A Learning Model for Routing in Telephone Networks
Authors:
- P. R. SrikantakumarPSP. R. Srikantakumar
- K. S. NarendraKNK. S. Narendra
- 1 January 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 20 (1) , 34-57
Abstract
The aim of this paper is to develop a theory of adaptive routing in telephone networks using learning methods. A mathematical model of the network with slow-learning algorithms distributed at various nodes is presented. The algorithms update the routing probabilities on the basis of network feedback information (like call blocking or completion) only. Convergence of the routing strategies is established. Two linear updating algorithms, under certain conditions, are shown to have desirable equilibrium behavior like load equalization and minimum blocking probability for the entire network.Keywords
This publication has 7 references indexed in Scilit:
- Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete InformationMathematics of Operations Research, 1981
- On the Behavior of a Learning Automaton in a Changing Environment with Application to Telephone Traffic RoutingIEEE Transactions on Systems, Man, and Cybernetics, 1980
- A Class of Decentralized Routing Algorithms Using RelaxationIEEE Transactions on Communications, 1977
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- Application of Learning Automata to Telephone Traffic Routing and ControlIEEE Transactions on Systems, Man, and Cybernetics, 1977
- Learning Automata - A SurveyIEEE Transactions on Systems, Man, and Cybernetics, 1974
- Programming and Control Problems Arising from Optimal Routing in Telephone NetworksSIAM Journal on Control, 1966