A wide variety of deflection routing strategies using packet state inf
ormation are compared in terms of delay performance using a toroidal n
etwork with uni-directional links. It is found that deflection strateg
ies based on packet age, the number of deflections experienced or path
length prediction work equally well and are superior to random deflec
tion, Strategies based on source to destination shortest path distance
or current location to destination shortest path distance were signif
icantly inferior to random deflection. This ranking was found to hold
with or without the inclusion of nodal input buffers.