Abstract
Comparative Study of can, Pastry, Kademlia and Chord DHTS
Highlights
With the arrival of concept of P2P, people have changed the way they use Internet
An evaluation of structured peer-to-peer performance in mobile networks described in [7] evaluates the performance of five structured P2P protocols based on popular Distributed Hash Tables (DHTs), namely: Chord, Pastry, Kademlia, Broose [7] and EpiChord [7]
Distributed hash tables provide reliable scaling while maintaining network performance compared to unstructured peer-to-peer technologies
Summary
With the arrival of concept of P2P, people have changed the way they use Internet. It allows users to create an application based on a virtual network in which data can be exchanged, even with the restrictions of the underlying networks of the Internet, such as firewalls, dynamic IP address assignment (1). Each node is responsible for a portion of the keys in the system and each object is stored in the node whose identifier is closest to its key according to the distance metric used These structured P2P networks give several types of routing topology that will change the performance of peer-to peer systems. Our contribution is to compare in terms of hop count, latency and transmitted messages both theoretical results and simulation results of CAN, Pastry, Kademlia and chord protocols by using the peerfactSim [18] simulator. This simulator abstracts the different network layers which gives the advantage to test the performances with a good accuracy. We proceed to their simulation and finish with a comparative analyse
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
