電信監(jiān)管系統(tǒng)海量目標(biāo)名單查找算法

電信監(jiān)管系統(tǒng)中目標(biāo)名單查找算法是衡量系統(tǒng)處理能力的重要指標(biāo)。SIP URI 作為SIP 用戶的網(wǎng)絡(luò)標(biāo)識有其自身的特點(diǎn)。該文在
分析現(xiàn)有Hash 算法對海量URI 查找的性能后，提出一種基于Bloom 過濾器的改進(jìn)算法。仿真結(jié)果表明，在引入有限并且可控的虛警概率
的前提下，Bloom 過濾器查找速度與Hash 算法相當(dāng)，但內(nèi)存消耗減小到原來的15%，提高了系統(tǒng)的處理能力。
關(guān)鍵詞：Bloom 過濾器；SIP 協(xié)議；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