CPC H04L 45/125 (2013.01) [H04L 41/0806 (2013.01); H04L 41/0896 (2013.01); H04L 45/123 (2013.01); H04L 45/24 (2013.01); H04L 45/34 (2013.01); H04L 45/50 (2013.01); H04L 47/125 (2013.01); H04L 47/20 (2013.01)] | 20 Claims |
1. A method comprising:
computing, by a computing device, for a segment routing policy that specifies a bandwidth constraint for the segment routing policy, first shortest paths through a network of network nodes, wherein each shortest path of the first shortest paths represents a different sequence of links connecting pairs of the network nodes from a source to a destination;
computing, by the computing device, based on the bandwidth constraint for the segment routing policy, a required bandwidth for a link of one of the first shortest paths, wherein the required bandwidth for the link is an amount of traffic, for the segment routing policy, expected to be forwarded on the link by the network nodes load balancing the traffic on the first shortest paths;
based on determining, by the computing device, the link has insufficient bandwidth to meet the required bandwidth for the link, increasing a metric of the link;
computing, by the computing device, for the segment routing policy, according to the increased metric of the link, second shortest paths through the network of network nodes; and
provisioning the second shortest paths in the network of network nodes.
|