A Lower Bound for Oblivious Dimensional Routing

被引：0
|
作者：
Osterloh, Andre [1 ]
机构：
[1] BTC AG, D-26121 Oldenburg, Germany
来源：
EURO-PAR 2009: PARALLEL PROCESSING, PROCEEDINGS | 2009年 / 5704卷
关键词：
MESHES;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 Omega(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.
引用
收藏
页码：1003 / 1010
页数：8
相关论文
共 50 条
  • [1] A lower bound for elementary oblivious routing on three-dimensional meshes
    Iwama, K
    Miyano, E
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 39 (02): : 145 - 161
  • [2] Is There an Oblivious RAM Lower Bound?
    Boyle, Elette
    Naor, Moni
    [J]. ITCS'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INNOVATIONS IN THEORETICAL COMPUTER SCIENCE, 2016, : 357 - 368
  • [3] AN OPTIMAL TIME BOUND FOR OBLIVIOUS ROUTING
    PARBERRY, I
    [J]. ALGORITHMICA, 1990, 5 (02) : 243 - 250
  • [4] Yes, There is an Oblivious RAM Lower Bound!
    Larsen, Kasper Green
    Nielsen, Jesper Buus
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT II, 2018, 10992 : 523 - 542
  • [5] Semi-oblivious Routing: Lower Bounds
    Hajiaghayi, MohammadTaghi
    Kleinberg, Robert
    Leighton, Tom
    [J]. PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 929 - +
  • [6] Is There an Oblivious RAM Lower Bound for Online Reads?
    Mor Weiss
    Daniel Wichs
    [J]. Journal of Cryptology, 2021, 34
  • [7] Is There an Oblivious RAM Lower Bound for Online Reads?
    Weiss, Mor
    Wichs, Daniel
    [J]. JOURNAL OF CRYPTOLOGY, 2021, 34 (03)
  • [8] Is There an Oblivious RAM Lower Bound for Online Reads?
    Weiss, Mor
    Wichs, Daniel
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2018, PT II, 2018, 11240 : 603 - 635
  • [9] New Lower Bounds for Oblivious Routing in Undirected Graphs
    Hajiaghayi, Mohammad T.
    Kleinberg, Robert D.
    Leighton, Tom
    Raecke, Harald
    [J]. PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 918 - +
  • [10] A Logarithmic Lower Bound for Oblivious RAM (for All Parameters)
    Komargodski, Ilan
    Lin, Wei-Kai
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2021, PT IV, 2021, 12828 : 579 - 609
12345