IDEAS home Printed from https://ideas.repec.org/a/kap/jgeosy/v14y2012i4p437-461.html
   My bibliography  Save this article

P-hub protection models for survivable hub network design

Author

Listed:
  • Hyun Kim

    ()

Abstract

The design of survivable networks has been a significant issue in network-based infrastructure in transportation, electric power systems, and telecommunications. In telecommunications networks, hubs and backbones are the most critical assets to be protected from any network failure because many network flows use these facilities, resulting in an intensive concentration of flows at these facilities. This paper addresses a series of new hub and spoke network models as survivable network designs, which are termed p-hub protection models (PHPRO). The PHPRO aim to build networks that maximize the total potential interacting traffic over a set of origin–destination nodes based on different routing assumptions, including multiple assignments and back-up hub routes with distance restrictions. Empirical analyses are presented using telecommunication networks in the United States, and the vulnerabilities of networks based on possible disruption scenarios are examined. The results reveal that PROBA, the model with a back-up routing scheme, considerably enhances the network resilience and even the network performance, indicating that the model is a candidate for a strong survivable hub network design. An extension, PROBA-D, also shows that applying a distance restriction can be strategically used for designing back-up hub routes if a network can trade off between network performance and network cost, which results from the reduced length of back-up routings. Copyright Springer-Verlag 2012

Suggested Citation

  • Hyun Kim, 2012. "P-hub protection models for survivable hub network design," Journal of Geographical Systems, Springer, vol. 14(4), pages 437-461, October.
  • Handle: RePEc:kap:jgeosy:v:14:y:2012:i:4:p:437-461
    DOI: 10.1007/s10109-011-0157-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10109-011-0157-5
    Download Restriction: Access to full text is restricted to subscribers.

    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. Alan Murray & Timothy Matisziw & Tony Grubesic, 2007. "Critical network infrastructure analysis: interdiction and system flow," Journal of Geographical Systems, Springer, vol. 9(2), pages 103-117, June.
    2. Morton E O’Kelly & Hyun Kim & Changjoo Kim, 2006. "Internet reliability with realistic peering," Environment and Planning B: Planning and Design, Pion Ltd, London, vol. 33(3), pages 325-343, May.
    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. Lei, Ting L. & Church, Richard L., 2015. "On the unified dispersion problem: Efficient formulations and exact algorithms," European Journal of Operational Research, Elsevier, vol. 241(3), pages 622-630.
    2. Morton O’Kelly, 2015. "Network Hub Structure and Resilience," Networks and Spatial Economics, Springer, vol. 15(2), pages 235-251, June.
    3. repec:kap:netspa:v:17:y:2017:i:3:d:10.1007_s11067-017-9357-y is not listed on IDEAS
    4. repec:eee:ejores:v:267:y:2018:i:1:p:23-39 is not listed on IDEAS
    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.

    More about this item

    Keywords

    Hub location; Hub network design; Survivability; C60; C61;

    JEL classification:

    • C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    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:kap:jgeosy:v:14:y:2012:i:4:p:437-461. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.