IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v26y2018i3d10.1007_s11750-018-0483-6.html
   My bibliography  Save this article

Integer programming models for the routing and spectrum allocation problem

Author

Listed:
  • Federico Bertero

    (Instituto de Ciencias - Universidad Nacional de General Sarmiento)

  • Marcelo Bianchetti

    (Instituto de Ciencias - Universidad Nacional de General Sarmiento)

  • Javier Marenco

    (Instituto de Ciencias - Universidad Nacional de General Sarmiento)

Abstract

One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid (flexgrid) technology specified in the ITU-T standard G.694.1. In this specification, the frequency spectrum of an optical fiber link is divided into narrow frequency slots. Any sequence of consecutive slots can be used as a simple channel, and such a channel can be switched in the network nodes to create a lightpath. In this kind of networks, the problem of establishing lightpaths for a set of end-to-end demands that compete for spectrum resources is called the routing and spectrum allocation problem (RSA). Due to its relevance, this problem has been intensively studied in the last couple of years. It has been shown to be NP-hard (Christodoulopoulos et al. in IEEE J Lightw Technol 29(9):1354–1366, 2011; Wang et al. in IEEE J Opt Commun Netw 4(11):906–917, 2012) and several models and formulations have been proposed, leading to different solution approaches. In this work, we explore integer programming models for RSA, analyzing their effectiveness over known instances. We resort to several modeling techniques, to find natural formulations of this problem. Since integer programming techniques are known to provide successful practical approaches for several combinatorial optimization problems, the aim of this work is to explore a similar approach for RSA.

Suggested Citation

  • Federico Bertero & Marcelo Bianchetti & Javier Marenco, 2018. "Integer programming models for the routing and spectrum allocation problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 465-488, October.
  • Handle: RePEc:spr:topjnl:v:26:y:2018:i:3:d:10.1007_s11750-018-0483-6
    DOI: 10.1007/s11750-018-0483-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-018-0483-6
    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/s11750-018-0483-6?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.

    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:topjnl:v:26:y:2018:i:3:d:10.1007_s11750-018-0483-6. 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.