Understanding Disconnection and Stabilization of Chord

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. 2011 IEEE.

authors

• Loguinov, Dmitri

published proceedings

• IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

author list (cited authors)

• Yao, Z., & Loguinov, D.

citation count

• 4

complete list of authors

• Yao, Zhongmei||Loguinov, Dmitri

publication date

• April 2011

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Parallel and Distributed Systems  Journal

keywords

• Graph Disconnection
• Peer-to-peer Networks
• Stabilization Of Chord

Digital Object Identifier (DOI)

• 10.1109/TPDS.2010.114

start page

• 650

end page

• 661

volume

• 22

issue

• 4

URL

• http://dx.doi.org/10.1109/tpds.2010.114