P2P-ENGINE

• US 20120210014A1
• Filed: 05/20/2011
• Published: 08/16/2012
• Est. Priority Date: 02/15/2011
• Status: Active Grant

• Current Assignee: Hive Streaming Ab
• Original Assignee: Hive Streaming Ab
• Inventors: El-Beltagy, Mohammed
• Granted Patent: US 8,806,049 B2
• Time in Patent Office: Days
• US Class Current: 709/231
• CPC Class Codes: H04L 67/1044 Group management mechanisms management of multicast group membership H04L12/185; reconfiguring of node membership in a computing system to eliminate errors G06F11/1425
• CPC Class Codes: H04L 67/1089 Hierarchical topologies

Abstract

A peer-to-peer (P2P) overlay network, which comprises a streaming source and a plurality of peers arranged in distribution layers, is arranged such that the total number of distribution layers of the overlay network is reduced. First, the upload capacity of each individual peer is determined and a maximum number of overlay peers to which said each individual peer can upload is calculated. Then, the peers are arranged in hierarchical order in relation to the streaming source on the basis of the maximum number of peers to which each individual peer can upload data. A higher number results in the individual peer being arranged in a distribution layer closer to the streaming source while a lower number results in the individual peer being arranged in a distribution layer further from the streaming source. Thus, the total number of distribution layers of the overlay network is reduced.

Claims

1. A method of arranging a peer-to-peer (P2P) overlay network comprising a streaming source and a plurality of peers arranged in distribution layers, the method comprising the steps of:

determining upload capacity for each peer and calculating a maximum number of overlay peers to which said each peer can upload data;

arranging the peers in hierarchical order in relation to the streaming source on the basis of the maximum number of overlay peers to which said each individual peer can upload data, wherein a higher number results in said each individual peer being arranged in a distribution layer closer to the streaming source while a lower number results in said each individual peer being arranged in a distribution layer further from the streaming source, such that the total number of distribution layers of the overlay network is reduced.

2. The method of claim 1, wherein the peers are arranged in relation to the streaming source such that a peer of a certain hierarchical order is placed in the same distribution layer, or a distribution layer closer to the streaming source, as compared to a peer of a lower hierarchical order.

3. The method of claim 1, further comprising the steps of:

receiving peer state information including one or more of the following parameters to be considered when arranging the peers in distribution layers;

upload bandwidth, download bandwidth, most recently downloaded part for each sub-stream, downloading peer list, uploading peer list, NAT type, CPU load, current playing point in the stream, rebuffering time, and peer IP address; and

considering said peer state information when arranging the peers in distribution layers.

4. The method of claim 1, wherein the number of peers to be placed in the layer closest to the streaming source is selected to be as low as possible while still being able to provide a total streaming bandwidth satisfying a predetermined bandwidth threshold value.

5. The method of claim 1, wherein, if an individual peer previously has not been capable of providing required bandwidth, said individual peer will be moved to a distribution layer further away from the streaming source.

6. The method of claim 1, wherein, if a certain peer cannot be placed in a distribution layer to which it is associated on the basis of its hierarchical order, the peer is placed in a next distribution layer closer to the streaming source.

7. The method of claim 1, further comprising the steps of:

creating, for a first peer in distribution layer r and a second peer in distribution layer r−

1 to be connected to the first peer, a utility matrix comprising selected network parameters; and

solving a Linear Sum Assignment Problem (LSAP) using the created utility matrix and considering the solution when arranging the peers in hierarchical order.

8. The method of claim 1, further comprising the step of:

sending a connectivity order to the peers, thereby indicating the hierarchical order according to which the peers should be placed in the distribution layers.

17. A computer program product comprising computer-executable components for causing a device to perform the steps recited in claim 1 when the computer-executable components are run on a processor included in the device.

9. A device for arranging a peer-to-peer (P2P) overlay network comprising a streaming source and a plurality of peers arranged in distribution layers, the device comprising:

a processor configured to receive peer information indicating upload capacity tor each peer and calculate a maximum number of overlay peers to which said each peer can upload data;

arrange the peers in hierarchical order in relation to the streaming source on the basis of the maximum number of overlay peers to which said each peer can upload data, wherein a higher number results in said each individual peer being arranged in a distribution layer closer to the streaming source while a lower number results in said each individual peer being arranged in a distribution layer further from the streaming source, such that the total number of distribution layers of the overlay network is reduced;

sending connectivity orders to the peers, thereby indicating the hierarchical order according to which the peers should be placed in the distribution layers.

10. The device of claim 9, said processor being configured to arrange the peers in relation to the streaming source such that a peer of a certain hierarchical order is placed in the same distribution layer, or a distribution layer closer to the streaming source, as compared to a peer of a lower hierarchical order.

11. The device of claim 9, said processor further being configured to:

receive peer state information including one or more of the following parameters to be considered when arranging the peers in distribution layers;

upload bandwidth, download bandwidth, most recently downloaded part for each sub-stream, downloading peer list, uploading peer list, NAT type, CPU load, current playing point in the stream, rebuffering time, and peer IP address; and

consider said peer state information when arranging the peers in distribution layers.

12. The device of claim 9, wherein the processor is configured to select the number of peers to be placed in the layer closest to the streaming source to be as low as possible while still being able to provide a total streaming bandwidth satisfying a predetermined bandwidth threshold value.

13. The device of claim 9, wherein said processor is configured move an individual peer to a distribution layer further away from the streaming source if said individual peer previously has not been capable of providing required bandwidth.

14. The device of claim 9, wherein said processor is configured to place a certain peer in a next distribution layer closer to the streaming source, if said certain peer cannot be placed in a distribution layer to which it is associated on the basis of its hierarchical order.

15. The device of claim 9, said processor further being configured to:

create, for a first peer in distribution layer r and a second peer in distribution layer r−

1 to be connected to the first peer, a utility matrix comprising selected network parameters; and

solve a Linear Sum Assignment Problem (LSAP) using the created utility matrix and considering the solution when arranging the peers in hierarchical order.

16. The device of claim 9, said processor further being configured to:

send a connectivity order to the peers, thereby indicating the hierarchical order according to which the peers should be placed in the distribution layers.