Fast Deflection Routing for Packets and Worms (Extended Summary)

@inproceedings{BarNoy1993FastDR,
  title={Fast Deflection Routing for Packets and Worms (Extended Summary)},
  author={Amotz Bar-Noy and Prabhakar Raghavan and Baruch Schieber and Hisao Tamaki},
  booktitle={PODC},
  year={1993}
}
We consider deflection routing on the n x n mesh and torus. In deflection routing a message cannot be buffered, and is therefore always moving until it reaches its destination. In addition, routing choices have to be made locally. We give a nearly optimal deterministic algorithm for the permutation routing problem for packets, the first such result for deflection routing. We extend the deterministic algorithm to the case when the messages are worms; a contiguous physical stream of bits that… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…