DYNAMIC ROUTING AND PROSPECTS FOR ON-LINE IMPLEMENTATION.

Stassinopulos, GI; Protonotarios, EN

dc.contributor.author	Stassinopulos, GI	en
dc.contributor.author	Protonotarios, EN	en
dc.date.accessioned	2014-03-01T02:47:46Z
dc.date.available	2014-03-01T02:47:46Z
dc.date.issued	1986	en
dc.identifier.issn	05361486	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33329
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0022865894&partnerID=40&md5=bbcf140859f364202802425a55feab98	en
dc.subject.other	COMPUTER SYSTEMS, DIGITAL - On Line Operation	en
dc.subject.other	DIGITAL COMMUNICATION SYSTEMS - Optimization	en
dc.subject.other	DYNAMIC ROUTING	en
dc.subject.other	ON-LINE IMPLEMENTATION	en
dc.subject.other	COMPUTER NETWORKS	en
dc.title	DYNAMIC ROUTING AND PROSPECTS FOR ON-LINE IMPLEMENTATION.	en
heal.type	conferenceItem	en
heal.publicationDate	1986	en
heal.abstract	The dynamic routing problem is examined. Theoretical results and appropriate algorithms are reviewed and their complexity and properties discussed. Methods of using dynamic congestion clearing schemes in a continuous fashion are suggested, thus presenting an alternative to present day static or quasistatic implementations. The drawbacks prohibiting so far an actual online implementation are discussed and approximate methods which could lead to a suboptimal but implementable solution are suggested.	en
heal.publisher	IEEE, New York, NY, USA	en
heal.journalName	Conference Record - International Conference on Communications	en
dc.identifier.spage	141	en
dc.identifier.epage	144	en