A 2-jump circulant is an undirected graph whose nodes are integers 0, 1,...
, n - 1 and each node u is adjacent to four nodes u +/- h(1) (mod n), u +/-
h(2) (mod n), where 0 < h(1) < h(2) < n. An algorithm for routing a packet
along the shortest path between a pair of processors in 2-jump circulant n
etworks is given. The algorithm requires -(d) time for preprocessing, and l
routing steps, where d is the diameter of the graph and l = O(d) is the di
stance between the two processors.