%0 Journal Article
%T Heuristic Fault Localization Algorithm Based on Bayesian Suspected Degree<br>基于贝叶斯疑似度的启发式故障定位算法
%A ZHANG Cheng
%A LIAO Jian-Xin
%A ZHU Xiao-Min
%A <br>张成
%A 廖建新
%A 朱晓民
%J 软件学报
%D 2010
%I 
%X Fault localization has theoretically been proven to be NP-hard. This paper takes a weighted bipartite graph, as fault propagation model, and proposes a heuristic fault localization algorithm based on Bayesian suspected degree (BSD) to reduce the computational complexity. It introduces a metric of BSD, which needs only to be calculated once, and uses incremental coverage, which makes the algorithm a low computation complexity O(|F|×|S|). Simulation results show that the algorithm has a high fault detection rate as well as low false positive rate and performs well even in the presence of unobserved and suspicious alarms. The algorithm, which has a polynomial computational complexity, can be applied to a large-scale communication network.
%K 故障管理
%K 故障诊断
%K 故障定位
%K 故障传播模型
%K 贝叶斯公式
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=FD6E729E39B2DACB3B5DB7046E5C6CEF&yid=140ECF96957D60B2&vid=659D3B06EBF534A7&iid=F3090AE9B60B7ED1&sid=960FAAFDFF4DC10B&eid=3459DD0730F46515&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=20