摘要
针对目前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)
湖北省普通高等学校"战略性新兴(支柱)产业人才培养计划"资助项目