Deterministic Many-to-Many Hot Potato Routing
IEEE Transactions on Parallel and Distributed Systems
Short Cut Eulerian Routing of Datagrams in All Optical Point-to-Point Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A Mixed Deflection and Convergence Routing Algorithm: Design and Performance
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Networks on which hot-potato routing does not livelock
Distributed Computing
Potential Function Analysis of Greedy Hot-Potato Routing
Theory of Computing Systems
| Hi-index | 0.00 |
Abstract: In "hot potato" packet routing problems, packets need to be routed to their respective destinations on a network. At each time step, each communication link can be traversed by at most one packet. Packets must keep on moving until they reach their destinations, even if this means temporarily moving further away from their destinations. We investigate some simple design principles for hot potato routing algorithms. Perhaps our most important negative result is that for a wide class of natural algorithms, the number of deflections that a packet suffers can grow experimentally in the number of other packets in the network. On the positive side, we present some (admitedly weak) upper bounds on the worst case performance for algorithms for general networks, and for special cases such as the mesh, the torus, and the infinite line.