Issue No.06 - June (1997 vol.8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.595575
<p><b>Abstract</b>—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.</p>
Routing, many-to-many routing, deflection routing, mesh, hypercube.
Allan Borodin, Baruch Schieber, "Deterministic Many-to-Many Hot Potato Routing", IEEE Transactions on Parallel & Distributed Systems, vol.8, no. 6, pp. 587-596, June 1997, doi:10.1109/71.595575