OPTIMAL DYNAMIC ROUTING IN MULTIDESTINATION NETWORKS.

Stassinopoulos, GI

dc.contributor.author	Stassinopoulos, GI	en
dc.date.accessioned	2014-03-01T01:06:56Z
dc.date.available	2014-03-01T01:06:56Z
dc.date.issued	1987	en
dc.identifier.issn	0090-6778	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9693
dc.subject	Cost Function	en
dc.subject	Dynamic Routing	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	DIGITAL COMMUNICATION SYSTEMS	en
dc.subject.other	DYNAMIC ROUTING PROBLEM	en
dc.subject.other	MULTIDESTINATION PROBLEM	en
dc.subject.other	ROUTING PROBLEM	en
dc.subject.other	COMPUTER NETWORKS	en
dc.title	OPTIMAL DYNAMIC ROUTING IN MULTIDESTINATION NETWORKS.	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/TCOM.1987.1096779	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TCOM.1987.1096779	en
heal.language	English	en
heal.publicationDate	1987	en
heal.abstract	The dynamic routing problem for multiple destination networks is considered. The minimum time rather than total delay cost functional is employed. Each link capacity is optimally partitioned by examining the competition of bottlenecks associated with each destination. The multidestination problem is thus solved through an iterative link-by-link optimization.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE Transactions on Communications	en
dc.identifier.doi	10.1109/TCOM.1987.1096779	en
dc.identifier.isi	ISI:A1987G441100017	en
dc.identifier.volume	COM-35	en
dc.identifier.issue	4	en
dc.identifier.spage	472	en
dc.identifier.epage	475	en