资料下载
×
电信监管系统海量目标名单查找算法
消耗积分:2 |
格式:rar |
大小:333 |
2009-03-30
王磊
分享资料个
电信监管系统中目标名单查找算法是衡量系统处理能力的重要指标。SIP URI 作为SIP 用户的网络标识有其自身的特点。该文在
分析现有Hash 算法对海量URI 查找的性能后，提出一种基于Bloom 过滤器的改进算法。仿真结果表明，在引入有限并且可控的虚警概率
的前提下，Bloom 过滤器查找速度与Hash 算法相当，但内存消耗减小到原来的15%，提高了系统的处理能力。
关键词：Bloom 过滤器；SIP 协议；Hash 算法
Search Algorithm for Mass Target List in Telecom Supervise System
DU Shi-xing, CHEN Hong-chang, HOU Ying
(Institute of Information Technology, Information Engineering College, PLA Information Engineering University, Zhengzhou 450002)
【Abstract】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.
【Key words】Bloom filter; SIP protocol; Hash algorithm
分析现有Hash 算法对海量URI 查找的性能后，提出一种基于Bloom 过滤器的改进算法。仿真结果表明，在引入有限并且可控的虚警概率
的前提下，Bloom 过滤器查找速度与Hash 算法相当，但内存消耗减小到原来的15%，提高了系统的处理能力。
关键词：Bloom 过滤器；SIP 协议；Hash 算法
Search Algorithm for Mass Target List in Telecom Supervise System
DU Shi-xing, CHEN Hong-chang, HOU Ying
(Institute of Information Technology, Information Engineering College, PLA Information Engineering University, Zhengzhou 450002)
【Abstract】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.
【Key words】Bloom filter; SIP protocol; Hash algorithm
声明：本文内容及配图由入驻作者撰写或者入驻合作网站授权转载。文章观点仅代表作者本人，不代表电子发烧友网立场。文章及其配图仅供工程师学习之用，如有内容侵权或者其他违规问题，请联系本站处理。 举报投诉
评论(0)
发评论
- 相关下载
- 相关文章
