On the Stability of Chord-based P2P Systems
Andreas Binzenhöfer, Dirk Staehle, and Robert Henjes
Research Report 347
Abstract
The current generation of P2P networks is intended to provide cost-effective alternatives to the traditional client-server architecture. The main goal is to be able to store and retrieve data in a decentralized manner. The challenge in doing so consists in creating a stable overlay network that allows for fast and efficient searches. In this paper we consider the Chord P2P algorithm in this context and analyze its stability and efficiency with stochastic methods. We present realistic probabilities for the problem of a disconnection and confirm the scalability of key lookups.