A Reinforcement Learning Based Network Scheduler for Deadline-Driven Data Transfers

We consider a science network that runs applications requiring data transfers to be completed within a given deadline. The underlying network is a software defined network (SDN) that supports fine grain real-time network telemetry. Deadline-aware data transfer requests are made to a centralized network controller that schedules the flows by setting pacing rates of the deadline flows and metering the background traffic at the ingress routers. The goal of the scheduling algorithm is to maximize the number of flows that meet the deadline while maximizing the network utilization. In this paper, we develop a Reinforcement Learning (RL) agent based network controller and compare its performance with well-known heuristics. For a network consisting of a single bottleneck link, we show that the RL-agent based network controller performs as well as Earliest Deadline First (EDF), which is known to be optimal. We also show that the RL-agent performs significantly better than an idealized TCP protocol in which the bottleneck link capacity is equally shared among the competing flows. We also study the sensitivity of the RL-agent controller for different parameter settings and reward functions.

[1]  Uwe Schwiegelshohn,et al.  Theory and Practice in Parallel Job Scheduling , 1997, JSSPP.

[2]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[3]  C. Broeck,et al.  Laser Interferometer Gravitational-wave Observatory , 2012 .

[4]  Wang,et al.  Review of road traffic control strategies , 2003, Proceedings of the IEEE.

[5]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[6]  Christopher D. Gill,et al.  Real-Time Scheduling via Reinforcement Learning , 2010, UAI.

[7]  Daniel Grosu,et al.  Incentive Compatible Online Scheduling of Malleable Parallel Jobs with Individual Deadlines , 2010, 2010 39th International Conference on Parallel Processing.

[8]  Urs Hölzle,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

[9]  Min Zhu,et al.  B4: experience with a globally-deployed software defined wan , 2013, SIGCOMM.

[10]  Srikanth Kandula,et al.  Calendaring for wide area networks , 2014, SIGCOMM.

[11]  Christopher Bebek,et al.  The Zwicky Transient Facility: Observing System , 2014, Astronomical Telescopes and Instrumentation.

[12]  Amin Vahdat,et al.  BwE: Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing , 2015, Comput. Commun. Rev..

[13]  Srikanth Kandula,et al.  Resource Management with Deep Reinforcement Learning , 2016, HotNets.

[14]  David Silver,et al.  Deep Reinforcement Learning with Double Q-Learning , 2015, AAAI.

[15]  Demis Hassabis,et al.  Mastering the game of Go with deep neural networks and tree search , 2016, Nature.

[16]  Ness B. Shroff,et al.  Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks , 2016, IEEE/ACM Transactions on Networking.

[17]  Dipak Ghosal,et al.  Dynamic traffic routing in a network with adaptive signal control , 2017 .

[18]  Ming Zhang,et al.  Guaranteeing Deadlines for Inter-Data Center Transfers , 2017, IEEE/ACM Transactions on Networking.

[19]  Dipak Ghosal,et al.  Calibers: A bandwidth calendaring paradigm for science workflows , 2018, Future Gener. Comput. Syst..

[20]  Lavanya Ramakrishnan,et al.  The future of scientific workflows , 2018, Int. J. High Perform. Comput. Appl..

[21]  R. Poggiani Multi-messenger Observations of a Binary Neutron Star Merger , 2019, Proceedings of Frontier Research in Astrophysics – III — PoS(FRAPWS2018).