Using Hidden Semi-Markov Models for Effective Online Failure Prediction
The DOI matches its Crossref record.
Abstract
A proactive handling of faults requires that the risk of upcoming failures is continuously assessed. One of the promising approaches is online failure prediction, which means that the current state of the system is evaluated in order to predict the occurrence of failures in the near future. More specifically, we focus on methods that use event-driven sources such as errors. We use hidden semi-Markov models (HSMMs)for this purpose and demonstrate effectiveness based on field data of a commercial telecommunication system. For comparative analysis we selected three well-known failure prediction techniques: a straightforward method that is based on a reliability model, dispersion frame technique by Lin and Siewiorek and the eventset-based method introduced by Vilalta et al. We assess and compare the methods in terms of precision, recall, F-measure, false-positive rate, and computing time. The experiments suggest that our HSMM approach is very effective with respect to online failure prediction.
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
A survey of online failure prediction methods
Salfner, F., Lenk, M., & Malek, M. (2010) · ACM Computing Surveys · doi:10.1145/1670679.1670680 · Cited by 560
Self-citationClustering 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
Survey on Models and Techniques for Root-Cause Analysis
Solé, M., Muntés-Mulero, V., Rana, A. I., & Estrada, G. (2017) · arXiv · doi:10.48550/arxiv.1701.08546 · Cited by 74
Mining causality of network events in log data
Kobayashi, S., Otomo, K., Fukuda, K., & Esaki, H. (2018) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2017.2778096 · Cited by 63
Anomaly Detection in Microservice-Based Systems
Nobre, J., Pires, E. J. S., & Reis, A. (2023) · Applied Sciences · doi:10.3390/app13137891 · Cited by 34
Metadata
- Authors
- Salfner, F., & Malek, M.
- Venue
- 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)
- Publisher
- IEEE
- Published
- 2007-10
- Pages
- 161-174
- ISSN
- 1060-9857 (ISSN-L)
- OpenAlex
- W2111038504
- Cited by
- 133
- References
- 0
- FWCI
- 23.43
- Type
- conference paper
- 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: Using Hidden Semi-Markov Models for Effective Online Failure Prediction. https://app.cochat.ai/papers/10.1109/srds.2007.35
- The paper
- Salfner, F., & Malek, M. (2007). Using Hidden Semi-Markov Models for Effective Online Failure Prediction. 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007). https://doi.org/10.1109/srds.2007.35
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.