Routing in MPLS networks with probabilistic failures

Author

Crichigno, J. ; Khoury, Joud ; Ghani, N.

Author_Institution

Eng. Dept., Northern New Mexico Coll., Espanola, NM, USA

fYear

2013

fDate

9-13 June 2013

Firstpage

2534

Lastpage

2539

Abstract

We present a routing scheme for MPLS networks with probabilistic failures. Our routing scheme simultaneously maximizes the expected satisfied demand and minimizes the maximum link utilization of the network. Our approach is novel in that it is the first to jointly address the traffic engineering and the routing through reliable paths problems. In addition to the optimal routing algorithm, we present a lower complexity heuristic algorithm based on Linear Programming and Yen´s algorithm. Finally, numerical results are presented to demonstrate the effectiveness of both our optimal and heuristic algorithms.

Keywords

linear programming; probability; protocols; telecommunication network routing; telecommunication traffic; MPLS network routing; Yen algorithm; heuristic algorithm; heuristic algorithms; linear programming; multi-protocol label switching; optimal algorithms; optimal routing algorithm; probabilistic failures; reliable paths problems; routing scheme; traffic engineering; Bandwidth; Electrostatic discharges; Linear programming; Multiprotocol label switching; Probabilistic logic; Reliability; Routing; Linear Programming; Multi-Protocol Label Switching; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications (ICC), 2013 IEEE International Conference on

Conference_Location

Budapest

ISSN

1550-3607

Type

conf

DOI

10.1109/ICC.2013.6654915

Filename

6654915