By Topic

Performance Enhancement in Hierarchical Peer-to-Peer Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shrivastava, B.K. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Guwahati, India ; Khataniar, G. ; Diganta Goswami

Increased popularity of decentralized peer-to-peer (P2P) architecture comes with several challenges, like how to handle efficient lookup and query routing, frequent joining and leaving of nodes and scalability problem. Several key based deterministic routing approaches in a structured P2P networks have been proposed to overcome with these problems. Still, problems become worse if nodes are heterogenous in processing speed, power, stability and storage capability. To bridge the heterogeneity, we propose a 2-tier hierarchical distributed hash table (DHT) in which nodes are classified into three categories: temporary, stable and fully stable nodes. We have achieved intra-group lookup and query routing in O(log(|Gj|)) steps, where |Gj| is the number of (super)peers in destination group Gj, while inter-group lookup in O(1) steps. We have also saved at least 66.67% messages in repairing the routing table due to frequent joining and leaving of nodes in average case.

Published in:

Communication Systems Software and Middleware, 2007. COMSWARE 2007. 2nd International Conference on

Date of Conference:

7-12 Jan. 2007