Distributing information over a network

• US 8,775,512 B1
• Filed: 05/04/2007
• Issued: 07/08/2014
• Est. Priority Date: 11/15/2006
• Status: Active Grant

• Current Assignee: Conviva Inc.
• Original Assignee: Conviva Inc.
• Inventors: Stoica, Ion, Zhang, Hui, Mccanne, Steven R., Zhan, Jibin, Ganjam, Aditya R.
• Primary Examiner(s): SCOTT, RANDY A
• Application Number:
  US11/800,413
• Time in Patent Office: 2,622 Days
• Field of Search: 709/205
• US Class Current: 709/204
• CPC Class Codes: G06Q 40/12 Accounting
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 65/60 Network streaming of media packets
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/101 based on network conditions
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1042 using topology management mechanisms
• CPC Class Codes: H04L 67/1063 Discovery through centralising entities
• CPC Class Codes: H04L 67/1085 involving dynamic management of active down- or uploading connections
• CPC Class Codes: H04N 21/632 using a connection between clients on a wide area network, e.g. setting up a peer-to-peer communication via Internet for retrieving video segments from the hard-disk of other client devices broadcast-related systems characterised by transmission among terminal devices H04H60/80; distributed application using peer-to-peer [P2P] networks H04L67/104

Abstract

Distributing information over a network is disclosed. Nodes are grouped into regions. Preferred nodes are designated. A source of content to be delivered to a preferred node using a preferred algorithm is indicated to at least one preferred node. At least one common node is assigned the preferred node as a relay of information.

Claims

1. A system for distributing information over a network, including:

a processor; and

a memory coupled with the processor, wherein the memory is configured to provide the processor with instructions which when executed cause the processor to;

group nodes into regions;

designate a first subset of nodes as preferred nodes and a second subset of nodes as common nodes;

indicate to a preferred node in the first subset a source of content, wherein a preferred distribution algorithm is selected to be used in communicating the content between the source and the preferred node based at least in part on the preferred node'"'"'s designation; and

assign the preferred node as a relay of information to a common node in the second subset, wherein the information relayed between the preferred node and the common node is communicated using a distribution algorithm that is selected based at least in part on the common node'"'"'s designation and that is different from the preferred algorithm selected to be used in communicating the content between the source and the preferred node.

2. The system of claim 1 wherein the preferred algorithm optimizes for robustness over efficiency.

3. The system of claim 1 wherein the algorithm used to relay information from the preferred node to the common node is based at least in part on the region into which the common node is grouped.

4. The system of claim 1 wherein information is relayed to the common node using an algorithm optimized for efficiency over robustness.

5. The system of claim 1 wherein the preferred nodes are of a first type, and wherein the memory is further configured to provide the processor with instructions which when executed cause the processor to designate preferred nodes of a second type.

6. The system of claim 1 further including a delivery coordinator manager configured to select a delivery algorithm to be used between two nodes.

7. The system of claim 1 further including a relay configured to associate one of the regions into which nodes are grouped with a delivery coordinator manager.

8. The system of claim 1 further including a delivery coordinator manager associated with each region into which nodes are grouped.

9. The system of claim 1 wherein nodes are designated as preferred nodes based at least in part on their historical performance.

10. The system of claim 1 wherein the memory is further configured to provide the processor with instructions which when executed cause the processor to detect a failure of a first delivery coordinator manager and reassociate nodes associated with the failed delivery coordinator manager with a second delivery coordinator manager.

11. The system of claim 10 wherein the second delivery coordinator manager is configured to reconstruct state information from heartbeats provided by nodes.

12. The system of claim 10 wherein the nodes are reassociated with the second delivery coordinator manager unobtrusively.

13. The system of claim 1 wherein the nodes are configured to transmit a heartbeat that includes state information.

14. The system of claim 1 wherein the nodes that have been grouped into a region are in possession of a logical identifier of a delivery coordinator manager.

15. The system of claim 1 wherein nodes are grouped into prespecified regions based on policies and the last known characteristics of the nodes.

16. The system of claim 1 wherein at least one preferred node is owned by a third party.

17. The system of claim 1 wherein the memory is further configured to provide the processor with instructions which when executed cause the processor to evaluate nodes for selection as preferred nodes on a recurring basis.

18. The system of claim 1 wherein the information relayed from the preferred node to the common node is a portion of a first content and wherein the memory is further configured to provide the processor with instructions which when executed cause the common node to receive a portion of a second content simultaneously with the receipt by the common node of the portion of the second content.

19. The system of claim 1 wherein the information delivered from the preferred node to the common node is a portion of content which a user of the common node wishes to consume, and which no user of the preferred node wishes to consume.

20. The system of claim 1 wherein at least one preferred node is a client.

21. The system of claim 1 wherein at least one preferred node is a server.

22. The system of claim 1 wherein the preferred node and the common node are each present in a node hierarchy and wherein the preferred node and the common node are at respective different levels of the hierarchy.

23. The system of claim 1, wherein the preferred distribution algorithm includes a protocol optimized for a set of factors including at least one of a network condition and resource usage.

24. The system of claim 1, wherein the first subset and the second subset of nodes are designated as preferred nodes and common nodes, respectively, based at least in part on an evaluation of a capacity of the nodes.

25. The system of claim 1, wherein the preferred nodes and the common nodes are configured to communicate using different distribution algorithms.

26. The system of claim 1, wherein the information relayed to the common node via the preferred node includes a portion of the content delivered to the preferred node by the source.

27. A method for distributing information over a network, comprising:

grouping nodes into regions;

designating a first subset of nodes as preferred nodes and a second subset of nodes as common nodes;

indicating to a preferred node in the first subset a source of content, wherein a preferred distribution algorithm is selected to be used in communicating the content between the source and the preferred node based at least in part on the preferred node'"'"'s designation; and

assigning the preferred node as a relay of information to a common node in the second subset, wherein the information relayed between the preferred node and the common node is communicated using a distribution algorithm that is selected based at least in part on the common node'"'"'s designation and that is different from the preferred algorithm selected to be used in communicating the content between the source and the preferred node.

28. A computer program product for distributing information over a network, the computer program product being embodied in a non-transitory computer readable medium and comprising computer instructions for:

grouping nodes into regions;

designating a first subset of nodes as preferred nodes and a second subset of nodes as common nodes;

indicating a preferred node in the first subset a source of content, wherein a preferred distribution algorithm is selected to be used in communicating the content between the source and the preferred node based at least in part on the preferred node'"'"'s designation; and

assigning the preferred node as a relay of information to a common node in the second subset, wherein the information relayed between the preferred node and the common node is communicated using a distribution algorithm that is selected based at least in part on the common node'"'"'s designation and that is different from the preferred algorithm selected to be used in communicating the content between the source and the preferred node.