Packet Distribution on a Ring


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 fi per packet and to show that the protocol is optimal, up to lower order terms, for unidirectional ring?..

DOI: 10.1016/0743-7315(89)90006-3

Cite this paper

@article{Peleg1989PacketDO, title={Packet Distribution on a Ring}, author={David Peleg and Allen Van Gelder}, journal={J. Parallel Distrib. Comput.}, year={1989}, volume={6}, pages={558-567} }