Ring-mesh topology design in a SONET-WDM network
- Authors
- Kim, Youngjin; Lee, Youngho; Han, Junghee
- Issue Date
- 8월-2010
- Publisher
- SPRINGER
- Keywords
- Optical transport network; Ring-mesh topology; Integer programming; Tabu search; Column generation; Valid inequality
- Citation
- PHOTONIC NETWORK COMMUNICATIONS, v.20, no.1, pp.43 - 53
- Indexed
- SCIE
SCOPUS
- Journal Title
- PHOTONIC NETWORK COMMUNICATIONS
- Volume
- 20
- Number
- 1
- Start Page
- 43
- End Page
- 53
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/115914
- DOI
- 10.1007/s11107-010-0244-4
- ISSN
- 1387-974X
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.