On improving optimal oblivious routing

被引：13
|
作者：
Scutella, Maria Grazia [1 ]
机构：
[1] Univ Pisa, Dipartimento Informat, I-56100 Pisa, Italy
来源：
OPERATIONS RESEARCH LETTERS | 2009年 / 37卷 / 03期
关键词：
Robust optimization; Oblivious routing; Mathematical models; Tractable cases;
D O I：
10.1016/j.orl.2009.01.009
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
in this paper a generalization of the robust network design problem with oblivious routing is investigated, where the (uncertain) demands are served through two alternative routing templates. A mathematical programming model leading to tractable cases is presented, together with related algorithmic approaches. The proposed special cases strictly generalize the standard oblivious routing model. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：197 / 200
页数：4
相关论文
共 50 条
  • [1] Optimal oblivious routing in polynomial time
    Azar, Y
    Cohen, E
    Fiat, A
    Kaplan, H
    Räcke, H
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 69 (03) : 383 - 394
  • [2] AN OPTIMAL TIME BOUND FOR OBLIVIOUS ROUTING
    PARBERRY, I
    [J]. ALGORITHMICA, 1990, 5 (02) : 243 - 250
  • [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] 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
  • [5] Optimal oblivious routing under linear and ellipsoidal uncertainty
    Pietro Belotti
    Mustafa Ç. Pınar
    [J]. Optimization and Engineering, 2008, 9 : 257 - 271
  • [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 on d-dimensional meshes
    Osterloh, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2005, 333 (03) : 331 - 346
  • [8] 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
  • [9] Randomized Throughput-Optimal Oblivious Routing for Torus Networks
    Ramanujam, Rohit Sunkam
    Lin, Bill
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (03) : 561 - 574
  • [10] Compact Oblivious Routing
    Raecke, Harald
    Schmid, Stefan
    [J]. 27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), 2019, 144
12345