Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks

Designing low cost SONET networks composed of self-healing rings is an important problem facing the providers of broadband services. This manuscript demonstrates how optimization technology coupled with the highly efficient CPLEX software system can be used to help solve this important problem. For the first time, provable optimal designs are presented for several small networks which appear in the literature. In an empirical analysis, we demonstrate how this same methodology can be used to find good (but not provably optimal) designs for large test cases.

[1]  Wayne D. Grover,et al.  An algorithm for survivable network design employing multiple self-healing rings , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[2]  James Evans,et al.  Optimization algorithms for networks and graphs , 1992 .

[3]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[4]  Ioannis G. Tollis,et al.  Techniques for finding ring covers in survivable networks , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

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

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

[7]  Jeffery L. Kennington,et al.  An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network , 1999, INFORMS J. Comput..

[8]  Frank Harary,et al.  Graph Theory , 2016 .

[9]  Ioannis G. Tollis,et al.  Net Solver: a software tool for the design of survivable networks , 1995, Proceedings of GLOBECOM '95.