| CPC H04L 45/12 (2013.01) | 20 Claims |

|
1. A method comprising:
generating, at a network node, a first shortest path tree for traffic routing in a network, the first shortest path tree identifying a corresponding shortest path from the network node to other nodes in the network;
generating, at the network node, a second shortest path tree for traffic routing after removing an element from the network, wherein the second shortest path tree identifies a corresponding shortest path from the network node to the other nodes in the network with the element removed;
generating, at the network node, a third shortest path tree, wherein the third shortest path tree is a weighted version of the second shortest path tree; and
performing, at the network node, traffic enforcement based on commonality of a parent node, for a given node, in the first shortest path tree and the third shortest path tree.
|