IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v71y2019i2d10.1007_s11235-018-0474-9.html
   My bibliography  Save this article

On solving the 1 + 1 routing, wavelength and network coding assignment problem with a bi-objective integer linear programming model

Author

Listed:
  • Dao Thanh Hai

    (Hanoi University of Industry)

Abstract

Network coding techniques have been viewed as the promising venue to improve the network efficiency and indeed, have been widely explored in the realm of failure recovery in optical networks. The combination of near-instantaneous recovery achieved by dedicated protections and capacity efficiency enabled by network coding brings about new opportunities to challenge the well-established trade-off of trading speed recovery for capacity efficiency and vice versa. In this context, the use of all-optical XOR network coding has reshaped the traditional 1 + 1 optical path protection in transparent WDM optical networks and established a new problem, called, 1 + 1 routing, wavelength and network coding assignment (1 + 1 RWNCA) as the extension of the conventional 1 + 1 routing and wavelength assignment (1 + 1 RWA). In this paper, we propose a bi-objective integer linear programming model of the 1 + 1 RWNCA problem aiming at minimizing the wavelength resources as the primary objective and simultaneously minimizing the wavelength link usage as the secondary objective. Our formulation uses a weighting method to combine two objectives into an integrated one and we provide insights on setting up the weight vectors to capture the priority of individual objectives. The effectiveness of our integrated objective model in comparison with reference designs based on the single-objective model, 1 + 1 RWA and 1 + 1 RWNCA, is numerically evaluated on different realistic topologies and traffic sets. Extensive simulation highlights that our proposal uses as efficient as around $$60\%$$ 60 % of the required wavelength link resources of reference designs and simultaneously achieve the highest performance on the primary objective of minimizing the wavelength resources while its computation time is a few time longer than its single objective counterpart model.

Suggested Citation

  • Dao Thanh Hai, 2019. "On solving the 1 + 1 routing, wavelength and network coding assignment problem with a bi-objective integer linear programming model," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 71(2), pages 155-165, June.
  • Handle: RePEc:spr:telsys:v:71:y:2019:i:2:d:10.1007_s11235-018-0474-9
    DOI: 10.1007/s11235-018-0474-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-018-0474-9
    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-018-0474-9?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. Abu Hena Al Muktadir & Eiji Oki, 2016. "A coding-aware reliable route design scheme for instantaneous recovery," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 62(3), pages 495-509, July.
    2. João Clímaco & José Craveirinha & Rita Girão-Silva, 2016. "Multicriteria Analysis in Telecommunication Network Planning and Design: A Survey," International Series in Operations Research & Management Science, in: Salvatore Greco & Matthias Ehrgott & José Rui Figueira (ed.), Multiple Criteria Decision Analysis, edition 2, chapter 0, pages 1167-1233, Springer.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Chunxue Wang & Daming Zhang & Jian Yue & Xucheng Zhang & Hang Lin & Xiangyi Sun & Anqi Cui & Tong Zhang & Changming Chen & Teng Fei, 2023. "Dual-layer optical encryption fluorescent polymer waveguide chip based on optical pulse-code modulation technique," Nature Communications, Nature, vol. 14(1), pages 1-11, December.

    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. Marta Pascoal & José Craveirinha & João Clímaco, 2022. "An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 405-425, 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:telsys:v:71:y:2019:i:2:d:10.1007_s11235-018-0474-9. 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.