期刊文献+

命名数据网络中基于多级计数Bloom过滤器的名字查找方法研究

Named Lookup Based on Multi-Level Counting Bloom Filters for Named Data Network
下载PDF
导出
摘要 针对目前NDN中大多数基于Bloom过滤器的名字查找方法仅考虑速率而忽略冲突概率的局限,提出了一种考虑名字冲突概率并基于多级计数Bloom过滤器的名字查找方法.该方法的实验结果表明:相对于目前广泛研究的计数Bloom过滤器、哈希函数和d-left计数Bloom过滤器,所提方法能有效降低冲突概率. In view of the present most of NDN name lookup method based on Bloom filter, only consider the rate and ignore the limitations of the conflict probability, proposes a consider name conflict probability and name lookup method based on Multi-level Counting Bloom Filters. The experiment results show that relative to the extensive research of Counting Bloom Filters, hash function and d - left Counting Bloom Filters, the proposed method can effectively reduce the collision probability.
作者 侯睿 吴婷婷
出处 《中南民族大学学报(自然科学版)》 CAS 北大核心 2016年第3期107-110,共4页 Journal of South-Central University for Nationalities:Natural Science Edition
基金 武汉市科技计划资助项目(2015010101010008 2013010501010125) 湖北省普通高等学校"战略性新兴(支柱)产业人才培养计划"资助项目
关键词 BLOOM过滤器 名字查找 命名数据网络 最长匹配前缀 Bloom filters named lookup named data networking the longest prefix matching
  • 相关文献

参考文献11

  • 1吴超,张尧学,周悦芝,傅晓明.信息中心网络发展研究综述[J].计算机学报,2015,38(3):455-471. 被引量:40
  • 2黄韬,刘江,霍如,魏亮,刘韵洁.未来网络体系架构研究综述[J].通信学报,2014,35(8):184-197. 被引量:80
  • 3Zhang L X,Estrin D,Burke J,et al. N amed data networking(ndn) . Project[R] . California: P A R C ,2010.
  • 4林啸.以内容为中心的新一代互联网体系架构研究[J].电信科学,2010,26(5):1-7. 被引量:10
  • 5Feng Y H, Huang N F, Chen C H. A n efficient cachingmechanism for network-based U R L filtering by multi-levelcounting bloom filters [C J//IEEE. InternationalConference on Communications ( ICC ) . Kyoto : I E E E ,2011: 1-6.
  • 6Park C , Hwang S. Fast U R L lookup using U R L prefix hashtree[EB/OL]. (2008-05-11). http://dbpia. co. kr/.
  • 7W a n g Y, Dai H, Jiang J, et al. Parallel name lookup fornamed data networking [C J//IEEE. GlobalTelecommunications Conference ( G L O B E C O M 2011 ).Houston : I E E E , 2011: 1 -5.
  • 8W a n g Y, H e K, Dai H, et al. Scalable name lookup inN D N using effective name component encoding [C]//IEEE. The 32nd IEEE International Conference onDistributed Computing Systems ( ICDCS ) . Macao : I E E E ,2012: 688-697.
  • 9W a n g Y, Pan T, Mi Z, et al. NameFilter: Achieving fastname lookup with low memory cost via applying two-stagebloom filters [C J//IEEE. The 32nd IEEE InternationalConference on Computer Communications ( I N F O C O M ).Turin: IEEE, 2013: 95-99.
  • 10Bonomi F, Mitzenmacher M , Panigrahy R, et al. A nimproved construction for counting bloom filter [M].Berlin: Springer, 2006: 684-69.

二级参考文献11

  • 1Koponen T, Chawla M, Gon C B, et al. A data-oriented (and beyond) network architecture. In: SIGCOMM'07, Kyoto, Japan, 2007.
  • 2Tolia N, Kaminsky M, Andersen D, et al. An architecture for Internet data transfer. In: NSDI'06, San Jose, California, USA, 2006.
  • 3Project PSIRP. http://www.psirp.org, Jan 2010.
  • 4Project CCNxTM. http://www.ccnx.org, Sep 2009.
  • 5Jacobson V, Smetters K D, Thorton D J, et al. Networking named content. In: CoNext'09, Dec 2009.
  • 6Project FP7 4WARD. http://www.4ward-project.eu, Jan 2010.
  • 7Project TRIAD. http://www-dsg.stanford.edu/triad, Sep 2009.
  • 8谢高岗,张玉军,李振宇,孙毅,谢应科,李忠诚,刘韵洁.未来互联网体系结构研究综述[J].计算机学报,2012,35(6):1109-1119. 被引量:78
  • 9尹浩,詹同宇,林闯.多媒体网络:从内容分发网络到未来互联网[J].计算机学报,2012,35(6):1120-1130. 被引量:26
  • 10叶润生,徐明伟.命名数据网络中的邻居缓存路由策略[J].计算机科学与探索,2012,6(7):593-601. 被引量:30

共引文献127

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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