| 摘要 |
This present invention is to classify the nodes into different roles for the purpose of routing packet and storing data. This is needed because each node in the Distributed Hash Table (DHT) network may have various capacities in terms of network bandwidth and disk storage. That is to say, this invention is focusing on assigning distinct functional roles (Server/Peer/Client) to nodes in the network based on the prior art (algorithm Kademlia). By using XOR of node ID's numeric values the distance between all the nodes can be known.
|
