Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs

被引:0
|
作者
Gruia Călinescu
Peng-Jun Wan
机构
[1] Illinois Institute of Technology,Department of Computer Science
来源
关键词
SONET; WDM; add-drop multiplexer; grooming; approximation algorithms;
D O I
暂无
中图分类号
学科分类号
摘要
SONET (Synchronous Optical NETworks) add-drop multiplexers (ADMs) are the dominant cost factor in the WDM(Wavelength Division Multiplexing)/SONET 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. Previous works took as input the traffic streams with routings given a priori and developed various heuristics for wavelength assignment to minimize the SONET ADM costs. However, little was known about the performance guarantees of these heuristics. This paper contributes mainly in two aspects. First, in addition to the traffic streams with pre-specified routing, this paper also studies minimizing the ADM requirement by traffic streams without given routings, a problem which is shown to be NP-hard. Several heuristics for integrated routing and wavelength assignment are proposed to minimize the SONET ADM costs. Second, the approximation ratios of those heuristics for wavelength assignment only and those heuristics for integrated routing and wavelength assignment are analyzed. The new Preprocessed Iterative Matching heuristic has the best approximation ratio: at most 3/2.
引用
收藏
页码:425 / 453
页数:28
相关论文
共 50 条
  • [41] A 10/7+ε approximation for minimizing the number of ADMs in SONET rings
    Shalom, M
    Zaks, S
    FIRST INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS, PROCEEDINGS, 2004, : 254 - 262
  • [42] SONET ADMs minimization with divisible paths
    Epstein, Leah
    Levin, Asaf
    ALGORITHMICA, 2007, 49 (01) : 51 - 68
  • [43] Multiobjective genetic algorithm based approach to traffic grooming in unidirectional SONET/WDM rings
    Biswas U.
    Maulik U.
    Mukhopadhyay A.
    Naskar M.K.
    Journal of Optics, 2010, 39 (3) : 136 - 142
  • [44] Better bounds for minimizing SONET ADMs
    Epstein, L
    Levin, A
    APPROXIMATION AND ONLINE ALGORITHMS, 2004, 3351 : 281 - 294
  • [45] Better bounds for minimizing SONET ADMs
    Epstein, Leah
    Levin, Asaf
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2009, 75 (02) : 122 - 136
  • [46] Grooming Traffic to Maximize Throughput in SONET Rings
    Colbourn, Charles J.
    Quattrocchi, Gaetano
    Syrotiuk, Violet R.
    JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2011, 3 (01) : 10 - 16
  • [47] The chord version for SONET ADMs minimization
    Epstein, L
    Levin, A
    THEORETICAL COMPUTER SCIENCE, 2005, 349 (03) : 337 - 346
  • [48] SONET ADMs Minimization with Divisible Paths
    Leah Epstein
    Asaf Levin
    Algorithmica, 2007, 49 : 51 - 68
  • [49] SONET ADMs minimization with divisible paths
    Epstein, L
    Levin, A
    APPROXIMATION AND ONLINE ALGORITHMS, 2006, 3879 : 119 - 132
  • [50] Efficient algorithms for traffic grooming in SONET/WDM networks
    Wang, Yong
    Gu, Qian-Ping
    2006 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS, 2006, : 355 - 362