一种基于并行Bloom Filter的高速URL查找算法  

Fast URL Lookup Using Parallel Bloom Filters

作　　者：周舟[1] 付文亮[2] 嵩天[2] 刘庆云[1] 

机构地区：[1]中国科学院信息工程研究所信息内容安全技术国家工程实验室,北京100093 [2]北京理工大学计算机学院,北京100081

出　　处：《电子学报》2015年第9期1833-1840,共8页Acta Electronica Sinica

基　　金：国家高技术研究发展计划("863"计划)基金(No.2011AA010703);中国科学院战略性先导科技专项基金(No.XDA06030200);国家自然科学基金(No.61402474)

摘　　要：URL查找是众多网络系统中重要的组成部分,如URL过滤系统、Web缓存等.随着互联网的迅速发展,URL查找面临的主要挑战是实现大规模URL集合下的高速查找,同时保证低存储和低功耗.本文提出了一种基于并行Bloom Filter的URL查找算法,CaBF.该算法高度并行化,提供大规模URL集合下的高速最长前缀匹配,并很好地适应集合中不同数量的URL组件.理论分析和真实网络数据集上的实验表明,该算法相比现有算法可以降低假阳性概率达一个数量级(或者在满足相同假阳性概率的前提下降低存储和硬件逻辑资源消耗).此外,该方法的体系结构很容易映射到FPGA等硬件器件上,提供每秒超过150M次的URL查找速度.URL lookup is fundamental to numerous networking systems, including URL filters, web caches, etc. With the ex- plosive development of the Internet,the main challenge in implementing URL lookup operation is to achieve fast lookup speed and accommodate large URL sets while keeping memory and power consumption low. This paper presents a new URL lookup scheme based on parallel Bloom Filters.It can adapt to set cardinality and perform fast longest prefix matching（LPM） with large URL sets in a highly parallel fashion. The theoretical analysis and experiments on real-life data traces show that the proposed approach leads to reduced false positive probability for up to an order of magnitude（ or reduced memory and hardware logic resources with the same false positive probability guaranteed）compmred with the existing methods. Moreover, the architecture can be easily mapped to the state-of-the-art FPGAs with moderate resource consumption to provide over 150M lookups per second.

关 键 词：URL查找 布鲁姆过滤器 最长前缀匹配 现场可编程门阵列 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]