Randomized greedy hot-potato routing

Authors:
Costas Busch;Maurice Herlihy;Rogert Wattenhofer
Affiliations:
Computer Science Department, Brown University, Providence, RI;Computer Science Department, Brown University, Providence, RI;Computer Science Department, Brown University, Providence, RI
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

The connection machine

The connection machine
Fast deflection routing for packets and worms

PODC '93 Proceedings of the twelfth 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
Dynamic deflection routing on arrays (preliminary version)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized single-target hot-potato routing

Journal of Algorithms
Hot-potato routing on processor arrays

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Hot-Potato Algorithms for Permutation Routing

IEEE Transactions on Parallel and Distributed Systems
Deterministic Many-to-Many Hot Potato Routing

IEEE Transactions on Parallel and Distributed Systems
Mosaic C: An Experimental Fine-Grain Multicomputer

Proceedings of the International Conference on Future Tendencies in Computer Science, Control and Applied Mathematics
Fast Deterministic Hot-Potato Routing on Processor Arrays

ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Bounds on evacuation time for deflection routing

Distributed Computing

Hard-Potato routing

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Routing without flow control

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
Experimental Evaluation of Hot-Potato Routing Algorithms on 2-Dimensional Processor Arrays (Research Note)

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Recurrence equation as basis for designing hot-potato routing protocols

CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
Improved bounds for data-gathering time in sensor networks

Computer Communications
A new bound for pure greedy hot potato routing

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Deterministic hot-potato permutation routing on the mesh and the torus

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

Hi-index	0.00