Consider a DHT with a mesh overlay topology (that is, every peer tracks all peers in the system). What are the advantages and disadvantages of such a design? What are the advantages and disadvantages of a circular DHT (with no shortcuts)?

Advantages of DHT with mesh overlay topology

A single hop is used to route a message to the peer, the nearest key is used route message between pointsThere are  bi-directional links between each pair of peers other than the broadcasting peer therefore creating a multiple delivery paths from source to other peers

Disadvantages of DHT with mesh overlay topology

complexity of the design of a Mesh overlay TopologyConsuming process ( tracking of all peers by each peer )

Advantages of circular DHT ( with no shortcuts )

less consuming process ( each peer tracks only two peers )

Disadvantages of Circular DHT ( with no short cuts )

The number of messages sent per query is minimized0(N) hopes are required to route message to a peer responsible for the key  

Explanation:

Advantages of DHT with mesh overlay topology

A single hop is used to route a message to the peer, the nearest key is used route message between pointsThere are  bi-directional links between each pair of peers other than the broadcasting peer therefore creating a multiple delivery paths from source to other peers

Disadvantages of DHT with mesh overlay topology

complexity of the design of a Mesh overlay TopologyConsuming process ( tracking of all peers by each peer )

Advantages of circular DHT ( with no shortcuts )

less consuming process ( each peer tracks only two peers )

Disadvantages of Circular DHT ( with no short cuts )

The number of messages sent per query is minimized0(N) hopes are required to route message to a peer responsible for the key  

Distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. in the DHT key-value are stored in it