IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v40y1994i11p1533-1541.html
   My bibliography  Save this article

Clustering for the Design of SONET Rings in Interoffice Telecommunications

Author

Listed:
  • Manuel Laguna

    (Graduate School of Business and Administration, Campus Box 419, University of Colorado, Boulder, Colorado 80309-0419)

Abstract

Optical fiber systems play an essential role in today's telecommunications networks. The recently standardized SONET (Synchronous Optical Network) technology has made rings the preferred architecture for designing survivable networks. The network design problem is very complex in nature, because it involves not only the configuration of rings at the logical level, but also the mapping of this configuration into physical fiber paths. This paper deals with the problem of finding optimal clusters of offices, which can be used as the basis for designing logical rings. A mathematical model of the problem is presented, and a heuristic solution based on the tabu search framework is developed to find optimal or near-optimal solutions.

Suggested Citation

  • Manuel Laguna, 1994. "Clustering for the Design of SONET Rings in Interoffice Telecommunications," Management Science, INFORMS, vol. 40(11), pages 1533-1541, November.
    • Handle: RePEc:inm:ormnsc:v:40:y:1994:i:11:p:1533-1541
    DOI: 10.1287/mnsc.40.11.1533
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.40.11.1533
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.40.11.1533?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. Arbib, Claudio & Rossi, Fabrizio, 2000. "An optimization problem arising in the design of multiring systems," European Journal of Operational Research, Elsevier, vol. 124(1), pages 63-76, July.
    2. Manuel Laguna, 1998. "Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty," Management Science, INFORMS, vol. 44(11-Part-2), pages 101-110, November.
    3. Dorit S. Hochbaum & Eli V. Olinick, 2001. "The Bounded Cycle-Cover Problem," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 104-119, May.
    4. Sudip Bhattacharjee & Hong Zhang & R. Ramesh & Dee H. Andrews, 2007. "A Decomposition and Guided Simulation Methodology for Large-Scale System Design: A Study in QoS-Capable Intranets with Fixed and Mobile Components," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 429-442, August.
    5. 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.
    6. 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.
    7. 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.
    8. Hongwei Gui & Rudolf M¨uller & Rakesh V. Vohra, 2004. "Dominant Strategy Mechanisms with Multidimensional Types," Discussion Papers 1392, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    9. Jiefeng Xu & Steve Y. Chiu & Fred Glover, 1999. "Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search," Management Science, INFORMS, vol. 45(3), pages 330-345, 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:ormnsc:v:40:y:1994:i:11:p:1533-1541. 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.