Design of Communication Networks with Survivability Constraints
AbstractThe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 45 (1999)
Issue (Month): 2 (February)
survivable network design; integer programming; heuristics;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- 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.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.