Optimal dynamic routing in double ring networks

Stassinopoulos, GI; Kukutos, H

dc.contributor.author	Stassinopoulos, GI	en
dc.contributor.author	Kukutos, H	en
dc.date.accessioned	2014-03-01T01:07:33Z
dc.date.available	2014-03-01T01:07:33Z
dc.date.issued	1989	en
dc.identifier.issn	0090-6778	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10068
dc.subject	Dynamic Routing	en
dc.subject	Optimal Routing	en
dc.subject	Rate of Convergence	en
dc.subject	Ring Network	en
dc.subject	and Forward	en
dc.subject	Local Area Network	en
dc.subject	Linear Program	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Data Transmission--Packet Switching	en
dc.subject.other	Mathematical Programming, Linear	en
dc.subject.other	Double Ring Networks	en
dc.subject.other	Minimax Cost	en
dc.subject.other	Optimal Dynamic Routing	en
dc.subject.other	Computer Networks	en
dc.title	Optimal dynamic routing in double ring networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/26.31191	en
heal.identifier.secondary	http://dx.doi.org/10.1109/26.31191	en
heal.language	English	en
heal.publicationDate	1989	en
heal.abstract	The dynamic routing problem with multiple destinations on ring networks is examined. The authors discuss the peculiarities of the ring topology as well as the resulting simplification for the dynamic routing problem. The problem is transformed into a problem that minimizes link evacuation times. It involves a minimax cost and is equivalent to a linear program admitting a finite solution. A different approach is then taken: a solution based on an infinite algorithm is proposed and used to obtain a complexity of only O(\|N\|3) per iteration and an exponential rate of convergence to the minimal value. Several optimal routing policies are characterized and formulated. It is found that the store-and-forward feature is not necessary in order to implement a particular optimal routing. Optimality can be achieved by a relatively simple protocol reminiscent of accessing procedures in local area networks. The incorporation of external arrival rates is discussed. Examples are worked out, and suggestions for future work are given.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE Transactions on Communications	en
dc.identifier.doi	10.1109/26.31191	en
dc.identifier.isi	ISI:A1989AJ34400017	en
dc.identifier.volume	37	en
dc.identifier.issue	8	en
dc.identifier.spage	890	en
dc.identifier.epage	896	en