Premium
Learning automata routeing in connection‐oriented networks
Author(s) -
Economides Anastasios A.
Publication year - 1995
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4500080402
Subject(s) - computer science , network packet , learning automata , computer network , automaton , queue , virtual network , link (geometry) , connection (principal bundle) , state information , shortest path problem , state (computer science) , distributed computing , theoretical computer science , algorithm , graph , structural engineering , engineering
Learning automata are used at the source nodes of a connection‐oriented network to dynamically route newly arriving virtual calls to their destination. First, two new learning automata are introduced. Then, these two learning automata, as well as the well‐known L Learning automaton and the deterministic shortest‐path algorithms are used in a simulation program to route virtual calls. The more frequent the updating and the more recent network state information used, the better the performance. In the sequence, the virtual link length is developed as a function of both the number of packets and the number of virtual calls at the network link. This virtual link length is used in the learning automata routeing algorithm and is shown via simulation to be superior to the minimum packet delay or shortest‐queue‐type link length, usually used in real networks. Thus, in connection‐oriented networks, not only the packet but also the virtual call traffic characteristics should be used in the routeing decisions. Furthermore, when the network state information is out‐of‐date, or when there are few virtual calls and each one carries a large number of packets, then the virtual link length should be based more on the number of virtual calls than on the number of packets at this link. On the other hand, when the network state information is current and there are many virtual calls and each one carries a small number of packets, then the virtual link length should be based more on the number of packets than on the number of virtual calls at this link.