title | author | geometry | documentclass | fontsize | header-includes | ||||
---|---|---|---|---|---|---|---|---|---|
Distributed Hashing |
|
margin=1.5cm |
extarticle |
12pt |
|
Distributed Hashing is a technique used to distribute the keys of a hash table across multiple nodes in a network.
Distributed Hashing is used to provide a scalable and fault-tolerant way of storing and retrieving data in a distributed system. It is used to distribute the keys of a hash table across multiple nodes in a network.
There are different types of Distributed Hash Tables. Some of the most popular ones are:
- Chord Distributed Hash Table (CDHT)
- Kademlia Distributed Hash Table (KDHT)
- Pastry Distributed Hash Table (PDHT)
We will be mainly comparing Kademlia and Pastry Distributed Hash Tables.
We will be implementing both the DHTs and comparing their performance in terms of latency, throughput, and fault tolerance.