Linear-based trunk reservation routing algorithm for ATM networks

Atlasis, AF; Baltatzis, ED; Stassinopoulos, GI; Venieris, IS

dc.contributor.author	Atlasis, AF	en
dc.contributor.author	Baltatzis, ED	en
dc.contributor.author	Stassinopoulos, GI	en
dc.contributor.author	Venieris, IS	en
dc.date.accessioned	2014-03-01T01:14:18Z
dc.date.available	2014-03-01T01:14:18Z
dc.date.issued	1999	en
dc.identifier.issn	1074-5351	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12990
dc.subject	ATM	en
dc.subject	routing	en
dc.subject	call admission control	en
dc.subject	quality of service	en
dc.subject	virtual path	en
dc.subject	virtual channel connection	en
dc.subject	trunk reservation	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Algorithms	en
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Congestion control (communication)	en
dc.subject.other	Routers	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Quality of service (QoS)	en
dc.subject.other	Trunk reservation routing algorithms	en
dc.subject.other	Virtual path	en
dc.subject.other	Asynchronous transfer mode	en
dc.title	Linear-based trunk reservation routing algorithm for ATM networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E	en
heal.identifier.secondary	http://dx.doi.org/10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	In this paper a practical routing algorithm is proposed that increases the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost function which achieves a successful trade-off between the use of the minimum-hop routes and the application of the load-balancing concept. Moreover, it employs the known Trunk Reservation notion according to a probability that increases linearly with the traffic load. This results in an effective compromise of the performance of the algorithm between light and heavy traffic loads. Finally, its simplicity and its suitability for a real-time application render it as an efficient routing algorithm for ATM networks. Copyright (C) 1999 John Wiley & Sons, Ltd.	en
heal.publisher	John Wiley & Sons Ltd, Chichester, United Kingdom	en
heal.journalName	International Journal of Communication Systems	en
dc.identifier.doi	10.1002/(SICI)1099-1131(199903/04)12:2<125::AID-DAC390>3.0.CO;2-E	en
dc.identifier.isi	ISI:000080017900003	en
dc.identifier.volume	12	en
dc.identifier.issue	2	en
dc.identifier.spage	125	en
dc.identifier.epage	141	en