Common approach to routing for k-ary n-cubes.
Dimensions of k-ary n-cube placed into order.
Packet first routed to correct position in higher dimension before attempting to route in next dimension.
For example in a 2D mesh, route first in X dimension, then in Y dimension.
Consider routing from (2,0) to (1,2):
Is it minimal?
Is it deadlock free?