IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i1p148-152.html
   My bibliography  Save this article

Optimal Load Balancing on Sonet Bidirectional Rings

Author

Listed:
  • Young-Soo Myung

    (Dankook University, Chungnam, Korea)

  • Hu-Gon Kim

    (Korea Advanced Institute of Science and Technology, Taejon, Korea)

  • Dong-Wan Tcha

    (Korea Advanced Institute of Science and Technology, Taejon, Korea)

Abstract

In this paper we consider the Ring Loading Problem, which arises in the design of SONET bidirectional rings. The issue of demand splitting divides the ring loading problem into the two kinds. One allows a demand to be split and routed in two different directions and the other does not. The former kind becomes a relaxation of the latter. We present an efficient exact solution procedure for the case with demand splitting, and a two-approximation algorithm for the case without demand splitting. Computational results are also shown to prove the efficiency of the proposed procedures.

Suggested Citation

  • Young-Soo Myung & Hu-Gon Kim & Dong-Wan Tcha, 1997. "Optimal Load Balancing on Sonet Bidirectional Rings," Operations Research, INFORMS, vol. 45(1), pages 148-152, February.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:1:p:148-152
    DOI: 10.1287/opre.45.1.148
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.1.148
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.1.148?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
    ---><---

    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.
    2. Cole Smith, J., 2004. "Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network," European Journal of Operational Research, Elsevier, vol. 154(3), pages 659-672, May.
    3. Fortz, Bernard & Soriano, Patrick & Wynants, Christelle, 2003. "A tabu search algorithm for self-healing ring network design," European Journal of Operational Research, Elsevier, vol. 151(2), pages 280-295, December.
    4. Hanif D. Sherali & J. Cole Smith & Youngho Lee, 2000. "Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 284-298, November.
    5. Man Xiao & Weidong Li & Xiaofei Liu, 2023. "Online Mixed Ring Covering Problem with Two Nodes," SN Operations Research Forum, Springer, vol. 4(1), pages 1-20, March.
    6. Y Shim & S A Gabriel & A Desai & P Sahakij & S Milner, 2008. "A fast heuristic method for minimizing traffic congestion on reconfigurable ring topologies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(4), pages 521-539, April.
    7. Meunier, Frédéric & Pradeau, Thomas, 2014. "The uniqueness property for networks with several origin–destination pairs," European Journal of Operational Research, Elsevier, vol. 237(1), pages 245-256.
    8. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.

    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:inm:oropre:v:45:y:1997:i:1:p:148-152. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.