检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学电子与信息工程学院,西安710049
出 处:《计算机工程》2004年第5期30-31,34,共3页Computer Engineering
基 金:国家"863"计划基金资助项目:"网络安全管理与测评技术"(863-301-05-03);国家"95"科技攻关基金资助项目(96-743-01-04-01)
摘 要:研究了故障管理中的故障定位,提出了一套新的、完整的告警关联方案。告警的时间关联中采用了模糊逻辑推理事件之间的最佳时间关系。对关联窗口的选择进行了讨论,提出了一种新的关联窗口选择方法以保证故障的告警集合的完整性,并证明了其有效性。告警的聚类关联采用依赖关系图模型,给出了一种最大公因数贪心算法。通过分析对比该算法与完全搜索算法和传统贪心算法的复杂性,证明了其在故障告警域重叠度较小情况下的有效性。As communication networks become lager and more complex, a single fault in a large communication network may result in a large number of alarms, which makes it difficult to find the root cause of fault. A novel scheme of integrated alarm correlation is proposed, which focuses on the fault identification in fault management. Fuzzy logic is used to find the optimal temporal relation among alarms with the purpose of correlation. To keep the integrity of alarm set, an original method is given and testified after the methods of selecting correlation window are discussed. A greatest common devisor greedy (GCDG) algorithm based on dependency graph in clustering correlation is presented. The complexity of GCDG is compared with both exhaustive search algorithm and traditional greedy search algorithm, and then its efficiency is proved in the small alarm overlapped domain.
关 键 词:网络故障管理 告警关联 时间关联 模糊逻辑 聚类关联
分 类 号:TP393.7[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.252.137