Probabilistic fault localization with sliding windows  

作　　者：ZHANG Cheng LIAO JianXin LI TongHong ZHU XiaoMin 

机构地区：[1]School of Electronic and Information Engineering,Beijing Jiaotong University,Beijing 100044,China [2]State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China [3]EBUPT Information Technology Co.Ltd.,Beijing 100191,China [4]Computer Science Department,Technical University of Madrid,Madrid 28660,Spain

出　　处：《Science China(Information Sciences)》2012年第5期1186-1200,共15页中国科学（信息科学）（英文版）

基　　金：supported in part by National Natural Science Foundation of China (Grant Nos. 60833002,61072057,60902051,61101119,61121001);Program for Changjiang Scholars and Innovative Research Team in University (Grant No. IRT1049);National Science & Technology Major Project of China (Grant No. 2011ZX03002-001-01);Beijing Natural Science Foundation (Grant No. 4091003);MICINN under project CloudStorm (Grant No. TIN2010-19077);CAM under project CLOUDS (Grant No. S2009TIC-1692)

摘　　要：Fault localization is a central element in network fault management.This paper takes a weighted bipartite graph as a fault propagation model and presents a heuristic fault localization algorithm based on the idea of incremental coverage,which is resilient to inaccurate fault propagation model and the noisy environment.Furthermore,a sliding window mechanism is proposed to tackle the inaccuracy of this algorithm in the presence of improper time windows.As shown in the simulation study,our scheme achieves higher detection rate and lower false positive rate in the noisy environment as well as in the presence of inaccurate windows,than current fault localization algorithms.

关 键 词：fault management fault diagnosis fault localization fault propagation model time windows incremental coverage 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TM726[自动化与计算机技术—计算机科学与技术]