Fault monitoring with sequential matrix factorization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Autonomous and Adaptive Systems Year : 2015

Fault monitoring with sequential matrix factorization


For real-world distributed systems, the knowledge component at the core of the MAPE-K loop has to be inferred, as it cannot be realistically assumed to be defined a priori. Accordingly, this paper considers fault monitoring as a latent factors discovery problem. In the context of end-to-end probing, the goal is to devise an efficient sampling policy that makes the best use of a constrained sampling budget. Previous work addresses fault monitoring in a Collaborative Prediction framework, where the information is a snapshot of the probes outcomes. Here, we take into account the fact that the system dynamically evolves at various time scales. We propose and evaluate Sequential Matrix Factor-ization (SMF) that exploits both the recent advances in matrix factoriza-tion for the instantaneous information and a new sampling heuristics based on historical information. The effectiveness of the SMF approach is exemplified on datasets of increasing difficulty and compared with state of the art history-based or snapshot-based methods. In all cases, strong adaptivity under the specific flavor of active learning is required to unleash the full potential of coupling the most confident and the most uncertain sampling heuristics, which is the cornerstone of SMF.
Fichier principal
Vignette du fichier
taasseqmAV.pdf (452.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01176013 , version 1 (02-10-2015)



Dawei Feng, Cecile Germain. Fault monitoring with sequential matrix factorization. ACM Transactions on Autonomous and Adaptive Systems, 2015, 10 (3), pp.20:1--20:25. ⟨10.1145/2797141⟩. ⟨hal-01176013⟩
206 View
318 Download



Gmail Facebook Twitter LinkedIn More