Scalable and Efficient Multi-Path Routing – Spec Update

In June, I implemented (in C#) the first draft of a scalable and efficient multi-path route-finding algorithm to use on a simulated IsoGrid. The result of this work led me to make some improvements to the IsoGrid spec. My next step is to share out this IsoGrid simulation (along with the produced data) to prove to myself and others that a mesh protocol can actually be globally-scalable.

Here’s the changelist for version 0.225 vs. 0.220:

  • Described challenges of highly-mobile nodes to providing isochronous data transit services
  • Described LinkTunnel usefulness for creating fan-out links from the local node, to allow targeting of redundancy levels
  • Required that link advertisements must declare if links are direct or EccFlowLinkTunnel based
  • Revamped LocatorHash: Moved 3DGeoHash from being embedded within the LocatorHash to just being a part of the link and node advertisements
  • Deprecated the “random trailblazing” algorithm for scalable route tracking in favor of HMLM
  • Incorporated a ton of great ideas from S/Kademlia into HMLM
  • Described the multi-path routing algorithm based on Dijkstra’s Algorithm
  • Added some detail to the LocatorHashTree to ensure efficient caching of data in the CAS system
  • Renamed HostName -> NodeInfo
  • Renamed HostNameLocatorHash -> GetNodeInfoFromLocatorHash

Here’s the latest spec:

IsoGrid Protocol Specification v0.225.

CC0

To the extent possible under law, Travis.Martin has waived all copyright and related or neighboring rights to:

IsoGrid Protocol Specification v0.225.
This work is published from: United States.

This document is still an early draft. If you’d like to help improve it, contact Travis.Martin at this domain. Discussion at Hacker News!