IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v45y1999i2p238-252.html
   My bibliography  Save this article

Design of Communication Networks with Survivability Constraints

Author

Listed:
  • Young-Soo Myung

    (Department of Business Administration, Dankook University, Cheonan, Chungnam 330-714, Korea)

  • Hyun-joon Kim

    (Department of Management Information Systems, University of Ulsan, Ulsan, Korea)

  • Dong-wan Tcha

    (Graduate School of Management, Korea Advanced Institute of Science and Technology, Seoul, Korea)

Abstract

The rapid growth of telecommunication capacity, driven in part by the wide-ranging deployment of fiber-optic technology has led to increasing concern regarding the survivability of such networks. In communication networks, survivability is usually defined as the percentage of total traffic surviving some network failures in the worst case. Most of the survivable network design models proposed to date indirectly ensure network survivability by invoking a connectivity constraint, which calls for a prespecified number of paths between every distinct pair of nodes in the network. In this paper, we introduce a new network design model which directly addresses survivability in terms of a survivability constraint which specifies the allowable level of lost traffic during a network failure under prescribed conditions. The new model enables a network designer to consider a richer set of alternative network topologies than the existing connectivity models, and encompasses the connectivity models as special cases. The paper presents a procedure to compute link survivability, develops an integer programming formulation of the proposed survivability model, and discusses a special case of practical interest and its associated heuristic procedure. The proposed heuristic is tested on data from real-world problems as well as randomly generated problems.

Suggested Citation

  • 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.
  • Handle: RePEc:inm:ormnsc:v:45:y:1999:i:2:p:238-252
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.45.2.238
    Download Restriction: no

    References listed on IDEAS

    as
    1. Yar, Mohammed & Chatfield, Chris, 1990. "Prediction intervals for the Holt-Winters forecasting procedure," International Journal of Forecasting, Elsevier, vol. 6(1), pages 127-137.
    2. Chatfield, Chris, 1993. "Calculating Interval Forecasts: Reply," Journal of Business & Economic Statistics, American Statistical Association, vol. 11(2), pages 143-144, April.
    3. S. A. Roberts, 1982. "A General Class of Holt-Winters Type Forecasting Models," Management Science, INFORMS, vol. 28(7), pages 808-820, July.
    4. Chatfield, Chris, 1993. "Calculating Interval Forecasts," Journal of Business & Economic Statistics, American Statistical Association, vol. 11(2), pages 121-135, April.
    5. Wilpen L. Gorr & Cheng Hsu, 1985. "An Adaptive Filtering Procedure for Estimating Regression Quantiles," Management Science, INFORMS, vol. 31(8), pages 1019-1029, August.
    6. Rosas, A. Lorena & Guerrero, Victor M., 1994. "Restricted forecasts using exponential smoothing techniques," International Journal of Forecasting, Elsevier, vol. 10(4), pages 515-527, December.
    7. Koenker, Roger & Bassett, Gilbert, Jr, 1982. "Robust Tests for Heteroscedasticity Based on Regression Quantiles," Econometrica, Econometric Society, vol. 50(1), pages 43-61, January.
    8. Chatfield, Chris & Yar, Mohammed, 1991. "Prediction intervals for multiplicative Holt-Winters," International Journal of Forecasting, Elsevier, vol. 7(1), pages 31-37, 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. Akgün, Ibrahim & Tansel, Barbaros Ç. & Kevin Wood, R., 2011. "The multi-terminal maximum-flow network-interdiction problem," European Journal of Operational Research, Elsevier, vol. 211(2), pages 241-251, June.
    2. Myung, Young-Soo & Kim, Hyun-joon, 2004. "A cutting plane algorithm for computing k-edge survivability of a network," European Journal of Operational Research, Elsevier, vol. 156(3), pages 579-589, 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:ormnsc:v:45:y:1999:i:2:p:238-252. 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: (Mirko Janc). General contact details of provider: http://edirc.repec.org/data/inforea.html .

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

    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.