Cited by 154Software System Performance and ReliabilitySoftware Testing and Debugging TechniquesAnomaly Detection Techniques and Applications

Anomaly Detection Using Program Control Flow Graph Mining From Execution Logs

Nandi, Animesh, Mandal, Atri, Atreja, Shubham, Dasgupta, Gargi B., Bhattacharya, Subhrajit·2016·Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Abstract

We focus on the problem of detecting anomalous run-time behavior of distributed applications from their execution logs. Specifically we mine templates and template sequences from logs to form a control flow graph (cfg) spanning distributed components. This cfg represents the baseline healthy system state and is used to flag deviations from the expected behavior of runtime logs. The novelty in our work stems from the new techniques employed to: (1) overcome the instrumentation requirements or application specific assumptions made in prior log mining approaches, (2) improve the accuracy of mined templates and the cfg in the presence of long parameters and high amount of interleaving respectively, and (3) improve by orders of magnitude the scalability of the cfg mining process in terms of volume of log data that can be processed per day. We evaluate our approach using (a) synthetic log traces and (b) multiple real-world log datasets collected at different layers of application stack. Results demonstrate that our template mining, cfg mining, and anomaly detection algorithms have high accuracy. The distributed implementation of our pipeline is highly scalable and has more than 500 GB/day of log data processing capability even on a 10 low-end VM based (Spark + Hadoop) cluster. We also demonstrate the efficacy of our end-to-end system using a case study with the Openstack VM provisioning system.

Integrity signals

Registry

Crossref · 10.1145/2939672.2939712

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Most related work infers the application topology using Control Flow Graphs extracted from logs or distributed traces to capture how microservices depend on each other.

    “Most related work infers the application topology. It does this by using Control Flow Graphs (CFG) extracted from logs or distributed traces to capture how microservices depend on each other [11].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Nandi, A., Mandal, A., Atreja, S., Dasgupta, G. B., & Bhattacharya, S.
Affiliations
  • IBM (India) (IN)
  • Indian Institute of Technology Kanpur (IN)
Venue
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Publisher
ACM
Published
2016-08-13
Pages
215-224
OpenAlex
W2508465325
Cited by
154
References
24
Citations by year
2026: 13 · 2025: 15 · 2024: 15 · 2023: 26 · 2022: 18 · 2021: 29 · 2020: 11 · 2019: 9 · 2018: 8 · 2017: 10
FWCI
7.69
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
  • Physical Sciences › Computer Science › Software › Software Testing and Debugging Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Anomaly Detection Techniques and Applications
Keywords
anomaly detection, execution logs, log mining, distributed applications, scalability

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