Enriched tree for a content distribution network

• US 20050188108A1
• Filed: 10/31/2002
• Published: 08/25/2005
• Est. Priority Date: 10/31/2002
• Status: Abandoned Application

• Current Assignee: EMC Corporation (Dell Technologies Inc.)
• Original Assignee: Volera
• Inventors: Luciani, Juan Carlos, Holm, Vernon Roger, Carter, Stephen R., Mahdavi, Jamshid, Wu, Felix Sun-Tsyr
• Application Number:
  US10/285,271
• Publication Number:
  US 20050188108A1
• Time in Patent Office: Days
• US Class Current: 709/239
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/28 using route fault recovery

Abstract

Methods, systems, and data structures are provided for enriching a tree of a content distribution network. A tree of the content distribution network is depicted having an ingress node, egress nodes, links between nodes, and one or more planned paths for moving data through the content distribution network from the ingress nodes to the egress nodes. The tree is augmented or enriched to include one or more alternative paths to the planned paths. The number of alternative paths is configurable based on policies of the content distribution network. Moreover, the alternative paths are generated based on potential failures in one or more of the links and/or failures in one or more of the nodes. Further, the alternative paths are available with the tree before the data is moved through the content distribution network.

Claims

1. A method to enrich a tree for a content distribution network, comprising:

receiving the tree for the content distribution network;

receiving a request to generate alternative paths for the tree; and

generating the alternative paths based on the request, wherein the alternative paths are generated before data is transferred through the content distribution network.

2. The method of claim 1 further comprising, receiving a customization level associated with the request, wherein the customization level indicates a granularity of the alternative paths that are generated.

3. The method of claim 1 further comprising, transferring the data using the tree over the content distribution network after the alternative paths are generated.

4. The method of claim 1 further comprising, using at least one of the alternative paths, as the data is being transferred, when a content distribution network node and/or link are determined to be unavailable.

5. The method of claim 1 wherein in receiving the tree, the tree is a hierarchical abstraction of the content distribution network, and the tree includes a number of planned paths from an ingress node to one or more egress nodes.

6. The method of claim 5 wherein in generating the alternative paths, each alternative path includes one or more costs associated with using each path to transfer the data, and wherein the costs are configurable based on policies associated with the content distribution network.

7. The method of claim 1 wherein in generating the alternative paths, each alternative path is ordered within a data structure that is associated with the tree.

8. A method to enrich a tree for a content distribution network, comprising:

requesting the tree for the content distribution network;

receiving the tree;

receiving a desired level of alternative paths to generate for the tree;

generating alternative paths using the desired level and the tree; and

associating the paths with the tree before data is transferred over the content distribution network using the tree and the alternative paths.

9. The method of claim 8 detecting a failure in a link and/or a node for a planned path within the tree during a transfer of the data over the content distribution network and automatically using one of the alternative paths to supplement the planned path in order to continue transferring the data.

10. The method of claim 8 wherein in requesting the tree, the tree is requested using a Steiner spanning tree generation algorithm.

11. The method of claim 8 further comprising, presenting the tree within a Graphical User Interface (GUI) application where nodes, links, and planned paths are discernible along with costs associated with the nodes, links, and paths.

12. The method of claim 8 wherein in receiving the desired level, the desired level is configurable to generate the alternative paths based on potential link failures and/or potential node failures included within the tree.

13. The method of claim 8 further comprising using customized policies to request the tree and to generate the alternative paths, where the customized policies are used to determine costs in transferring the data via the alternative paths.

14. The method of claim 8 further comprising, using an accelerated cache to transfer the data from an ingress node within the tree to one or more egress nodes within the tree, wherein a number of the alternative paths are used when links and/or nodes fail during the transfer of the data through the content distribution network.

15. A system to enrich a tree of a content distribution network, comprising:

a tree generated by a spanning tree algorithm for a content distribution network, wherein the tree includes a plurality of nodes, a link between a number of the nodes, and one or more planned paths for moving data through the content distribution network;

a skip parent module for generating a number of the alternative paths if a parent node fails within the content distribution network;

a join module for generating a number of the alternative paths if a link fails within the content distribution network; and

wherein the alternative paths are associated with the tree before the data is moved through the content distribution network to provide an enriched tree.

16. The system of claim 15 wherein the enriched tree is used as a network routing table by one or more accelerated caches to move the data through the content distribution network from an ingress node to one or more egress nodes.

17. The system of claim 15 wherein the enriched tree is used as a network routing table by one or more routing devices to move the data through the content distribution network from an ingress node to one or more egress nodes.

18. The system of claim 15 wherein the skip parent module and the join module are configurable to generate a desired level of alternative paths.

19. The system of claim 15 wherein the alternative paths are automatically used when one of the nodes and/or one of the links fail while the data is moved through the content distribution network.

20. The system of claim 15, wherein the planned paths and the alternative paths include costs associated with using the planned paths or the alternative paths, and the costs are represented numerically.

21. An augmented tree data structure residing on a computer readable medium for providing alternative paths when moving data through a content distribution network, comprising:

an original tree data structure depicted from a topology of the content distribution network, wherein the original tree data structure includes an ingress node, intermediate nodes, egress nodes, links between the nodes, and one or more planned paths from the ingress node to the egress nodes for moving data through the content distribution network; and

one or more alternative paths to the planned paths for moving the data around potential failures in the nodes and/or the links when the data is moved through the content distribution network.

22. The augmented tree data structure of claim 21 wherein the data structure is used as a routing table for the data as it is moved through the content distribution network.

23. The augmented tree data structure of claim 21 wherein a level of granularity is used to determine a total number of the alternative paths provided and to determine types of the alternative paths included within the data structure.

24. The augmented tree data structure of claim 23 wherein the types include paths associated with failed links and paths associated with failed parent nodes.

25. The augmented tree data structure of claim 21 wherein the alternative paths are generated based on using the whole tree when a specific link and/or specific node within the tree is identified as unavailable for use, and the alternative paths are generated and available within the data structure before the data is moved through the content distribution network.

26. The augmented tree data structure of claim 21, wherein when an event is detected indicating that one of the links and/or one of the nodes have failed within the content distribution network, the data structure is accessed to select one of the alternative paths and the data is rerouted using the selected alternative path within the content distribution network.

27. The augmented tree data structure of claim 21, wherein the alternative paths are generated by temporarily setting costs associated with links of the original tree data structure to 0 in order to bias path generation algorithms to converge to the original tree data structure when generating the alternative paths.