On the use of a stochastic estimator learning algorithm to the ATM routing problem: A methodology

Atlasis, AF; Saltouros, MP; Vasilakos, AV

dc.contributor.author	Atlasis, AF	en
dc.contributor.author	Saltouros, MP	en
dc.contributor.author	Vasilakos, AV	en
dc.date.accessioned	2014-03-01T01:13:58Z
dc.date.available	2014-03-01T01:13:58Z
dc.date.issued	1998	en
dc.identifier.issn	0140-3664	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12819
dc.subject	ATM	en
dc.subject	Learning automata	en
dc.subject	Routing problem	en
dc.subject	Virtual path	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Automata theory	en
dc.subject.other	Computer simulation	en
dc.subject.other	Congestion control (communication)	en
dc.subject.other	Learning algorithms	en
dc.subject.other	Probability	en
dc.subject.other	Random processes	en
dc.subject.other	Real time systems	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Cell loss probability	en
dc.subject.other	Routing algorithms	en
dc.subject.other	Stochastic estimator learning algorithm (SELA)	en
dc.subject.other	Asynchronous transfer mode	en
dc.title	On the use of a stochastic estimator learning algorithm to the ATM routing problem: A methodology	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0140-3664(98)00122-4	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0140-3664(98)00122-4	en
heal.language	English	en
heal.publicationDate	1998	en
heal.abstract	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 tate. 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. (C) 1998 Elsevier Science B.V.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Communications	en
dc.identifier.doi	10.1016/S0140-3664(98)00122-4	en
dc.identifier.isi	ISI:000074594100004	en
dc.identifier.volume	21	en
dc.identifier.issue	6	en
dc.identifier.spage	538	en
dc.identifier.epage	546	en