Abstract
We provide a model and a set of solution techniques for an important problem arising in the design of survivable telecommunication networks utilizing fiber-optics-based technologies. The emergence of a synchronous standard for optical signaling called “SONET” allows for an economic implementation of ring designs that provides protection for high capacity services. An objective is to choose a loading of the demands onto a ring design that minimizes associated equipment and facility costs while providing capacity for alternative routing should some link or node fail. After the computational complexity of the problem has been determined, three approximation heuristics, including a mathematical programming dual-ascent solution technique, are described and compared. The heuristics are being successfully applied to actual network design problems arising in Bell operating companies and other telecommunication providers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Babcock, Sonet: A practical perspective, Bussiness Commun. Rev. (September 1990) pp. 59–63.
O. Bilde and J. Krarup, Sharp lower bounds and efficient algorithms for the simple plant location problem, Ann. Discr. Math. 1(1977)79–97.
A. Balakrishnan, T.L. Magnanti and R.T. Wong, A dual-ascent procedure for large scale network design, Oper. Res. 37(1989)716–740.
S. Cosares, I. Saniee and O. Wasem, Network planning with the SONET Toolkit, Bellcore EXCHANGE (September/October 1992) pp. 8–13.
D. Erlenkotter, A dual-based procedure for uncapacitated facility location, Oper. Res. 26(1978)992–1009.
M.L. Fisher and D.S. Hochbaum, Database location in computer networks, J. ACM 27(1980) 718–735.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to NP-Completeness (Freeman, San Francisco, CA, 1979).
I. Saniee, An upper bound for weight-based routings in ring networks, Bellcore manuscript (1994).
R.M. Karp, Reducibility among combinatorial problems, in:Complexity of Computer Computations (Plenum Press, 1972) pp. 85–103.
L.G. Khachiyan, A polynomial algorithm in linear programming, Sov. Math. Dokl. 20(1979)191–194.
Much of east coast phone service is disrupted by Jersey cable break, New York Times (November 19, 1988) p. 1; AT&T acting to thwart new mass disruption, New York Times (November 20, 1988) p. 37.
G.R. Ritchie, SONET lays the roadbed for broadband networks, Networking Manag. (1990).
A. Schulman, R. Vachani, J. Ward and P. Kubat, Multicommodity flows in ring networks, GTE Laboratories manuscript (September 1991).
R.T. Wong, Dual-ascent approach for Steiner tree problems on a directed graph, Math. Progr. 28(1984)271–287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cosares, S., Saniee, I. An optimization problem related to balancing loads on SONET rings. Telecommunication Systems 3, 165–181 (1994). https://doi.org/10.1007/BF02110141
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02110141