Peer-to-peer system and method with prefix-based distributed hash table
First Claim
Patent Images
1. A method for routing in a peer-to-peer network, the method comprising the steps of:
- receiving a message comprising a hash key of a hash function, the hash key further comprising a fixed portion which is associated with one of a plurality of zones in the peer-to-peer network and where the fixed portion comprises a string of bits that is further grouped into a number of disjoint groupings of bits;
consulting a jump table which associates combinations of the groupings of bits with routing destination zones in the peer-to-peer network; and
if an entry is found on the jump table which associates a destination zone with a next unresolved grouping of bits in the fixed portion of the hash key, then routing the message to the destination zone in the peer-to-peer network so that the message can be routed in a fixed path length to a final destination zone associated with the fixed portion of the hash key.
2 Assignments
0 Petitions
Accused Products
Abstract
An architecture for a peer-to-peer network is disclosed which advantageously is able to maintain short fixed path length routing as the network grows.
-
Citations
28 Claims
-
1. A method for routing in a peer-to-peer network, the method comprising the steps of:
-
receiving a message comprising a hash key of a hash function, the hash key further comprising a fixed portion which is associated with one of a plurality of zones in the peer-to-peer network and where the fixed portion comprises a string of bits that is further grouped into a number of disjoint groupings of bits;
consulting a jump table which associates combinations of the groupings of bits with routing destination zones in the peer-to-peer network; and
if an entry is found on the jump table which associates a destination zone with a next unresolved grouping of bits in the fixed portion of the hash key, then routing the message to the destination zone in the peer-to-peer network so that the message can be routed in a fixed path length to a final destination zone associated with the fixed portion of the hash key. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method for use in a peer-to-peer network, the method comprising the steps of:
-
associating a fixed portion of hash keys of a hash function with one of a plurality of zones in the peer-to-peer network, where each hash key generated from the hash function is associated with an object in the peer-to-peer network and where the fixed portion of the hash key comprises a string of bits that is further grouped into a number of disjoint groupings of bits; and
maintaining state for each zone in the peer-to-peer network regarding the groupings of bits so as to route messages to a destination zone in the peer-to-peer network in a fixed path length. - View Dependent Claims (11, 12, 13, 14, 15)
-
-
16. A computer-readable medium comprising instructions for routing in a peer-to-peer network, the instructions when executed on a computer perform the method of:
-
receiving a message comprising a hash key of a hash function, the hash key further comprising a fixed portion which is associated with one of a plurality of zones in the peer-to-peer network and where the fixed portion comprises a string of bits that is further grouped into a number of groupings of bits;
consulting a jump table which associates combinations of the groupings of bits with routing destination zones in the peer-to-peer network; and
if an entry is found on the jump table which associates a destination zone with a next unresolved grouping of bits in the fixed portion of the hash key, then routing the message to the destination zone in the peer-to-peer network so that the message can be routed in a fixed path length to a final destination zone associated with the fixed portion of the hash key. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24)
-
-
25. A node for a peer-to-peer network comprising:
-
a first interface for communication with other nodes in the peer-to-peer network;
a second interface to at least one storage device, the second interface storing objects on the storage device where each object stored at the node is associated with a hash key of a hash function where each hash key has a fixed portion associated with a zone of the peer-to-peer network hosted at the node;
a memory unit for storing state for the zone in the peer-to-peer network hosted at the node, the state comprising associations between groupings of bits in the fixed portion of the hash key and destination zones in the peer-to-peer network a routing processor which can route messages in the peer-to-peer network using the first interface and the state stored on the memory unit so that a message can be routed to a destination zone in the peer-to-peer network in a fixed path length. - View Dependent Claims (26, 27, 28)
-
Specification