Join in Tapestry
Danke und Gruss,
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing, Abschnitt 4.1 hat geschrieben:The intuition of the incremental algorithm is as follows: First, we populate the new node’s neighbor maps at each level by routing to the new node ID, and copying and optimizing neighbor maps along each hop from the router. Then we inform the relevant nodes of its entry into the Tapestry, so that they may update their neighbor maps with it. In our example, we assume a new node is integrating into a network which satisfies the constraints of a Tapestry network. Node requests a new ID , and contacts a Gateway node , a Tapestry node known to that acts as a bridge to the network.