Comparative Study of can, Pastry, Kademlia and Chord DHTS
Kabre Laciné, Telesphore Tiendrebeogo · International Journal of Peer to Peer Networks · 2021
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct communication and collaboration between nodes.There are three main families of P2P networks: the centralized architecture, the decentralized architecture that can be structured or unstructured and the hybrid architecture.Today, there are several implementations for structured decentralized architectures.This implies that the insertion and search algorithms are different.Among them we have; Chord, Pastry, Kademlia, CAN(Content Addressable Network) .The choice of these DHTs (Distributed Hash Table) for an application is made on the basis of their performances.Studies of each of these DHTs mentioned have been done, proving their performance.But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia has not been clearly addressed by previous works.In this paper, we have conducted a comparative theoretical study of the DHTs Chord, Pastry, CAN, Kademlia.Then, by simulation, we have evaluated the performances in terms of latency, number of hops and number of transmitted messages.Our study clearly shows the differences between mathematically established performance and actual performance in an environment with less restriction.This analysis was made from the data obtained by using the simple network layer of the PeerfactSim simulator.This simulator abstracts the different network layers, which gives the advantage of testing the performances with reasonable accuracy.The use of the single network layer can be considered an ideal case because the node searches are done locally.