Telecommunication Systems

, Volume 3, Issue 2, pp 165–181 | Cite as

An optimization problem related to balancing loads on SONET rings

  • Steve Cosares
  • Iraj Saniee
Article

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.

Keywords

Stochastic Process Computational Complexity Probability Theory Design Problem High Capacity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Babcock, Sonet: A practical perspective, Bussiness Commun. Rev. (September 1990) pp. 59–63.Google Scholar
  2. [2]
    O. Bilde and J. Krarup, Sharp lower bounds and efficient algorithms for the simple plant location problem, Ann. Discr. Math. 1(1977)79–97.Google Scholar
  3. [3]
    A. Balakrishnan, T.L. Magnanti and R.T. Wong, A dual-ascent procedure for large scale network design, Oper. Res. 37(1989)716–740.Google Scholar
  4. [4]
    S. Cosares, I. Saniee and O. Wasem, Network planning with the SONET Toolkit, Bellcore EXCHANGE (September/October 1992) pp. 8–13.Google Scholar
  5. [5]
    D. Erlenkotter, A dual-based procedure for uncapacitated facility location, Oper. Res. 26(1978)992–1009.Google Scholar
  6. [6]
    M.L. Fisher and D.S. Hochbaum, Database location in computer networks, J. ACM 27(1980) 718–735.Google Scholar
  7. [7]
    M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to NP-Completeness (Freeman, San Francisco, CA, 1979).Google Scholar
  8. [8]
    I. Saniee, An upper bound for weight-based routings in ring networks, Bellcore manuscript (1994).Google Scholar
  9. [9]
    R.M. Karp, Reducibility among combinatorial problems, in:Complexity of Computer Computations (Plenum Press, 1972) pp. 85–103.Google Scholar
  10. [10]
    L.G. Khachiyan, A polynomial algorithm in linear programming, Sov. Math. Dokl. 20(1979)191–194.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    G.R. Ritchie, SONET lays the roadbed for broadband networks, Networking Manag. (1990).Google Scholar
  13. [13]
    A. Schulman, R. Vachani, J. Ward and P. Kubat, Multicommodity flows in ring networks, GTE Laboratories manuscript (September 1991).Google Scholar
  14. [14]
    R.T. Wong, Dual-ascent approach for Steiner tree problems on a directed graph, Math. Progr. 28(1984)271–287.Google Scholar

Copyright information

© J.C. Baltzer AG, Science Publishers 1994

Authors and Affiliations

  • Steve Cosares
    • 1
  • Iraj Saniee
    • 2
  1. 1.Department of MathematicsDowling CollegeOakdaleUSA
  2. 2.Bell Communications Research, Inc.MorristownUSA

Personalised recommendations