LIAO Jianxin, ZHANG Cheng, LI Tonghong, ZHU Xiaomin. A Quasi-Optimal Probabilistic Fault Localization Algorithm in Communication Networks[J]. Chinese Journal of Electronics, 2011, 20(1): 151-154.
Citation: LIAO Jianxin, ZHANG Cheng, LI Tonghong, ZHU Xiaomin. A Quasi-Optimal Probabilistic Fault Localization Algorithm in Communication Networks[J]. Chinese Journal of Electronics, 2011, 20(1): 151-154.

A Quasi-Optimal Probabilistic Fault Localization Algorithm in Communication Networks

  • Received Date: 2010-01-01
  • Rev Recd Date: 2010-03-01
  • Publish Date: 2011-01-05
  • The problem of fault localization, which needs to find the optimal hypothesis from all possible fault hypotheses, is theoretically proven to be NP-hard. In this paper, we propose a quasi-optimal probabilistic fault localization algorithm based on the observation that there are few concurrent faults in real communication systems. A heuristic algorithm is first used to estimate the real number of concurrent faults. According to this estimated number, we then perform exhaustive search over a small specific candidate fault set, in order to obtain the accurate explanation of the observed symptoms. Simulation shows that the algorithm is quasi-optimal, effective and efficient.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (649) PDF downloads(666) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return