Optimal-Algorithms for Multipacket Routing Problems on Rings

Makedon, F; Symvonis, A

dc.contributor.author	Makedon, F	en
dc.contributor.author	Symvonis, A	en
dc.date.accessioned	2014-03-01T01:42:25Z
dc.date.available	2014-03-01T01:42:25Z
dc.date.issued	1994	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/23822
dc.subject	Optimal Algorithm	en
dc.subject	Lower Bound	en
dc.title	Optimal-Algorithms for Multipacket Routing Problems on Rings	en
heal.type	journalArticle	en
heal.identifier.primary	10.1006/jpdc.1994.1068	en
heal.identifier.secondary	http://dx.doi.org/10.1006/jpdc.1994.1068	en
heal.publicationDate	1994	en
heal.abstract	We study multipacket routing problems on rings of processors. We prove a newlower bound of 2n=3 routing steps for the case that k, the number of packetsper processor, is at most 2. We also give an algorithm that tightens thislower bound. For the case where k ? 2, the lower bound is kn=4. The trivialalgorithm needs in the worst case	en
heal.journalName	Journal of Parallel and Distributed Computing	en
dc.identifier.doi	10.1006/jpdc.1994.1068	en