面向NDN中名字查找的哈希布鲁姆过滤器
发布时间：2018-08-22 21:14
【摘要】：该文设计了一种面向NDN中名字查找的哈希布鲁姆过滤器(HBF)。HBF由位于片内存储器中的g个计数器布鲁姆过滤器(CBF)、g个计数器和位于片外存储器中的g个哈希表组成,每个哈希表与1个CBF和1个计数器关联。为了避免因部分CBF存入名字过多而导致HBF的高误判率,HBF通过二次哈希选择算法将NDN路由器中FIB/CS/PIT表项完整信息均匀分散保存于g个CBF和g个哈希表中,同时也利于数据包转发的并行处理。理论分析和实验结果表明在名字查找过程中,HBF利用片内存储器中CBF的定位与过滤作用,大幅度减少片外存储器的访问开销,提高数据包转发速率,有效避免泛洪攻击。
[Abstract]:In this paper, a hash Bloom filter (HBF). HBF) for name lookup in NDN is designed, which consists of g counter in on-chip memory, (CBF) filter g counter and g hash table in off-chip memory. Each hash table is associated with 1 CBF and 1 counter. In order to avoid the high error rate of HBF caused by the excessive number of HBF stored in part of the CBF, the complete information of FIB/CS/PIT table in NDN router can be evenly distributed in g CBF and g hash table by using the quadratic hash selection algorithm. At the same time, it also facilitates the parallel processing of packet forwarding. The theoretical analysis and experimental results show that in the process of name searching, the location and filtering function of CBF in on-chip memory can be used to greatly reduce the access cost of out-of-chip memory, improve the packet forwarding rate, and effectively avoid flooding attacks.
【作者单位】： 湖南大学信息科学与工程学院;
【基金】：国家973项目(2012CB315805) 国家自然科学基金(61173167,61472130)
【分类号】：TP393.0
本文编号：2198317
[Abstract]:In this paper, a hash Bloom filter (HBF). HBF) for name lookup in NDN is designed, which consists of g counter in on-chip memory, (CBF) filter g counter and g hash table in off-chip memory. Each hash table is associated with 1 CBF and 1 counter. In order to avoid the high error rate of HBF caused by the excessive number of HBF stored in part of the CBF, the complete information of FIB/CS/PIT table in NDN router can be evenly distributed in g CBF and g hash table by using the quadratic hash selection algorithm. At the same time, it also facilitates the parallel processing of packet forwarding. The theoretical analysis and experimental results show that in the process of name searching, the location and filtering function of CBF in on-chip memory can be used to greatly reduce the access cost of out-of-chip memory, improve the packet forwarding rate, and effectively avoid flooding attacks.
【作者单位】： 湖南大学信息科学与工程学院;
【基金】：国家973项目(2012CB315805) 国家自然科学基金(61173167,61472130)
【分类号】：TP393.0
【相似文献】
相关期刊论文 前1条
1 张震;汪斌强;陈庶樵;郭通;;几何布鲁姆过滤器的设计与分析[J];电子学报;2012年09期
相关硕士学位论文 前1条
1 张生华;一种面向DPI的内存高效的布鲁姆过滤器研究[D];湖南大学;2009年
，本文编号：2198317
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2198317.html
