Shortest-path and hot-potato routing on unbuffered 2-D tori

We probabilistically model dynamic routing on unbuffered 2-dimensional tori. We consider shortest-path routing with packet loss and retransmissions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deflections. Computations of the sustained packet generating rate, node throughput, and average packet latency indicate that the proposed ALB strategy is a much better alternative to a shortest-path routing on unbuffered tori. It achieves an almost optimal sustained packet generating rate, near-optimal latency, and acceptable node throughput