Abstract
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. © 2009 Springer.
Cite
CITATION STYLE
Osterloh, A. (2009). A lower bound for oblivious dimensional routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5704 LNCS, pp. 1003–1010). https://doi.org/10.1007/978-3-642-03869-3_92
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
