DEVICE AND METHOD FOR CONTROLLING DISSEMINATION OF CONTENT DATA BETWEEN PEERS IN A P2P MODE, BY USING A TWO-LEVEL RAMDOMIZED PEER OVERLAY AND A DYNAMIC UNCHOKE MECHANISM

• US 20120016936A1
• Filed: 03/22/2010
• Published: 01/19/2012
• Est. Priority Date: 03/24/2009
• Status: Abandoned Application

• Current Assignee: Thomson Licensing (Vantiva SA)
• Original Assignee: Thomson Licensing (Vantiva SA)
• Inventors: Massoulie, Laurent, Picconi, Fabio, Varvello, Matteo
• Application Number:
  US13/138,716
• Publication Number:
  US 20120016936A1
• Time in Patent Office: Days
• US Class Current: 709/204
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1059 Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups

Abstract

A method is intended for controlling dissemination of content data in a peer-to-peer mode between peers connected to different communication networks. This method comprises the steps of: i) building, for each peer, a first peer set comprising active peers that are primary connected neighbours close to this peer in terms of network cost and a second peer set comprising active peers that are secondary connected neighbours of this peer, chosen at random irrespectively of network cost, and ii) dynamically determining into each peer a capacity of content data it is ready to receive from peers of the second peer set, taking into account its current capacity to receive content data from peers of the first peer set, in order to optimize the peer-to-peer dissemination of the content data.

Claims

1. Method for controlling dissemination of content data in a peer-to-peer mode between peers connected to different communication networks, wherein it comprises the steps of:

i) building, for each peer, a first peer set comprising active peers that are primary connected neighbours close to this peer in terms of network cost and a second peer set comprising active peers that are secondary connected neighbours of this peer, chosen at random irrespectively of network cost, and ii) dynamically determining into each peer a capacity of content data it is ready to receive from peers of said second peer set taking into account its current capacity to receive content data from peers of said first peer set, in order to optimize the peer-to-peer dissemination of said content data.

2. Method according to claim 1, wherein in step i) one builds said first peer set from peers belonging to the same communication network.

3. Method according to claim 1, wherein in step i) one defines a first constraint consisting in authorizing each peer to have a number of incoming peer connections equal to a first chosen value and a number of outgoing peer connections equal to or smaller than a second chosen value, and a second constraint consisting in minimizing the sum of network costs of all primary connected neighbouring peers, then one lets the peers in said first peer set be randomly uniformly distributed under said first and second constraints.

4. Method according to claim 1, wherein in step i) one defines a first constraint consisting in authorizing each peer to have a number of incoming peer connections equal to a first chosen value and a number of outgoing peer connections equal to or smaller than a second chosen value, then one lets the peers in said second peer set be randomly uniformly distributed under said first constraint.

5. Method according claim 1, wherein each peer receives a list of active peers from a communication equipment, said list comprising a first sub-list containing active peers that are close to said considered peer in terms of network cost and a second sub-list containing active peers that are chosen at random irrespectively of network cost.

6. Method according to claim 5, wherein each peer periodically contacts a peer from said list in order to determine if a primary connection or secondary connection can be established with it.

7. Method according to claim 1, wherein each peer exchanges neighbouring information with other peers in order to build a list of active peers comprising a first sub-list containing active peers that are close to it in terms of network cost and a second sub-list containing active peers that are chosen at random irrespectively of network cost.

8. Device for controlling dissemination of content data in a peer-to-peer mode from a peer, connected to a communication network, to other peers connected to said communication network or to at least one other communication network, wherein it is arranged for dynamically determining into said peer a capacity of content data it is ready to receive from peers of a second peer set comprising active peers that are secondary connected neighbours of said peer, chosen at random irrespectively of network cost, taking into account a current capacity of said peer to receive content data from peers of a first peer set comprising active peers that are primary connected neighbours of said peer, closed in terms of network cost, in order to optimize the peer-to-peer dissemination of said content data.