Distributed Utility Maximization From the Edge in IP Networks

To improve bandwidth sharing in IP networks, load balancing and rate control are key traffic engineering ingredients. In this context, we propose a fully distributed load balancing and rate allocation mechanism that operates only from the edge. Each access router is able to determine target rates over multiple paths for different traffic aggregates based on already available link state information and, some small and optional, information received from other edge devices. Our distributed utility maximization solution provides a feasible rate allocation at each iteration with diminishing returns. Through numerical results on a variety of instances, we show that it converges to near optimal solutions after a few iterations. Thanks to packetlevel simulations on an SD-WAN scenario, we also show that it can well prioritize traffic over centralized and legacy solutions.

[1]  Yiwei Thomas Hou,et al.  A generalized max-min rate allocation policy and its distributed implementation using the ABR flow control mechanism , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Peter Ashwood-Smith,et al.  Real time alpha-fairness based traffic engineering , 2014, HotSDN.

[3]  Ning Wang,et al.  An overview of routing optimization for internet traffic engineering , 2008, IEEE Communications Surveys & Tutorials.

[4]  Edmundo Roberto Mauro Madeira,et al.  OFSwitch13: Enhancing ns-3 with OpenFlow 1.3 Support , 2016, WNS3.

[5]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[6]  Yishay Mansour,et al.  Phantom: a simple and effective flow control scheme , 1996, SIGCOMM '96.

[7]  Nick McKeown,et al.  A Distributed Algorithm to Calculate Max-Min Fair Rates Without Per-Flow State , 2019, Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems.

[8]  Toha,et al.  An Improved Subgradiend Optimization Technique for Solving IPs with Lagrangean Relaxation , 2013 .

[9]  Yi Xu,et al.  Software-Defined Wide Area Network (SD-WAN): Architecture, Advances and Opportunities , 2019, 2019 28th International Conference on Computer Communication and Networks (ICCCN).

[10]  Baruch Awerbuch,et al.  Converging to approximated max-min flow fairness in logarithmic time , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[11]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[12]  Daniel Pérez Palomar,et al.  A tutorial on decomposition methods for network utility maximization , 2006, IEEE Journal on Selected Areas in Communications.

[13]  Guy Leduc,et al.  A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks , 2004, ICT.

[14]  David Thaler,et al.  Multipath Issues in Unicast and Multicast Next-Hop Selection , 2000, RFC.

[15]  Fernando M. V. Ramos,et al.  Software-Defined Networking: A Comprehensive Survey , 2014, Proceedings of the IEEE.

[16]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[17]  Ao Tang,et al.  HALO: Hop-by-Hop Adaptive Link-State Optimal Routing , 2015, IEEE/ACM Transactions on Networking.

[18]  Konstantin Avrachenkov,et al.  Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software-Defined Networks , 2018, IEEE Journal on Selected Areas in Communications.

[19]  Peter Putz,et al.  Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded-Diameter Minimum Spanning Tree Problem , 2007 .

[20]  Lisa Zhang,et al.  Fast, Fair and Frugal Bandwidth Allocation in ATM Networks , 1999, SODA '99.

[21]  Min Zhu,et al.  WCMP: weighted cost multipathing for improved fairness in data centers , 2014, EuroSys '14.

[22]  Matthew Roughan,et al.  The Internet Topology Zoo , 2011, IEEE Journal on Selected Areas in Communications.

[23]  Jennifer Rexford,et al.  HULA: Scalable Load Balancing Using Programmable Data Planes , 2016, SOSR.

[24]  Rong Pan,et al.  Let It Flow: Resilient Asymmetric Load Balancing with Flowlet Switching , 2017, NSDI.

[25]  Klaus Wehrle,et al.  Modeling and Tools for Network Simulation , 2010, Modeling and Tools for Network Simulation.