Hot-potato worm routing is almost as easy as store-and-forward packet routing
Ilan Newman, Assaf Schuster · 2002
The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-potato style is a desired form of communication in high-speed optical interconnection networks. The authors develop a simple method for the design of parallel hot-potato worm routing algorithms. The basic approach is to simulate known packet routing algorithms, so that in each step worms are moved around instead of packets. For hot-potato permutation routing of worms of size k the authors have the following results. They get a O(k/sup 2.5/n) algorithm for the n*n mesh, and a O(k/sup 1.5/n) algorithm for the corresponding offline problem. For the 2/sup n/-nodes hypercube they get a O(k/sup 3/n log /sup 2/n) deterministic algorithm, and a O(k/sup 3/n) randomized algorithm. Although the results are given for permutation routing on the mesh and the hypercube, the general method can be applied to many other networks and to more general communication patterns as well. Moreover, once better routing algorithms are found for the underlying network, the worm routing algorithm improves, too.>