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.

Authors

Institutions

Publication Details

Journal
Proceedings of the ACM on Networking
Published
2026-11-19
DOI
https://doi.org/10.1145/3856966
Primary Topic
Network Traffic and Congestion Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

m4: A Learned Flow-level Network Backend

Chenning Li, Arash Nasr-Esfahany, Prateesh Goyal, Kevin Zhao et al.
Proceedings of the ACM on Networking
Network Traffic and Congestion Control
article

m4: A Learned Flow-level Network Backend

Chenning Li, Arash Nasr-Esfahany, Prateesh Goyal, Kevin Zhao, Anton A. Zabreyko, Mohammad Alizadeh, Thomas Anderson, Om Chabra
article en

Abstract

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.

Proceedings of the ACM on NetworkingVol. 4(CoNEXT4)
Microsoft (United States) (US), University of Washington (US), Massachusetts Institute of Technology (US)
Network Traffic and Congestion Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon