APPLICATION LAYER
PEER TO PEER PARADIGM
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following statements regarding the Kademlia P2P system is false?
|
|
If we use 160-bit keys, each node will store 160 k-buckets
|
|
|
The distance between keys is calculated using a bitwise XOR
|
|
|
Each key/value pair is stored only in the node with the closest ID to the key
|
|
|
Each k-bucket i of node P contains up to k nodes that are at distance [2i, 2i+1) from P
|
Explanation:
Detailed explanation-1: -A distributed hash table (DHT) is a type of distributed system that provides a lookup service similar to a hash table. In a hash table, data is stored and retrieved using keys, and the keys are used to determine the location of the data in the table.
Detailed explanation-2: -A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. key–value pairs are stored in a DHT, and any participating node can efficiently retrieve the value associated with a given key.
There is 1 question to complete.