2004/06/16 by Dietrich Fahrenholtz, Fahrenholtz, Dietrich, Volker Turau +1
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Distributed #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Parallel #Peer-to-Peer Network Technologies #and Cluster Computing (cs.DC) #cs.DC #cs.NI
paper · pdf · doi:10.48550/arxiv.cs/0406027
5 pages
arxiv created 2004/06/16 · openalex publication_date 2004/06/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Due to the transient nature of peers, any Peer-to-Peer network is in peril to falling apart if peers do not receive routing table updates periodically. To this end, maintenance, which affects every peer, ensures connectedness and sustained data operation performance. However, a high rate of change in peer population usually incurs lots of network maintenance messages and can severely degrade overall performance. We discuss three methods how to tackle and mitigate the effect of peer fluctuation on a tree-based distributed hash table.