| 注册
首页|期刊导航|计算机技术与发展|网络防御和不重复子串模式匹配算法研究实现

网络防御和不重复子串模式匹配算法研究实现

陈伟东 黄祖泉 陈传波 张伟平 吴涛

计算机技术与发展2016,Vol.26Issue(7):89-93,99,6.
计算机技术与发展2016,Vol.26Issue(7):89-93,99,6.DOI:10.3969/j.issn.1673-629X.2016.07.019

网络防御和不重复子串模式匹配算法研究实现

Research and Implementation of Network Active Defense and Pattern Matching Algorithm

陈伟东 1黄祖泉 2陈传波 1张伟平 3吴涛1

作者信息

  • 1. 上海颐东网络信息公司,上海 200233
  • 2. 华中科技大学 软件学院,湖北 武汉 430074
  • 3. 华中科技大学 软件学院,湖北 武汉 430074
  • 折叠

摘要

Abstract

Cloud computing network and next-generation network is now widely used,which brings more security threats. Based on the process and the network tuples communication to construct defense system,the key technologies of defense under IPv4/IPv6 dual stack network are researched. It presents the NRLS Sunday based on improvement of the longest norepeat substring and Sunday algorithm,to a-void excessive repetitive character comparison and improve the matching efficiency of a single pattern string. Compared with BM,Sunday algorithm,the experiment shows the improved algorithm optimizes its time complexity. Under high-speed network,packet data contents is carried on rapid detection and analysis. Based on intelligent traffic restrictions for process and network,the intrusion detection and defense is conducted for network. In this paper,parallel packet detection method is studied under the high speed. Application web collaboration, and the unified arrangements and issued policies is applied in a complex network environment,proposing and realizing the effective meth-od of defense in the complex network environment.

关键词

网络防御/系统内核/网络安全/最长不重复子串/改进的Sunday算法

Key words

network defense/system kernel/network security/the longest norepeat substring/improved Sunday algorithm

分类

信息技术与安全科学

引用本文复制引用

陈伟东,黄祖泉,陈传波,张伟平,吴涛..网络防御和不重复子串模式匹配算法研究实现[J].计算机技术与发展,2016,26(7):89-93,99,6.

基金项目

国家自然科学基金面上项目(51175197) (51175197)

计算机技术与发展

OACSTPCD

1673-629X

访问量0
|
下载量0
段落导航相关论文