Load balancing distribution of data to multiple recipients on a peer-to-peer network
First Claim
1. A peer-to-peer network, comprising:
- a plurality of peer nodes, wherein each peer node is configured to communicate with one or more other ones of said peer nodes over the peer-to-peer network, wherein the peer-to-peer network is an overlay network, wherein each peer node in the plurality has a different corresponding key value, wherein each of the one or more peer nodes is operable to broadcast one or more items to a plurality of recipient nodes of the plurality of peer nodes byarranging the plurality of recipient nodes into a list according to a key value order,dividing the list into two or more parts of approximately equal size, and forwarding each part of the list and the one or more items to a recipient peer node corresponding to a first key value in that part of the list, wherein dividing the list into two or more parts of approximately equal size, and forwarding each part of the list and the one or more items to a peer node corresponding to a first key value in that part of the list avoids overloading intermediate nodes in routing messages in the peer-to-peer network.
2 Assignments
0 Petitions
Accused Products
Abstract
Each peer node in a plurality has a different corresponding key value. Each of the nodes can broadcast one or more items to a plurality of recipient nodes. The recipient nodes are arranged into a list according to a key value order. The list is divided into two or more parts of approximately equal size, and each part of the list and the one or more items is forwarded to a recipient peer node corresponding to a first key value in that part of the list. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. This abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.
24 Citations
17 Claims
-
1. A peer-to-peer network, comprising:
- a plurality of peer nodes, wherein each peer node is configured to communicate with one or more other ones of said peer nodes over the peer-to-peer network, wherein the peer-to-peer network is an overlay network, wherein each peer node in the plurality has a different corresponding key value, wherein each of the one or more peer nodes is operable to broadcast one or more items to a plurality of recipient nodes of the plurality of peer nodes by
arranging the plurality of recipient nodes into a list according to a key value order, dividing the list into two or more parts of approximately equal size, and forwarding each part of the list and the one or more items to a recipient peer node corresponding to a first key value in that part of the list, wherein dividing the list into two or more parts of approximately equal size, and forwarding each part of the list and the one or more items to a peer node corresponding to a first key value in that part of the list avoids overloading intermediate nodes in routing messages in the peer-to-peer network. - View Dependent Claims (2, 3, 4, 5)
- a plurality of peer nodes, wherein each peer node is configured to communicate with one or more other ones of said peer nodes over the peer-to-peer network, wherein the peer-to-peer network is an overlay network, wherein each peer node in the plurality has a different corresponding key value, wherein each of the one or more peer nodes is operable to broadcast one or more items to a plurality of recipient nodes of the plurality of peer nodes by
-
6. A peer node, comprising:
- a processor;
a network interface operable to couple the peer node to a network; and
a memory operable to store program instructions and a finger table, wherein the program instructions are executable by the processor to;communicate with one or more peer nodes on a peer-to-peer network, wherein the peer-to-peer network is an overlay network, wherein each peer node in the plurality has a different corresponding key value;
wherein the peer node is operable to broadcast one or more items to a plurality of recipient nodes of the plurality of peer nodes by;arranging the plurality of peer nodes into a list according to a key value order dividing the list into two or more parts of approximately equal size, and forwarding each part of the list and the one or more items to a peer node corresponding to a first key in that part of the list, wherein dividing the list into two or more parts of approximately equal size, and forwarding each part of the list and the one or more items to a peer node corresponding to a first key value in that part of the list avoids overloading intermediate nodes in routing messages in the peer-to-peer network. - View Dependent Claims (7, 8, 9, 10, 11)
- a processor;
-
12. In a peer-to-peer overlay network a method for broadcasting one or more items of data to a plurality of recipient peer nodes selected from a plurality of peer nodes organized in a peer-to-peer overlay network wherein each peer node is associated with a different corresponding key value, the method comprising:
-
arranging the plurality of recipient peer nodes into a list according to a key value order; dividing the list into two or more parts of approximately equal size; and forwarding each part of the list and the one or more items to a recipient peer node corresponding to a first key in that part of the list, wherein dividing the list into two or more parts of approximately equal size, and forwarding each part of the list and the one or more items to a peer node corresponding to a first key value in that part of the list avoids overloading intermediate nodes in routine messages in the peer-to-peer network. - View Dependent Claims (13, 14, 15, 16)
-
-
17. A non-transitory computer-accessible storage medium comprising program instructions, wherein the program instructions are computer-executable on a peer node to implement a method for broadcasting one or more items of data to a plurality of recipient peer nodes selected from a plurality of peer nodes organized in a peer-to-peer overlay network wherein each peer node is associated with a different corresponding key value, the method comprising:
-
arranging a plurality of recipient peer nodes into a list according to a key value order; dividing the list into two or more parts of approximately equal size; and forwarding each part of the list and the one or more items to a recipient peer node corresponding to a first key in that part of the list, wherein dividing the list into two or more parts of approximately equal size, and forwarding each part of the list and the one or more items to a peer node corresponding to a first key value in that part of the list avoids overloading intermediate nodes in routine messages in the peer-to-peer network.
-
Specification