Dijkstra´s Algorithm Model over MPLS / GMPLS

Author

Parra, Octavio J Salcedo ; Manta, Cristyan ; Rubio, Gustavo López

Author_Institution

Fac. de Ing., Univ. Distrital Francisco Jose de Caldas, Bogota, Colombia

fYear

2011

Firstpage

1

Lastpage

4

Abstract

The increased use of virtual connections in packet switched networks, in particular over the Internet, using MPLS and GMPLS evolution has produced a significant amount of studies on traffic engineering protocols, especially with regard to the different ways to provide quality of service over connections. This article presents a model to characterize the reliability of these types of networks, in computing restricted route domain. With these elements, an application is proposed, to establish virtual connections with likely default reliability on MPLS/GMPLS networks.

Keywords

Internet; multiprotocol label switching; quality of service; telecommunication network reliability; telecommunication network routing; Dijkstra algorithm model; Internet; MPLS-GMPLS network; packet switched networks; quality of service; reliability; restricted route domain; traffic engineering protocols; virtual connections; Computer architecture; Computer network reliability; Delay; Minimization; Multiprotocol label switching; Reliability; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on

Conference_Location

Wuhan

ISSN

2161-9646

Print_ISBN

978-1-4244-6250-6

Type

conf

DOI

10.1109/wicom.2011.6040536

Filename

6040536