Path: Top -> Journal -> Telkomnika -> 2017 -> Vol 15, No 4: December

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

Journal from gdlhub / 2018-01-15 10:17:17
Oleh : Mohammad Abdelhadi Alhihi, Mohammad Reza Khosravi, Hani Attar, Mohammad Samour, Telkomnika
Dibuat : 2018-01-15, dengan 1 file

Keyword : Communication Networks, Multi-Protocol Label Switching (MPLS), Traffic Engineering (TE), Routing Protocols, Next Generation Networks (NGNs).
Url : http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/6597
Sumber pengambilan dokumen : WEB

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.

Beri Komentar ?#(0) | Bookmark

PropertiNilai Properti
ID Publishergdlhub
OrganisasiTelkomnika
Nama KontakHerti Yani, S.Kom
AlamatJln. Jenderal Sudirman
KotaJambi
DaerahJambi
NegaraIndonesia
Telepon0741-35095
Fax0741-35093
E-mail Administratorelibrarystikom@gmail.com
E-mail CKOelibrarystikom@gmail.com

Print ...

Kontributor...

  • , Editor: sukadi

Download...