Greedy packet scheduling on shortest paths (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Potential function analysis of greedy hot-potato routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Many-to-one packet routing on grids
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Hot-potato routing on processor arrays
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Observations on hot potato routing
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Bounds on evacuation time for deflection routing
Distributed Computing
Randomized greedy hot-potato routing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Õ(congestion + dilation) hot-potato routing on leveled networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Networks on which hot-potato routing does not livelock
Distributed Computing
Evaluation of on-chip networks using deflection routing
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
TDM virtual-circuit configuration for network-on-chip
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A new bound for pure greedy hot potato routing
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Efficient bufferless routing on leveled networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
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.