Optimal oblivious routing under linear and ellipsoidal uncertainty

被引:0
|
作者
Pietro Belotti
Mustafa Ç. Pınar
机构
[1] Carnegie Mellon University,Tepper School of Business
[2] Bilkent University,Department of Industrial Engineering
来源
关键词
Traffic engineering; Oblivious routing; Linear programming; Second order cone programming;
D O I
暂无
中图分类号
学科分类号
摘要
In telecommunication networks, a common measure is the maximum congestion (i.e., utilization) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic demands.
引用
下载
收藏
页码:257 / 271
页数:14
相关论文
共 50 条
  • [41] Routing under uncertainty: A comparative study
    Steenstrup, ME
    WCNC: 2000 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-3, 2000, : 112 - 116
  • [42] The Inventory Routing Problem Under Uncertainty
    Cui, Zheng
    Long, Daniel Zhuoyu
    Qi, Jin
    Zhang, Lianmin
    OPERATIONS RESEARCH, 2023, 71 (01) : 378 - 395
  • [43] Robust Adaptive Routing Under Uncertainty
    Flajolet, Arthur
    Blandin, Sebastien
    Jaillet, Patrick
    OPERATIONS RESEARCH, 2018, 66 (01) : 210 - 229
  • [44] Routing Strategies Under Demand Uncertainty
    Tarhini, Hussein
    Bish, Douglas R.
    NETWORKS & SPATIAL ECONOMICS, 2016, 16 (02): : 665 - 685
  • [45] Routing Strategies Under Demand Uncertainty
    Hussein Tarhini
    Douglas R. Bish
    Networks and Spatial Economics, 2016, 16 : 665 - 685
  • [46] Oblivious Routing in IP Networks
    Chiesa, Marco
    Retvari, Gabor
    Schapira, Michael
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (03) : 1292 - 1305
  • [47] Survey on Oblivious Routing Strategies
    Raecke, Harald
    MATHEMATICAL THEORY AND COMPUTATIONAL PRACTICE, 2009, 5635 : 419 - 429
  • [48] 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
  • [49] Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
    Kurtz, Jannis
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2018, 6 (04) : 315 - 337
  • [50] Generalized criterion for robust modality of linear systems with ellipsoidal uncertainty of parameters
    Mamatov, AV
    Podleshnyi, VN
    Rubanov, VG
    AUTOMATION AND REMOTE CONTROL, 1999, 60 (02) : 213 - 221