%0 Report %1 TR404 %A Binzenhöfer, Andreas %A Leibnitz, Kenji %C Department of Computer Science %D 2007 %K myown %N 404 %T Estimating Churn in Structured P2P Overlay Networks. %U http://www3.informatik.uni-wuerzburg.de/TR/tr404.pdf %X Structured peer-to-peer (P2P) networks have become an important alternative to the classic client-server architecture. Participating peers can join and leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that churn is one of the main problems faced by any Distributed Hash Table (DHT). As a countermeasure most DHT protocols have to invest a significant amount of overhead to maintain both the structure of the overlay and the redundancy of the stored data. In order to automatically adapt this maintenance overhead and other parameters of the DHT to the changes in the overlay, an estimation of the current churn rate is required. In this paper we discuss different possibilities of how to estimate the current churn rate in the system. In particular, we show how to obtain a robust estimate which is independent of the implementation details of the DHT. We also investigate the trade-offs between accuracy, overhead, and responsiveness to changes.

@techreport{TR404, abstract = { Structured peer-to-peer (P2P) networks have become an important alternative to the classic client-server architecture. Participating peers can join and leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that churn is one of the main problems faced by any Distributed Hash Table (DHT). As a countermeasure most DHT protocols have to invest a significant amount of overhead to maintain both the structure of the overlay and the redundancy of the stored data. In order to automatically adapt this maintenance overhead and other parameters of the DHT to the changes in the overlay, an estimation of the current churn rate is required. In this paper we discuss different possibilities of how to estimate the current churn rate in the system. In particular, we show how to obtain a robust estimate which is independent of the implementation details of the DHT. We also investigate the trade-offs between accuracy, overhead, and responsiveness to changes. }, added-at = {2015-06-18T10:00:28.000+0200}, address = {Department of Computer Science}, author = {Binzenhöfer, Andreas and Leibnitz, Kenji}, biburl = {https://www.bibsonomy.org/bibtex/29534a74c934fcf163d9c1c01fb1ef7d0/trcsuniwue}, interhash = {3c5d3892d8a29a53d25d7b985b4dc287}, intrahash = {9534a74c934fcf163d9c1c01fb1ef7d0}, keywords = {myown}, month = {April}, number = 404, timestamp = {2015-06-18T10:00:28.000+0200}, title = {Estimating Churn in Structured P2P Overlay Networks.}, type = {Technical Report}, url = {http://www3.informatik.uni-wuerzburg.de/TR/tr404.pdf}, year = 2007 }