Packet distribution on a ring

David Peleg, Allen Van Gelder

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


The balanced packet distribution problem on a ring of n processors requires that randomly arriving packets be stored at nodes as evenly as possible by passing packets (and other messages) around the ring. We give a protocol to achieve balanced distribution with an average message complexity of √n per packet and to show that the protocol is optimal, up to lower order terms, for unidirectional rings.

Original languageEnglish
Pages (from-to)558-567
Number of pages10
JournalJournal of Parallel and Distributed Computing
Issue number3
StatePublished - Jun 1989
Externally publishedYes

Bibliographical note

Funding Information:
* Supported in part by a Weizmann fellowship and by Contract ONR NOOO1 4-85-C-073 1. t Current address: CIS, Applied Sciences, UCSC, Santa Cruz, CA 95064.


Dive into the research topics of 'Packet distribution on a ring'. Together they form a unique fingerprint.

Cite this