Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques

Vasilakos, A; Saltouros, MP; Atlassis, AF; Pedrycz, W

dc.contributor.author	Vasilakos, A	en
dc.contributor.author	Saltouros, MP	en
dc.contributor.author	Atlassis, AF	en
dc.contributor.author	Pedrycz, W	en
dc.date.accessioned	2014-03-01T01:19:24Z
dc.date.available	2014-03-01T01:19:24Z
dc.date.issued	2003	en
dc.identifier.issn	1094-6977	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15467
dc.subject	ATM QoS routing	en
dc.subject	Computational intelligence	en
dc.subject	Reinforcement learning algorithm	en
dc.subject.classification	Computer Science, Artificial Intelligence	en
dc.subject.classification	Computer Science, Cybernetics	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.other	Asynchronous transfer mode	en
dc.subject.other	Computer simulation	en
dc.subject.other	Learning algorithms	en
dc.subject.other	Mathematical models	en
dc.subject.other	Network protocols	en
dc.subject.other	Optimization	en
dc.subject.other	Probability	en
dc.subject.other	Quality of service	en
dc.subject.other	Resource allocation	en
dc.subject.other	Switching systems	en
dc.subject.other	Theorem proving	en
dc.subject.other	Private network-to-network interface	en
dc.subject.other	Quality of service routing problem	en
dc.subject.other	Reinforcement learning algorithm	en
dc.subject.other	Artificial intelligence	en
dc.title	Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TSMCC.2003.817354	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TSMCC.2003.817354	en
heal.language	English	en
heal.publicationDate	2003	en
heal.abstract	In this paper, the use of a computational intelligence approach - a Reinforcement Learning Algorithm (RLA) - for optimizing the routing in asynchronous transfer mode (ATM) networks based on the private network-to-network interface (PNNI) standard is proposed. This algorithm which is specially designed for the quality of service (QoS) routing problem, aims at maximizing the network revenue (allocating efficiently the network resources) while ensuring the QoS requirements for each connection. In this study, large-scale networks are considered where it becomes necessary to be organized hierarchically so that a scale in terms of computation, communication and storage requirements will be achieved. A comparative performance study of the proposed and other commonly used routing schemes is demonstrated by means of simulation on existing commercial networks. Simulation results over a wide range of uniform, time-varying and skewed loading conditions show the effectiveness of the proposed routing algorithm, and disclose the strength and weakness of the various schemes.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews	en
dc.identifier.doi	10.1109/TSMCC.2003.817354	en
dc.identifier.isi	ISI:000186083600002	en
dc.identifier.volume	33	en
dc.identifier.issue	3	en
dc.identifier.spage	297	en
dc.identifier.epage	312	en