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 条
  • [21] Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
    Colbourn, CJ
    Ling, ACH
    DISCRETE MATHEMATICS, 2003, 261 (1-3) : 141 - 156
  • [22] On minimizing the number of ADMs in a general topology optical network
    Flammini, Michele
    Shalom, Mordechai
    Zaks, Shmuel
    Distributed Computing, Proceedings, 2006, 4167 : 459 - 473
  • [23] On minimizing the number of ADMs in a general topology optical network
    Flammini, Michele
    Shalom, Mordechai
    Zaks, Shmuel
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (12) : 2701 - 2717
  • [24] On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing
    Flammini, Michele
    Shalom, Mordechai
    Zaks, Shmuel
    COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING, 2006, 4235 : 72 - +
  • [25] On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing
    Flammini, Michele
    Shalom, Mordechai
    Zaks, Shmuel
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2007, 67 (04) : 448 - 455
  • [26] Minimizing the number of ADMs with and without traffic grooming: Complexity and approximability
    Shalom, M.
    Zaks, Sh.
    Flammini, M.
    Monaco, G.
    Moscardelli, L.
    ICTON 2006: 8TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS, VOL 3, PROCEEDINGS, 2006, : 105 - 107
  • [27] Optimal on-line colorings for minimizing the number of ADMs in optical networks
    Shalom, Mordechai
    Wong, Prudence W. H.
    Zaks, Shmuel
    ICTON 2007: PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS, VOL 1, 2007, : 58 - 58
  • [28] Optimal on-line colorings for minimizing the number of ADMs in optical networks
    Shalom, Mordechai
    Wong, Prudence W. H.
    Zaks, Shmuel
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, 4731 : 435 - +
  • [29] Optimal on-line colorings for minimizing the number of ADMs in optical networks
    Shalom, Mordechai
    Wong, Prudence W. H.
    Zaks, Shmuel
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (02) : 174 - 188
  • [30] Lower bound on number of ADMs in WDM rings with nonuniform traffic demands
    Xu, Y
    Yao, X
    ELECTRONICS LETTERS, 2004, 40 (13) : 824 - 825
12345