电信监管系统海量目标名单查找算法  

Search Algorithm for Mass Target List in Telecom Supervise System

作　　者：杜世星[1] 陈鸿昶[1] 候颖[1] 

机构地区：[1]解放军信息工程大学信息工程学院信息技术研究所,郑州450002

出　　处：《计算机工程》2009年第6期272-274,共3页Computer Engineering

基　　金：国家"863"计划基金资助项目(2004AA103130)

摘　　要：电信监管系统中目标名单查找算法是衡量系统处理能力的重要指标。SIPURI作为SIP用户的网络标识有其自身的特点。该文在分析现有Hash算法对海量URI查找的性能后,提出一种基于Bloom过滤器的改进算法。仿真结果表明,在引入有限并且可控的虚警概率的前提下,Bloom过滤器查找速度与Hash算法相当,但内存消耗减小到原来的15%,提高了系统的处理能力。Search algorithm of the target list in the telecom supervise system is an important criterion of the system processing capability. SIP Uniform Resource Identifier（URI） is the identity of the SIP user in the network and it has its own characteristics. After analyzing the search performance of the Hash algorithm for the mass URIs, this paper puts forward an improved algorithm based on Bloom filter. The simulation results show that the search speed of the Bloom filter is almost the same as Hash algorithm, but the consumption of memory is reduced to 15 percentage of Hash after introducing finite and controllable false positive probability. So it can highly promote the processing capability of the system.

关 键 词：BLOOM过滤器 SIP协议 HASH算法 

分 类 号：TN915[电子电信—通信与信息系统]