A ring-mesh topology design problem for optical transport networks

Authors:
Youngjin Kim;Youngho Lee;Junghee Han
Affiliations:
Department of Industrial Systems and Information Engineering, Korea University, Seoul, Republic of Korea 136-701;Department of Industrial Systems and Information Engineering, Korea University, Seoul, Republic of Korea 136-701;College of Business Administration, Kangwon National University, Kangwon-do, Republic of Korea 200-701
Venue:
Journal of Heuristics
Year:
2008

Citing 9
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Tabu Search

Tabu Search
Wavelength Routing and Assignment in a Survivable WDM Mesh Network

Operations Research
Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms

Operations Research
SONET/SDH ring assignment with capacity constraints

Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Improving Discrete Model Representations via Symmetry Considerations

Management Science
Combined Ring–Mesh Optical Transport Networks

Cluster Computing
A branch and cut algorithm for hub location problems with single assignment

Mathematical Programming: Series A and B
A stochastic integer programming approach to solving a synchronous optical network ring design problem

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with a ring-mesh network design problem arising from the deployment of an optical transport network. The problem seeks to find an optimal clustering of traffic demands in the network such that the total cost of optical add-drop multiplexer (OADM) and optical cross-connect (OXC) is minimized, while satisfying the OADM ring capacity constraint, the node cardinality constraint, and the OXC capacity constraint. We formulate the problem as an integer programming model and propose several alternative modeling techniques designed to improve the mathematical representation of the problem. We then develop various classes of valid inequalities to tighten the mathematical formulation of the problem and describe an algorithmic approach that coordinates tailored routines with a commercial solver CPLEX. We also propose an effective tabu search procedure for finding a good feasible solution as well as for providing a good incumbent solution for the column generation based heuristic procedure that enhances the solvability of the problem. Computational results exhibit the viability of the proposed method.