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 条
  • [11] Optimal routing and wavelength assignment to minimize the number of SONET ADMs in WDM rings
    Chung, Jibok
    Mo, Jeonghoon
    PHOTONIC NETWORK COMMUNICATIONS, 2011, 21 (01) : 13 - 20
  • [12] Traffic partition in WDM/SONET rings to minimize SONET ADMs
    Calinescu, G
    Wan, PJ
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2002, 6 (04) : 425 - 453
  • [13] Optimal routing and wavelength assignment to minimize the number of SONET ADMs in WDM rings
    Jibok Chung
    Jeonghoon Mo
    Photonic Network Communications, 2011, 21 : 13 - 20
  • [14] An optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings
    Sethuraman, J
    Mahanti, A
    Saha, D
    Sadhukhan, SK
    2005 INTERNATIONAL CONFERENCE ON WIRELESS AND OPTICAL COMMUNICATIONS NETWORKS, 2005, : 205 - 209
  • [15] Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
    Calinescu, G
    Wan, PJ
    THEORETICAL COMPUTER SCIENCE, 2002, 276 (1-2) : 33 - 50
  • [16] Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem
    Shalom, Mordechai
    Zaks, Shmuel
    THEORETICAL COMPUTER SCIENCE, 2007, 384 (2-3) : 250 - 262
  • [17] A heuristic search based optimal wavelength assignment algorithm to minimize the number of SONET ADMS in WDM rings
    Sethuraman, J
    Mahanti, A
    Saba, D
    PROCEEDINGS OF THE THIRD IASTED INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND COMPUTER NETWORKS, 2005, : 152 - 157
  • [18] A wavelength assignment heuristic to minimize SONET ADMs in WDM rings
    Yuan, X
    Fulay, A
    INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS, PROCEEDINGS, 2001, : 257 - 262
  • [19] A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings
    Sethuraman, J
    Mahanti, A
    Saha, D
    Sadhukhan, SK
    ICCCN 2005: 14TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2005, : 597 - 597
  • [20] AN UNINFORMED BEST FIRST SEARCH BASED WAVELENGTH ASSIGNMENT ALGORITHM TO MINIMIZE THE NUMBER OF SONET ADMs IN WDM RINGS
    Sethuraman, J.
    Mahanti, Ambuj
    Saha, Debashis
    TELECOMMUNICATIONS PLANNING : INNOVATIONS IN PRICING, NETWORK DESIGN AND MANAGEMENT, 2006, 33 : 225 - 239
12345