Prateesh Goyal

Prateesh Goyal

Auto-generated profile, based on publicly available information

Prateesh Goyal

Microsoft Research, Redmond, United States of America

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2024
Verified
Conference Paper
Open access
CLChenning Li
Chenning Li
ANArash Nasr-Esfahany
Arash Nasr-Esfahany
KZKevin Zhao
Kevin Zhao
KNKimia Noorbakhsh
Kimia Noorbakhsh
PGPrateesh Goyal
Prateesh Goyal
TAThomas E. Anderson
Thomas E. Anderson
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.

10 September 2023
Verified
Conference Paper
Open access
EGEashan Gupta
Eashan Gupta
PGPrateesh Goyal
Prateesh Goyal
IMIlias Marinos
Ilias Marinos
CZChenxingyu Zhao
Chenxingyu Zhao
RMRadhika Mittal
Radhika Mittal
RCRanveer Chandra
Ranveer Chandra

4 August 2024
Verified
Conference Paper
Open access
ATAmmar Tahir
Ammar Tahir
PGPrateesh Goyal
Prateesh Goyal
IMIlias Marinos
Ilias Marinos
MEMike Evans
Mike Evans
RMRadhika Mittal
Radhika Mittal
ISPs routinely rate-limit user traffic. In addition to correctly enforcing the desired rates, rate-limiting mechanisms must be able to support rich rate-sharing policies within each traffic aggregate (e.g. per-flow fairness, weighted fairness, and prioritization). This must be done at scale to support the vast magnitude of users efficiently. There are two primary rate-limiting mechanisms - traffic shaping (that buffers packets in queues to enforce the desired rates and policies) and traffic policing (that filters packets as per the desired rates without buffering them). Policers are lightweight and scalable but don't support rich policy enforcement and often provide poor rate enforcement (being notoriously hard to configure). Shapers, on the other hand, achieve desired rates and policies, but at the cost of high system resource (memory and CPU) utilization impacting scalability. This paper explores whether we can get the best of both worlds. We present our system BC-PQP, which augments a policer with (i) multiple phantom queues that simulate buffer occupancy using counters and enable rich policy enforcement, and (ii) a novel burst-control mechanism that enables auto-configuration of the queues for correct rate enforcement. Our system achieves the rate and policy enforcement properties close to that of a shaper with 7× higher efficiency.

22 August 2017
Verified
Conference Paper
Open access
VNVikram Nathan
Vikram Nathan
SNSrinivas Narayana
Srinivas Narayana
ASAnirudh Sivaraman
Anirudh Sivaraman
PGPrateesh Goyal
Prateesh Goyal
VAVenkat Arun
Venkat Arun
CKChanghoon Kim
Changhoon Kim
We demonstrate Marple [15], a system that allows network operators to measure a wide variety of performance metrics in real time. It consists of a performance query language, Marple, modeled on familiar functional operators like map, filter, and groupby. Marple is supported by a programmable key-value store on switches, which can compute flexible aggregated statistics (e.g., per-flow counts, moving averages over queueing latencies) over packets at line rate. Our switch design implements performance queries which could previously run only on end hosts, while utilizing only a modest fraction of switch hardware resources. To demonstrate the utility of Marple, we compile Marple queries to a P4-programmable software switch running within Mininet. We demonstrate two example use cases of Marple: diagnosing the root cause of latency spikes and measuring the flowlet size distribution.

11 August 2026
Verified
Conference Paper
Open access
ATAmmar Tahir
Ammar Tahir
PGPrateesh Goyal
Prateesh Goyal
YCYongzhou Chen
Yongzhou Chen
RMRadhika Mittal
Radhika Mittal
Modern Internet traffic is increasingly dominated by interactive video applications (e.g. cloud gaming, conferencing, etc) that require high throughput, extremely low delay, and near-zero drop rates. Meeting these requirements is inherently challenging for such applications because video encoders often need to overshoot the target bitrates, causing transient traffic bursts. These bursts lead to inevitable delays and drops on traditional Internet bottlenecks with fixed capacities and finite physical queues. However, we observe that modern Internet bottlenecks are often artificial, where ISPs intentionally limit user's traffic to subscribed rates. Our work exploits the flexibility afforded in these artificial bottlenecks to achieve zero queuing and drops for interactive applications. Specifically, we make a case for using traffic policers (implemented as token bucket filters) at the ISPs to enforce desired rate limits on an average. Policers can absorb traffic bursts without any queuing, but incur packet drops. Our system, QLDL, avoids packet drops by augmenting the policer and the endpoints with a light-weight explicit rate control mechanism. Our prototype evaluation using WebRTC applications shows how QLDL thus achieves zero queuing and drops, thereby improving interactive applications' QoE on all fronts: 2× higher bitrate, 2 – 3× lower frame delays, and 20× lower playback freezes, when compared to state-of-the-art baselines.

19 November 2026 in Proceedings of the ACM on Networking
Verified
Journal Article
Open access
CLChenning Li
Chenning Li
AZAnton A. Zabreyko
Anton A. Zabreyko
OCOm Chabra
Om Chabra
ANArash Nasr-Esfahany
Arash Nasr-Esfahany
KZKevin Zhao
Kevin Zhao
TAThomas Anderson
Thomas Anderson
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.