IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v250y2016i3p990-1000.html
   My bibliography  Save this article

Near optimal design of wavelength routed optical networks

Author

Listed:
  • Agarwal, Y.K.
  • Venkateshan, Prahalad

Abstract

The problem of designing a wavelength routed optical transport network without wavelength conversion at intermediate nodes is considered. A class of valid inequalities for wavelength routing and assignment is reported and is used to augment traditional network design formulations. The resulting network cost provides a lower bound on the cost of a network that permits wavelength routing. The resulting network is shown to be optimal for a majority of the problem instances tested and in those cases where it is not, a trial-and-error method is proposed that is able to find near-optimal solutions within relatively short period of time. This is achieved by developing efficient and effective heuristics that attempt to provide a feasible wavelength routing. Computational tests are reported on relatively larger problem sizes than have been reported in literature on the wavelength routing problem.

Suggested Citation

  • Agarwal, Y.K. & Venkateshan, Prahalad, 2016. "Near optimal design of wavelength routed optical networks," European Journal of Operational Research, Elsevier, vol. 250(3), pages 990-1000.
    • Handle: RePEc:eee:ejores:v:250:y:2016:i:3:p:990-1000
    DOI: 10.1016/j.ejor.2015.10.023
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715009492
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.10.023?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. Skorin-Kapov, Nina & Furdek, Marija & Aparicio Pardo, Ramon & Mariño, Pablo Pavón, 2012. "Wavelength assignment for reducing in-band crosstalk attack propagation in optical networks: ILP formulations and heuristic algorithms," European Journal of Operational Research, Elsevier, vol. 222(3), pages 418-429.
    2. Yogesh Agarwal, 2013. "Design of Survivable Networks Using Three- and Four-Partition Facets," Operations Research, INFORMS, vol. 61(1), pages 199-213, February.
    3. Jeffery Kennington & Eli Olinick & Augustyn Ortynski & Gheorghe Spiride, 2003. "Wavelength Routing and Assignment in a Survivable WDM Mesh Network," Operations Research, INFORMS, vol. 51(1), pages 67-79, February.
    4. Agarwal, Y.K. & Venkateshan, Prahalad, 2014. "Survivable network design with shared-protection routing," European Journal of Operational Research, Elsevier, vol. 238(3), pages 836-845.
    5. Belgacem, Lucile & Charon, Irène & Hudry, Olivier, 2014. "A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands," European Journal of Operational Research, Elsevier, vol. 232(2), pages 298-306.
    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. Ben Yaghlane, Asma & Azaiez, M. Naceur, 2017. "Systems under attack-survivability rather than reliability: Concept, results, and applications," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1156-1164.

    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. Wu, Xinyun & Lü, Zhipeng & Glover, Fred, 2020. "A matheuristic for a telecommunication network design problem with traffic grooming," Omega, Elsevier, vol. 90(C).
    2. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    3. Müller, R.J. & Gui, H. & Vohra, R., 2004. "Dominant strategy mechanisms with multidimensional types," Research Memorandum 046, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    4. Olaizola, Norma & Valenciano, Federico, 2014. "Asymmetric flow networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 566-579.
      • Olaizola Ortega, María Norma & Valenciano Llovera, Federico, 2012. "Asymmetric flow networks," IKERLANAK http://www-fae1-eao1-ehu-, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
    5. Kohar, Amit & Jakhar, Suresh Kumar & Agarwal, Yogesh K., 2023. "Strong cutting planes for the capacitated multi-pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 176(C).
    6. Yogesh Kumar Agarwal & Prahalad Venkateshan, 2019. "New Valid Inequalities for the Optimal Communication Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 268-284, April.
    7. Nigam, Ashutosh & Agarwal, Yogesh K., 2014. "Optimal relay node placement in delay constrained wireless sensor network design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 220-233.
    8. Kennington, Jeffery L. & Olinick, Eli V. & Spiride, Gheorghe, 2007. "Basic mathematical programming models for capacity allocation in mesh-based survivable networks," Omega, Elsevier, vol. 35(6), pages 629-644, December.
    9. Fabrizio Altarelli & Alfredo Braunstein & Luca Dall’Asta & Caterina De Bacco & Silvio Franz, 2015. "The Edge-Disjoint Path Problem on Random Graphs by Message-Passing," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-18, December.

    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:eee:ejores:v:250:y:2016:i:3:p:990-1000. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.