IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v6y2002i4d10.1023_a1019525904862.html
   My bibliography  Save this article

Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs

Author

Listed:
  • Gruia Călinescu

    (Illinois Institute of Technology)

  • Peng-Jun Wan

    (Illinois Institute of Technology)

Abstract

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.

Suggested Citation

  • Gruia Călinescu & Peng-Jun Wan, 2002. "Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs," Journal of Combinatorial Optimization, Springer, vol. 6(4), pages 425-453, December.
    • Handle: RePEc:spr:jcomop:v:6:y:2002:i:4:d:10.1023_a:1019525904862
    DOI: 10.1023/A:1019525904862
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1019525904862
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1019525904862?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qingqin Nong & Jinjiang Yuan & Yixun Lin, 2009. "The weighted link ring loading problem," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 38-50, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:6:y:2002:i:4:d:10.1023_a:1019525904862. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.