Abstract
In this paper, we consider a SONET (Synchronous Optical NETwork) USHR (Uni‐directional Self‐Healing Ring) design problem for a single‐homing cluster, i.e., a cluster with a single designated hub. The problem is formulated as a nonlinear integer programming problem and a branch and bound heuristic method based on the Lagrangian relaxation and subgradient optimization technique is proposed to handle the problem. In solving any ring design problem, we should deal with two different aspects of the ring design, namely, the ring routing aspect and the ring loading aspect. Both of these two aspects are well integrated and represented in our model. Such an integrated formulation has not been proposed in the existing literature mainly due to its computationally intractable complexity. In order to cope with such complexity, a preprocessing technique for reducing the complexity and several branch and bound strategies are proposed. The efficiency of the proposed method is tested through computational experiments. For the computational experiments, test problems are generated using the data obtained from the actual topologies in Seoul, Korea. The computational experiments show that the proposed method yields near‐optimum designs within reasonable computation time.
Similar content being viewed by others
References
K. Altinkemer, Topological design of ring networks, Computers and Operations Research 21 (1994) 21–431.
K. Altinkemer and Z. Yu, Topological design of wide area communication networks, Annals of Operations Research 36 (1992) 365–381.
A. Balakrishnan, T.L. Magnanti, A. Shulman and R.T. Wong, Models for planning capacity expansion in local access telecommunication networks, Annals of Operations Research 33 (1991) 239–284.
G. Belvaux, N. Boissin, A. Sutter and L.A. Wolsey, Optimal placement of add/drop multiplexers: Static and dynamic models, Core Discussion Paper 9609, Université Catholique de Louvain, Louvain-la-Neuve (1996).
S. Cosares, D.N. Deutsch, I. Saniee and O.J. Wasem, SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks, Interfaces 25 (1995) 20–40.
S. Cosares and I. Saniee, An optimization problem related to balancing loads on SONET rings, Telecommunication Systems 3 (1994) 165–182.
CPLEX linear optimizer 4.0.8 with mixed integer & barrier solvers, CPLEX Optimization, Inc. (1995).
R.D. Doverspike, J.A. Morgan and W. Leland, Network design survivability studies for use of digital cross-connect systems in survivable network architectures, IEEE Journal on Selected Areas in Communications 12 (1994) 69–78.
A. Dutta and J. Lim, A multiperiod capacity planning model for backbone computer communication networks, Operations Research 40 (1992) 689–705.
M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Management Science 27 (1981) 1–18.
B. Gavish, Topological design of computer communication networks – the overall design problem, European Journal of Operations Research 58 (1992) 149–172.
M. Gendreau, M. Labbe and G. Laporte, Efficient heuristics for the design of ring networks, Telecommunication Systems 4 (1995) 177–188.
M. Grotschel, C.L. Monma and M. Stoer, Polyhedral and computational investigations for designing communication networks with high survivability requirements, Operations Research 43 (1995) 1012–1024.
M. Laguna, Clustering for the design of SONET rings in interoffice telecommunications, Management Science 40 (1994) 1533–1541.
B.W. Lamar, Y. Sheffi and W.B. Powell, A capacity improvement lower bound for fixed charge network design problems, Operations Research 38 (1990) 704–710.
G. Laporte, The vehicle routing problem: an overview of exact and approximate algorithms, European Journal of Operations Research 59 (1992) 345–358.
H.S. Lee, A study on telecommunication network survivability by integrating the logical layer and the transmission system layer, Korea IE Interfaces 9 (1996) 81–91.
I. Neuman, A system for priority routing and capacity assignment in packet switched networks, Annals of Operations Research 36 (1992) 225–245.
O.J. Wasem, An algorithm for designing rings for survivable fiber networks, IEEE Transactions on Reliability 40 (1991) 428–432.
O.J. Wasem, T. Wu and R.H. Cardwell, Survivable SONET networks – design methodology, IEEE Journal on Selected Areas in Communications 12 (1994) 205–212.
T. Wu, Fiber Network Service Survivability (Artech House, 1992).
T. Wu, Cost-effective network evolution, IEEE Communications Magazine (September 1993).
T. Wu, R.H. Cardwell and M. Boyden, A multiperiod design model for survivable network architecture selection for SONET interoffice networks, IEEE Transactions on Reliability 40 (1991) 417–427.
A. Zolfaghari and F.J. Kaudel, Framework for network survivability performance, IEEE Journal on Selected Areas in Communications 12 (1994) 46–51.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chang, M., Chang, S.Y. A heuristic method for self‐healing ring design in a single‐homing cluster. Telecommunication Systems 14, 175–195 (2000). https://doi.org/10.1023/A:1019193417664
Issue Date:
DOI: https://doi.org/10.1023/A:1019193417664