CONGESTION CLEARING PROBLEM IN MULTI-DESTINATION NETWORKS.

Stassinopoulos, GI; Theodorakis, PC

dc.contributor.author	Stassinopoulos, GI	en
dc.contributor.author	Theodorakis, PC	en
dc.date.accessioned	2014-03-01T02:47:36Z
dc.date.available	2014-03-01T02:47:36Z
dc.date.issued	1985	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33283
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0022207147&partnerID=40&md5=4b8fe97727c2c4ca4bdab8d2e50dafc6	en
dc.subject.other	DIGITAL COMMUNICATION SYSTEMS	en
dc.subject.other	MATHEMATICAL TECHNIQUES - Algorithms	en
dc.subject.other	CONGESTION CLEARING	en
dc.subject.other	MULTI-DESTINATION NETWORKS	en
dc.subject.other	OPTIMAL DYNAMIC ROUTING	en
dc.subject.other	SINGLE-DESTINATION NETWORKS	en
dc.subject.other	VAROPTFLO ALGORITHMS	en
dc.subject.other	COMPUTER NETWORKS	en
dc.title	CONGESTION CLEARING PROBLEM IN MULTI-DESTINATION NETWORKS.	en
heal.type	conferenceItem	en
heal.publicationDate	1985	en
heal.abstract	The congestion clearing problem in single-destination networks (SDN) has been extensively studied. The problem admits a particularly simple solution through a finite algorithm of polynomial complexity with respect to the number of network nodes. The authors extend this algorithm, introducing a new class called VAROPTFLO algorithms, which find optimal flows in SDNs with variable-capacity links. They apply these algorithms to the optimal dynamic routing problem in multidestination networks. They present the VAROPTFLO algorithm for the case of a SDN with one variable-capacity link. Finally, they comment on the worst-case complexity of the general VAROPTFLO algorithms. The minimum total delay criterion is used throughout.	en
heal.publisher	IEEE, New York, NY, USA	en
heal.journalName	[No source information available]	en
dc.identifier.spage	583	en
dc.identifier.epage	586	en