SampleHST: Efficient On-the-Fly Selection of Distributed Traces
Alim Ul Gias, Yicheng Gao, Matthew Sheldon, Jos\'e A. Perusqu\'ia,, Owen O'Brien, Giuliano Casale

TL;DR
SampleHST is an unsupervised, on-the-fly sampling method for distributed traces that prioritizes anomalous traces, reducing storage needs while improving sampling performance significantly.
Contribution
It introduces a novel unsupervised approach combining Half Space Trees and mean-shift clustering for efficient trace sampling in distributed systems.
Findings
Improves sampling performance up to 9.5x
Effectively biases sampling towards anomalous traces
Reduces storage requirements for distributed tracing
Abstract
Since only a small number of traces generated from distributed tracing helps in troubleshooting, its storage requirement can be significantly reduced by biasing the selection towards anomalous traces. To aid in this scenario, we propose SampleHST, a novel approach to sample on-the-fly from a stream of traces in an unsupervised manner. SampleHST adjusts the storage quota of normal and anomalous traces depending on the size of its budget. Initially, it utilizes a forest of Half Space Trees (HSTs) for trace scoring. This is based on the distribution of the mass scores across the trees, which characterizes the probability of observing different traces. The mass distribution from HSTs is subsequently used to cluster the traces online leveraging a variant of the mean-shift algorithm. This trace-cluster association eventually drives the sampling decision. We have compared the performance 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.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Network Security and Intrusion Detection · Privacy-Preserving Technologies in Data
