We consider algorithms for many-to-many hot potato routing. In hot potato (deflection) routing, a packet cannot be buffered, and is therefore always moving until it reaches its destination. We give optimal and nearly optimal deterministic algorithms for many-to-many packet routing in commonly occurring networks such as the hypercube, meshes, and tori of various dimensions and sizes, trees, and hypercubic networks such as the butterfly. All these algorithms are analyzed using a charging scheme that may be applicable to other algorithms as well. Moreover, all bounds hold in a dynamic setting in which packets can be injected at arbitrary times.
|Original language||American English|
|Number of pages||10|
|Journal||IEEE Transactions on Parallel and Distributed Systems|
|State||Published - 1997|
Bibliographical noteFunding Information:
This work was done while Allan Borodin was visiting the Departments of Computer Science at the Hebrew University, Jerusalem, and The Weizmann Institute of Science, Rehovot, Israel; and while Yuval Rabani was at the Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, supported by U.S. ARPA/Army contract DABT63-93-C-0038, and at the Department of Computer Science, University of Toronto, Toronto, Canada. Dr. Rabani’s work at the Technion was supported by a David and Ruth Moskowitz academic lecturer award and by a grant from the fund for the promotion of sponsored research at the Technion.
- Deflection routing
- Many-to-many routing