283 results about "Distribute hash table" patented technology

Embodiments of a distributed index mechanism for indexing and searching for identity information in peer-to-peer networks. In one embodiment, a distributed index may be used to store identity information in a decentralized manner on a plurality of peer nodes. The identity information may be used, for example, to authenticate users. Distributed indexes may allow identity information to be spread across multiple peer nodes so that the load is spread among the various peer nodes. In one embodiment, the distributed index may be a distributed hash table. One embodiment of a distributed index of identity information may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

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 of storing data from a first node on a peer-to-peer network. The method includes creating a public and private key pair from a data item, determining a hash value for the public key, assigning the hash value as a user identifier for the user of the node, and storing the public key within a distributed hash table of the network. The user identifier corresponds to the key for the public key within the distributed hash table. The method includes the step of digitally signing the user identifier using the created private key.

Protocols for facilitating a peer-to-peer real time network in which network state information and data processing is delegated to user nodes. A virtual space is recursively divided into a plurality of sub-regions represented by a logical tree, with responsibility for leaf nodes delegated to multiple user nodes. A distributed hash table can be used to store leaf node state and identity information. A discovery index protocol is provided for user nodes to effectively identify a user node responsible for a sub-region of interest. Further, a semantic filtering protocol limits communications primarily to other user nodes deemed relevant, so as to constrain bandwidth usage. A broadcast control protocol is provided to increase the number of simultaneous interactions for each user node. A security protocol is also provided to prevent any illegal activity by malicious nodes.

A system and method for theft recovery, data recovery, and privacy protection for portable devices with IP connectivity is implemented either according to a peer-to-peer or client-server model, with a serverless or a server-based infrastructure. In the P2P model, a distributed hash table (DHT) algorithm is used for storing and retrieving the device IP addresses and the device location coordinates when available. An authorized user can set a protected device into a locked mode or the device automatically enters into a locked mode after the device has been operated without proper authorization. In a locked mode, private data is deleted, transferred to a pre-selected storage system, alerts and location coordinates, when available, are to be sent to preselected accounts. Data on a lost portable device can be synchronized with a pre-selected storage system and be restored when the lost device is recovered.

A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network. The DHT may be implemented to store MAC addresses, IP addresses, MPLS labels, or other information of interest to enable routes to be stored and learned by network elements on the network.

The invention discloses a data switching system based on a locator identify separation protocol (LISP), which comprises an IP backbone network and more than one tunneling router. The data switching system is characterized in that the system also comprises an LISP superimposed layer for storing the mapping relationship between an endpoint identifier (EID) and a routing locator (RLOC); the LISP superimposed layer comprises at least one distributed hash table (DHT) server; and the tunneling router is connected with the DHT server, and is used for transmitting a mapping request or a mapping register to the DHT server and receiving a mapping response from the DHT server. The invention also discloses an LISP data switching method. By using the invention, the mapping from the EID to the RLOC can be simply and conveniently realized, thereby flexibly completing the switching of LISP data.

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.