The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On de Bruijn Routing in Distributed Hash Tables: There and Back Again
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
The Essence of P2P: A Reference Architecture for Overlay Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Self-Stabilizing Structured Ring Topology P2P Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
A General Framework for Scalability and Performance Analysis of DHT Routing Systems
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Analytical Study on Improving DHT Lookup Performance under Churn
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
P2P Networking and Applications
P2P Networking and Applications
| Hi-index | 0.24 |
Peer-to-peer networks have widespread and got commonly used in our every day life. The maintenance strategy of overlays is a key factor in structured peer-to-peer networks. Most of these routing overlays scale well even for a very large number of nodes in static and quasi-static networks. However, providing good performance in dynamic network environments is still an open question. We analyse maintenance of routing overlays in structured P2P systems under churn. We exploit the inherent difference in the role of local (short-range) and long-range connections. We propose a dual strategy for the routing overlays: (i) we reuse strict, proactive and self-stabilizing short-range connection maintenance and (ii) we define a novel, loose and stochastic long-range connection maintenance mechanism, which can significantly reduce maintenance overhead in large networks with high churn rates without affecting routing performance. We use Kleinberg's small worlds model to describe and (re)construct long-range connections. We formally describe the evolution of our proposed system under churn by a Markov chain model and we derive its steady state maintenance traffic (overhead). We formally show that our maintenance method scales logarithmically with the system's size, which is the theoretical lower bound for maintenance traffic to ensure connectivity of the network. Finally, we numerically analyse overlay and maintenance behaviour using various protocol parameter settings and conclude that an overlay with our maintenance method is stable at very high levels of churn.