283 results about "Distribute hash table" patented technology

The invention discloses a content acquisition method, a content acquisition node and a content network, which belong to the field of communication. The method comprises the following steps of: receiving a content request, wherein the content request at least comprises an identifier of requested contents; judging whether the contents corresponding to the identifier can be locally acquired or not, and if the contents corresponding to the identifier can be locally acquired, locally acquiring the contents corresponding to the identifier; otherwise, querying a name resolution system according to the identifier to obtain a target node corresponding to the identifier, and acquiring the contents corresponding to the identifier from the target node, wherein the name resolution system comprises a hierarchical distributed hash table and a global content resolution structure; and the global content resolution structure supports name aggregation and longest match searching. The node comprises a content agent module and a content acquisition module. The content network comprises the content acquisition node and a transmission network. In the content acquisition method, the content acquisition node and the content network, a content-oriented network architecture is constructed by adopting a distributed scheme, the content delivery efficiency and the safety of the network are improved by introducing an optimization strategy, network investment is reduced, and the network is more adaptive to the rapid increasing of the contents.

A method for joining a network resource as a joining node to a peer-to-peer network includes establishing a node ID for the joining node to be joined to the peer-to-peer network, routing the join message to an assignment node that manages resources with resource IDs closest to the node ID of the joining node, determining whether or not the node ID established is identical to respective ones of the node IDs on the peer-to-peer network, and joining the joining node to the peer-to-peer network, when the node ID of the joining node is not identical to any one of the node IDs on the peer-to-peer network.

A range of a node is split when the data stored upon that node reaches a predetermined size. A split value is determined such that roughly half of the key / value pairs stored upon the node have a hash result that falls to the left of the split value and roughly half have a hash result that falls to the right. A key / value pair is read by computing the hash result of the key, dictating the node and the sub-range. Only those files associated with that sub-range need be searched. A key / value pair is written to a storage platform. The hash result determines on which node to store the key / value pair and to which sub-range the key / value pair belongs. The key / value pair is written to a file; the file is associated with the sub-range to which the pair belongs. A file includes any number of pairs.