Iroko A Data Center Emulator for Reinforcement Learning

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

Improving Datacenter Performance and Robustness with Multipath TCP
Finishing Flows Quickly with Preemptive Scheduling
Software-defined networking: Change is hard Ratul Mahajan with Chi-Yao Hong, Rohan Gandhi, Xin Jin, Harry Liu, Vijay Gill, Srikanth Kandula, Mohan Nanduri,
B 黃冠智.
Deconstructing Datacenter Packet Transport Mohammad Alizadeh, Shuang Yang, Sachin Katti, Nick McKeown, Balaji Prabhakar, Scott Shenker Stanford University.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
WiFox: Scaling WiFi Performance for Large Audience Environments Arpit Gupta, Jeongki Min and Injong Rhee NC State University.
PRESENTED BY: TING WANG PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric Radhika Niranjan Mysore, Andreas Pamboris, Nathan.
Improving Datacenter Performance and Robustness with Multipath TCP Costin Raiciu, Sebastien Barre, Christopher Pluntke, Adam Greenhalgh, Damon Wischik,
PFabric: Minimal Near-Optimal Datacenter Transport Mohammad Alizadeh Shuang Yang, Milad Sharif, Sachin Katti, Nick McKeown, Balaji Prabhakar, Scott Shenker.
Balajee Vamanan et al. Deadline-Aware Datacenter TCP (D 2 TCP) Balajee Vamanan, Jahangir Hasan, and T. N. Vijaykumar.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Mohamed Hafeeda, Ahsan Habib et al. Presented By: Abhishek Gupta.
18 Nov 2009 TCP VEGAS Mohammad AlKurbi CMPT – 771: Internet Architecture and Protocols.
1 Modeling and Emulation of Internet Paths Pramod Sanaga, Jonathon Duerig, Robert Ricci, Jay Lepreau University of Utah.
1 Modeling and Taming Parallel TCP on the Wide Area Network Dong Lu,Yi Qiao Peter Dinda, Fabian Bustamante Department of Computer Science Northwestern.
Analysis and Simulation of a Fair Queuing Algorithm
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
ACN: Congestion Control1 Congestion Control and Resource Allocation.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
Information-Agnostic Flow Scheduling for Commodity Data Centers
Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.
Practical TDMA for Datacenter Ethernet
Curbing Delays in Datacenters: Need Time to Save Time? Mohammad Alizadeh Sachin Katti, Balaji Prabhakar Insieme Networks Stanford University 1.
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Oppenheimer.
Sharing Information across Congestion Windows CSE222A Project Presentation March 15, 2005 Apurva Sharma.
1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
Department of Computer Science A Scalable, Commodity Data Center Network Architecture Mohammad Al-Fares Alexander Loukissas Amin Vahdat SIGCOMM’08 Reporter:
Wei Bai with Li Chen, Kai Chen, Dongsu Han, Chen Tian, Hao Wang SING HKUST Information-Agnostic Flow Scheduling for Commodity Data Centers 1 SJTU,
1 On Scalable Edge-based Flow Control Mechanism for VPN Tunnels --- Part 2: Scalability and Implementation Issues Hiroyuki Ohsaki Graduate School of Information.
WB-RTO: A Window-Based Retransmission Timeout Ioannis Psaras Demokritos University of Thrace, Xanthi, Greece.
1 Wide Area Network Emulation on the Millennium Bhaskaran Raman Yan Chen Weidong Cui Randy Katz {bhaskar, yanchen, wdc, Millennium.
Internet research Needs Better Models Sally Floyd, Eddie Kohler ISCI Center for Internet Research, Berkeley, California Presented by Max Podlesny.
Performance Limitations of ADSL Users: A Case Study Matti Siekkinen, University of Oslo Denis Collange, France Télécom R&D Guillaume Urvoy-Keller, Ernst.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
Theophilus Benson*, Ashok Anand*, Aditya Akella*, Ming Zhang + *University of Wisconsin, Madison + Microsoft Research.
Studies of LHCb Trigger Readout Network Design Karol Hennessy University College Dublin Karol Hennessy University College Dublin.
Revisiting Transport Congestion Control Jian He UT Austin 1.
CIS 700-5: The Design and Implementation of Cloud Networks
6.888 Lecture 5: Flow Scheduling
Trading Timeliness and Accuracy in Geo-Distributed Streaming Analytics
OTCP: SDN-Managed Congestion Control for Data Center Networks
Neha Jain Shashwat Yadav
COMP 431 Internet Services & Protocols
Managing Data Transfer in Computer Clusters with Orchestra
Improving Datacenter Performance and Robustness with Multipath TCP
Google’s BBR Congestion control algorithm
Improving Datacenter Performance and Robustness with Multipath TCP
ElasticTree Michael Fruchtman.
Congestion Control and Resource Allocation
Ramakrishna Gummadi, Ramesh Govindan, Konstantinos Psounis
Credit-Scheduled Delay-Bounded Congestion Control for Datacenters
Amogh Dhamdhere, Hao Jiang and Constantinos Dovrolis
File Transfer Issues with TCP Acceleration with FileCatalyst
FAST TCP : From Theory to Experiments
AMP: A Better Multipath TCP for Data Center Networks
The University of Adelaide, School of Computer Science
IETF standard chances of IDNet in NM area
April 10, 2006, Northwestern University
Iroko: A Data Center Emulator for Reinforcement Learning
Centralized Arbitration for Data Centers
COMP/ELEC 429/556 Fall 2017 Homework #2
Lecture 17, Computer Networks (198:552)
AI Applications in Network Congestion Control
Congestion Control and Resource Allocation
Review of Internet Protocols Transport Layer
Fair Queueing.
Introduction to Packet Scheduling
When to use and when not to use BBR:
Presentation transcript:

Iroko A Data Center Emulator for Reinforcement Learning Fabian Ruffy, Michael Przystupa, Ivan Beschastnikh University of British Columbia https://github.com/dcgym/iroko

Reinforcement Learning and Networking

The Data Center: A perfect use case DC challenges are optimization problems Traffic control Resource management Routing Operators have complete control Automation possible Lots of data can be collected Cho, Inho, Keon Jang, and Dongsu Han. "Credit-scheduled delay-bounded congestion control for datacenters.“ SIGCOMM 2017

Two problems… Typical reinforcement learning is not viable for data center operators! Fragile stability Questionable reproducibility Unknown generalizability Prototyping RL is complicated Cannot interfere with live production traffic Offline traces are limited in expressivity Deployment is tedious and slow

Our work: A platform for RL in Data Centers Iroko: open reinforcement learning gym for data center scenarios Inspired by the Pantheon* for WAN congestion control Deployable on a local Linux machine Can scale to topologies with many hosts Approximates real data center conditions Allows arbitrary definition of Reward State Actions *Yan, Francis Y., et al. "Pantheon: the training ground for Internet congestion-control research.“ ATC 2018

Iroko in one slide Policy OpenAI Gym Reward Model State Model Data Collectors Traffic Pattern Action Model Topology Fat-Tree Rack Dumbbell

Use Case: Congestion Control Ideal data center should have: Low latency, high utilization No packet loss or queuing delay Fairness CC variations draw from the reactive TCP  Queueing latency dominates Frequent retransmits reduce goodput Data center performance may be unstable

Predicting Networking Traffic Bandwidth Allocation 10 Flow Pattern Data Collection Policy 10 10 10 Switch 10 10 10

Predicting Networking Traffic Bandwidth Allocation 10 Flow Pattern Data Collection Policy 3.3 10 10 10 3.3 3.4 Switch 10 10 10

Predicting Networking Traffic Bandwidth Allocation 10 Flow Pattern Data Collection Policy 3.3 10 10 Switch 3.3 3.4 10

Can we learn to allocate traffic fairly? Two environments: env_iroko: centralized rate limiting arbiter Agent can set the sending rate of hosts PPO, DDPG, REINFORCE env_tcp: raw TCP Contains implementations of TCP algorithms TCP Cubic, TCP New Vegas, DCTCP Goal: Avoid congestion

Experiment Setup 50000 timesteps Linux default UDP as base transport 5 runs (~7 hours per run) Bottleneck at central link

Results – Dumbbell UDP

Results - Takeaways Challenging real-time environment Noisy observation Exhibits strong credit assignment problem RL algorithms show expected behavior for our gym Achieve better performance than TCP New Vegas More robust algorithms required to learn good policy DDPG and PPO achieve near optimum REINFORCE fails to learn good policy

Contributions Data center reinforcement learning is gaining traction …but it is difficult to prototype and evaluate Iroko is a platform to experiment with RL for data centers intended to train on live traffic early stage work but experiments are promising available on Github: https://github.com/dcgym/iroko