Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems
The DOI matches its Crossref record.
Abstract
Distributed systems generate a large amount of monitoring data such as log files to track their operational status. However, it is hard to correlate such monitoring data effectively across distributed systems and along observation time for system management. In previous work, we proposed a concept named flow intensity to measure the intensity with which internal monitoring data reacts to the volume of user requests. We calculated flow intensity measurements from monitoring data and proposed an algorithm to automatically search constant relationships between flow intensities measured at various points across distributed systems. If such relationships hold all the time, we regard them as invariants of the underlying systems. Invariants can be used to characterize complex systems and support various system management tasks. However, the computational complexity of the previous invariant search algorithm is high so that it may not scale well in large systems with thousands of measurements. In this paper, we propose two efficient but approximate algorithms for inferring invariants in large-scale systems. The computational complexity of new randomized algorithms is significantly reduced, and experimental results from a real system are also included to demonstrate the accuracy and efficiency of our new algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
AutoMAP: Diagnose Your Microservice-based Web Applications Automatically
Ma, M., Xu, J., Wang, Y., Chen, P., Zhang, Z., & Wang, P. (2020) · Proceedings of The Web Conference 2020 · doi:10.1145/3366423.3380111 · Cited by 129
“For instance, a structure called “invariant graph” [20] is proposed to depict the anomaly propagation topology.”
BackgroundMS-Rank: Multi-Metric and Self-Adaptive Root Cause Diagnosis for Microservice Applications
Ma, M., Lin, W., Pan, D., & Wang, P. (2019) · 2019 IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws.2019.00022 · Cited by 58
ServiceRank: Root Cause Identification of Anomaly in Large-Scale Microservice Architectures
Ma, M., Lin, W., Pan, D., & Wang, P. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3083671 · Cited by 46
Self-Adaptive Root Cause Diagnosis for Large-Scale Microservice Architecture
Ma, M., Lin, W., Pan, D., & Wang, P. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.2993251 · Cited by 37
Metadata
- Authors
- Jiang, G., Chen, H., & Yoshihira, K.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2007-11
- Volume
- 19
- Issue
- 11
- Pages
- 1508-1523
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2120217028
- Cited by
- 58
- References
- 0
- FWCI
- 3.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems. https://app.cochat.ai/papers/10.1109/tkde.2007.190648
- The paper
- Jiang, G., Chen, H., & Yoshihira, K. (2007). Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2007.190648
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.