The routing performance of Logarithmic-hop Structured P2P overlay

Khan, S. and Gani, Abdullah and Sreekandath, M. (2011) The routing performance of Logarithmic-hop Structured P2P overlay. In: 2011 IEEE Conference on Open Systems (ICOS2011), 25-28 Sep 2011, Langkawi.

The_Routing_Performance_of_Logarithmic.pdf - Published Version

Download (292kB)


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.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Chord, Pastry, Kademlia, DHT and P2P
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Computer Science & Information Technology
Depositing User: Mr. Mohd Samsul Ismail
Date Deposited: 18 Feb 2015 06:15
Last Modified: 11 Oct 2018 04:35

Actions (login required)

View Item View Item