A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 realisticdoi:10.1109/glocom.2005.1577765 dblp:conf/globecom/BinzenhoferSH05 fatcat:3zzcps5aajaxni2auehocqe3oe