ENERO: Efficient Real-Time Routing Optimization

Wide Area Networks (WAN) are a key infrastructure in today’s society. During the last years, WANs have seen a considerable increase in network’s traffic as well as in the number of network applications. To enable the deployment of emergent network applications (e.g., Vehicular networks, Internet of Things), existing Traffic Engineering (TE) solutions must be able to achieve high performance real-time network operation. In addition, TE solutions must be able to adapt to dynamic scenarios (e.g., changes in the traffic matrix or topology link failures). However, current TE technologies rely on hand-crafted heuristics or computationally expensive solvers, which are not suitable for highly dynamic TE scenarios. In this paper we propose Enero, an efficient real-time TE engine. Enero is based on a two-stage optimization process. In the first one, it leverages Deep Reinforcement Learning (DRL) to optimize the routing configuration by generating a long-term TE strategy. We integrated a Graph Neural Network (GNN) into the DRL agent to enable efficient TE on dynamic networks. In the second stage, Enero uses a Local Search algorithm to improve DRL’s solution without adding computational overhead to the optimization process. Enero offers a lower bound in performance, enabling the network operator to know the worstcase performance of the DRL agent. We believe that the lower bound in performance will lighten the path of deploying DRLbased solutions in real-world network scenarios. The experimental results indicate that Enero is able to operate in realworld dynamic network topologies in 4.5 seconds on average for topologies up to 100 edges.

[1]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[2]  Junjie Zhang,et al.  CFR-RL: Traffic Engineering With Reinforcement Learning in SDN , 2020, IEEE Journal on Selected Areas in Communications.

[3]  K. Jarrod Millman,et al.  Array programming with NumPy , 2020, Nat..

[4]  Yuval Tassa,et al.  Continuous control with deep reinforcement learning , 2015, ICLR.

[5]  Sergey Levine,et al.  High-Dimensional Continuous Control Using Generalized Advantage Estimation , 2015, ICLR.

[6]  Helio Waldman,et al.  The Impending Optical Network Capacity Crunch , 2018, 2018 SBFoton International Optics and Photonics Conference (SBFoton IOPC).

[7]  Xin Jin,et al.  SketchVisor: Robust Network Measurement for Software Packet Processing , 2017, SIGCOMM.

[8]  Stefano Vissicchio,et al.  Expect the unexpected: Sub-second optimization for segment routing , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[9]  Stefan Behnel,et al.  Cython: The Best of Both Worlds , 2011, Computing in Science & Engineering.

[10]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[11]  A. Cabellos-Aparicio,et al.  RouteNet: Leveraging Graph Neural Networks for Network Modeling and Optimization in SDN , 2019, IEEE Journal on Selected Areas in Communications.

[12]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Xin Jin,et al.  Neural packet classification , 2019, SIGCOMM.

[14]  Alec Radford,et al.  Proximal Policy Optimization Algorithms , 2017, ArXiv.

[15]  Olivier Bonaventure,et al.  A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks , 2015, SIGCOMM.

[16]  Ah Chung Tsoi,et al.  The Graph Neural Network Model , 2009, IEEE Transactions on Neural Networks.

[17]  Tiejun J. Xia,et al.  How will optical transport deal with future network traffic growth? , 2014, 2014 The European Conference on Optical Communication (ECOC).

[18]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[19]  Jean C. Walrand,et al.  Knowledge-Defined Networking: Modelització de la xarxa a través de l’aprenentatge automàtic i la inferència , 2016 .

[20]  Albert Cabellos-Aparicio,et al.  Feature Engineering for Deep Reinforcement Learning Based Routing , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[21]  Feng Liu,et al.  AuTO: scaling deep reinforcement learning for datacenter-scale automatic traffic optimization , 2018, SIGCOMM.

[22]  Louis-Martin Rousseau,et al.  Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization , 2020, AAAI.

[23]  Nei Kato,et al.  State-of-the-Art Deep Learning: Evolving Machine Intelligence Toward Tomorrow’s Intelligent Network Traffic Control Systems , 2017, IEEE Communications Surveys & Tutorials.

[24]  Chi Harold Liu,et al.  Experience-driven Networking: A Deep Reinforcement Learning based Approach , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[25]  Ananth Balashankar,et al.  Software Defined Networking , 2019, 2019 19th International Conference on Sciences and Techniques of Automatic Control and Computer Engineering (STA).

[26]  Nicolas Le Roux,et al.  Understanding the impact of entropy on policy optimization , 2018, ICML.

[27]  Pierre Schaus,et al.  REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms , 2017, ArXiv.

[28]  Demis Hassabis,et al.  Mastering the game of Go without human knowledge , 2017, Nature.

[29]  D. Saad,et al.  Communication networks beyond the capacity crunch , 2016, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[30]  Clarence Filsfils,et al.  The Segment Routing Architecture , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).

[31]  Peng Liu,et al.  Elastic sketch: adaptive and fast network-wide measurements , 2018, SIGCOMM.

[32]  Mung Chiang,et al.  Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

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

[34]  Wojciech Zaremba,et al.  OpenAI Gym , 2016, ArXiv.

[35]  Olivier Bonaventure,et al.  CG4SR: Near Optimal Traffic Engineering for Segment Routing with Column Generation , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[36]  Hongzi Mao,et al.  Learning scheduling algorithms for data processing clusters , 2018, SIGCOMM.

[37]  Albert Cabellos-Aparicio,et al.  Deep Reinforcement Learning meets Graph Neural Networks: exploring a routing optimization use case. , 2020 .

[38]  T. V. Lakshman,et al.  Optimized network traffic engineering using segment routing , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[39]  Roy Friedman,et al.  Nitrosketch: robust and general sketch-based monitoring in software switches , 2019, SIGCOMM.