Selected Papers from the 1998 Dagstuhl Seminar on Graph Algorithms and Applications New Bounds for Oblivious Mesh Routing Vol. 5, no. 5, pp. 17-38, 2001. Regular paper. Abstract We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an $O( N^{0.75})$ algorithm on the two-dimensional, $\sqrt{N} \times \sqrt{N}$ mesh with constant queue-size. This is the first algorithm which improves substantially the trivial $O(N)$ bound for oblivious routing in the mesh networks with constant queue-size. The other is a $1.16 \sqrt{N} + o(\sqrt{N})$ algorithm on the three-dimensional, $N^{1/3} \times N^{1/3} \times N^{1/3}$ mesh with unlimited queue-size. This algorithm allows at most three bends in the path of each packet. If the number of bends is restricted to minimal, i.e., at most two, then the bound jumps to $\Omega( N^{2/3})$ as was shown in ESA'97. Submitted: January 1999. Revised: April 2000. Revised: October 2000. Communicated by Takao Nishizeki, Roberto Tamassia, and Dorothea Wagner article (PDF) BibTeX