Abstract
This article deals with a ring–mesh network design problem arising from the deployment of an optical transport network. The problem seeks to partition the set of demand pairs to a number of rings and a mesh cluster, and to determine the location of the optical cross-connect system (OXC), while minimizing the total cost of optical add-drop multiplexers (OADMs), OXCs, and fiber links. We formulate this problem as a zero-one integer programming problem. In strengthening the formulation, we develop some valid inequalities for the zero-one quadratic (knapsack) polytope and a column generation formulation that eliminates the symmetry of ring configurations. Also, we prescribe an effective tabu search procedure for finding a good quality feasible solution, which is also used as a starting column for the column generation procedure. Computational results show that the proposed solution procedure provides tight lower and upper bounds within a reasonable time bound.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arijs P., Van Caenegem B., Demeester P., Lagasse P., VanParys W., Achten P.: Design of ring and mesh based WDM transport networks. Opt. Netw. Mag. 1(3), 25–40 (2000)
Glover F.: Tabu search and adaptive memory programming—advances, applications and challenges. In: Barr, R., Helgason, R., Kennington, J. (eds) Advances in Metaheuristics, Optimization and Stochastic Modeling Technologies, pp. 1–75. Kluwer, Dordrecht (1997)
Glover F., Laguna M.: Tabu Search. Kluwer, Boston (1998)
Goldschmidt O., Laugier A., Olinick E.: SONET/SDH ring assignment with capacity constraints. Discret. Appl. Math. 129(1), 99–128 (2003)
Grover W., Martens R.: Combined ring–mesh optical transport networks. Cluster Comput. 7(3), 245–258 (2004)
Johnson E., Mehrotra A., Nemhauser G.: Min-cut clustering. Math. Program. 62(1), 133–151 (1993)
Kennington J., Olinick E., Ortynski A., Spiride G.: Wavelength routing and assignment in a survivable WDM mesh network. Oper. Res. 51(1), 67–79 (2003)
Kim Y., Lee Y., Han J.: A ring–mesh topology design problem for optical transport network. J. Heuristics 14(2), 83–202 (2008)
Lee C., Koh S.: Assignment of add-drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks. J. Oper. Res. Soc. 52(4), 440–448 (2001)
Lee Y., Sherali H., Han J., Kim S.: A branch-and-cut algorithm for solving and intraring synchronous optical network design problem. Networks 35(3), 223–232 (2000)
Lee Y., Han J., Kang K.: A fiber routing problem in designing optical transport networks with wavelength division multiplexed systems. Photonic Netw. Commun. 5(3), 247–257 (2003)
Nemhauser G., Wolsey L.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Padberg M.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1), 139–172 (1989)
Rochat Y., Taillard E.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1(1), 147–167 (1995)
Smith J., Schaefer A., Yen J.: A stochastic integer programming approach to solving a synchronous optical network ring design problem. Networks 44(1), 12–26 (2004)
Sutter A., Vanderbeck F., Wolsey L.: Optimal placement of add/drop multiplexers: heuristic and exact algorithms. Oper. Res. 46(5), 719–728 (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kim, Y., Lee, Y. & Han, J. Ring–mesh topology design in a SONET–WDM network. Photon Netw Commun 20, 43–53 (2010). https://doi.org/10.1007/s11107-010-0244-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-010-0244-4