Abstract
We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a large scale linear programming formulation and propose and test two effective heuristics.
Similar content being viewed by others
References
Ash, G.R., R.H. Cardwell, and R.P. Murray. (1981). “Design and Optimization of Networks with Dynamic Routing.” Bell System Tech. Journal 60(8), 1787–1820.
Cameron, W.H., T. Regnier, P. Galloy, and A.M. Savoie. (1983). “Dynamic Routing for Intercity Telephone Networks.” In 10th International Teletraffic Congress, Paper 3.2-3.
Gibbens, R.J. and P.B. Key. (1988). “Dynamic Alternative Routing-Modelling and Behaviour.” In 12th International Teletraffic Congress, Paper 3.4A-3.
Gibbens, R.J. and F.P. Kelly. (1990). “Dynamic Routing in Fully Connected Networks.” IMA Journal of Math. Control & Infor. 7, 77–111.
Medhi, D. (1991). “Network Dimensioning for a Multi-Service Integrated Digital Network with Dynamic Routing.” In Proceedings of ACM/IEEE-CS Symposium on Applied Computing (SAC'91), pp. 30–36.
Ouveysi, I. and Y.K. Tham. (1994). “Survivable Network Design for Volatile Traffic Scenarios.” In Proceedings of Australian Telecommunication Networks & Applications Conference, pp. 851–856.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ouveysi, I., Wirth, A., Yeh, A. et al. Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks. Annals of Operations Research 124, 285–293 (2003). https://doi.org/10.1023/B:ANOR.0000004774.11601.b6
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000004774.11601.b6