Abstract
The paper considers a problem of routing, protection and load balancing in the IP/MPLS network. A network design problem combining all these aspects is presented. Proportionally fair distribution of residual bandwidths on links is used for load balancing, and protection is achieved with failure–dependent backup paths. The efficiency of the proposed approach is tested by combining optimization and simulation tools. Numerical experiments show that using the proposed load balancing and protection mechanisms decreases the number of disrupted LSPs in case of failures, as compared to other recovery options considered.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gruber, C.G., Koster, A.M., Orlowski, S., Wessäly, R., Zymolka, A.: A new model and computational study for demand-wise shared protection. Technical Report ZIB-Report 05-55, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin-Dahlem, Germany (2005)
Jain, V., Alagar, S., Baig, S.I., Venkatesan, S.: Optimal quasi-path restoration in telecom backbone networks. In: 13th International Conference on System Engineering, Las Vegas, USA, CS–175–CS–180 (1999)
Patel, M., Chandrasekaran, R., Venkatesan, S.: Improved quasi-path restoration scheme and spare capacity assignment in mesh networks. Technical Report UTDCS-14-03, University of Texas at Dallas, Richardson, TX, USA (2003)
Mohan, G., Murthy, C.S.R., Somani, A.K.: Efficient algorithms for routing dependable connections in WDM optical networks. IEEE/ACM Transactions on Networking 9(5), 553–566 (2001)
Fredric, M.T., Somani, A.K.: A single-fault recovery strategy for optical networks using subgraph routing. In: 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM-2003), Budapest, Hungary (2003)
Ramasubramanian, S.: On failure dependent protection in optical grooming networks. In: International Conference on Dependable Systems and Networks (DSN’04), Florence, Italy, pp. 440–449 (2004)
Kubilinskas, E., Aslam, F., Dzida, M., Pióro, M.: Network protection by single and failure-dependent backup paths–modeling and efficiency comparison. In: 4th Polish-German Teletraffic Symposium (PGTS 2006), Wroclaw, Poland (2006)
Patel, M., Chandrasekaran, R., Venkatesan, S.: A comparative study of restoration schemes and spare capacity assignment in mesh networks. In: The 12th International Conference on Computer Communications and Networks (ICCCN 2003), pp. 399–404. Dallas, TX, USA (2003)
Pióro, M., Medhi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, San Francisco (2004)
Kodialam, M.S., Lakshman, T.V.: Minimum interference routing with applications to MPLS traffic engineering. In: Proc. of INFOCOM 2, pp. 884–893 (2000)
Pióro, M., Dzida, M., Kubilinskas, E., Nilsson, P., Ogryczak, W., Tomaszewski, A., Zagożdżon, M.: Applications of the max-min fairness principle in telecommunication network design. In: First Conference on Next Generation Internet Networks Traffic Engineering (NGI 2005), Rome, Italy (2005)
Kelly, F., Mauloo, A., Tan, D.: Rate control for communication networks: Shadow prices, proportional fairness and stability. Journal of the Operations Research Society 49, 2006–2017 (1997)
Kubilinskas, E., Pióro, M., Nilsson, P.: Design models for multi-layer next generation Internet core networks carrying elastic traffic. In: Proc. 4th International Workshop on the Design of Reliable Communication Networks (DRCN 2003), Banff, Canada (2003)
Advanced CSPF Simulator, http://suraj.lums.edu.pk/~te/code.htm
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kubilinskas, E., Aslam, F., Dzida, M., Pióro, M. (2007). Recovery, Routing and Load Balancing Strategy for an IP/MPLS Network. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)