Optimal oblivious routing on d-dimensional meshes

Abstract

In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). We present an asymptotically optimal O(k √ n d ) step oblivious k-k routing algorithm for d-dimensional n × · · · × n meshes of n d processors for all k 1 and d > 1. We further show how the algorithm can be used to achieve asymptotically optimal oblivious k-k routing algorithms on other networks.

A Lower Bound for Oblivious Dimensional Routing

“…In [4,10,12] oblivious weakly-dimensional 1-1 routing algorithms are considered. In [4] it was shown that any oblivious elementary-path 1-1 routing algorithm on M 3,n needs Ω(n 2 ) steps.…”