Linear-based trunk reservation routing algorithm for ATM networks

Atlasis Antonios, F; Baltatzis Evangelos, D; Stassinopoulos Georgios, I; Venieris, Iakovos

dc.contributor.author	Atlasis Antonios, F	en
dc.contributor.author	Baltatzis Evangelos, D	en
dc.contributor.author	Stassinopoulos Georgios, I	en
dc.contributor.author	Venieris, Iakovos	en
dc.date.accessioned	2014-03-01T02:41:30Z
dc.date.available	2014-03-01T02:41:30Z
dc.date.issued	1998	en
dc.identifier.issn	07421303	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30502
dc.subject	Atm Networks	en
dc.subject	Call Admission Control	en
dc.subject	Load Balance	en
dc.subject	Network Traffic	en
dc.subject	Quality of Service	en
dc.subject	Real Time Application	en
dc.subject	Routing Algorithm	en
dc.subject	Virtual Channel	en
dc.subject	Virtual Path	en
dc.subject.other	Algorithms	en
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Congestion control (communication)	en
dc.subject.other	Frequency hopping	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Routers	en
dc.subject.other	Telecommunication services	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Virtual reality	en
dc.subject.other	Linear-based trunk reservation routing algorithms	en
dc.subject.other	Quality of service (QoS)	en
dc.subject.other	Virtual channel connections	en
dc.subject.other	Asynchronous transfer mode	en
dc.title	Linear-based trunk reservation routing algorithm for ATM networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/LCN.1998.727650	en
heal.identifier.secondary	http://dx.doi.org/10.1109/LCN.1998.727650	en
heal.publicationDate	1998	en
heal.abstract	In this paper an efficient heuristic routing algorithm is proposed that increase the network throughput irrespective of the network traffic load. Its effectiveness is based on an efficient cost metric, which achieves a successful trade-off between the use of the minimum-hop routes and the load balancing. Moreover, it employs the known Trunk Reservation concept according to a probability that increases linearly as the traffic load increases. This results in an effective compromise of the performance of the algorithm between light and heavy loads. Finally, its simplicity and its suitability for a real-time application render it as an efficient routing algorithm for ATM networks.	en
heal.publisher	IEEE, Piscataway, NJ, United States	en
heal.journalName	Conference on Local Computer Networks	en
dc.identifier.doi	10.1109/LCN.1998.727650	en
dc.identifier.spage	90	en
dc.identifier.epage	96	en