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
On the Quality of Service of Failure Detectors
IEEE Transactions on Computers
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Multimedia Systems
Performance and Dependability of Structured Peer-to-Peer Overlays
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Friendships that last: peer lifespan and its role in P2P protocols
Web content caching and distribution
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Latency and bandwidth-minimizing failure detectors
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Cooperative Keep-Alives: An Efficient Outage Detection Algorithm for P2P Overlay Networks
P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
Comparing Maintenance Strategies for Overlays
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
Designing less-structured P2P systems for the expected high churn
IEEE/ACM Transactions on Networking (TON)
Long term study of peer behavior in the KAD DHT
IEEE/ACM Transactions on Networking (TON)
An adaptive stabilization framework for distributed hash tables
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Hi-index | 0.00 |
Detecting node failures within Peer-to-Peer networks is an inherent trade-off between timely detection and consuming bandwidth on network maintenance. In the absence of user-driven messages, the majority of P2P networks rely upon the exchange of periodic keep-alive messages to maintain connections and network topology. We investigate three novel algorithms which prioritise keep-alive messages to nodes that are more likely to have failed. In doing so, these algorithms significantly reduce the expected delay between failures occurring and their subsequent detection in comparison to the standard approach, whilst consuming similar levels of bandwidth. Our algorithms build upon several studies that have shown that older peers are more likely to remain in the network than their short-lived counterparts. Each of our algorithms increase the interval between successive keep-alive messages as peers age in the system, based upon the distribution of peer session times and the current age of peers. We extensively describe the details of each algorithm, before comparing them to the standard periodic approach using simulations based upon measured network data. Furthermore, we show that these algorithms are complimentary to existing gossip-based mechanisms and investigate alternate methods of ascertaining a node's age so that our algorithms can be robustly deployed in untrustworthy environments.