The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Mining Causality of Network Events in Log Data
Abstract
Network log messages (e.g., syslog) are expected to be valuable and useful information to detect unexpected or anomalous behavior in large scale networks. However, because of the huge amount of system log data collected in daily operation, it is not easy to extract pinpoint system failures or to identify their causes. In this paper, we propose a method for extracting the pinpoint failures and identifying their causes from network syslog data. The methodology proposed in this paper relies on causal inference that reconstructs causality of network events from a set of time series of events. Causal inference can filter out accidentally correlated events, thus it outputs more plausible causal events than traditional cross-correlation-based approaches can. We apply our method to 15 months' worth of network syslog data obtained from a nationwide academic network in Japan. The proposed method significantly reduces the number of pseudo correlated events compared with the traditional methods. Also, through three case studies and comparison with trouble ticket data, we demonstrate the effectiveness of the proposed method for practical network operation.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Tickets and change records capture intent, approval, and accountability [55], [65].”
From Large language models for agentic NetOps and AIOps: Architectures, evaluation, and safety (2027) · cites this paper as [65]
In the citing paper
“They also help define operational ground truth, including whether mitigation was accepted, whether a change was rolled back, and whether a similar incident later recurred [65], [66].”
From Large language models for agentic NetOps and AIOps: Architectures, evaluation, and safety (2027) · cites this paper as [65]
In the citing paper
“NetOps practitioners assess risk using criteria that align with autonomy decisions, such as the number of affected devices, novelty of the change, the adequacy of verification procedures, and the history of similar changes causing incidents [73], [70], [65].”
From Large language models for agentic NetOps and AIOps: Architectures, evaluation, and safety (2027) · cites this paper as [65]
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
(2017) · Encyclopedia of Machine Learning and Data Mining · doi:10.1007/978-1-4899-7687-1_100245 · Cited by 1,424
An Algorithm for Fast Recovery of Sparse Causal Graphs
Spirtes, P., & Glymour, C. (1991) · Social Science Computer Review · doi:10.1177/089443939100900106 · Cited by 953
Estimating high-dimensional directed acyclic graphs with the PC-algorithm
Kalisch, M., & Bühlmann, P. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0510436 · Cited by 591
Execution Anomaly Detection in Distributed Systems through Unstructured Log Analysis
Fu, Q., Lou, J.-G., Wang, Y., & Li, J. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.60 · Cited by 542
Ramoni, M. F., & Sebastiani, P. (2005) · Encyclopedia of Data Warehousing and Mining · doi:10.4018/978-1-59140-557-3.ch128 · Cited by 541
A data clustering algorithm for mining patterns from event logs
Vaarandi, R. (2004) · Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) (IEEE Cat. No.03EX764) · doi:10.1109/ipom.2003.1251233 · Cited by 453
Order-independent constraint-based causal structure learning
Colombo, D., & Maathuis, M. H. (2014) · arXiv (Cornell University) · doi:10.5555/2627435.2750365 · Cited by 439
Clustering event logs using iterative partitioning
Makanju, A. A. O., Zincir-Heywood, A. N., & Milios, E. E. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557154 · Cited by 338
Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm
KalischMarkus, & BühlmannPeter (2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248681 · Cited by 330
Research works printed but not linked: 1
- heckerman, 2000, Dependency networks for inference, collaborative filtering, and data visualization, J Mach Learn Res, 1, 49
Cited by
Causal analysis of network logs with layered protocols and topology knowledge
Kobayashi, S., Otomo, K., & Fukuda, K. (2019) · 2019 15th International Conference on Network and Service Management (CNSM) · doi:10.23919/cnsm46954.2019.9012718 · Cited by 13
Self-citationLarge language models for agentic NetOps and AIOps: Architectures, evaluation, and safety
Bilal, M., Crowcroft, J., Wang, R., Xu, X., & Dustdar, S. (2027) · Computer Science Review · doi:10.1016/j.cosrev.2026.101075 · Cited by 10
“A causal diagnosis method aims to recover this propagation structure, so that the output is not only a ranked root cause but also an explanation path linking symptoms to candidate causes [49], [50].”
Influential
Metadata
- Authors
- Kobayashi, S., Otomo, K., Fukuda, K., & Esaki, H.
- Affiliations
- The University of Tokyo (JP)
- National Institute of Informatics (JP)
- Venue
- IEEE Transactions on Network and Service Management
- Published
- 2018-03
- Volume
- 15
- Issue
- 1
- Pages
- 53-67
- ISSN
- 1932-4537 (ISSN-L)
- OpenAlex
- W2771013155
- Cited by
- 63
- References
- 41
- Citations by year
- 2026: 7 · 2025: 5 · 2024: 5 · 2023: 7 · 2022: 10 · 2021: 11 · 2020: 8 · 2019: 7 · 2018: 3
- FWCI
- 3.28
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Transactions on Network and Service Management (publishedVersion)
- Funders
- NTT
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
- Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
- Physical Sciences › Computer Science › Computer Networks and Communications › Mobile Agent-Based Network Management
- Keywords
- syslog, causal inference, anomaly detection, cross correlation function, academic networks
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: Mining Causality of Network Events in Log Data. https://app.cochat.ai/papers/10.1109/tnsm.2017.2778096
- The paper
- Kobayashi, S., Otomo, K., Fukuda, K., & Esaki, H. (2018). Mining Causality of Network Events in Log Data. IEEE Transactions on Network and Service Management. https://doi.org/10.1109/tnsm.2017.2778096
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.