TELKOMNIKA (Telecommunication Computing Electronics and Control)
Vol 15, No 4: December 2017

Determining the Optimum Number of Paths for Realization of Multi-path Routing in MPLS-TE Networks

Mohammad Alhihi (Philadelphia University, Jordan)
Mohammad Reza Khosravi (Shiraz University of Technology, Iran)
Hani Attar (Philadelphia University, Jordan)
Mohammad Samour (Philadelphia University, Jordan)



Article Info

Publish Date
01 Dec 2017

Abstract

Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) technology is an intelligent and advanced tool for handling traffic through the core networks and implementing new services based on virtual transport. Since MPLS-TE combines channel and network layer mechanisms, network administrators can optimally integrate and allocate the traffic loads while maintaining the speed of technologies such as Asynchronous Transfer Mode (ATM) technology. In this paper, the problem of the developed algorithm of multi-path routing which allows us to determine the optimum number of independent shortest paths is theoretically solved. In details, the article proposes a way for finding the set of shortest paths using Dijkstra's algorithm, and then determination of the maximum flow for each of the shortest paths based on the mathematical concepts and finally, introducing the solution of the multi-criteria optimization problem for a set of shortest paths. According to our approach, optimizing the use of resources in the core networks is possible with using the MPLS-TE technology.

Copyrights © 2017






Journal Info

Abbrev

TELKOMNIKA

Publisher

Subject

Computer Science & IT

Description

Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of ...