Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. m3: Accurate Flow-Level Performance Estimation using Machine Learning

m3: Accurate Flow-Level Performance Estimation using Machine Learning

Thumbnail Image
Download
Name

3651890.3672243.pdf

Size

1.75 MB

Format

Adobe PDF

Checksum (MD5)

91b17fe9baad4c78112bc3cc497e0f4f

Download all files submitted through automated deposit
3651890.3672243.zip (1.71 MB)
Author(s)
Li, Chenning
•
Nasr-Esfahany, Arash
•
Zhao, Kevin
•
Noorbakhsh, Kimia
•
Goyal, Prateesh
•
Alizadeh, Mohammad
•
Anderson, Thomas
Date Issued
August 4, 2024
Publisher
ACM|ACM SIGCOMM 2024 Conference
Citation
Chenning Li, Arash Nasr-Esfahany, Kevin Zhao, Kimia Noorbakhsh, Prateesh Goyal, Mohammad Alizadeh, and Thomas E. Anderson. 2024. M3: Accurate Flow-Level Performance Estimation using Machine Learning. In Proceedings of the ACM SIGCOMM 2024 Conference (ACM SIGCOMM '24). Association for Computing Machinery, New York, NY, USA, 813–827.
Version
Final published version
Abstract
Data center network operators often need accurate estimates of aggregate network performance. Unfortunately, existing methods for estimating aggregate network statistics are either inaccurate or too slow to be practical at the data center scale. In this paper, we develop and evaluate a scale-free, fast, and accurate model for estimating data center network tail latency performance for a given workload, topology, and network configuration. First, we show that path-level simulations---simulations of traffic that intersects a given path---produce almost the same aggregate statistics as full network-wide packet-level simulations. We use a simple and fast flow-level fluid simulation in a novel way to capture and summarize essential elements of the path workload, including the effect of cross-traffic on flows on that path. We use this coarse simulation as input to a machine-learning model to predict path-level behavior, and run it on a sample of paths to produce accurate network-wide estimates. Our model generalizes over the choice of congestion control (CC) protocol, CC protocol parameters, and routing. Relative to Parsimon, a state-of-the-art system for rapidly estimating aggregate network tail latency, our approach is significantly faster (5.7×), more accurate (45.9% less error), and more robust.
Description
ACM SIGCOMM ’24, August 4–8, 2024, Sydney, NSW, Australia
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/156674
DOI of Published Version
https://doi.org/10.1145/3651890.3672243
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.