Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Failure recovery for structured P2P networks: protocol design and performance evaluation
Proceedings of the joint international conference on Measurement and modeling of computer systems
A Concentric Multi-ring Overlay for Highly Reliable P2P Networks
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper proposes a churn-resistant strategy designed on top of a highly reliable P2P overlay network [1], with degree $2{\it\Delta} +2$, where ${\it\Delta}$ is the degree of a De Bruijn digraph [2]. We show that when each node in the network periodically retransmits only one KEEPALIVE message to one of its neighbors in the network, any node’s failure can be detected within an optimal timeout. As a major contribution, we demonstrate that even in failure situations the lookup of any available resource is achieved with the lowest possible maintenance overhead O(1) along the shortest path of length DCMR = ${\rm log}_{\it\Delta}$(N($\it\Delta$–1)+${\it\Delta}$) – 1 with N being the maximal number of nodes in the network.