Optimal Oblivious Routing on D-Dimensional Meshes

In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for d- dimensional n n meshes, d > 1. For these networks we present asymptotically optimal O(k d ) step oblivious k-k routing algorithms for all k and d > 1