A Statistical Theory of Chord under Churn
<|reference_start|>A Statistical Theory of Chord under Churn: 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.<|reference_end|>
@article{krishnamurthy2005a,
    title={A Statistical Theory of Chord under Churn},
    author={Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell and Seif Haridi},
    journal={arXiv preprint arXiv:cs/0501069},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0501069},
    primaryClass={cs.NI cond-mat.stat-mech cs.DC}
}