Abstract
Network survivability is a critical issue in telecommunication networks due to the increasing dependence of the society on communication systems. Fast restoration from a network failure is an important challenge that deserves attention. This paper addresses an optimal link capacity and flow assignment design problem for survivable asynchronous transfer mode (ATM) networks based on two restoration strategies: a path restoration and a link restoration. Given the projected traffic demands and the network topology, the capacity and flow assignment are jointly optimized to yield the optimal capacity placement and flow allocation. The problem is formulated as a large-scale nonconvex nonlinear multi-commodity flow problem and is solved by a special augmented Lagrangian method (called separable augmented Lagrangian algorithm (SALA)). Several networks with diverse topological characteristics are used in the experiments to compare the two restoration strategies. Numerical results demonstrate that the link restoration strategy requires more capacity than the path restoration strategy when using both symmetric and asymmetric traffic. This strategy also increases the routing cost, the capacity installation cost, and the total network cost.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Y. **ong, L.G. Masson, Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Trans. Networking 7(1), 98–110 (1999)
Y. Liu, D. Tipper, P. Siripongwutikorn, Approximating optimal spare capacity allocation by successive survivable routing. IEEE/ACM Trans. Networking 13(1), 198–211 (2005)
K. Murakami, S. Hyong, Optimal capacity and flow assignment for self-healing ATM networks based on line and end-to-end restoration. IEEE/ACM Trans. Networking 6(2), 207–221 (1998)
R.P.M. Ferreira, H.P.L. Luna, Discrete capacity and flow assignment algorithms with performance guarantee. Comput. Commun. 26(10), 1056–1069 (2003)
P. Mahey, M.C. De Souza, Local optimality conditions for multicommodity flow problems with separable piecewise convex costs. Oper. Res. Lett. 35(2), 221–226 (2007)
I. Woungang, M. Guangyan, M.K. Denko, S. Misra, H.-C. Chao, M.S. Obaidat, Survivable ATM mesh networks: Techniques and performance evaluation. J. Syst. Softw. 83(3), 457–466 (2010)
D. Bertsekas, Nonlinear Programming (Athena Scientific, Belmont, 1995)
A. Hamdi, P. Mahey, J.-P. Dussault, A new decomposition method in non-convex programming, in Recent Advances in Optimization, Lecture Notes in Economics and Mathematical Systems, ed. by P. Gritzmann, R. Horst, E. Sachs, R. Tichatschke (Eds), vol. 452, (1997), pp. 90–104
F. Khandaker, Optimal capacity and flow assignment for self-healing ATM networks based on path restoration: A non-linear model, MSc Thesis, Department of Computer Science, Ryerson University, 29 Aug 2012
A.B.M. Bodrul, Optimal capacity and flow assignment in self-healing ATM networks based on link restoration: A non-linear model, MSc Thesis, Department. Of Computer Science, Ryerson University, 29 Aug 2012
S. Misra, S. Goswami, Network Routing: Fundamentals, Applications, and Emerging Technologies Wiley, UK (2017). ISBN-10: 04-70750065
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Gueye, O.M., Woungang, I., Dhurandher, S.K., Khandaker, F., Bodrul Alam, A.B.M. (2018). Path Restoration Versus Link Restoration in Survivable ATM Networks. In: Woungang, I., Dhurandher, S. (eds) International Conference on Wireless, Intelligent, and Distributed Environment for Communication. WIDECOM 2018. Lecture Notes on Data Engineering and Communications Technologies, vol 18. Springer, Cham. https://doi.org/10.1007/978-3-319-75626-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-75626-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-75625-7
Online ISBN: 978-3-319-75626-4
eBook Packages: EngineeringEngineering (R0)