Patent ID: 7948899
Filing Date: 2011-05-24
Classification: H04L

Abstract:
1. A method comprising: in a network comprising a plurality of links, via a predetermined traffic engineering device: via a modified Djkstra algorithm, for each of a plurality of identified traffic trunks, calculating an alternate route through a plurality of congested links of said plurality of links, said alternate route sharing no links with an original route for said traffic trunk, said link considered congested responsive to a determination that a utilization for said link exceeds a predetermined parameter associated with said link, said predetermined parameter a maximum link utilization, a portion of traffic from said traffic trunks rerouted according to said modified Djkstra algorithm, said portions of traffic sufficient to reduce said utilization for said link to a value equal to or below said predetermined parameter, said portions of traffic rerouted in congestion contribution order, said 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.