Data networks
Nonstationary models of learning automata routing in data communication networks
IEEE Transactions on Systems, Man and Cybernetics
Analysis of shortest-path routing algorithms in a dynamic network environment
ACM SIGCOMM Computer Communication Review
Some routing problems on broadband ISDN
Computer Networks and ISDN Systems - Special issue: Broadband ISDN: standards, switches, and traffic management
Optimizing the system of virtual paths
IEEE/ACM Transactions on Networking (TON)
On the use of a stochastic estimator learning algorithm to the ATM routing problems: a methodology
ICCC '95 Proceedings of the 12th international conference on computer communication on Information highways : for a smaller world and better living: for a smaller world and better living
The use of learning algorithms in ATM networks call admission control problem: a methodology
ICCC '95 Proceedings of the 12th international conference on computer communication on Information highways : for a smaller world and better living: for a smaller world and better living
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The use of learning algorithms in telephone traffic routing-A methodology
Automatica (Journal of IFAC)
Research: Congestion control based dynamic routing in ATM networks
Computer Communications
Priority assignment control of ATM line buffers with multiple QOS classes
IEEE Journal on Selected Areas in Communications
Application of computational intelligence techniques in active networks
Proceedings of the 2001 ACM symposium on Applied computing
Hi-index | 0.24 |
This paper presents a dynamic solution to the Routing problem in (ATM) networks suitable for real-time applications. The proposed methodology employs a Stochastic Estimator Learning Algorithm (SELA) specially designed for the Routing problem. The feedback of the SELA Routing algorithm is computed from the utilisation of the links that comprise a route which is a possible solution to a specific Routing problem. The algorithm promotes the load balancing in light loading conditions, whereas as the load of the network increases it tends to behave as a shortest path algorithm trying to minimise the cell loss probability and the call dropping rate. Simulation results show the effectiveness of the proposed scheme in comparison with some of the most known Routing algorithms of the literature. Some interesting directions for future work are also discussed.