Patent ID: 7778182

Claim:
A method comprising: in a network comprising a plurality of links, via a predetermined traffic engineering device: identifying a link from the plurality of links that is congested by determining, for the link, that a utilization for the link exceeds a predetermined parameter associated with the link, the predetermined parameter a maximum link utilization, the maximum link utilization associated with all of the plurality of links and associated with a bandwidth that is below a maximum capacity of the via a modified Djkstra algorithm, rerouting portions of traffic from identified traffic trunks that contribute to traffic on the link, the portions of traffic sufficient to reduce the utilization for the link to a value equal to or below the predetermined parameter, the portions of traffic rerouted in congestion contribution order, the modified Djkstra algorithm adapted to: determine a set of nodes of a best path from a computing ingress node of a traffic trunk of the identified traffic trunks; and determine a set of nodes that are neighbors of nodes of the best path, the set of nodes that are neighbors used to determine that there are no potentially bottlenecking links between the ingress node and an egressing node of the traffic trunk via the modified Djkstra algorithm, for each of the identified traffic trunks, calculating an alternate route through the plurality of links sharing no links with an original route for the identified traffic trunk and storing the alternate route.