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:
assigning, in an iterative manner, weights to a first series of network links connecting network nodes of a network, the first series of network links forming a ring such that weights have a first high cost in a first direction around the ring and a first low cost in a second direction around the ring;
assigning, in an iterative manner, weights to a second series of network links forming a first chain such that weights have a second high cost in a first direction along the first chain and a second low cost in a second direction along the first chain;
assigning, in an iterative manner, weights to a third series of network links forming a second chain such that weights have a third high cost in a first direction along the second chain and a third low cost in a second direction along the second chain, wherein the ring and the first chain have at least one network node in common, and wherein the second chain and the ring have at least one network node in common; and
upon a network failure in one of the ring, the first chain and the second chain:
delivering multicast packets using a dynamic unicast path restoration procedure wherein the assigned weights in the ring, the first chain and the second chain are associated with interfaces between the network nodes, wherein unicast paths are determined according to the assigned weights, and wherein multicast packets are encapsulated and routed to a next hop router on a multicast tree; and
decapsulating received encapsulated unicast packets.
2. The method of claim 1 , wherein assigning the weights to the first series of network links is performed such that multicast forwarding paths and unicast forwarding paths are failure disjoint.
3. The method of claim 1 , wherein the multicast packets comprise communication data that is part of a two-way communication.
4. The method of claim 1 , wherein multicast traffic and unicast traffic do not travel on a same path between nodes.
5. The method of claim 1 , further comprising communicating one of a television signal, an audio signal, and a radio signal over an undirected network.
6. The method of claim 1 , further comprising, after delivering the multicast packets upon the network failure, tuning the weights such that multicast traffic and unicast traffic travel on disjoint paths.
7. A system comprising:
a processor; and
a non-transitory computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising:
assigning, in an iterative manner, weights to a first series of network links forming a ring such that weights have a first high cost in a first direction around the ring and a first low cost in a second direction around the ring;
assigning, in an iterative manner, weights to a second series of network links forming a first chain such that weights have a second high cost in a first direction along the first chain and a second low cost in a second direction along the first chain;
assigning, in an iterative manner, weights to a third series of network links forming a second chain such that weights have a third high cost in a first direction along the second chain and a third low cost in a second direction along the second chain, wherein the ring and the first chain have at least one network node in common, and wherein the second chain and the ring have at least one network node in common; and
upon a network failure in one of the ring, the first chain and the second chain:
delivering multicast packets using a dynamic unicast path restoration procedure wherein the assigned weights in the ring, the first chain and the second chain are associated with interfaces between the network nodes, wherein unicast paths are determined according to the assigned weights, and wherein multicast packets are encapsulated and routed to a next hop router on a multicast tree; and
decapsulating received encapsulated unicast packets using internet protocol unicast encapsulation to a next hop router on a multicast tree.
8. The system of claim 7 , wherein assigning the weights to the first series of network links is performed such that multicast forwarding paths and unicast forwarding paths are failure disjoint.
9. The system of claim 7 , wherein the multicast packets comprise communication data that is part of a two-way communication.
10. The system of claim 7 , wherein multicast traffic and unicast traffic do not travel on a same path between nodes.
11. The system of claim 7 , further comprising communicating one of a television signal, an audio signal, and a radio signal over an undirected network.
12. The system of claim 7 , further comprising, after delivering the multicast packets upon the network failure, tuning the weights such that multicast traffic and unicast traffic travel on disjoint paths.
13. A non-transitory computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform operations comprising:
assigning weights to a first series of network links forming a ring such that weights have a first high cost in a first direction around the ring and a first low cost in a second direction around the ring;
assigning weights to a second series of network links forming a first chain such that weights have a second high cost in a first direction along the first chain and a second low cost in a second direction along the first chain;
assigning weights to a third series of network links forming a second chain such that weights have a third high cost in a first direction along the second chain and a third low cost in a second direction along the second chain, wherein the ring and the first chain have at least one network node in common, and wherein the second chain and the ring have at least one network node in common; and
upon a network failure in one of the ring, the first chain and the second chain:
delivering multicast packets using a dynamic unicast path restoration procedure wherein the assigned weights in the ring, the first chain and the second chain are associated with interfaces between the network nodes, wherein unicast paths are determined according to the assigned weights, and wherein multicast packets are encapsulated and routed to a next hop router on a multicast tree; and
decapsulating received encapsulated unicast packets.
14. The non-transitory computer-readable storage device of claim 13 , wherein assigning the weights to the first series of network links is performed such that multicast forwarding paths and unicast forwarding paths are failure disjoint.