Adaptive routing algorithm for ATM networks using a Learning Automaton

Atlasis Antonios, F; Saltouros Marios, P; Stassinopoulos Georgios, I; Vasilakos Athanasios, V

dc.contributor.author	Atlasis Antonios, F	en
dc.contributor.author	Saltouros Marios, P	en
dc.contributor.author	Stassinopoulos Georgios, I	en
dc.contributor.author	Vasilakos Athanasios, V	en
dc.date.accessioned	2014-03-01T01:13:34Z
dc.date.available	2014-03-01T01:13:34Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12565
dc.subject	Adaptive Routing	en
dc.subject	Atm Networks	en
dc.subject	Dynamic Environment	en
dc.subject	Learning Algorithm	en
dc.subject	Network Topology	en
dc.subject	Real Time Application	en
dc.subject	Routing Algorithm	en
dc.subject.other	Adaptive algorithms	en
dc.subject.other	Computer simulation	en
dc.subject.other	Learning algorithms	en
dc.subject.other	Random processes	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Stochastic estimator learning algorithm (SELA)	en
dc.subject.other	Asynchronous transfer mode	en
dc.title	Adaptive routing algorithm for ATM networks using a Learning Automaton	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/GLOCOM.1998.776470	en
heal.identifier.secondary	http://dx.doi.org/10.1109/GLOCOM.1998.776470	en
heal.publicationDate	1998	en
heal.abstract	In the dynamic environment of the ATM networks, where the traffic load and the network topology change significantly over the time, the use of an adaptive routing algorithm is mandatory. In this paper, a dynamic solution to the routing problem in ATM networks is presented suitable for real-time application. The proposed methodology employs a Learning Automaton, called Stochastic Estimator Learning Algorithm (SELA), specially designed for the routing problem. The feedback of the SELA is a function of the utilizations of the links that comprise a possible route to a specific routing problem. Simulation results show the effectiveness of the proposed scheme in comparison with some of the most known routing algorithms. Some interesting directions for future works are also discussed.	en
heal.publisher	IEEE, Piscataway, NJ, United States	en
heal.journalName	Conference Record / IEEE Global Telecommunications Conference	en
dc.identifier.doi	10.1109/GLOCOM.1998.776470	en
dc.identifier.volume	5	en
dc.identifier.spage	2669	en
dc.identifier.epage	2674	en