IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v62y2016i2d10.1007_s11235-015-0066-x.html
   My bibliography  Save this article

An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks

Author

Listed:
  • José M. F. Craveirinha

    (Faculty of Sciences and Technology, University of Coimbra
    Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra))

  • João C. N. Clímaco

    (Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra))

  • Lúcia M. R. A. Martins

    (Faculty of Sciences and Technology, University of Coimbra
    Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra))

  • Marta M. B. Pascoal

    (University of Coimbra
    Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra))

Abstract

The construction of overlay or broadcast networks, based on spanning trees, over WDM optical networks with SRLG information, has important applications in telecommunications. In this paper we propose a bicriteria optimization model for calculating communication spanning trees over WDM networks the objectives of which are the minimization of the total number of different SRLGs of the tree links (seeking to maximise reliability) and the minimization of the total bandwidth usage cost. An exact algorithm for generating the whole set of non-dominated solutions and methods for selecting a final solution in various decision environments are put forward. An extensive experimental study on the application of the model, including two sets of experiments based on reference transport network topologies, with random link bandwidth occupations and with random SRLG assignments to the links, is also presented, together with a discussion on potential advantages of the model.

Suggested Citation

  • José M. F. Craveirinha & João C. N. Clímaco & Lúcia M. R. A. Martins & Marta M. B. Pascoal, 2016. "An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 62(2), pages 327-346, June.
    • Handle: RePEc:spr:telsys:v:62:y:2016:i:2:d:10.1007_s11235-015-0066-x
    DOI: 10.1007/s11235-015-0066-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-015-0066-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-015-0066-x?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.

    References listed on IDEAS

    as
    1. Clímaco, João C.N. & Eugénia Captivo, M. & Pascoal, Marta M.B., 2010. "On the bicriterion - minimal cost/minimal label - spanning tree problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 199-205, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andrew Ensor & Felipe Lillo, 2016. "Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-21, February.

    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:telsys:v:62:y:2016:i:2:d:10.1007_s11235-015-0066-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.