Monitoring Networked Applications With Incremental Quantile Estimation
John M. Chambers, David A. James, Diane Lambert, Scott Vander Wiel

TL;DR
This paper introduces an Incremental Quantile estimation method for monitoring networked application performance, enabling efficient, distributed computation of quality metrics like medians and tail quantiles with limited data transfer.
Contribution
The paper presents a novel incremental quantile estimation technique tailored for distributed networked applications, reducing data transfer while accurately computing performance metrics.
Findings
Effective in real and simulated network scenarios
Accurately estimates medians and tail quantiles
Reduces network bandwidth for performance monitoring
Abstract
Networked applications have software components that reside on different computers. Email, for example, has database, processing, and user interface components that can be distributed across a network and shared by users in different locations or work groups. End-to-end performance and reliability metrics describe the software quality experienced by these groups of users, taking into account all the software components in the pipeline. Each user produces only some of the data needed to understand the quality of the application for the group, so group performance metrics are obtained by combining summary statistics that each end computer periodically (and automatically) sends to a central server. The group quality metrics usually focus on medians and tail quantiles rather than on averages. Distributed quantile estimation is challenging, though, especially when passing large amounts of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
