Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Greedy packet scheduling on shortest paths
Journal of Algorithms
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Computers
Nonuniform traffic in the Manhattan street network
Performance Evaluation
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
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
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
Fast Deterministic Hot-Potato Routing on Processor Arrays
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Hot-Potato Routing on Multi-Dimensional Tori
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Greedy Hot-Potato Routing on the Mesh
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Observations on hot potato routing
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Bounds on evacuation time for deflection routing
Distributed Computing
Fault tolerant network on chip switching with graceful performance degradation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special issue on the 2009 ACM/IEEE international symposium on networks-on-chip
| Hi-index | 0.00 |
Hot-potato routing is a form of synchronous routing which makes no use of buffers at intermediate nodes. Packets must move at every time step, until they reach their destination. If contention prevents a packet from taking its preferred outgoing edge, it is deflected on a different edge. Two simple design principles for hot potato routing algorithms are minimum advance, that advances at least one packet towards its destination from every nonempty node (and possibly deflects all other packets), and maximum advance, that advances the maximum possible number of packets. Livelock is a situation in which packets keep moving indefinitely in the network without any packet ever reaching its destination. It is known that even maximum advance algorithms might livelock on some networks. We show that minimum advance algorithms never livelock on tree networks, and that maximum advance algorithms never livelock on triangulated networks.