Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Abou-Sayed, J. Kennington, and S. Nair, “Joint working and spare capacity assignment in a link restorable mesh network,” (revised January 1997) Technical Report 96–CSE-16, Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX 75275–0122.
R. Attanasio and K. Hoffman, “The right tool kit is all a network planner needs,” Telephony, pp. 22–26, 1993.
J.R. Evans and E. Minieka, Optimization Algorithms for Networks and Graphs, 2nd edition, Marcel Dekker: New York, 1992.
L.M. Gardner, M. Heydari, J. Shah, I.H. Sudborough, I.G. Tollis, and C. Xia, “Techniques for finding ring covers in survivable networks,” in Proceedings of IEEE GLOBECOM '94, 1994, pp. 1862–1866.
L.M. Gardner, I.H. Sudborough, and I.G. Tollis, “Net solver: A software tool for the design of survivable networks,” in Proceedings of IEEE GLOBECOM '95, 1995, pp. 926–930.
W.D. Grover, “Case studies of survivable ring, mesh and mesh-arc hybrid network,” in Proceedings of IEEE GLOBECOM '92, 1992, pp. 633–638.
W.D. Grover, J.B. Slevinsky, and M.H. MacGregor, “Optimized design of ring-based survivable networks,” Canadian Journal of Electrical and Computer Engineering, pp. 139–149, 1995.
F. Harary, Graph Theory, Addison-Wesley Publishing Company: Reading, Massachusetts, 1969.
J. Kennington and J. Whitler, “An efficient decomposition algorithm to optimize spare capacity in a telecommunications network,” Technical Report 97–CSE-5, Department of Computer Science and Engineering, Southern Methodist University, Dallas, Tx 75275–0122, 1997.
J.B. Slevinsky, W.D. Grover, and M.H. MacGregor, “An algorithm for survivable network design employing multiple self-healing rings,” in Proceedings of IEEE GLOBECOM '93, 1993, pp. 1568–1573.
M.N.S. Swamy and K. Thulasiraman, Graphs, Networks, and Algorithms, John Wiley & Sons: New York, 1981.
Using the CPLEX Callable Library, CPLEX Optimization, Incline Village, NV, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kennington, J., Nair, V. & Rahman, M. Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks. Computational Optimization and Applications 14, 219–230 (1999). https://doi.org/10.1023/A:1008747332633
Issue Date:
DOI: https://doi.org/10.1023/A:1008747332633