Volume 13, Issue 1, January 2015, Pages 193–199
Sourabh Kamble1 and V.M. Aranke2
1 Dept. of Electronics and Telecommunication, Vishwakarma Institute of Information Technology, Pune, India
2 Dept. of Electronics and Telecommunication, Vishwakarma Institute of Information Technology, Pune, India
Original language: English
Copyright © 2015 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
In this paper a new path computing algorithm named as Disjoint Path Algorithm (DPA) to ensure the efficient load balancing in MPLS networks to minimize the congestion and prominent use of network resources to support the traffic engineering feature of MPLS (MPLS-TE). This algorithm finds the alternate path called as Disjoint Path (DP), for selected flow sharing no common path to other flow paths. Then routing of flow via Disjoint Path is done by using the explicit path routing technology of MPLS network. Network Simulator (NS2) is used as simulator tool for analysis of the performance of algorithm. Simulation results shows that DPA effectively balances the load between the links in the network to improve the real time traffic service quality by lowering end to end delay, packet arrival time and packet drop rate and increasing throughput while reducing the congestion and improving the network utilization.
Author Keywords: Disjoint Path Algorithm (DPA), Multiple Protocol Label Switching (MPLS), Traffic Engineering (TE), load balancing, Shortest Path First (SPF).
Sourabh Kamble1 and V.M. Aranke2
1 Dept. of Electronics and Telecommunication, Vishwakarma Institute of Information Technology, Pune, India
2 Dept. of Electronics and Telecommunication, Vishwakarma Institute of Information Technology, Pune, India
Original language: English
Copyright © 2015 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
In this paper a new path computing algorithm named as Disjoint Path Algorithm (DPA) to ensure the efficient load balancing in MPLS networks to minimize the congestion and prominent use of network resources to support the traffic engineering feature of MPLS (MPLS-TE). This algorithm finds the alternate path called as Disjoint Path (DP), for selected flow sharing no common path to other flow paths. Then routing of flow via Disjoint Path is done by using the explicit path routing technology of MPLS network. Network Simulator (NS2) is used as simulator tool for analysis of the performance of algorithm. Simulation results shows that DPA effectively balances the load between the links in the network to improve the real time traffic service quality by lowering end to end delay, packet arrival time and packet drop rate and increasing throughput while reducing the congestion and improving the network utilization.
Author Keywords: Disjoint Path Algorithm (DPA), Multiple Protocol Label Switching (MPLS), Traffic Engineering (TE), load balancing, Shortest Path First (SPF).
How to Cite this Article
Sourabh Kamble and V.M. Aranke, “Disjoint Path Algorithm for Load Balancing in MPLS network,” International Journal of Innovation and Scientific Research, vol. 13, no. 1, pp. 193–199, January 2015.
