A traffic grooming problem of SONET-WDM rings

Junghee Han, Youngho Lee, Youngjin Kim

Research output: Contribution to journalArticle

Abstract

In this paper, we present a traffic grooming problem of the SONET-WDM ring. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipment, while satisfying intra-ring and inter-ring capacities. We develop integer programming (IP) formulations for the problem and devise some reformulations for enhancing the mathematical representation of the proposed IP model. By investigating the polyhedral structure of the problem, we develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computation time. Computational results are provided to demonstrate the relative strength of the proposed formulations, and to reveal the efficacy of the lower and upper bound procedures for solving the problem.

Original languageEnglish
Pages (from-to)93-106
Number of pages14
JournalPhotonic Network Communications
Volume16
Issue number2
DOIs
Publication statusPublished - 2008 Oct 1

Fingerprint

Integer programming
Wavelength division multiplexing
Telecommunication traffic
traffic
Tabu search
rings
programming
integers
Computational complexity
formulations
hubs
multiplexing
Costs
costs

Keywords

  • Integer programming
  • SONET-WDM ring
  • Tabu search
  • Traffic grooming

ASJC Scopus subject areas

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

Cite this

A traffic grooming problem of SONET-WDM rings. / Han, Junghee; Lee, Youngho; Kim, Youngjin.

In: Photonic Network Communications, Vol. 16, No. 2, 01.10.2008, p. 93-106.

Research output: Contribution to journalArticle

Han, Junghee ; Lee, Youngho ; Kim, Youngjin. / A traffic grooming problem of SONET-WDM rings. In: Photonic Network Communications. 2008 ; Vol. 16, No. 2. pp. 93-106.
@article{f6739b8dfd0649c4a031cfb14f136ef9,
title = "A traffic grooming problem of SONET-WDM rings",
abstract = "In this paper, we present a traffic grooming problem of the SONET-WDM ring. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipment, while satisfying intra-ring and inter-ring capacities. We develop integer programming (IP) formulations for the problem and devise some reformulations for enhancing the mathematical representation of the proposed IP model. By investigating the polyhedral structure of the problem, we develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computation time. Computational results are provided to demonstrate the relative strength of the proposed formulations, and to reveal the efficacy of the lower and upper bound procedures for solving the problem.",
keywords = "Integer programming, SONET-WDM ring, Tabu search, Traffic grooming",
author = "Junghee Han and Youngho Lee and Youngjin Kim",
year = "2008",
month = "10",
day = "1",
doi = "10.1007/s11107-008-0121-6",
language = "English",
volume = "16",
pages = "93--106",
journal = "Photonic Network Communications",
issn = "1387-974X",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - A traffic grooming problem of SONET-WDM rings

AU - Han, Junghee

AU - Lee, Youngho

AU - Kim, Youngjin

PY - 2008/10/1

Y1 - 2008/10/1

N2 - In this paper, we present a traffic grooming problem of the SONET-WDM ring. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipment, while satisfying intra-ring and inter-ring capacities. We develop integer programming (IP) formulations for the problem and devise some reformulations for enhancing the mathematical representation of the proposed IP model. By investigating the polyhedral structure of the problem, we develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computation time. Computational results are provided to demonstrate the relative strength of the proposed formulations, and to reveal the efficacy of the lower and upper bound procedures for solving the problem.

AB - In this paper, we present a traffic grooming problem of the SONET-WDM ring. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipment, while satisfying intra-ring and inter-ring capacities. We develop integer programming (IP) formulations for the problem and devise some reformulations for enhancing the mathematical representation of the proposed IP model. By investigating the polyhedral structure of the problem, we develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computation time. Computational results are provided to demonstrate the relative strength of the proposed formulations, and to reveal the efficacy of the lower and upper bound procedures for solving the problem.

KW - Integer programming

KW - SONET-WDM ring

KW - Tabu search

KW - Traffic grooming

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

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

U2 - 10.1007/s11107-008-0121-6

DO - 10.1007/s11107-008-0121-6

M3 - Article

AN - SCOPUS:49149128182

VL - 16

SP - 93

EP - 106

JO - Photonic Network Communications

JF - Photonic Network Communications

SN - 1387-974X

IS - 2

ER -