Patent Document ID: 20040151124
Application ID: 10357559
Patent Flag: 0

Claim One:
1. A method of allocating demands of a plurality of restorable connections transferring data through a network of nodes connected by links, the method comprising the steps of: (a) initializing a link length of each link; (b) routing a demand for a current restorable connection by the steps of: (b1) generating a minimum path length for paths through nodes and links of the network for the current restorable connection, wherein the minimum path length is the least sum of link lengths for links of each path between a source and a destination node of the current restorable connection, (b2) determining a path set of disjoint paths through nodes and links of the network for the current restorable connection based on the minimum path length, (b3) routing a portion of a remainder of the demand as flows over the path set, wherein the portion is based on a lesser value of the remainder of the demand and a minimum capacity of links in the optimal path set, (b4) updating i) the link length of each link based on the routed portion and a capacity of the link and ii) the remainder of the demand, and (b5) repeating steps (b1)-(b5) until the demand is routed; (d) repeating step (b) for each restorable connection; (e) generating a scaling value based on a maximum ratio of a flow over a link and a capacity of the link.