Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Sampling regular graphs and a peer-to-peer network
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
HyperCuP: hypercubes, ontologies, and efficient search on peer-to-peer networks
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
Building low-diameter peer-to-peer networks
IEEE Journal on Selected Areas in Communications
The flip markov chain and a randomising P2P protocol
Proceedings of the 28th ACM symposium on Principles of distributed computing
| Hi-index | 5.23 |
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(logt) 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^+^@d. With high probability the network reconnects itself by replacing lost edges using tokens from the token pool.