A Fiber Routing Problem in Designing Optical Transport Networks with Wavelength Division Multiplexed Systems

Youngho Lee, Junghee Han, Kugchang Kang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this paper, we consider a fiber routing problem arising from the design of optical transport networks. The problem is to find an optimal routing of multiple rings and an optimal location of wavelength division multiplexed (WDM) systems for carrying demand traffic. This problem can be conceptualized as a Steiner (multiple) ring problem with link capacity constraints. We formulate the problem as a mixed-integer programming model and develop a new branch-and-cut procedure along with preprocessing routines and valid inequalities for optimally solving the problem. Exploiting the inherent special structures of the formulation, we focus on developing strong valid inequalities and devising an effective Tabu search heuristic for solving large-scale problems. Computational results indicate that preprocessing rules and valid inequalities provide a tight lower bound, and in turn reduce the effort required to solve the problem within the framework of the branch-and-cut procedure. Moreover, the proposed Tabu search heuristic works quite well for solving large-scale problems. Motivated by promising computational results, we provide insights into implementing the proposed branch-and-cut procedure for deploying fiber optic networks in practice.

Original languageEnglish
Pages (from-to)247-257
Number of pages11
JournalPhotonic Network Communications
Volume5
Issue number3
DOIs
Publication statusPublished - 2003 May 1

Fingerprint

Tabu search
division
preprocessing
Wavelength
fibers
Fibers
Integer programming
Fiber optic networks
wavelengths
rings
programming
traffic
integers
fiber optics
formulations

Keywords

  • Branch-and-cut
  • Capacitated Steiner ring problem
  • Synchronous optical network (SONET)
  • Tabu search
  • Telecommunication networks
  • Wavelength division multiplexed (WDM) systems

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Atomic and Molecular Physics, and Optics

Cite this

A Fiber Routing Problem in Designing Optical Transport Networks with Wavelength Division Multiplexed Systems. / Lee, Youngho; Han, Junghee; Kang, Kugchang.

In: Photonic Network Communications, Vol. 5, No. 3, 01.05.2003, p. 247-257.

Research output: Contribution to journalArticle

@article{3e61b7f15a724f5ca15b44682e105cf2,
title = "A Fiber Routing Problem in Designing Optical Transport Networks with Wavelength Division Multiplexed Systems",
abstract = "In this paper, we consider a fiber routing problem arising from the design of optical transport networks. The problem is to find an optimal routing of multiple rings and an optimal location of wavelength division multiplexed (WDM) systems for carrying demand traffic. This problem can be conceptualized as a Steiner (multiple) ring problem with link capacity constraints. We formulate the problem as a mixed-integer programming model and develop a new branch-and-cut procedure along with preprocessing routines and valid inequalities for optimally solving the problem. Exploiting the inherent special structures of the formulation, we focus on developing strong valid inequalities and devising an effective Tabu search heuristic for solving large-scale problems. Computational results indicate that preprocessing rules and valid inequalities provide a tight lower bound, and in turn reduce the effort required to solve the problem within the framework of the branch-and-cut procedure. Moreover, the proposed Tabu search heuristic works quite well for solving large-scale problems. Motivated by promising computational results, we provide insights into implementing the proposed branch-and-cut procedure for deploying fiber optic networks in practice.",
keywords = "Branch-and-cut, Capacitated Steiner ring problem, Synchronous optical network (SONET), Tabu search, Telecommunication networks, Wavelength division multiplexed (WDM) systems",
author = "Youngho Lee and Junghee Han and Kugchang Kang",
year = "2003",
month = "5",
day = "1",
doi = "10.1023/A:1023040219593",
language = "English",
volume = "5",
pages = "247--257",
journal = "Photonic Network Communications",
issn = "1387-974X",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - A Fiber Routing Problem in Designing Optical Transport Networks with Wavelength Division Multiplexed Systems

AU - Lee, Youngho

AU - Han, Junghee

AU - Kang, Kugchang

PY - 2003/5/1

Y1 - 2003/5/1

N2 - In this paper, we consider a fiber routing problem arising from the design of optical transport networks. The problem is to find an optimal routing of multiple rings and an optimal location of wavelength division multiplexed (WDM) systems for carrying demand traffic. This problem can be conceptualized as a Steiner (multiple) ring problem with link capacity constraints. We formulate the problem as a mixed-integer programming model and develop a new branch-and-cut procedure along with preprocessing routines and valid inequalities for optimally solving the problem. Exploiting the inherent special structures of the formulation, we focus on developing strong valid inequalities and devising an effective Tabu search heuristic for solving large-scale problems. Computational results indicate that preprocessing rules and valid inequalities provide a tight lower bound, and in turn reduce the effort required to solve the problem within the framework of the branch-and-cut procedure. Moreover, the proposed Tabu search heuristic works quite well for solving large-scale problems. Motivated by promising computational results, we provide insights into implementing the proposed branch-and-cut procedure for deploying fiber optic networks in practice.

AB - In this paper, we consider a fiber routing problem arising from the design of optical transport networks. The problem is to find an optimal routing of multiple rings and an optimal location of wavelength division multiplexed (WDM) systems for carrying demand traffic. This problem can be conceptualized as a Steiner (multiple) ring problem with link capacity constraints. We formulate the problem as a mixed-integer programming model and develop a new branch-and-cut procedure along with preprocessing routines and valid inequalities for optimally solving the problem. Exploiting the inherent special structures of the formulation, we focus on developing strong valid inequalities and devising an effective Tabu search heuristic for solving large-scale problems. Computational results indicate that preprocessing rules and valid inequalities provide a tight lower bound, and in turn reduce the effort required to solve the problem within the framework of the branch-and-cut procedure. Moreover, the proposed Tabu search heuristic works quite well for solving large-scale problems. Motivated by promising computational results, we provide insights into implementing the proposed branch-and-cut procedure for deploying fiber optic networks in practice.

KW - Branch-and-cut

KW - Capacitated Steiner ring problem

KW - Synchronous optical network (SONET)

KW - Tabu search

KW - Telecommunication networks

KW - Wavelength division multiplexed (WDM) systems

UR - http://www.scopus.com/inward/record.url?scp=0037256657&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037256657&partnerID=8YFLogxK

U2 - 10.1023/A:1023040219593

DO - 10.1023/A:1023040219593

M3 - Article

VL - 5

SP - 247

EP - 257

JO - Photonic Network Communications

JF - Photonic Network Communications

SN - 1387-974X

IS - 3

ER -