Comparative Methods and Issues In Design of Mesh-Restorable STM and ATM Networks

Many sectors of society, business, and industry have become dependent on the availability of communication networks. Today virtually all forms of traffic, whether circuit switched as in telephony, cell-based, or packet-switched, such as in B-ISDN or the Internet, are combined into standard synchronous optical network (SONET) carrier signals for transport on fiber optic transmission systems. A pair of optical fibers operating at the SONET rate of 9.8 Gb/s (called an OC-192) carries the equivalent of 129,000 voice or data circuits. A single cable may contain 48 or more of these fibers. The sheer volume of traffic makes the impact of a cable cut widespread and severe. Such events are, however, surprisingly frequent in practice. They have not only caused widespread congestion effects, but more serious effects such as loss of 911 service, loss of credit card services, and even the shut down of a major air traffic control network (MacDonald, 1994).

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

[2]  Wayne D. Grover,et al.  Fast heuristic principle for spare capacity placement in mesh-restorable SONET/SDH transport networks , 1997 .

[3]  M. Minoux.  Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .

[4]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1999, TNET.

[5]  Jean-Yves Le Boudec,et al.  The Asynchronous Transfer Mode: A Tutorial , 1992, Comput. Networks ISDN Syst..

[6]  Teodor Gabriel Crainic,et al.  Multicommodity Capacitated Network Design , 1999 .

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

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

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

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

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

[12]  Hyong S. Kim,et al.  Joint optimization of capacity and flow assignment for self-healing ATM networks , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[13]  Brunilde Sansò,et al.  Telecommunications Network Planning , 1998 .

[14]  Brunilde Sansò,et al.  Issues In ATM Network Planning: An Operations Research Perspective , 1999 .

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

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

[17]  Bradley David. Venables.  Algorithms for the spare capacity design of mesh restorable networks , 1992 .

[18]  Wayne D. Grover,et al.  BROADBAND NETWORK DESIGN WITH CONTROLLED EXPLOITATION OF FLOW CONVERGENCE OVERLOADS IN ATM VP-BASED RESTORATION , 1997 .

[19]  Wayne D. Grover,et al.  Dependence of network capacity requirements on the allowable flow convergence overloads in ATM backup VP restoration , 1997 .

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

[21]  T. C. Hu,et al.  Synthesis of a Communication Network , 1964 .

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

[23]  Curtis A. Siller,et al.  SONET/SDH: A Sourcebook of Synchronous Networking , 1996 .

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

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

[26]  Vipul. Rawat.  Heuristic techniques for very fast solution of the mesh spare capacity placement (SCP) problem , 1996 .

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