期刊文献+

包过滤系统中关键字过滤的实现及其性能分析 被引量:3

Implementation of the keyword filter in the packet filter system and catability analysis
下载PDF
导出
摘要 一般的包过滤系统仅对IP(InternetProtocol)地址、端口类型等项目进行过滤。笔者提出了对数据包中的数据按照关键字进行过滤的方法,并基于KMP(Kunth-Morris-Pratt)关键字匹配算法,对该系统进行了相应的性能测试。在测试环境下,得出网络吞吐量为75%,1000字节长的数据帧的平均过滤时延约为100μs等一系列测试数据。通过对过滤时延的分析及网络吞吐量的测试结果表明,该方案所设计的系统性能基本能够满足实际要求。 Common packet filter system can only filt er the project based on the IP address and port type, a method to filter aimed a t the data in data packet according to the key word is presented.On the bas is of the key word KMP(Kunth-Morris-Pratt) arithmetic, tests the function of the system accordingly ,thus gets a series of testing data as throughput is 75% and average filtrate d elay is about 100 μs for frame of 1 000 bytes in testing environment .Through t he analysis of the filter delay and the network throughput, presents that the syst em performance designed by this scheme can meet the performance needs of practic al use.
出处 《吉林大学学报(信息科学版)》 CAS 2003年第2期167-171,共5页 Journal of Jilin University(Information Science Edition)
基金 吉林大学青年教师基金资助项目(2001-055)
关键词 防火墙 包过滤 关键字匹配算法 过滤时延 吞吐量 Firewall Packet filter Keyword-method-arit hmetic Filter delay Throughput
  • 相关文献

参考文献6

  • 1夏亮.透明防火墙技术的研究与实现(Research and Achieve the Transparent Fire work)[D].北京:北京邮电大学(Beijing:Beijing University of Po,2001.
  • 2Richard Stevens R.UNIX网络编程,第1卷(UNIX Network Programing,Volumn 1)[M].北京:清华大学出版社(Beiiing:Tsinghua University Pr,1999..
  • 3谢楚屏 陈慧南.数据结构(Data Structure)[M].北京:人民邮电出版社(Beijing:People’s Post and Tel,1996..
  • 4谢希仁(XIE Xi—ren).计算机网络(Computer Network)[M].大连:大连理工大学出版社(Dalmn:Science and Engineer,2000..
  • 5夏亮(XIA Liang).[D].北京: 北京邮电大学(Beijing:Beijing University of Post and Telecomunication),2001.
  • 6Richard Stevens R.UNIX网络编程,第1卷(UNIX Network Programing, Volumn 1)[M].北京:清华大学出版社(Beijing:Tsinghua University Press),1999..

同被引文献11

  • 1戈晓斐,黄竞伟,胡磊.改进的KMP算法在生物序列模式自动识别中的应用[J].计算机工程,2004,30(10):140-142. 被引量:6
  • 2朱小宝,陈富林,吴凤.改进Kmp算法在模糊查找中的应用[J].南昌航空工业学院学报,2005,19(2):70-73. 被引量:6
  • 3ABPIELJPDA M I,KIRTZ S,OHLEBUSCH E. The enhanced suffix array and its applications to genomeanalysis[C]. Workshop on algorithms in bioinformatics,lecture notes in computer science,Springer- Verlag, Berlin, 2002 :449-463.
  • 4KASAI T, LEE G, ARIMURA H, et al. Linear-time longest-common- prefix computation in suffix arrays and its applications[C]. Annual symposium on combinatorial pattern matching, lecture notes in computer science, Springer-Verlag, Berlin, 2001,2089 : 181-192.
  • 5GONZALO N, MATHIEU R. Flexible pattern matching in strings [ M]. Publishing house of electronics industry, 2007 : 132-136.
  • 6BURKHARDT S, CRAUSER A, FERRAGINA P, et al. Vingron M: q-gram based database searching using a suffix array (QUASAR)[C]. In RECOMB,Lyon, 1999 : 77-83.
  • 7UKKONEN E. Approximate string-matching with qgrams and maximal matches[J]. Theoretical Computer Science, 1992,92 : 191-211.
  • 8RASMUSSEN K, STOYE J, MYERS E. Efficient qgram Filters for finding all epsilon-matches over a given length [J]. Journal of Computational Biology 2006,13(2) :296-308.
  • 9KNUTH D,MORRIS J,PRATT V.Fast pattern matching in strings[J].SIAM Journal on Computing,1977,6(2):323-350.
  • 10BOYER R,MOORE J.A fast string searching algorithm[J].Communications of the ACM,1977,20(10):762 -772.

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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