Better bounds for minimizing SONET ADMs

Leah Epstein; Asaf Levin

doi:10.1016/j.jcss.2008.08.003

Better bounds for minimizing SONET ADMs

Leah Epstein, Asaf Levin

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Following previous work, we consider the problem where the route of each traffic stream is given as input, and we need to assign wavelengths so as to minimize the total number of used SONET ADMs. This problem is known to be NP-hard, and the best known approximation algorithm for this problem has a performance guarantee of frac(3, 2). We improve this result, and present a frac(98, 69) ≈ 1.42029-approximation algorithm. We also study some of the previously proposed algorithms for this problem, and give either tight or tighter analysis of their approximation ratio.

Original language	English
Pages (from-to)	122-136
Number of pages	15
Journal	Journal of Computer and System Sciences
Volume	75
Issue number	2
DOIs	https://doi.org/10.1016/j.jcss.2008.08.003
State	Published - Feb 2009

Keywords

ADM minimization
Approximation algorithms
Optical network design

ASJC Scopus subject areas

Theoretical Computer Science
Computer Networks and Communications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1016/j.jcss.2008.08.003

Cite this

@article{f02cdbfcdcc44667bb5b31aa8216072f,

title = "Better bounds for minimizing SONET ADMs",

abstract = "SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Following previous work, we consider the problem where the route of each traffic stream is given as input, and we need to assign wavelengths so as to minimize the total number of used SONET ADMs. This problem is known to be NP-hard, and the best known approximation algorithm for this problem has a performance guarantee of frac(3, 2). We improve this result, and present a frac(98, 69) ≈ 1.42029-approximation algorithm. We also study some of the previously proposed algorithms for this problem, and give either tight or tighter analysis of their approximation ratio.",

keywords = "ADM minimization, Approximation algorithms, Optical network design",

author = "Leah Epstein and Asaf Levin",

year = "2009",

month = feb,

doi = "10.1016/j.jcss.2008.08.003",

language = "English",

volume = "75",

pages = "122--136",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Better bounds for minimizing SONET ADMs

AU - Epstein, Leah

AU - Levin, Asaf

PY - 2009/2

Y1 - 2009/2

N2 - SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Following previous work, we consider the problem where the route of each traffic stream is given as input, and we need to assign wavelengths so as to minimize the total number of used SONET ADMs. This problem is known to be NP-hard, and the best known approximation algorithm for this problem has a performance guarantee of frac(3, 2). We improve this result, and present a frac(98, 69) ≈ 1.42029-approximation algorithm. We also study some of the previously proposed algorithms for this problem, and give either tight or tighter analysis of their approximation ratio.

AB - SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Following previous work, we consider the problem where the route of each traffic stream is given as input, and we need to assign wavelengths so as to minimize the total number of used SONET ADMs. This problem is known to be NP-hard, and the best known approximation algorithm for this problem has a performance guarantee of frac(3, 2). We improve this result, and present a frac(98, 69) ≈ 1.42029-approximation algorithm. We also study some of the previously proposed algorithms for this problem, and give either tight or tighter analysis of their approximation ratio.

KW - ADM minimization

KW - Approximation algorithms

KW - Optical network design

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

U2 - 10.1016/j.jcss.2008.08.003

DO - 10.1016/j.jcss.2008.08.003

M3 - Article

AN - SCOPUS:58149166904

SN - 0022-0000

VL - 75

SP - 122

EP - 136

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 2

ER -

Better bounds for minimizing SONET ADMs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this