A Stochastic Random-Races Algorithm for Routing in MPLS Traffic Engineering

This paper presents an efficient adaptive online routing algorithm for the computation of bandwidth-guaranteed paths in Multiprotocol Label Switching (MPLS) based networks, using a learning scheme that computes an optimal ordering of routes. This work has two-fold contributions. The first is that we propose a new class of solutions other than those available in the literature incorporating the family of stochastic Random-Races (RR) algorithms. The most popular previouslyproposed MPLS Traffic Engineering (TE) solutions attempt to find a superior path to route an incoming path setup request. Our algorithm, on the other hand, tries to learn an optimal ordering of the paths through which requests can be routed according to the “rank” of the paths in the order learnt by the algorithm. The second contribution of our work is that we have proposed a routing algorithm that has better performance than the important algorithms in the literature. The efficiency of our algorithm was experimentally established.

[1]  Athanasios V. Vasilakos,et al.  Ergodic discretized estimator learning automata with high accuracy and high adaptation rate for nonstationary environments , 1992, Neurocomputing.

[2]  Serene Wing Hang Wong,et al.  The online and offline properties of routing algorithms in MPLS , 2002 .

[3]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[4]  Sudip Misra,et al.  Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach , 2007, IEEE Transactions on Computers.

[5]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[6]  Daniel Bauer,et al.  A New Class of Online Minimum-Interference Routing Algorithms , 2002, NETWORKING.

[7]  Raouf Boutaba,et al.  DORA: Efficient Routing for MPLS Traffic Engineering , 2002, Journal of Network and Systems Management.

[8]  Bin Wang,et al.  A new bandwidth guaranteed routing algorithm for MPLS traffic engineering , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[9]  Witold Pedrycz,et al.  Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques , 2003, IEEE Trans. Syst. Man Cybern. Part C.

[10]  B. John Oommen,et al.  Adaptive learning mechanisms for ordering actions using random races , 1993, IEEE Trans. Syst. Man Cybern..

[11]  Athanasios V. Vasilakos,et al.  A new approach to the design of reinforcement schemes for learning automata: Stochastic estimator learning algorithm , 1995, Neurocomputing.

[12]  S. Lakshmivarahan,et al.  Learning Algorithms Theory and Applications , 1981 .

[13]  Eric Osborne,et al.  Traffic Engineering with MPLS , 2002 .

[14]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[15]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[16]  B. John Oommen,et al.  Discretized pursuit learning automata , 1990, IEEE Trans. Syst. Man Cybern..

[17]  P. S. Sastry,et al.  Estimator Algorithms for Learning Automata , 1986 .

[18]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[19]  Subhash Suri,et al.  Profile-based routing and traffic engineering , 2003, Comput. Commun..

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[21]  B. J. Oommen,et al.  A comparison of continuous and discretized pursuit learning schemes , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[22]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[23]  Athanasios V. Vasilakos,et al.  Ergodic discretized estimator learning automata with high accuracy and high adaptation rate for nonstationary environments , 1990, [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence.

[24]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[25]  Mohammad S. Obaidat,et al.  Guest editorial learning automata: theory, paradigms, and applications , 2002, IEEE Trans. Syst. Man Cybern. Part B.