Patent ID: 7391732

Claim:
A method for path generation request for restoration within a failed communication network having a plurality of switches, links and circuits, comprising: (a) ignoring links that do not meet quality of service requirements of the circuit, (b) ignoring all links with weight greater than X for each switch pair with a plurality of links, where X is the minimum of the weights of these links, (c) probabilistically selecting one link according to a chosen rule for each switch pair with remaining multiple links, and (d) running Dijkstra's algorithm on the remaining network and obtaining the shortest path for the request for restoration for the failed communication network, said shortest path comprising two or more links of said remaining network, wherein the chosen rule comprises assigning a probability of selection, and where the probability of selection of a link j equals aw(j) divided by aw(total), where available bandwidth of the link j is denoted as aw(j), and where aw(total) equals to the sum of available bandwidths of all of said remaining links of said each switch pair.