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 条
  • [1] AN OPTIMAL TIME BOUND FOR OBLIVIOUS ROUTING
    PARBERRY, I
    [J]. ALGORITHMICA, 1990, 5 (02) : 243 - 250
  • [2] On improving optimal oblivious routing
    Scutella, Maria Grazia
    [J]. OPERATIONS RESEARCH LETTERS, 2009, 37 (03) : 197 - 200
  • [3] Optimal Oblivious Routing for Structured Networks
    Supittayapornpong, Sucha
    Namyar, Pooria
    Zhang, Mingyang
    Yu, Minlan
    Govindan, Ramesh
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 1988 - 1997
  • [4] Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost
    Shi, Yangguang
    Zhang, Fa
    Liu, Zhiyong
    [J]. FRONTIERS IN ALGORITHMICS, FAW 2014, 2014, 8497 : 216 - 228
  • [5] Optimal oblivious routing on d-dimensional meshes
    Osterloh, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 333 (03) : 331 - 346
  • [6] Optimal oblivious routing under linear and ellipsoidal uncertainty
    Belotti, Pietro
    Pinar, Mustafa C.
    [J]. OPTIMIZATION AND ENGINEERING, 2008, 9 (03) : 257 - 271
  • [7] Optimal Oblivious Routing With Concave Objectives for Structured Networks
    Chitavisutthivong, Kanatip
    Supittayapornpong, Sucha
    Namyar, Pooria
    Zhang, Mingyang
    Yu, Minlan
    Govindan, Ramesh
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2023, 31 (06) : 2669 - 2681
  • [8] Optimal oblivious routing under linear and ellipsoidal uncertainty
    Pietro Belotti
    Mustafa Ç. Pınar
    [J]. Optimization and Engineering, 2008, 9 : 257 - 271
  • [9] Optimal and Heuristic Application-Aware Oblivious Routing
    Kinsy, Michel A.
    Cho, Myong Hyon
    Shim, Keun Sup
    Lis, Mieszko
    Suh, G. Edward
    Devadas, Srinivas
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (01) : 59 - 73
  • [10] Randomized Throughput-Optimal Oblivious Routing for Torus Networks
    Ramanujam, Rohit Sunkam
    Lin, Bill
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (03) : 561 - 574
12345