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 条
  • [21] Improving SDN Scalability With Protocol-Oblivious Source Routing: A System-Level Study
    Li, Shengru
    Han, Kai
    Ansari, Nirwan
    Bao, Qinkun
    Hu, Daoyun
    Liu, Junjie
    Yu, Shui
    Zhu, Zuqing
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2018, 15 (01): : 275 - 288
  • [22] Oblivious routing for wireless mesh networks
    Wellons, Jonathan
    Xue, Yuan
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 2969 - 2973
  • [23] A Lower Bound for Oblivious Dimensional Routing
    Osterloh, Andre
    [J]. EURO-PAR 2009: PARALLEL PROCESSING, PROCEEDINGS, 2009, 5704 : 1003 - 1010
  • [24] Oblivious routing algorithms on the mesh of buses
    Iwama, K
    Miyano, E
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2000, 60 (02) : 137 - 149
  • [25] On a New Competitive Measure for Oblivious Routing
    Nemeth, Gabor
    [J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2014, 5 (01) : 117 - 123
  • [26] Oblivious routing in wireless mesh networks
    Chen, Weiwei
    Lea, Chin-Tau
    [J]. WIRELESS NETWORKS, 2016, 22 (07) : 2337 - 2353
  • [27] Oblivious routing for LC permutations on hypercubes
    Liu, ZY
    Cheung, DW
    [J]. PARALLEL COMPUTING, 1999, 25 (04) : 445 - 460
  • [28] Oblivious Routing Using Learning Methods
    Usubutun, Ufuk
    Kodialam, Murali
    Lakshman, T. V.
    Panwar, Shivendra
    [J]. IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 5226 - 5231
  • [29] Oblivious routing algorithms on the mesh of buses
    Iwama, K
    Miyano, E
    [J]. 11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 721 - 727
  • [30] Oblivious Routing for the Lp-norm
    Englert, Matthias
    Raecke, Harald
    [J]. 2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 32 - 40
12345