Patent ID: 7564805

Claim:
A method comprising a plurality of activities, comprising: via a capacity planning simulation performed on an information device, for each circuit from a plurality of circuits affected by a selected failure scenario from a plurality of failure scenarios of a circuit-switched communication network, all links impacted by the selected failure scenario pruned from a network of unaffected links: failing the affected circuit; for a remaining network comprised of all unaffected links, repeatedly: blocking a predetermined amount of capacity of each of the unaffected links, the information device adapted to prune any links from the network that lack sufficient capacity to restore the affected circuit, the information device adapted to run Dijkstra's Algorithm on remaining unaffected links; determining that the circuit-switched communication network is not fully restorable; and reducing the amount of blocked capacity of each of the unaffected links; the information device adapted to, responsive to a determination that a path is found for the affected circuit, render an indication that unaffected links have a maximum available capacity of at least said predetermined amount of capacity associated with the circuit-switched communication network being fully restorable, the indication comprising capacity information for each unaffected link subsequent to the selected failure scenario; and the information device adapted to, responsive to a determination that no capacity is blocked and no path is found render an indication that no path exists.