We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

The routing performance of logarithmic-hop structured P2P overlay

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)
Khan, S. ; Fac. of Comput. Sci. & Inf. Technol., Univ. of Malaya, Kuala Lumpur, Malaysia ; Gani, A. ; Sreekandath, M.

This paper presents an analysis on performance of logarithmic degree structured P2P (peer-to-peer) overlay networks. P2P network consist of highly transient peers, where peers join and leave the network randomly also known as dynamic environment. It is, therefore difficult to measure the performance of the parameters in real environment. The design of structured overlay networks is fragmented and due to various designs few simulations have been conducted to compare the protocols in dynamic environment. The outcome of the analysis helps the decision in choosing and designing better structured overlay protocol for P2P network. In order to evaluate the routing performance, this work simulates logarithmic-hop overlays - Chord, Pastry and Kademlia. The result shows that among Chord, Pastry and Kademlia protocols, performance of Kademlia is better than Chord and Pastry with 94.2-99% routing efficiency. Hence, Kademlia architecture is better choice to implement structured P2P network.

Published in:

Open Systems (ICOS), 2011 IEEE Conference on

Date of Conference:

25-28 Sept. 2011