Understanding Disconnection and Stabilization of Chord

Author(s)

Zhongmei Yao, University of DaytonFollow
Dmitri Loguinov, Texas A & M University - College Station

Document Type

Article

Publication Date

4-2011

Publication Source

IEEE Transactions on Parallel and Distributed Systems

Abstract

Previous analytical work 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.

Inclusive pages

650 - 661

ISBN/ISSN

1045-9219

Comments

Permission documentation on file.

Copyright

Copyright © 2011, IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Publisher

Institute of Electrical and Electronics Engineers

Volume

22

Peer Reviewed

yes

Issue

4

eCommons Citation

Yao, Zhongmei and Loguinov, Dmitri, "Understanding Disconnection and Stabilization of Chord" (2011). Computer Science Faculty Publications. 163.
https://ecommons.udayton.edu/cps_fac_pub/163