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 条
  • [31] Minimizing Average Latency in Oblivious Routing
    Harsha, Prahladh
    Hayes, Thomas P.
    Narayanan, Hariharan
    Raecke, Harald
    Radhakrishnan, Jaikumar
    [J]. PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 200 - +
  • [32] Oblivious routing in wireless mesh networks
    Weiwei Chen
    Chin-Tau Lea
    [J]. Wireless Networks, 2016, 22 : 2337 - 2353
  • [33] On the Competitiveness of Oblivious Routing: A Statistical View
    Nemeth, Gabor
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (20):
  • [34] Hop-Constrained Oblivious Routing
    Ghaffari, Mohsen
    Haeupler, Bernhard
    Zuzic, Goran
    [J]. STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1208 - 1220
  • [35] OBLIVIOUS ROUTING WITH LIMITED BUFFER CAPACITY
    KRIZANC, D
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1991, 43 (02) : 317 - 327
  • [36] TIGHT BOUNDS FOR OBLIVIOUS ROUTING IN THE HYPERCUBE
    KAKLAMANIS, C
    KRIZANC, D
    TSANTILAS, T
    [J]. MATHEMATICAL SYSTEMS THEORY, 1991, 24 (04): : 223 - 232
  • [37] Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue
    Shi, Elaine
    [J]. 2020 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2020), 2020, : 842 - 858
  • [38] Optimal Oblivious Parallel RAM
    Asharov, Gilad
    Komargodski, Ilan
    Lin, Wei-Kai
    Peserico, Enoch
    Shi, Elaine
    [J]. PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2459 - 2521
  • [39] OptORAMa: Optimal Oblivious RAM
    Asharov, Gilad
    Komargodski, Ilan
    Lin, Wei-Kai
    Nayak, Kartik
    Peserico, Enoch
    Shi, Elaine
    [J]. JOURNAL OF THE ACM, 2023, 70 (01)
  • [40] OptORAMa: Optimal Oblivious RAM
    Asharov, Gilad
    Komargodski, Ilan
    Lin, Wei-Kai
    Nayak, Kartik
    Peserico, Enoch
    Shi, Elaine
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT II, 2020, 12106 : 403 - 432
12345