期刊文献+

电动汽车领域基于规则的网管告警压缩机制研究及应用

Research and Application of Alarm Compression in Network System of EV Field Based on Rules
在线阅读 下载PDF
导出
摘要 为了有效防止电动汽车加电站网络的告警风暴,提高告警监控的有效性和准确性,需要研究出有效的告警压缩机制,以快速找出根源性告警、合并重复告警和过滤无用告警。本文首先描述系统的架构,然后根据不同层次的特点,详细分析了告警压缩规则的方法。通过告警压缩机制在深圳某公司的应用和对告警数量的统计,表明了压缩机制的实用性和有效性。 The effective compressing mechanism of alarms in charge station of electric vehicle is researched to prevent alarms storm effectively and improve the accuracy of alarm monitoring and to identify the root alarm, merge reduplicate alarms and filter redundant alarms quickly. The architecture of the alarm system is described, and then the compression rules is analyzed in detail according to the characteristic of each level of the architecture. According to the application of the architecture of alarm compression and the statistics of the number of alarm of a company in Shenzhen, the practicality and effectiveness of the compression mechanism is clearly proved.
作者 张志超
出处 《软件》 2012年第12期185-187,232,共4页 Software
关键词 电动汽车 加电站 告警 压缩 规则 electric vehicle charge station alarm compression rule
  • 相关文献

参考文献6

  • 1闰生超.基于关联集的电力通信网告警压缩方法[J].中国电子商情(通信市场),2012(2):85-88. 被引量:1
  • 2AlfredV.Aho.编译原理[M].赵建华.北京:机械工业出版社,2008.
  • 3Haines J, Ryder D K, Tinnel L.Validation of Sensor Alert Correlators[J]. IEEE Security and Privacy, 2003, 1(01): 46-56.
  • 4S.Kliger, S.Yemini. A coding approach to event correlation[J]. Proc. 4th International Symposium on Integrated Network Management (IFIP/IEEE), 1995, 5(03):290-301.
  • 5M. Hasan, B. Sugla, R. Viswanathan. A conceptual framework for network management event correlation and filtering systems[J]. Integrated Network Management VI, 1999, 4(09): 233-245.
  • 6吴简,李兴明.基于关联规则的分布式通信网告警相关性研究[J].计算机科学,2009,36(11):204-207. 被引量:7

二级参考文献19

  • 1吕晓斌,邓琦皓,罗军勇,王清贤.基于模式匹配的告警关联[J].微电子学与计算机,2005,22(7):103-106. 被引量:4
  • 2李明芳.基于信号流的光传输网告警相关性分析[J].电信技术,2005(10):34-37. 被引量:4
  • 3Agrawal R,Imielinski T,Swami A. Mining association rules between sets of items in large databases[A]//Proceedings of the ACM SIGMOD International Conference on Management of Data[C]. Washington, USA, 1993 : 207-216.
  • 4Cheung D W, et al. A Fast Distributed Algorithm for Mining Association Rules[C]// Proc. Parallel and Distributed Information Systems. IEEE CS Press, 1996 : 31-42.
  • 5Zaki M J, Pin Y. Introduction: Recent Developments in Parallel and Distributed Data Mining[J]. J. Distributed and Parallel Databases, 2002,11 (2) : 123-127.
  • 6Cheung D W, et al. Efficient Mining of Association Rules in Distributed Databases[J]. IEEE Trans. Knowledge and Data Eng. , 1996,8(6) :911-922.
  • 7Schuster A, Wolff R. Communication-efficient Distributed Mining of Association Rules[C]//Proc. ACM SIGMOD Int ' l Conf. Management of Data. ACM Press, 2001:473-484.
  • 8Ashrafi M Z. Monash University ODAM: An Optimized Distributed Association Rule Mining Algorithm, IEEE DISTRIBUTED SYSTEMS ONLINE 1541-4922 2004[J]. IEEE Computer Society,2004,5 (3).
  • 9Ma Y, Liu B, Wong C K. Web for Data Mining: Organizing and Interpreting the Discovered Rules Using the Web[J]. SIGKDD Explorations, New York: ACM Press, 2000,2 (1) : 16-23.
  • 10Kimball R, Ross M. The Data Warehouse Toolkit, The Complete Guide to Dimensional Modeling. 2nd edn[M]. John Wiley Sons, New York, 2002.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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