Title :
Handling churn in structured peer-to-peer networks
Author_Institution :
China Jiliang Univ., Hangzhou, China
Abstract :
An common difficulty in structured P2P networks is caused by the dynamic membership of nodes (churn). This results in constant reorganization of overlay topology. The objective of this paper is to handle churn in P2P networks by a flexible cluster-based protocol. In our protocol, a cluster of nodes work together to achieve efficient greedy routing and the size of each cluster varies between an upper bound and a lower bound. We show our protocol achieves a desirable level of stability to absorb the impact of membership change, and improves the rate at which nodes join and leave the overlay network.
Keywords :
peer-to-peer computing; routing protocols; telecommunication network topology; cluster-based protocol; constant reorganization; greedy routing; overlay network; overlay topology; structured peer-to-peer network; Clocks; Clustering algorithms; Fingers; Intrusion detection; Network topology; Peer to peer computing; Routing protocols; Stability; Upper bound; Churn; Peer-to-Peer; Stability;
Conference_Titel :
Broadband Network & Multimedia Technology, 2009. IC-BNMT '09. 2nd IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-4590-5
Electronic_ISBN :
978-1-4244-4591-2
DOI :
10.1109/ICBNMT.2009.5347772