Rate‐adaptive multipath routing: Distributed, centralized, and hybrid architectures

With the increasing volume and volatility of Internet traffic, the need for adaptive routing algorithms has become compelling lately. An adaptive routing algorithm controls the rate at which traffic is placed on forwarding paths in concert with the actual user demands, making it possible to avoid congestion even when no information on expected traffic is available. In this article, we present a new model for rate-adaptive multipath routing, which allows one to analyze distributed, centralized, and hybrid routing architectures within a single framework, and to develop quantitative as well as qualitative arguments regarding their optimality, stability, and realizability. By a novel generalization of oblivious routing, we present a centralized algorithm with provable optimality, and we arrive at the conclusion that congestion can be completely eliminated even if routing decisions are completely precomputed. We find, although, that the complexity of the centralized scheme can become exponential. Therefore, we develop a hybrid distributed-centralized algorithm that combines the simplicity of distributed algorithms with the efficiency of centralized ones, and we provide numerical studies demonstrating that the hybrid scheme performs well in a broad selection of realistic scenarios. © 2015 Wiley Periodicals, Inc.NETWORKS, Vol. 662, 118-135 2015

[1]  Dimitri P. Bertsekas,et al.  Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .

[2]  Stefano Leonardi,et al.  On-Line Routing in All-Optical Networks , 1997, ICALP.

[3]  Subhash Suri,et al.  Profile-Based Routing: A New Framework for MPLS Traffic Engineering , 2001, QofIS.

[4]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM 1989.

[5]  Renata Teixeira,et al.  Dynamics of hot-potato routing in IP networks , 2004, SIGMETRICS '04/Performance '04.

[6]  Mikkel Thorup,et al.  Traffic engineering with estimated traffic matrices , 2003, IMC '03.

[7]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[8]  Donald F. Towsley,et al.  On optimal routing with multiple traffic matrices , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Desmond P. Taylor,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 2007 .

[10]  Harald Räcke,et al.  Oblivious Routing for the Lp-norm , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[11]  Donald F. Towsley,et al.  Path Selection and Multipath Congestion Control , 2007, INFOCOM.

[12]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2003, STOC '03.

[13]  Mung Chiang,et al.  Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing , 2007, IEEE Journal on Selected Areas in Communications.

[14]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[15]  Amund Kvalbein,et al.  Multipath load-adaptive routing: putting the emphasis on robustness and simplicity , 2009, 2009 17th IEEE International Conference on Network Protocols.

[16]  Mateusz Zotkiewicz,et al.  Robust routing and optimal partitioning of a traffic demand polytope , 2011, Int. Trans. Oper. Res..

[17]  Hans-Werner Braun,et al.  The National Science Foundation Network , 1992 .

[18]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[19]  Dong Zhou,et al.  Translation techniques in cross-language information retrieval , 2012, CSUR.

[20]  Gábor Rétvári,et al.  On optimal multipath rate-adaptive routing , 2010, The IEEE symposium on Computers and Communications.

[21]  Gábor Rétvári,et al.  Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds , 2010, BROADNETS.

[22]  Mung Chiang,et al.  Rethinking internet traffic management: from multiple decompositions to a practical protocol , 2007, CoNEXT '07.

[23]  Alberto Bemporad,et al.  The explicit linear quadratic regulator for constrained systems , 2003, Autom..

[24]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[25]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[26]  Matthew Roughan,et al.  Traffic Matrix Reloaded: Impact of Routing Changes , 2005, PAM.

[27]  Donald F. Towsley,et al.  Optimal routing with multiple traffic matrices tradeoff between average and worst case performance , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[28]  Harald Räcke.  Survey on Oblivious Routing Strategies , 2009, CiE.

[29]  Srikanth Kandula,et al.  Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.

[30]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

[31]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

[32]  Renata Teixeira,et al.  BGP routing changes: merging views from two ISPs , 2005, CCRV.

[33]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[34]  Gábor Rétvári,et al.  Demand-Oblivious Routing: Distributed vs. Centralized Approaches , 2010, 2010 Proceedings IEEE INFOCOM.

[35]  Tibor Cinkler,et al.  Fairness in Capacitated Networks: A Polyhedral Approach , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[36]  Anja Feldmann,et al.  REPLEX: dynamic traffic engineering based on wardrop routing policies , 2006, CoNEXT '06.

[37]  Yin Zhang,et al.  COPE: traffic engineering in dynamic networks , 2006, SIGCOMM 2006.

[38]  Alexander Below.  Complexity of triangulation , 2002 .

[39]  Deep Medhi.  Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks , 1995, TNET.

[40]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[41]  Mikael Johansson,et al.  Traffic matrix estimation on a large IP backbone: a comparison on real data , 2004, IMC '04.

[42]  Song Chong,et al.  Multi-Path Aggregate Flow Control for Real-Time Traffic Engineering , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[43]  Jukka Suomela,et al.  Survey of local algorithms , 2013, CSUR.

[44]  Ram Dantu,et al.  Forwarding and Control Element Separation (ForCES) Framework , 2004, RFC.

[45]  Tor Arne Johansen,et al.  Approximate explicit constrained linear model predictive control via orthogonal search tree , 2003, IEEE Trans. Autom. Control..

[46]  Hao Che,et al.  Adaptive control algorithms for decentralized optimal traffic engineering in the Internet , 2004, IEEE/ACM Transactions on Networking.

[47]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[48]  Tibor Cinkler,et al.  Routing-Independent Fairness in Capacitated Networks , 2007, 2007 IEEE International Conference on Communications.

[49]  Zhi-Li Zhang,et al.  Profiling internet backbone traffic: behavior models and applications , 2005, SIGCOMM '05.

[50]  Mung Chiang,et al.  Link-State Routing With Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering , 2011, IEEE/ACM Trans. Netw..

[51]  Harald Räcke,et al.  Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.

[52]  Thomas Voice,et al.  Stability of end-to-end algorithms for joint routing and rate control , 2005, CCRV.

[53]  Subhash Suri,et al.  Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[54]  M. Morari,et al.  Geometric Algorithm for Multiparametric Linear Programming , 2003 .

[55]  G. Ziegler.  Lectures on Polytopes , 1994 .

[56]  Sudipta Sengupta,et al.  Efficient and robust routing of highly variable traffic , 2005 .

[57]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[58]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[59]  Albert G. Greenberg,et al.  Experience in measuring backbone traffic variability: models, metrics, measurements and meaning , 2002, IMW '02.