Oblivious Routing in IP Networks

被引:8
|
作者
Chiesa, Marco [1 ]
Retvari, Gabor [2 ]
Schapira, Michael [3 ]
机构
[1] KTH Royal Inst Technol, S-11428 Stockholm, Sweden
[2] MTA BME Informat Syst Res Grp, H-1521 Budapest, Hungary
[3] Hebrew Univ Jerusalem, IL-9190401 Jerusalem, Israel
关键词
Software defined networking; routing; IP networks; wide area networks; network theory; ALGORITHMS;
D O I
10.1109/TNET.2018.2832020
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
To optimize the flow of traffic in IP networks, operators do traffic engineering (TE), i.e., tune routing-protocol parameters in response to traffic demands. TE in IP networks typically involves configuring static link weights and splitting traffic between the resulting shortest-paths via the equal-cost-multipath (ECMP) mechanism. Unfortunately, ECMP is a notoriously cumbersome and indirect means for optimizing traffic flow, often leading to poor network performance. Also, obtaining accurate knowledge of traffic demands as the input to TE is a non-trivial task that may require additional monitoring infrastructure, and traffic conditions can be highly variable, further complicating TE. We leverage recently proposed schemes for increasing ECMP's expressiveness via carefully disseminated bogus information (lies) to design COYOTE, a readily deployable TE scheme for robust and efficient network utilization. COYOTE leverages new algorithmic ideas to configure (static) traffic splitting ratios that are optimized with respect to all (even adversarial) traffic scenarios within the operator's "uncertainty bounds". Our experimental analyses show that COYOTE significantly outperforms today's prevalent TE schemes in a manner that is robust to traffic uncertainty and variation. We discuss experiments with a prototype implementation of COYOTE.
引用
收藏
页码:1292 / 1305
页数:14
相关论文
共 50 条
  • [41] Survivable and traffic-oblivious routing in WDM networks: valiant load balancing versus tree routing
    Dai, Rui
    Li, Lemin
    Wang, Sheng
    Zhang, Xiaoning
    [J]. JOURNAL OF OPTICAL NETWORKING, 2009, 8 (05): : 438 - 453
  • [42] Survey on Oblivious Routing Strategies
    Raecke, Harald
    [J]. MATHEMATICAL THEORY AND COMPUTATIONAL PRACTICE, 2009, 5635 : 419 - 429
  • [43] Routing Oblivious Measurement Analytics
    Ben Basat, Ran
    Chen, Xiaoqi
    Einziger, Gil
    Feibish, Shir Landau
    Raz, Danny
    Yu, Minlan
    [J]. 2020 IFIP NETWORKING CONFERENCE AND WORKSHOPS (NETWORKING), 2020, : 449 - 457
  • [44] Selfish routing with oblivious users
    Karakostas, George
    Kim, Taeyon
    Viglas, Anastasios
    Xia, Hao
    [J]. STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2007, 4474 : 318 - +
  • [45] An oblivious shortest-path routing algorithm for fully connected cubic networks
    Yang, Xiaofan
    Megson, Graham M.
    Evans, David J.
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2006, 66 (10) : 1294 - 1303
  • [46] Near-Optimal Oblivious Routing on Three-Dimensional Mesh Networks
    Ramanujam, Rohit Sunkam
    Lin, Bill
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, 2008, : 134 - 141
  • [47] Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty
    Wellons, Jonathan
    Dai, Liang
    Xue, Yuan
    Cui, Yui
    [J]. COMPUTER NETWORKS, 2010, 54 (02) : 178 - 195
  • [48] Two routing algorithms for failure protection in IP networks
    Reichert, C
    Glickmann, Y
    Magedanz, T
    [J]. 10TH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2005, : 97 - 102
  • [49] An Integer Programming Algorithm for Routing Optimization in IP Networks
    Bley, Andreas
    [J]. ALGORITHMICA, 2011, 60 (01) : 21 - 45
  • [50] Traffic control in IP networks with multiple topology routing
    Adamovic, L
    Kowalik, K
    Collier, M
    [J]. NETWORKING - ICN 2005, PT 2, 2005, 3421 : 335 - 342