๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal-Algorithms for Multipacket Routing Problems on Rings

โœ Scribed by F. Makedon; A. Symvonis

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
643 KB
Volume
22
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

We study multipacket routing problems on rings of processors. We prove a new lower bound of (2 n / 3) routing steps for the case that (k), the number of packets per processor, is at most 2 . We also give an algorithm that tightens this lower bound. For the case where (k>2), the lower bound is (k n / 4). The trivial algorithm needs in the worst case (k{n / 2}) steps to terminate. An algorithm that completes the routing in (k n / 4+2.5 n) routing steps is given. 1994 Academic Press, Inc.

๐Ÿ“œ SIMILAR VOLUMES

Optimal Algorithms for Probabilistic Sol
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
โœ Lisa Higham; David Kirkpatrick; Karl Abrahamson; Andrew Adler ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 340 KB

Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, called contenders, determine whether or not there