A 10/7+ε approximation for minimizing the number of ADMs in SONET rings

被引：8
|
作者：
Shalom, Mordechai [1 ]
Zaks, Shmuel [1 ]
机构：
[1] Technion Israel Inst Technol, Fac Comp Sci, IL-32000 Haifa, Israel
来源：
IEEE-ACM TRANSACTIONS ON NETWORKING | 2007年 / 15卷 / 06期
关键词：
add-drop multiplexer (ADM); optical networks; wavelength assignment; wavelength division multiplexing (WDM);
D O I：
10.1109/TNET.2007.906638
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
SONET add/drop multiplexers (ADMs) are dominant cost factors in WDM SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in Calinescu and Wan, 2002. Through the study of the relation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + epsilon approximation for it.
引用
收藏
页码：1593 / 1602
页数：10
相关论文
共 50 条
12345