DYNAMIC ROUTING USING A DISTRIBUTED HASH TABLE

摘要

Embodiments for sharing data within a network or creating networking groups in a distributed peer-to-peer network using an agreed upon key and a distributed hash table (DHT) process. The DHT comprises an abstract keyspace and a partitioning scheme that splits ownership of the keyspace among participating nodes. The DHT is a scalable, decentralized data structure in which a large key-value table is stored among the network nodes, such that each node only hosts a small chunk of a key space. The mapping from keys to values is distributed among the nodes such that a change in the network nodes causes a minimal amount of disruption to the network.