Probabilistic Selection of QoS Paths for Improving Survivability in MPLS Networks


Many applications do not fit well with the traditional best effort packet delivery policy of the Internet. These include applications such as Internet telephony and video conferencing which require voice and bulky graphical images transfer. Therefore, the policies of assigning traffic to various service classes and providing service as per the service level agreement of the user with the network provider came into existence. Multi-protocol Label Switching is the backbone of fast switching technology that helps the network service providers to implement these policies. It provides Quality of service oriented reserved paths from the source to the destination for the user’s traffic. Selection of these paths is a cumbersome task, especially when the traffic forecast is totally unknown. Furthermore, nodes and link failures in the Internet worsen the situation. This paper addresses the issue of selecting Label Switched Paths (LSPs) for various traffic demands in the network so that the resultant network has the characteristics like high failure resistance, low LSP demand blocking probability, low impact from the node or link failure, load balancing and low over-all resource utilization. By extensive simulations, the proposed cost function has been compared with the various cost functions mentioned in the literature and it was found to score over them in major aspects.

Share and Cite:

R. Singh, N. Chaudhari and K. Saxena, "Probabilistic Selection of QoS Paths for Improving Survivability in MPLS Networks," Communications and Network, Vol. 5 No. 4, 2013, pp. 328-336. doi: 10.4236/cn.2013.54041.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] E. Rosen, A. Viswanathan and R. Callon, “Multiprotocol Label Switching Architecture,” IETF RFC 3031, January 2001.
[2] D. Awduche, J. Malcolm, J. Agogbua, M. O’Dell and J. McManuz, “Requirement of Traffic Engineering over MPLS,” IETF RFC 2702, September 1999.
[3] M. Amin, K. H. Ho, G. Pavlou and M. Howarth, “Improving Survivability through Traffic Engineering in MPLS Networks,” Proceeding of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), Murcia, Cartagena, 27-30 June 2005, pp. 758-763.
[4] A. Bosco, R. Mameli, E. Manconi and F. Ubaldi, “Edge Distributed Admission Control in MPLS Networks,” IEEE Communications Letters, Vol. 7, No. 2, 2003, pp. 88-90.
[5] S. Lahoud, G. Texier and L. Toutain, “Classification and Evaluation of Constraint-Based Routing Algorithms for MPLS Traffic Engineering,” French Sixth Meetings on Algorithmic Aspects of Telecommunications (AlgoTel 2004), Batz-sur-Mer, France, 2004.
[6] J. Moy, “OSPF: Anatomy of an Internet Routing Protocol,” Addison-Wesley, New York, 1998.
[7] K. Kar, M. Kodialam and T. V. Lakshman, “Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications,” IEEE Journal on Selected Areas in Communications, Vol. 18, No. 12, 2000, pp. 2566-2579.
[8] R. K. Ahuja, T. L. Magnanti and J. B. Orlin, “Network Flows: Theory, Algorithms, and Applications,” PrenticeHall, Englewood Cliffs, 1993.
[9] M. Naraghi-Pour and V. Desai, “Loop-Free Traffic Engineering with Pathprotection in MPLS VPNs,” Computer Networks, Vol. 52, No. 12, 2008, pp. 2360-2372.
[10] J.-W. Lin and H.-Y. Liu, “Redirection Based Recovery for MPLS Network Systems,” The Journal of Systems and Software, Vol. 83, No. 4, 2010, pp. 609-620.
[11] R. K. Singh and N. S. Chaudhari, “Integrated Load Balancing Approach for Fault Tolerance in MPLS Networks,” International Conference on Communication Systems and Network Technologies (CSNT), Gwalior, 6-8 April 2013, pp. 295-298,
[12] M. Chowdhury, M. R. Rahman and R. Baoutaba, “ViNEYard: “Virtual Network Embedding Algorithms with Coordinated Node and Link Mapping,” IEEE/ACM Transactions on Networking, Vol. 20, No. 1, 2012, pp. 206-219.
[13] M. R. Rahman and R. Baoutaba, “SVNE: Survivable virtual Network Enbedding Algorithms for Network Virtulization,” IEEE/ACM Transactionson Network and Service Management, Vol. 10, No. 2, 2013, pp. 105-118.
[14] E. W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numerische Mathematik, Vol. 1, No. 1, 1959, pp. 269-271.
[15] A. Medina, A. Lakhina, I. Matta and J. Byers, “BRITE: An Approach to Universal Topology Generation,” Proceedings of the 9th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’01), Cincinnati, 15-18 August 2001, p. 346.
[16] “A Modeling Language for Mathematical Programming,” 2013.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.