Connection management in peer-to-peer content distribution clouds

• US 7,849,196 B2
• Filed: 12/04/2006
• Issued: 12/07/2010
• Est. Priority Date: 12/22/2005
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Costa, Manuel, Miller, John, Gkantsidis, Christos, Rodriguez, Pablo Rodriguez, Ranson, Stuart
• Primary Examiner(s): Chan; Wing F
• Assistant Examiner(s): MARTINEZ, MICHAEL T
• Application Number:
  US12/097,946
• Publication Number:
  US 20080294779A1
• Time in Patent Office: 1,464 Days
• Field of Search: 709/201, 709/204, 709/223, 709/224, 709/238, 709/241, 709/206, 709/227, 370/400, 713/168, 707/999.1
• US Class Current: 709/227
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1085 involving dynamic management of active down- or uploading connections

Abstract

A topology management process is implemented which involves removing or “tearing down” connections between nodes in certain situations in order to try to replace those connections with more optimal ones. Idle connections are torn down unless those are in a “notify” state; a notify state being one in which a request for content has been made to a neighbour but that neighbour has no available content as yet. Idle connections in a notify state are torn down only if they remain idle for a longer time than that required before an idle connection is torn down. To avoid problems caused by clusters of node forming and of loners being unable to join the cloud, network churn algorithms are taught. These involve requiring nodes to drop connections when specified conditions are met. Relative content distribution between connections is monitored and this information used to influence selection of those connections to drop.

Claims

1. A method of managing connections at a node in a peer-to-peer content distribution cloud, said method comprising:

(i) monitoring traffic on connections at the node for a specified first time period;

(ii) allocating as being in a notify state any idle connections at the node over which content has been requested from a neighbor but is not present at that neighbor;

(iii) tearing down any connections at the node which have been idle for at least that specified first time period and which are not in the notify state; and

(iv) once every specified interval, selecting one of the connections at the node in a substantially random manner from at least a subset of the connections at the node and tearing down that connection;

wherein said monitoring traffic on connections at the node further comprises obtaining information about relative content distribution over those connections; and

wherein said subset of the connections at the node excludes the connection where the monitored relative content distribution over that connection is the lowest.

2. A method as claimed in claim 1 which further comprises:

tearing down any connections at the node which have been in the notify state for at least a second specified time period which is different and longer than the first time period.

3. A method as claimed in claim 2 wherein said second time period is about twice as long as the first time period.

4. A method as claimed in claim 3 wherein said first time period is between about 3 and 7 minutes.

5. A method as claimed in claim 3 which further comprises:

specifying a minimum number of connections required by the node in order to be part of the peer-to-peer content distribution cloud, and

allowing the number of connections at the node to fall below the minimum in specified situations.

6. A method as claimed in claim 5 which further comprises:

specifying a maximum number of connections required by the node in order to be part of the peer-to-peer content distribution cloud, and

allowing the number of connections at the node to exceed the maximum in specified situations.

7. A method as claimed in claim 6 wherein said monitoring traffic on connections at the node further comprises obtaining information about relative content distribution over those connections.

8. A method as claimed in claim 1 wherein said subset of the connections at the node excludes the connection where the monitored relative content distribution over that connection is the highest.

9. A method as claimed in claim 8 wherein said subset further excludes the connection where the monitored relative content distribution over that connection is the second highest.

10. A node in a peer-to-peer content distribution cloud said node comprising:

(i) a plurality of connections to other nodes in the cloud;

(ii) a monitor arranged to monitor traffic on connections at the node for a specified first time period;

(iii) an allocator arranged to allocate as being in a notify state any idle connections at the node over which content has been requested from a neighbor but is not present at that neighbor;

(iv) a processor arranged to tear down connections at the node which have been idle for at least that specified first time period and which are not in the notify state; and

(v) a processor further arranged to, once every specified interval, select one of the connections at the node in a substantially random manner from at least a subset of connections at the node, and tear down that connection, wherein the monitor arranged to monitor traffic on connections at the node obtains information about relative content distribution over those connections; and

wherein said subset of the connections at the node excludes the connection where the monitored relative content distribution over the connection is the lowest.

11. A node as claimed in claim 10 wherein the processor is further arranged to tear down any connections at the node which have been in the notify state for at least a second specified time period which is different and longer than the first time period.

12. One or more storage devices with computer-executable instructions for performing acts at a node connected in a peer-to-peer content distribution cloud said acts comprising:

monitoring traffic on connections at the node for a specified first time period;

allocating as being in a notify state any idle connections at the node over which content has been requested from a neighbor but is not present at that neighbor;

tearing down any connections at the node which have been idle for at least that specified first time period and which are not in the notify state; and

once every specified interval, selecting one of the connections at the node in a substantially random manner from at least a subset of connections at the node, and tearing down that connection wherein said monitoring traffic on connections at the node further comprises obtaining information about relative content distribution over those connections; and

wherein said subset of the connections at the node excludes the connection where the monitored relative content distribution over the connection is the lowest.

13. One or more storage devices as claimed in claim 12 wherein said acts further comprise tearing down any connections at the node which have been in the notify state for at least a second specified time period which is different and longer than the first time period.