A randomized algorithm for the joining protocol in dynamic distributed networks

We describe a randomized algorithm for assigning neighbours to vertices joining a dynamic distributed network. The aim of the algorithm is to maintain connectivity, low diameter and constant vertex degree. On joining each vertex donates a constant number of tokens to the network. These tokens contain the address of the donor vertex. The tokens make independent random walks in the network. A token can be used by any vertex it is visiting to establish a connection to the donor vertex. This allows joining vertices to be allocated a random set of neighbours although the overall vertex membership of the network is unknown. The network we obtain in this way is robust under adversarial deletion of vertices and edges and actively reconnects itself. One model we consider is a network constructed in this fashion, in which vertices join but never leave. If t is the size of the network, then the diameter of the network is O ( log t ) for all t, with high probability. As an example of the robustness of this model, suppose an adversary deletes edges from the network leaving components of size at least t 1 / 2 + δ. With high probability the network reconnects itself by replacing lost edges using tokens from the token pool.

Authors

• Colin Cooper
• Ralf Klasing
• Tomasz Radzik

Keywords

• Randomized algorithm
• Dynamic network
• Joining protocol
• Random graph process
• Overlay network
• Random walks
• Peer to peer networks
• Self repairing networks