System and method for restoration in a multimedia IP network
Disclosed herein are systems, methods, and computer readable media for modifying IP backbone link weights such that multicast traffic and unicast traffic will not travel on a same path between nodes. The method comprises assigning link weights to nodes within an IP backbone such that multicast forwarding paths and unicast forwarding paths are failure disjoint, and delivering undelivered multicast packets using IP unicast encapsulation to the loopback address of next hop router on a multicast tree upon link/interface failure.
1. A method comprising:
starting from a source node, locating a series of network links in an undirected network graph that form a ring;
initializing weights to the series of network links along one direction of the ring as high cost and in another direction as low cost; and
iteratively:
identifying a chain of links having a first endpoint and a second endpoint, where the first endpoint and the second endpoint each terminate at nodes associated with the ring;
adding the chain of links to the ring by connecting the first endpoint and the second endpoint to the ring without the weights assigned to the chain of links; and
assigning the weights to the chain of links, such that the weights result in multicast forwarding paths and unicast forwarding paths being failure disjoint.
2. The method of claim 1 , wherein unidirectional links in one direction have a high cost and unidirectional links in another direction have a low cost, until all links are assigned weights.
3. The method of claim 1 , further comprising:
initializing a graph as nodes and links of the ring.
4. The method of claim 1 , wherein, upon network failure, delivering undelivered multicast packets using internet protocol unicast encapsulation to a next hop router on a multicast tree.
5. The method of claim 4 , wherein unidirectional links in one direction have a high cost and unidirectional links in another direction have a low cost, until all links are assigned weights.
6. The method of claim 4 , further comprising:
initializing a graph as nodes and links of the ring.
7. A system comprising:
a processor; and
a computer-readable storage medium having instructions stored which, when executed by the processor, result in the processor performing operations comprising:
starting from a source node, locating a series of network links in an undirected network graph that form a ring;
initializing weights to the series of network links along one direction of the ring as high cost and in another direction as low cost; and
iteratively:
identifying a chain of links having a first endpoint and a second endpoint, where the first endpoint and the second endpoint each terminate at nodes associated with the ring;
adding the chain of links to the ring by connecting the first endpoint and the second endpoint to the ring without the weights assigned to the chain of links; and
assigning the weights to the chain of links, such that the weights result in multicast forwarding paths and unicast forwarding paths being failure disjoint.
8. The system of claim 7 , wherein unidirectional links in one direction have a high cost and unidirectional links in another direction have a low cost, until all links are assigned weights.
9. The system of claim 7 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising:
initializing a graph as nodes and links of the ring.
10. The system of claim 7 , wherein, upon network failure, delivering undelivered multicast packets using internet protocol unicast encapsulation to a next hop router on a multicast tree.
11. The system of claim 10 , wherein unidirectional links in one direction have a high cost and unidirectional links in another direction have a low cost, until all links are assigned weights.
12. The system of claim 10 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising:
initializing a graph as nodes and links of the ring.
13. A computer-readable storage device having instructions stored which, when executed by a computing device, result in the computing device performing operations comprising:
starting from a source node, locating a series of network links in an undirected network graph that form a ring;
initializing weights to the series of network links along one direction of the ring as high cost and in another direction as low cost; and
iteratively:
identifying a chain of links having a first endpoint and a second endpoint, where the first endpoint and the second endpoint each terminate at nodes associated with the ring;
adding the chain of links to the ring by connecting the first endpoint and the second endpoint to the ring without the weights assigned to the chain of links; and
assigning the weights to the chain of links, such that the weights result in multicast forwarding paths and unicast forwarding paths being failure disjoint.
14. The computer-readable storage device of claim 13 , wherein unidirectional links in one direction have a high cost and unidirectional links in another direction have a low cost, until all links are assigned weights.
15. The computer-readable storage device of claim 13 , the computer-readable storage device having additional instructions stored which result in the operations further comprising:
initializing a graph as nodes and links of the ring.
16. The computer-readable storage device of claim 13 , wherein, upon network failure, delivering undelivered multicast packets using internet protocol unicast encapsulation to a next hop router on a multicast tree.
17. The computer-readable storage device of claim 16 , wherein unidirectional links in one direction have a high cost and unidirectional links in another direction have a low cost, until all links are assigned weights.