Sciweavers

Share
CN
2006

Failure recovery for structured p2p networks: Protocol design and performance under churn

9 years 9 months ago
Failure recovery for structured p2p networks: Protocol design and performance under churn
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured p2p networks. We confine our study to the hypercube routing scheme used by several structured p2p systems. To improve system robustness and facilitate failure recovery, we introduce the property of K-consistency, K P 1, which generalizes consistency defined previously. (Consistency guarantees connectivity from any node to any other node.) We design and evaluate a failure recovery protocol based upon local information for K-consistent networks. The failure recovery protocol is then integrated with a join protocol that has been proved to construct K-consistent neighbor tables for concurrent joins. The integrated protocols were evaluated by a set of simulation experiments in which nodes joined a 2000-node network and nodes (both old and new) were randomly selected to fail concurrently over 10,000 s of simulated...
Simon S. Lam, Huaiyu Liu
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CN
Authors Simon S. Lam, Huaiyu Liu
Comments (0)
books