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 条
  • [21] OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
    Altin, Ayseguel
    Belotti, Pietro
    Pinar, Mustafa C.
    OPTIMIZATION AND ENGINEERING, 2010, 11 (03) : 395 - 422
  • [22] Near-Optimal Oblivious Routing on Three-Dimensional Mesh Networks
    Ramanujam, Rohit Sunkam
    Lin, Bill
    2008 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, 2008, : 134 - 141
  • [23] OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
    Ayşegül Altın
    Pietro Belotti
    Mustafa Ç. Pınar
    Optimization and Engineering, 2010, 11 : 395 - 422
  • [24] Oblivious Routing in IP Networks
    Chiesa, Marco
    Retvari, Gabor
    Schapira, Michael
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (03) : 1292 - 1305
  • [25] Survey on Oblivious Routing Strategies
    Raecke, Harald
    MATHEMATICAL THEORY AND COMPUTATIONAL PRACTICE, 2009, 5635 : 419 - 429
  • [26] Routing Oblivious Measurement Analytics
    Ben Basat, Ran
    Chen, Xiaoqi
    Einziger, Gil
    Feibish, Shir Landau
    Raz, Danny
    Yu, Minlan
    2020 IFIP NETWORKING CONFERENCE AND WORKSHOPS (NETWORKING), 2020, : 449 - 457
  • [27] Selfish routing with oblivious users
    Karakostas, George
    Kim, Taeyon
    Viglas, Anastasios
    Xia, Hao
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2007, 4474 : 318 - +
  • [28] Polynomial time algorithms for the message routing problem
    Wong, CS
    Chan, P
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 995 - 1000
  • [29] Oblivious Polynomial Evaluation in the Exponent, Revisited
    Itakura, Naota
    Kurosawa, Kaoru
    Yoneyama, Kazuki
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2017, E100A (01) : 26 - 33
  • [30] Optimal traffic-oblivious energy-aware routing for multihop wireless networks
    Li, Yuxi
    Harms, Janelle
    Holte, Robert
    25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006, 2006, : 86 - 97
12345