Stochastic Analysis of a Churn-Tolerant Structured Peer-to-Peer Scheme

The authors present and analyze a simple and general scheme to build a churn (fault)-tolerant structured Peer-to-Peer (P2P) network. The scheme shows how to "Convert" a static network into a dynamic distributed hash table (DHT)-based P2P network such that all the good properties of the static network are guaranteed with high probability (w.h.p). Applying the scheme to a cube-connected cycles network, for example, yields a O(logN) degree connected network, in which every search succeeds in O(logN) hops w.h.p., using O(logN) messages, where N is the expected stable network size.

Provided by: Purdue University Topic: Collaboration Date Added: Nov 2010 Format: PDF

Find By Topic