A Distributed Real Time Path Restoration Protocol with Performance close to Centralized Multi-commodity Max Flow

Intense competition between transport network service providers and the widespread deployment of vulnerable high-capacity fiber optic transport facilities has created the need for networks with short restoration times. This paper presents an optimized distributed real time path restoration mechanism, named OPRA, capable of restoring network failures quickly with performance close to centralized multi-commodity max-flow. OPRA synthesizes restoration pathsets by autonomous, database-free, self-organizing interaction between nodes. Simulation results predict that OPRA will restore network failures in very minimally redundant networks in less than two seconds.

[1]  Keiji Miyazaki,et al.  A distributed restoration algorithm for multiple-link and node failures of transport networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

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

[3]  Iraj Saniee,et al.  Optimal Routing Designs in Self-healing Communications Networks , 1996 .

[4]  J. E. Baker,et al.  A distributed link restoration algorithm with robust preplanning , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

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

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

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

[8]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

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

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

[11]  Salah Aidarous,et al.  Telecommunications Network Management into the 21st Century: Techniques, Standards, Technologies, and Applications , 1994 .

[12]  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.

[13]  W. D. Grover,et al.  The selfhealing network : A fast distributed restoration technique for networks using digital crossconnect machines , 1987 .

[14]  M. P. Vecchi,et al.  A distributed protocol to improve the survivability of trunk networks , 1990, International Symposium on Switching.

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

[16]  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.

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

[18]  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.

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