IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v37y1989i4p531-541.html
   My bibliography  Save this article

Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints

Author

Listed:
  • Clyde L. Monma

    (Bell communications Research, Morristown, New Jersey)

  • David F. Shallcross

    (Cornell University, Ithaca, New York)

Abstract

In this paper, we consider the problem of designing a minimum cost communication network subject to certain two-connected survivability constraints. This problem was motivated by work at Bellcore on planning fiber optic communications networks. We introduce heuristics for constructing initial feasible networks, and local improvement heuristics for reducing the cost of existing network designs while preserving a feasible network. This approach is shown to be effective on data from both real-world fiber optic communications network problems and randomly generated problems.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:37:y:1989:i:4:p:531-541
    DOI: 10.1287/opre.37.4.531
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.37.4.531
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.37.4.531?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
    ---><---

    Citations

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


    Cited by:

    1. Amiri, Ali & Pirkul, Hasan, 1999. "Routing and capacity assignment in backbone communication networks under time varying traffic conditions," European Journal of Operational Research, Elsevier, vol. 117(1), pages 15-29, August.
    2. Hyun Kim, 2012. "P-hub protection models for survivable hub network design," Journal of Geographical Systems, Springer, vol. 14(4), pages 437-461, October.
    3. 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.
    4. Yogesh Agarwal, 2013. "Design of Survivable Networks Using Three- and Four-Partition Facets," Operations Research, INFORMS, vol. 61(1), pages 199-213, February.
    5. Yıldız, Barış & Karaşan, Oya Ekin, 2015. "Regenerator Location Problem and survivable extensions: A hub covering location perspective," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 32-55.
    6. 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.
    7. Bernard Fortz & Martine Labbé & Francesco Maffioli, 2000. "Solving the Two-Connected Network with Bounded Meshes Problem," Operations Research, INFORMS, vol. 48(6), pages 866-877, December.
    8. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    9. Young-Soo Myung & Hyun-joon Kim & Dong-wan Tcha, 1999. "Design of Communication Networks with Survivability Constraints," Management Science, INFORMS, vol. 45(2), pages 238-252, February.
    10. Juan Ma & Balabhaskar Balasundaram, 2019. "On the chance-constrained minimum spanning k-core problem," Journal of Global Optimization, Springer, vol. 74(4), pages 783-801, August.
    11. Konak, Abdullah & Bartolacci, Michael R., 2007. "Designing survivable resilient networks: A stochastic hybrid genetic algorithm approach," Omega, Elsevier, vol. 35(6), pages 645-658, December.
    12. 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.
    13. Abdullah Konak & Alice E. Smith, 2011. "Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 430-445, August.
    14. Hadjiat, Malika & Maurras, Jean-Francois & Vaxes, Yann, 2000. "A primal partitioning approach for single and non-simultaneous multicommodity flow problems," European Journal of Operational Research, Elsevier, vol. 123(2), pages 382-393, June.
    15. 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.
    16. Gunhak Lee & Ningchuan Xiao, 2009. "Examining the tradeoff between residential broadband service coverage and network connectivity using a bi‐objective facility location model," Papers in Regional Science, Wiley Blackwell, vol. 88(3), pages 547-562, August.

    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:inm:oropre:v:37:y:1989:i:4:p:531-541. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.