Subscribe

Issue No.04 - April (2011 vol.22)

pp: 650-661

Zhongmei Yao , The University of Dayton, Dayton

Dmitri Loguinov , Texas A&M University, College Station

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.114

ABSTRACT

Previous analytical work [16], [17] on the resilience of P2P networks has been restricted to disconnection arising from simultaneous failure of all neighbors in routing tables of participating users. In this paper, we focus on a different technique for maintaining consistent graphs—Chord's successor sets and periodic stabilizations—under both static and dynamic node failure. We derive closed-form models for the probability that Chord remains connected under both types of node failure and show the effect of using different stabilization interval lengths (i.e., exponential, uniform, and constant) on the probability of partitioning in Chord.

INDEX TERMS

Peer-to-peer networks, graph disconnection, stabilization of Chord.

CITATION

Zhongmei Yao, Dmitri Loguinov, "Understanding Disconnection and Stabilization of Chord",

*IEEE Transactions on Parallel & Distributed Systems*, vol.22, no. 4, pp. 650-661, April 2011, doi:10.1109/TPDS.2010.114REFERENCES