期刊文献+

基于时间、空间和规则的无线网络告警关联方法 被引量:5

Wireless Network Alarm Correlation Based on Time,Space and Rules
下载PDF
导出
摘要 无线网络应用的普及使网络故障管理成为网络运维的关键。为了从大量的网络告警数据中快速准确地找到告警、定位根源故障,提出了一种基于时间、空间和规则的无线网络告警关联方法。该方法基于专家规则库、网络拓扑结构,以及告警的时间序列,将时间、空间、传统单一的规则告警关联方法相结合,综合定位根源告警;针对大型复杂网络结构,采用层次关联的方法,针对大型复杂网络结构,采用层次关联的方法,先找到产生告警的子网,再从该子网的节点间找到产生告警的节点;同时,通过动态维护网络拓扑结构和专家规则库,能够适应无线网络的动态变化特点。实验结果表明,提出的基于时间、空间和规则的告警关联方法的准确率为86.6%。 The generation of a wireless network alarm is caused by multiple faults that occurs over a period of time in a complex wireless network.How to find the root alarm of the root fault quickly and accurately is an important issue for network managers.This paper presented a method of wireless network alarm association based on time,space and expert rules.The method is based on rules,network topology,and time series of alarm,and the method combines the space and time with the traditional single rules alarm association method to synthetically locate the root alarm.To solve the large-scale complex network structure,the method uses a hierarchical correlation method.First it finds the subnet which generates alarm,and then locates the alarm node from subnet.At the same time,to adapt the dynamic characteristics of wireless networks,the method maintenans network topology structure and expert rule base dynamically.Experimental results demonstrate that the accuracy rate of the proposed method is 86.6%.
作者 万莹 洪玫 陈宇星 王帅 樊哲宁 WAN Ying;HONG Mei;CHEN Yu-xing;WANG Shuai;FAN Zhe-ning(College of Computer Science,Sichuan University,Chengdu 610065,China)
出处 《计算机科学》 CSCD 北大核心 2018年第B11期287-291,共5页 Computer Science
关键词 告警关联 根源告警 网络拓扑结构 规则库 Alarm correlation Root alarms Network topology Rule base
  • 相关文献

参考文献1

二级参考文献8

  • 1Aho A V,Corasick M J. Efficient string matching: an aid to bibliographic search. Communications of ACM, 1975, 18 (6) : 333-340 被引量:1
  • 2Commentz-Walter B. A string matching algorithm fast on the average:[Technical Report]. The University of Heidelberg: IBM Heidelberg Scientific Center, Sep. 1979 被引量:1
  • 3Wu Sun, Manber U. A Fast Algorithm for Multi pattern Searching: [Technical Report]. The University of Arizona: The Computer Science Department, May1994 被引量:1
  • 4Muth R, Manber U. Approximate multiple string search. In:Proc. 7th Combinatorial Pattern Matching (CPM' 96 ). LNCS 1075. 1996. 75-86 被引量:1
  • 5Crochemore M, Czumaj A, Gasieniec L, I.ecroq T, Plandowski W, Rytter W. Faster practical multi-pattern matching. Inf.Process. Leu, 1999,71(3-4): 107-113 被引量:1
  • 6Wu Sun, Manber U. Agrep: A Fast Approximate Patternmatching Tool. Usenix Winter Technical Conference, San Francisco,1992 被引量:1
  • 7Wu Sun, Manber U. GLIMPSE: A Tool to Search Through Entire FileSystem. Usenix Winter Technical Conference, San Francisco, 1994 被引量:1
  • 8Boyer R S, Moore J S. A fast string searching algorithm. Communications of ACM, 1977, 20(10):762-772 被引量:1

共引文献12

同被引文献27

引证文献5

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部