AStudyond-leftCountingBloomFilterforDynamicPacketsFiltering.docVIP

AStudyond-leftCountingBloomFilterforDynamicPacketsFiltering.doc

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
AStudyond-leftCountingBloomFilterforDynamicPacketsFiltering.doc

A Study on d-left Counting Bloom Filter for Dynamic Packets Filtering Peizhen Lin, Feng Wang*, Weiliang Tan, Hui Deng Yunnan Computer Technology Application Key Lab Kunming University of Science and Technology Kunming, China, 650051 lpz@cnlab.net, wf@cnlab.net, twl@cnlab.net, dh@kmust.edu.cn Abstract In the previous study of dynamic packet filtering technique, list-base Counting Bloom Filter (CBF) algorithm was adopted to implement the filtering rule’s adding and deleting dynamically. However, the drawbacks of list-base CBF, i.e., low memory utilization, limited rule capacity and high false positive rate (FP rate), are obvious. Time efficiency also needs improvement. In this paper, d-left Counting Bloom Filter (d-left CBF) algorithm is exploited to improve the performance of the dynamic packet filtering. Through the usage of the algorithm, compared with list-based CBF, approximately 55 times memory space can be saved at least. In addition, with the increasing of memory allocation, the false positive rate of d-left CBF decreases more significantly than list-base CBF. Improved d-left CBF can enhance time efficiency from16.61% to 39.55% compare with list-based CBF when querying data which matches the filter rules with existed rules quantity from 1000 to 40000 and enhance time efficiency from 0.91% to 18.12% compare with list-based CBF when querying data which doesn’t match the filter rules with existed rules quantity from 1000 to 35000. The experimental results and corresponding analyses indicate that d-left CBF is feasible and high-efficient in the process of the dynamic packet filtering. Key Words: dynamic packet filter; d-left Counting Bloom Filter; false positive rate 1. Introduction Network stream packets capturing technique has been widely used in network applications, i.e., protocol analysis, firewall and intrusion detection system. With the advent of high-speed (more than 1Gbits) network, the capturing performance cannot meet the requirements of real tim

文档评论(0)

***** + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档