Computer Science – Networking and Internet Architecture
Scientific paper
2005-01-24
Computer Science
Networking and Internet Architecture
6 pages, In the 4th International Workshop on Peer-to- Peer Systems (IPTPS'05), Ithaca, New York, USA, 2005
Scientific paper
Most earlier studies of Distributed Hash Tables (DHTs) under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we present a complete analytical study of churn using a master-equation-based approach, used traditionally in non-equilibrium statistical mechanics to describe steady-state or transient phenomena. Simulations are used to verify all theoretical predictions. We demonstrate the application of our methodology to the Chord system. For any rate of churn and stabilization rates, and any system size, we accurately predict the fraction of failed or incorrect successor and finger pointers and show how we can use these quantities to predict the performance and consistency of lookups under churn. We also discuss briefly how churn may actually be of different 'types' and the implications this will have for the functioning of DHTs in general.
Aurell Erik
El-Ansary Sameh
Haridi Seif
Krishnamurthy Supriya
No associations
LandOfFree
A Statistical Theory of Chord under Churn does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Statistical Theory of Chord under Churn, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Statistical Theory of Chord under Churn will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-312349