A highly efficient path-restoration protocol for management of optical network transport integrity

Distributed path restoration based on optical cross-connects can provide highly capacity-efficient real-time restoration for WDM-based optical networking. However, to obtain an assured restoration level with the theoretically very low amounts of spare capacity that path restoration allows, one must solve, or closely approximate a solution to, the integer multicommodity maximum flow (MCMF) problem, MCMF is, however a hard combinatorial optimization problem due to what is called the "mutual capacity" aspects of the problem: which of many competing origin-destination pairs should be allowed paths over the finite spares on each span? Integer MCMF is further complicated by the nonunimodular nature of the problem, i.e., fractional flows are forbidden but would arise if solved by linear programming. This paper presents a heuristic principle that tests well against integer programming solutions of MCMF routing. The heuristic is first characterized in a centralized program, then adapted for use in a distributed path restoration protocol. In all test cases, the protocol obtains over 97% of the paths found in an optimal MCMF solution in the same network. Via OPNET simulation it is also predicted that the protocol will run in well under 2 seconds which means it could be used directly in real-time, or in distributed prefailure self-planning, for restoration. The significance is that network operators could aggressively optimize their spare capacity, toward theoretical minimums, while still assuring 100% restorability.

[1]  Deep Medhi,et al.  A unified approach to network survivability for teletraffic networks: models, algorithms and analysis , 1994, IEEE Trans. Commun..

[2]  Wayne D. Grover,et al.  Two strategies for spare capacity placement in mesh restorable networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[3]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in mesh survivable networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[4]  Wayne D. Grover,et al.  A Distributed Real Time Path Restoration Protocol with Performance close to Centralized Multi-commodity Max Flow , 1998 .

[5]  Rainer R. Iraschko.  Path restorable networks , 1997 .

[6]  Joseph Sosnosky,et al.  Service applications for SONET DCS distributed restoration , 1994, IEEE J. Sel. Areas Commun..

[7]  Wayne D. Grover,et al.  Optimized k‐shortest‐paths algorithm for facility restoration , 1994, Softw. Pract. Exp..

[8]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[9]  H. Eslambolchi,et al.  FASTAR-a robust system for fast DS3 restoration , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[10]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[11]  Farnam Jahanian,et al.  Internet routing instability , 1997, SIGCOMM '97.

[12]  W. D. Grover,et al.  Optimized design of ring-based survivable networks , 1995, Canadian Journal of Electrical and Computer Engineering.

[13]  Katsuyuki Yamazaki,et al.  Robust design and planning of a worldwide intelligent network , 1989, IEEE J. Sel. Areas Commun..

[14]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

[15]  T. Flanagan,et al.  Fiber network survivability , 1990, IEEE Communications Magazine.

[16]  Ken-ichi Sato,et al.  Self-healing ATM networks based on virtual path concept , 1994, IEEE J. Sel. Areas Commun..

[17]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[18]  T. V. Lakshman,et al.  A service restoration time study for distributed control SONET digital cross-connect system self-healing networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[19]  H. Fujii,et al.  Restoration message transfer mechanism and restoration characteristics of double-search self-healing ATM network , 1994, IEEE J. Sel. Areas Commun..

[20]  Keiji Miyazaki,et al.  Distributed self‐healing network and its optimum spare‐capacity assignment algorithm , 1991 .

[21]  C. H. Yang,et al.  FITNESS-failure immunization technology for network services survivability , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[22]  C. Edward Chow,et al.  Performance analysis of fast distributed link restoration algorithms , 1995 .

[23]  John C. McDonald,et al.  Public network integrity-avoiding a crisis in trust , 1994, IEEE J. Sel. Areas Commun..

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

[25]  Salah Aidarous,et al.  Distributed Restoration of the Transport Network , 1994 .

[26]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[27]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[28]  Wayne D. Grover,et al.  Development and Performance Assessment of a Distributed Asynchronous Protocol for Real-Time Network Restoration , 1991, IEEE J. Sel. Areas Commun..

[29]  B. D. Venables,et al.  Performance of the Selfhealing Network protocol with random individual link failure times , 1991, ICC 91 International Conference on Communications Conference Record.

[30]  W. D. Grover,et al.  Self-organizing broad-band transport networks , 1997, Proc. IEEE.

[31]  W.E. Falconer,et al.  Service assurance in modern telecommunications networks , 1990, IEEE Communications Magazine.

[32]  M. Herzberg,et al.  An optimal spare-capacity assignment model for survivable networks with hop limits , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[33]  Wayne D. Grover,et al.  Case studies of survivable ring, mesh and mesh-arc hybrid networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.