A lower bound for oblivious dimensional routing

Osterloh, Andre GND

In this work we consider deterministic oblivious dimensional rout- ing 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 short- est 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.

Vorschau

Zitieren

Zitierform:

Osterloh, Andre: A lower bound for oblivious dimensional routing. Hagen 2008. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe