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
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
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Low-Bandwidth Topology Maintenance for Robustness in Structured Overlay Networks
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
ACM Transactions on Computer Systems (TOCS)
PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn
SASO '08 Proceedings of the 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Performance evaluation of a Kademlia-based communication-oriented P2P system under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The problem of churn in structured peer-to-peer (P2P) networks is one of important research issues in this area. When churn, continuous coming and going of participating nodes, is arisen, search performance of structured P2Ps is degraded. Under high churn rate, network topology is congested, so link recovery is needed to maintain proper search performance. Generally periodic link recovery is used to recover broken links by churn. In periodic maintenance, link recovery period is important parameter. If it is too high or low compared with churn rate, it is difficult to guarantee consistent QoS. We propose an adaptive link recovery scheme to assure consistent search performance of structured P2Ps. In our scheme, churn rate is estimated by gossip protocol, and then the expected number of failed links, Nf, is derived from it. Each node makes Nf times of attempts to recover invalid links. Simulation results show that our scheme guarantees consistent QoS under various situations.