Adaptive algorithms for routing and traffic engineering in stochastic networks

Authors:
Sudip Misra;B. John Oommen
Affiliations:
School of Computer Science, Carleton University, Ottawa, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 9
Cited 0

Learning automata: an introduction

Learning automata: an introduction
On the computational complexity of dynamic graph problems

Theoretical Computer Science
Fully dynamic algorithms for maintaining shortest paths trees

Journal of Algorithms
A fully dynamic algorithm for distributed shortest paths

Theoretical Computer Science - Latin American theoretical informatics
A new approach to dynamic all pairs shortest paths

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Stochastic learning automata-based dynamic algorithms for the single source shortest path problem

IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Guest editorial learning automata: theory, paradigms, and applications

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Profile-based routing and traffic engineering

Computer Communications
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.