Optimal randomized algorithms for multipacket and cut through routing on the mesh

Presents a randomized algorithm for the multipacket (i.e. k-k) routing problem on an n*n mesh. The algorithm completes with high probability in at the most kn+O(k log n) parallel communication steps, with a constant queue size of O(k). The previous best known algorithm takes 5/4 kn+O(kn/f(n)) steps with a queue size of O(k f(n)) (for any 1>