Minimal adaptive routing on the mesh with bounded queue size
Donald D. Chinn, Tom Leighton, Martin Tompa · 1994
An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around “hot spots.” Minimal adaptive routing algorithms have the additional advantage that the path each packet takes is a shortest one.