The Forcer Concept and Express Route Planning in Mesh-Survivable Networks

To date, mesh network design theory has beendeveloped for the case where working and protectioncapacity is terminated at every node. It is recognizedthat express routes, which bypass some nodes en-route, would decrease the total DCS port costs but ithas been unclear how to incorporate bypass planning inthe optimal spare capacity design for a mesh-restorablenetwork. An important issue is whether the introduction of nodal bypass will increase the total sparecapacity needed for restorability, due to a reduction ofrestoration re-routing flexibility. To address thesequestions, we introduce the forcer concept for analysis of the relationship between workingand spare capacity in a mesh-restorable network. Weapply the forcer concept to show theoretically whybypass in fact need never require an increase in sparing and may actually permit a decrease in somecases. In tests to validate and exploit these findings,an average reduction of 12% in total spare capacity and16% in DCS port count totals were obtainedsimultaneously with an Integer Programming optimization. Thesesavings are relative to an already optimized fullyterminated network design. The work thus contributes togreater theoretical understanding and designcost-effectiveness for mesh-based restorable networks.

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

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

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

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

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

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

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

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

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

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

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