A link based alternative routing scheme for network restoration under failure

We present an alternative routing scheme which ensures that the network restores itself under any single link failure. In addition, our scheme has the advantage that restoration of the network occurs immediately on discovery of failure (without waiting for time consuming exchange of messages). An efficient heuristic algorithm, based on maximal-flow algorithm, is first used to partition the network into two parts (one carries the regular or primary traffic and the other is reserved to carry re-routed traffic in the event of failure). Then, we show how to use the results of the algorithm to actually find the alternative routes for a given call at the time of call setup.

[1]  Wayne D. Grover,et al.  Near optimal spare capacity planning in a mesh restorable network , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[2]  T. Murase,et al.  An alternate path routing scheme supporting QOS and fast connection setup in ATM networks , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Liang T. Wu,et al.  Using distributed topology update and preplanned configurations to achieve trunk network survivability , 1991 .

[5]  Ken-ichi Sato,et al.  Broad-band ATM network architecture based on virtual paths , 1990, IEEE Trans. Commun..

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Hideki Sakauchi,et al.  A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[8]  Subrahmanyam Dravida,et al.  Fast restoration of ATM networks , 1994, IEEE J. Sel. Areas Commun..

[9]  Tsong-Ho Wu.  A passive protected self-healing mesh network architecture and applications , 1994, TNET.