A time-randomness tradeoff for oblivious routing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Oblivious routing with limited buffer capacity
Journal of Computer and System Sciences
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
How much can hardware help routing?
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
A lower bound for elementary oblivious routing on three-dimensional meshes
Journal of Algorithms
An O( N) oblivious routing algorithm for two-dimensional meshes of constant queue-size
Journal of Algorithms
Deterministic 1-k Routing on Meshes
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Communication in Parallel Systems
SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In this work we consider deterministic oblivious dimensional routing algorithms on d -dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends only on the source and destination node of the packet. Furthermore packets use a shortest path with a minimal number of bends. We present an ***(kn (d + 1)/2) step lower bound for oblivious dimensional k -k routing algorithms on d -dimensional meshes for odd d 1 and show that the bound is tight.