Mint: Cost-Efficient Tracing with All Requests Collection via Commonality and Variability Analysis
Distributed traces contain valuable information but are often massive in volume, posing a core challenge in tracing framework design: balancing the tradeoff between preserving essential trace information and reducing trace volume. To address this tradeoff, previous approaches typically used a '1 or 0' sampling strategy: retaining sampled traces while completely discarding unsampled ones. However, based on an empirical study on real-world production traces, we discover that the '1 or 0' strategy actually fails to effectively balance this tradeoff.
Authors
- Kunyi Chen (ORCID: https://orcid.org/0000-0003-4359-9861)
- Huxing Zhang (ORCID: https://orcid.org/0009-0007-1761-9044)
- Haiyu Huang (ORCID: https://orcid.org/0009-0000-6146-2493)
- Guangba Yu (ORCID: https://orcid.org/0000-0001-6195-9088)
- Yilun Wang (ORCID: https://orcid.org/0000-0001-9262-8652)
- Pengfei Chen (ORCID: https://orcid.org/0000-0003-0972-6900)
- Zilong He (ORCID: https://orcid.org/0000-0001-7963-082X)
- Qi Zhou (ORCID: https://orcid.org/0000-0002-7759-800X)
- Cheng Chen (ORCID: https://orcid.org/0009-0006-6492-9881)
Institutions
- Sun Yat-sen University (CN)
- Alibaba Group (China) (CN)
Publication Details
- Published
- 2025-02-06
- DOI
- https://doi.org/10.1145/3669940.3707287
- Citations
- 1
- Primary Topic
- Network Security and Intrusion Detection
- Type
- article
- Field-Weighted Citation Impact
- 1.49