期刊文献+

基于布鲁姆过滤器的未决兴趣表查找方法研究 被引量:1

PIT Searching Based on Bloom Filters
下载PDF
导出
摘要 针对基于布鲁姆过滤器的PIT查找性能瓶颈,文章在分析布鲁姆过滤器条目无匹配时的特点基础上,给出一种支持条件中断的实现方法,可在付出很小硬件资源代价的条件下,大大减轻瓶颈压力,提高系统转发性能。 Because of the bottleneck in PIT( pendins interest table) searching based on Bloorn Filters,this paper proposes a condition-interrupt-supported look-up method based on the analysis of characteristics of Bloom filters with no matching items. The proposed method can greatly alleviate the bottleneck pressure and improve the system forwarding performance with only a little cost of hardware resources.
出处 《信息工程大学学报》 2015年第1期84-89,共6页 Journal of Information Engineering University
基金 国家973计划资助项目(2012CB315901) 国家863计划资助项目(2011AA01A103) 国家科技支撑计划资助项目(2011BAH19B01)
关键词 内容中心网络 路由器 未决兴趣表(PIT) 布鲁姆过滤器 content-centric networking router pending interest table bloom filter
  • 相关文献

参考文献9

  • 1Jacobson V, Smetters D K, Thornton J D, et al. Networking named content[ C ]//Proceedings of the 5th international confer- ence on Emerging networking experiments and technologies. 2009: 1-12.
  • 2Almeida F L F, Lourenco J M. Information Centric Networks-Design Issues, Principles and Approaches[ J]. International Journal of Latest Trends in Computing, 2012, 3 (3) :559-563.
  • 3Zhang L, Estrin D, Burke J, et al. Named data networking (ndn) project[ J]. Relat6rio T6cnico NDN-0001, Xerox Palo Alto Research Center-PARC, 2010,5 ( 2 ) : 1005-1007.
  • 4Perino D, Varvello M. A reality check for content centric networking[ C]// Proceedings of the ACM SIGCOMM workshop on Information-centric networking. 2011: 44-49.
  • 5Sun Y, Egi N, Shi G, et al. Content-based route lookup using CAMs [ C ]// Global Communications Conference (GLOBE- COM), 2012 IEEE. 2012: 2677-2682.
  • 6Wang Y, He K, Dai H, et al. Scalable name lookup in NDN using effective name component encoding[ C ]// Distributed Computing Systems (ICDCS) , 2012 IEEE 32nd International Conference on. 2012: 688-697.
  • 7You W, Mathieu B, Truong P, et al. DiPIT: A distributed Bloom-filter based PIT table for CCN nodes[ C ]//Computer Com- munications and Networks (ICCCN) , 2012 21st International Conference on. 2012: 1-7.
  • 8Broder A, Mitzenmacher M. Network applications of bloom filters: A survey [ J]. Internet mathematics, 2004, 1 (4) : 485 -509.
  • 9Bloom B H. Space/time trade-offs in hash coding with allowable errors[ J]. Communications of the ACM, 1970, 13 (7) : 422- 426.

同被引文献11

  • 1Labrinidis A ,Jagadish H V. Challenges and opportunities with big data [ J ]. Proceedings of the VLDB Endowment, 2012,5 (12) :2032-2033.
  • 2Gong Q, Yang T, Tong H, et al. Reducing the number of Bloom filters [ C ]//Proc of international conference on progress in in- formatics and computing. [ s. l. ] :IEEE ,2014.
  • 3Guo D, Wu J, Chen H, et al. The dynamic Bloom filters [ J ]. IEEE Transactions on Knowledge & Data Engineering,2010, 22(1) :120-133.
  • 4Tang S,Jin A ,Wang Y. A comment on "fast bloom filters and their generalization" [ J ]. Molecular Medicine, 2016, 13 ( 3 - 4) :303-304.
  • 5Saravanan K, Senthilkumar A, Chacko P. Modified whirlpoolhash based bloom filter for networking and security applica- tions[ C]//Proc of 2nd international conference on devices, cireuits and systems. [ s. l. ] :IEEE,2014.
  • 6Xia W, Jiang H, Feng D, et al. Similarity and locality based in- dexing for high performance data deduplication [ J ]. IEEE Transactions on Computers,2015,64 (4) : 1162-1176.
  • 7Kim M, Oh K H, Youn H Y, et al. Enhanced dual Bloom filter based on SSD for efficient directory parsing in cloud storage system[ C]//Proc of international conference on computing, networking and communications. [ s. l. ] : IEEE, 2015 : 413 - 417.
  • 8Rottenstreich O, Keslassy I. The Bloom paradox: when not to use a Bloom filter [ J ]. IEEE./ACM Transactions on Networ- king,2015,23 ( 3 ) :703-716.
  • 9Antikainen M, Aura T, Sarela M. Denial-of-service attacks in bloom- filter- based forwarding [ J ]. IEEE/ACM Transactions on Networking,2014,22 (5) : 1463-1476.
  • 10谢平.存储系统重复数据删除技术研究综述[J].计算机科学,2014,41(1):22-30. 被引量:25

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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