Adaptive Algorithms for Routing and Traffic Engineering in Stochastic Networks

In this paper we report some of the research endeavors we are embarking on as part of the Doctoral research of the first author. We have already completed an investigation of some of the existing algorithms in the areas of Network Routing and Traffic Engineering, and we propose superior algorithms that would adapt to the changes in the environment in which they operate. In this attempt, we intend to use the theory of Learning Automata (LA) (Narendra and Thathachar, 1989; Obaidat et al. 2002) to address the problems we are investigating.

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

[2]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

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

[4]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.

[5]  B. John Oommen,et al.  Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem , 2004, IEA/AIE.

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

[7]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2003, STOC '03.

[8]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[9]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[11]  Daniele Frigioni,et al.  A fully dynamic algorithm for distributed shortest paths , 2003, Theor. Comput. Sci..

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