Kevin Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kevin Zhao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Arash Nasr-Esfahany
CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA
2 shared publications - Chenning Li
CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA
2 shared publications - Mohammad Alizadeh
Massachusetts Institute of Technology, Cambridge, MA, USA
2 shared publications - Prateesh Goyal
Microsoft Research, Redmond, Washington, USA
2 shared publications - Thomas Anderson
University of Washington, Seattle, USA
2 shared publications - Anton A. Zabreyko
CSAIL, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA
1 shared publication
Latest Publications
- Open Access
- 19 November 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT4) , 1-24
m4: A Learned Flow-level Network Backend
Distributed-application simulators need to model the completion times of individual network transfers because later computation or communication may depend on the timing of earlier completions. Packet-level simulators can model detailed queue and protocol dynamics but are too slow for application modeling. Flow-level models are scalable but inaccurate; they ignore queue buildup and transient contention effects. Existing learned network models are fast but typically are limited to preset traces rather than acting in response to dynamic application behavior. We present m4, a learned flow-level network backend that maintains state across flow arrivals and completions and returns individual completion callbacks. m4 represents the network as a stateful flow-link bipartite graph and uses dense supervision from intermediate signals to improve accuracy. We first train m4 on packet-simulator labels and evaluate on standalone simulation, where it reduces mean error by up to 57.3% versus a flow-level simulator. We then integrate m4 into SimAI, where it achieves 10.9% mean error (vs. 23.3% for the flow-level backend) while delivering a median 40.1x speedup over the packet-level backend. On an RDMA testbed, we fine-tune the checkpoint on 4-host traces and evaluate on 12-host hardware, with median application completion-time error of 15.1% vs. 31.0% for a calibrated packet-level backend and 88.4% for the flow-level backend.
- 19 November 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 4 (CoNEXT4) , 1-24
Open Accessm4: A Learned Flow-level Network Backend
Distributed-application simulators need to model the completion times of individual network transfers because later computation or communication may depend on the timing of earlier completions. Packet-level simulators can model detailed queue and protocol dynamics but are too slow for application modeling. Flow-level models are scalable but inaccurate; they ignore queue buildup and transient contention effects. Existing learned network models are fast but typically are limited to preset traces rather than acting in response to dynamic application behavior. We present m4, a learned flow-level network backend that maintains state across flow arrivals and completions and returns individual completion callbacks. m4 represents the network as a stateful flow-link bipartite graph and uses dense supervision from intermediate signals to improve accuracy. We first train m4 on packet-simulator labels and evaluate on standalone simulation, where it reduces mean error by up to 57.3% versus a flow-level simulator. We then integrate m4 into SimAI, where it achieves 10.9% mean error (vs. 23.3% for the flow-level backend) while delivering a median 40.1x speedup over the packet-level backend. On an RDMA testbed, we fine-tune the checkpoint on 4-host traces and evaluate on 12-host hardware, with median application completion-time error of 15.1% vs. 31.0% for a calibrated packet-level backend and 88.4% for the flow-level backend.
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 813-827
m3: Accurate Flow-Level Performance Estimation using Machine Learning
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.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 813-827
Open Accessm3: Accurate Flow-Level Performance Estimation using Machine Learning
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.