Understanding disconnection and stabilization of Chord Conference Paper uri icon

abstract

  • Previous analytical work [15], [16] 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. 2008 IEEE.

name of conference

  • 27th IEEE International Conference on Computer Communications (INFOCOM 2008)

published proceedings

  • 27TH IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (INFOCOM), VOLS 1-5

author list (cited authors)

  • Yao, Z., & Loguinov, D.

complete list of authors

  • Yao, Zhongmei||Loguinov, Dmitri

publication date

  • April 2008

publisher