Methods and apparatus for content delivery via application level multicast with minimum communication delay

• US 7,593,353 B2
• Filed: 03/13/2004
• Issued: 09/22/2009
• Est. Priority Date: 03/13/2004
• Status: Active Grant

• Current Assignee: International Business Machines Corporation, ServiceNow Incorporated
• Original Assignee: International Business Machines Corporation
• Inventors: Liu, Zhen, Zhang, Li, Riabov, Anton
• Primary Examiner(s): Mattis; Jason E
• Application Number:
  US10/800,305
• Publication Number:
  US 20050201405A1
• Time in Patent Office: 2,019 Days
• Field of Search: 370/256, 370/390, 370/432
• US Class Current: 370/256
• CPC Class Codes: H04L 12/1881 with schedule organisation, e.g. priority, sequence management
• CPC Class Codes: H04L 45/16 Multipoint routing
• CPC Class Codes: H04L 45/48 Routing tree calculation

Abstract

A method for constructing an overlay multicast tree to deliver data from a source to an identified group of nodes is provided in which a plurality of nodes are identified and mapped into multidimensional Euclidean space. A geometric region is constructing having a size that is the minimum size necessary to contain the source and all the nodes. Once constructed, a tree is created beginning at the source and including all of the nodes within the geometric region.

Claims

1. A method for constructing an overlay multicast tree to deliver data from a source to an identified group of nodes, the method comprising:

identifying a plurality of nodes;

mapping the nodes into multidimensional space;

constructing a circular geometric region comprising a size that is the minimum size necessary to contain the source and all the nodes;

creating a polar grid within the geometric region comprising a plurality of cells such that all of the cells comprise an equivalent amount of area;

dividing the circular geometric region into a maximum number of rings such that there is at least one node in each cell except for cells disposed in an outmost ring;

creating a tree beginning at the source and including all of the nodes within the geometric region; and

using the created tree as the overlay multicast tree to deliver data from the source comprising a provider of a given service to an identified group of nodes comprising subscribers having access to the given service.

2. The method of claim 1, wherein the step of mapping the nodes into multidimensional space comprises mapping the nodes into multidimensional Euclidean space.

3. The method of claim 1 wherein the step of creating a tree comprises selecting a representative node for each cell containing at least one node and connecting first to the representative nodes.

4. The method of claim 3, wherein the representative node is selected to be the node within each cell that is closest to the source.

6. The method of claim 4, further comprising, for cells containing three or more nodes one of which is the representative node, selecting a second node in the same cell to connect to additional nodes in the cell and selecting a third node in the cell to connect to the representative nodes in at least two cells in an outer ring.

7. The method of claim 3, further comprising connecting additional nodes within each cell.

8. The method of claim 7, wherein the step of connecting to additional nodes within each cell comprises using a constant factor approximation algorithm.

9. The method of claim 1, wherein the step of constructing a polar grid comprises dividing the circle into a plurality of rings by constructing a sequence of circles of decreasing radius concentric with the source such that each subsequent circle divides in half an area bounded by a next largest circle, and placing a number of the cells into each one of the plurality of rings such that the number of cells per ring doubles with each ring moving radially outward from the source.

10. The method of claim 1, wherein the step of creating a tree comprises using an out-degree less than two for each node in the tree.

5. The method of clam 4, further comprising, for cells containing two nodes one of which is the representative node, connecting the representative node to a second node in the same cell and using the second node to connect to the representative nodes in at least two cells in an outer ring.

11. A computer readable medium containing a computer executable code that when read by a computer causes the computer to perform a method for constructing an overlay multicast tree to deliver data from a source to an identified group of nodes, the method comprising:

identifying a plurality of nodes;

mapping the nodes into multidimensional space;

constructing a circular geometric region comprising a size that is the minimum size necessary to contain the source and all the nodes;

creating a polar grid within the geometric region comprising a plurality of cells such that all of the cells comprise an equivalent amount of area;

dividing the circular geometric region into a maximum number of rings such that there is at least one node in each cell except for cells disposed in an outmost ring; and

creating a tree beginning at the source and including all of the nodes within the geometric region.

12. The computer readable medium of claim 11, wherein the step of mapping the nodes into multidimensional space comprises mapping the nodes into multidimensional Euclidean space.

13. The computer readable medium of claim 11, wherein the step of creating a tree comprises selecting a representative node for each cell containing at least one node and connecting first to the representative nodes.

14. The computer readable medium of claim 13, wherein the representative node is selected to be the node within each cell that is closest to the source.

15. The computer readable medium of claim 14, further comprising, for cells containing two nodes one of which is the representative node, connecting the representative node to a second node in the same cell and using the second node to connect to the representative nodes in at least two cells in an outer ring.

16. The computer readable medium of claim 14, further comprising, for cells containing three or more nodes one of which is the representative node, selecting a second node in the same cell to connect to additional nodes in the cell and selecting a third node in the cell to connect to the representative nodes in at least two cells in an outer ring.

17. The computer readable medium of claim 13, further comprising connecting additional nodes within each cell.

18. The computer readable medium of claim 17, wherein the step of connecting to additional nodes within each cell comprises using a constant factor approximation algorithm.

19. The computer readable medium of claim 11, wherein the step of constructing a polar grid comprises dividing the circle into a plurality of rings by constructing a sequence of circles of decreasing radius concentric with the source such that each subsequent circle divides in half an area bounded by a next largest circle, and placing a number of the cells into each one of the plurality of rings such that the number of cells per ring doubles with each ring moving radially outward from the source.

20. The computer readable medium of claim 11, wherein the step of creating a tree comprises using an out-degree less than two for each node in the tree.