OPTIMAL CONGESTION CONTROL IN SINGLE DESTINATION NETWORKS.

Stassinopoulos, GI; Konstantopoulos, Panagiotis

dc.contributor.author	Stassinopoulos, GI	en
dc.contributor.author	Konstantopoulos, Panagiotis	en
dc.date.accessioned	2014-03-01T01:06:27Z
dc.date.available	2014-03-01T01:06:27Z
dc.date.issued	1985	en
dc.identifier.issn	0090-6778	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9391
dc.subject	Community Networks	en
dc.subject	Congestion Control	en
dc.subject	Flow Control	en
dc.subject	Necessary and Sufficient Condition	en
dc.subject	Optimal Routing	en
dc.subject	Optimal Solution	en
dc.subject	Time Constant	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	CONTROL SYSTEMS, OPTIMAL	en
dc.subject.other	DATA TRANSMISSION - Packet Switching	en
dc.subject.other	TELEPHONE SYSTEMS - Traffic Analysis	en
dc.subject.other	ARRIVAL RATES	en
dc.subject.other	OPTIMAL CONGESTION CONTROL	en
dc.subject.other	OPTIMAL ROUTING	en
dc.subject.other	SINGLE DESTINATION NETWORKS	en
dc.subject.other	STORE-AND-FORWARD PACKET SWITCHING	en
dc.subject.other	DIGITAL COMMUNICATION SYSTEMS	en
dc.title	OPTIMAL CONGESTION CONTROL IN SINGLE DESTINATION NETWORKS.	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TCOM.1985.1096380	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TCOM.1985.1096380	en
heal.language	English	en
heal.publicationDate	1985	en
heal.abstract	An algorithm for optimal routing in communication networks resulting in minimum time and minimum total delay clearing of congested traffic towards a single destination is presented. The algorithm is suitable for online implementation and can also be applied in the presence of time constant external arrival rates. In the case where several optimal solutions exist, the solution given is of the simplest form. The results are discussed and compared to existing ones, in particular to optimal feedback solutions found in the literature. The simplicity of the approach and results makes it possible to give necessary and sufficient conditions for arrival rates, so that the minimal value for the maximal delay encountered by any packet in the network does not increase when these external arrivals are present. This suggests a flow control policy which, together with optimal routing, gives a guaranteed upper limit for traffic delay, while inhibiting incoming traffic as little as necessary. A thorough geometric interpretation is given, and examples illustrate the applicability of the results.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE Transactions on Communications	en
dc.identifier.doi	10.1109/TCOM.1985.1096380	en
dc.identifier.isi	ISI:A1985ANH8900006	en
dc.identifier.volume	COM-33	en
dc.identifier.issue	8	en
dc.identifier.spage	792	en
dc.identifier.epage	800	en