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

Survivable network design with shared-protection routing

Author

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

Abstract

In this paper we study the problem of designing a survivable telecommunication network with shared-protection routing. We develop a heuristic algorithm to solve this problem. Recent results in the area of global re-routing have been used to obtain very tight lower bounds for the problem. Our results indicate that in a majority of problem instances, the average gap between the heuristic solutions and the lower bounds is within 5%. Computational experience is reported on randomly generated problem instances with up to 35 nodes, 80 edges and 595 demand pairs and also on the instances available in SNDlib database.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:238:y:2014:i:3:p:836-845
    DOI: 10.1016/j.ejor.2014.04.047
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714003907
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.04.047?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. Geir Dahl & Mechthild Stoer, 1998. "A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 1-11, February.
    2. 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.
    3. Jeffery L. Kennington & Mark W. Lewis, 2001. "The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis," INFORMS Journal on Computing, INFORMS, vol. 13(3), pages 181-190, August.
    4. Sara Mattia, 2012. "Solving survivable two-layer network design problems by metric inequalities," Computational Optimization and Applications, Springer, vol. 51(2), pages 809-834, March.
    5. Thomas L. Magnanti & Prakash Mirchandani & Rita Vachani, 1995. "Modeling and Solving the Two-Facility Capacitated Network Loading Problem," Operations Research, INFORMS, vol. 43(1), pages 142-157, February.
    6. Anantaram Balakrishnan & Prakash Mirchandani & Harihara Prasad Natarajan, 2009. "Connectivity Upgrade Models for Survivable Network Design," Operations Research, INFORMS, vol. 57(1), pages 170-186, February.
    7. Clyde L. Monma & David F. Shallcross, 1989. "Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints," Operations Research, INFORMS, vol. 37(4), pages 531-541, August.
    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. 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. & Venkateshan, Prahalad, 2016. "Near optimal design of wavelength routed optical networks," European Journal of Operational Research, Elsevier, vol. 250(3), pages 990-1000.

    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. Yogesh Agarwal, 2013. "Design of Survivable Networks Using Three- and Four-Partition Facets," Operations Research, INFORMS, vol. 61(1), pages 199-213, February.
    2. Anantaram Balakrishnan & Thomas L. Magnanti & Joel S. Sokol & Yi Wang, 2002. "Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type," Operations Research, INFORMS, vol. 50(4), pages 617-635, August.
    3. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    4. Sridhar, Varadharajan & Park, June S., 2000. "Benders-and-cut algorithm for fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 622-632, September.
    5. Sara Mattia, 2013. "The robust network loading problem with dynamic routing," Computational Optimization and Applications, Springer, vol. 54(3), pages 619-643, April.
    6. Anantaram Balakrishnan & Gang Li & Prakash Mirchandani, 2017. "Optimal Network Design with End-to-End Service Requirements," Operations Research, INFORMS, vol. 65(3), pages 729-750, June.
    7. Ioannis Gamvros & Bruce Golden & S. Raghavan, 2006. "The Multilevel Capacitated Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 348-365, August.
    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. C S Sung & S H Song, 2003. "Integrated service network design for a cross-docking supply chain network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1283-1295, December.
    10. Juan Ma & Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Vladimir Boginski, 2016. "The Minimum Spanning k -Core Problem with Bounded CVaR Under Probabilistic Edge Failures," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 295-307, May.
    11. Liang Chen & Wei-Kun Chen & Mu-Ming Yang & Yu-Hong Dai, 2021. "An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron," Journal of Global Optimization, Springer, vol. 81(3), pages 659-689, November.
    12. Luís Gouveia & Pedro Patrício & Amaro Sousa, 2008. "Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM," Networks and Spatial Economics, Springer, vol. 8(1), pages 3-21, March.
    13. Oya Ekin Karaşan & A. Ridha Mahjoub & Onur Özkök & Hande Yaman, 2014. "Survivability in Hierarchical Telecommunications Networks Under Dual Homing," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 1-15, February.
    14. Frederick Kaefer & June S. Park, 1998. "Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 25-39, February.
    15. Garg, Manish & Smith, J. Cole, 2008. "Models and algorithms for the design of survivable multicommodity flow networks with general failure scenarios," Omega, Elsevier, vol. 36(6), pages 1057-1071, December.
    16. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    17. Nima Haghighi & S. Kiavash Fayyaz & Xiaoyue Cathy Liu & Tony H. Grubesic & Ran Wei, 2018. "A Multi-Scenario Probabilistic Simulation Approach for Critical Transportation Network Risk Assessment," Networks and Spatial Economics, Springer, vol. 18(1), pages 181-203, March.
    18. M Riis & A J V Skriver & S F Møller, 2005. "Internet protocol network design with uncertain demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1184-1195, October.
    19. Sylvie Borne & Eric Gourdin & Bernard Liau & A. Mahjoub, 2006. "Design of survivable IP-over-optical networks," Annals of Operations Research, Springer, vol. 146(1), pages 41-73, September.
    20. Anantaram Balakrishnan & Prakash Mirchandani & Harihara Prasad Natarajan, 2009. "Connectivity Upgrade Models for Survivable Network Design," Operations Research, INFORMS, vol. 57(1), pages 170-186, 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:eee:ejores:v:238:y:2014:i:3:p:836-845. 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.