Optimal oblivious routing in polynomial time

被引：46
|
作者：
Azar, Y
Cohen, E
Fiat, A
Kaplan, H
Räcke, H
机构：
[1] AT&T Labs Res, Florham Pk, NJ 07932 USA
[2] Tel Aviv Univ, Sch Comp Sci, IL-69978 Tel Aviv, Israel
[3] Paderborn Univ, Dept Math & Comp Sci, D-33102 Paderborn, Germany
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2004年 / 69卷 / 03期
关键词：
oblivious routing; oblivious ratio; communication networks;
D O I：
10.1016/j.jcss.2004.04.010
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A recent seminal result of Rake is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Racke's construction is not polynomial time. We give a polynomial time construction that guarantees Racke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network. (C) 2004 Elsevier Inc. All rights reserved.
引用
收藏
页码：383 / 394
页数：12
相关论文
共 50 条
  • [31] Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks
    Cholvi, Vicent
    Garncarek, Pawel
    Jurdzinski, Tomasz
    Kowalski, Dariusz R.
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, SIROCCO 2020, 2020, 12156 : 165 - 182
  • [32] Multivariate oblivious polynomial evaluation protocol
    Xiao Mingjun
    Huang Liusheng
    Liu An
    Han Kai
    CHINESE JOURNAL OF ELECTRONICS, 2007, 16 (02): : 217 - 222
  • [33] Optimal Register Allocation in Polynomial Time
    Krause, Philipp Klaus
    COMPILER CONSTRUCTION, CC 2013, 2013, 7791 : 1 - 20
  • [34] Randomized Partially-Minimal Routing: Near-Optimal Oblivious Routing for 3-D Mesh Networks
    Ramanujam, Rohit Sunkam
    Lin, Bill
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2012, 20 (11) : 2080 - 2093
  • [35] Optimal broadcast domination in polynomial time
    Heggernes, Pinar
    Lokshtanov, Daniel
    DISCRETE MATHEMATICS, 2006, 306 (24) : 3267 - 3280
  • [36] Oblivious routing for wireless mesh networks
    Wellons, Jonathan
    Xue, Yuan
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 2969 - 2973
  • [37] A Lower Bound for Oblivious Dimensional Routing
    Osterloh, Andre
    EURO-PAR 2009: PARALLEL PROCESSING, PROCEEDINGS, 2009, 5704 : 1003 - 1010
  • [38] On a New Competitive Measure for Oblivious Routing
    Nemeth, Gabor
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2014, 5 (01) : 117 - 123
  • [39] Oblivious routing algorithms on the mesh of buses
    Iwama, K
    Miyano, E
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2000, 60 (02) : 137 - 149
  • [40] Oblivious routing in wireless mesh networks
    Chen, Weiwei
    Lea, Chin-Tau
    WIRELESS NETWORKS, 2016, 22 (07) : 2337 - 2353
12345