A Time Efficient Algorithm Based on Bloom Filters for Longest Prefix Matching in IP Lookups

被引：1

作者：

Yu, Ming ^{[1
]}

Wang, Dongju ^{[1
]}

机构：

[1] Dalian Univ Technol, Sch Informat & Commun Engn, Dalian, Peoples R China

来源：

JOURNAL OF COMPUTERS | 2013年 / 8卷 / 10期

基金：

中国国家自然科学基金;

关键词：

Bloom filters; IP lookups; longest prefix matching; time efficient algorithm;

D O I：

10.4304/jcp.8.10.2724-2729

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

A time efficient algorithm based on Bloom filters is proposed to solve the problem of longest prefix matching in IP lookups. It is distinguished from the existing algorithms by three features. Firstly, a first-byte indexing table is established before querying the Bloom filters, so that the impact of positive false inherent to Bloom filters on IP lookups is reduced. Secondly, only twelve Bloom filters are required for prefix query, as is based on the uniform distribution of various prefix lengths. Thirdly, update of routing tables is supported by associating a counter with each bit in the bit vectors of the Bloom filters. Performance analysis and experimental results show the efficacy of the proposed algorithm in decreasing the time complexity of IP lookups.

引用

页码：2724 / 2729

页数：6

共 50 条

[31] TCAM-based High Speed Longest Prefix Matching with Fast Incremental Table Updates
Rasmussen, A.
Kragelund, A.
Berger, M.
Wessing, H.
Ruepp, S.
2013 IEEE 14TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE SWITCHING AND ROUTING (HPSR), 2013, : 43 - 48
[32] Accelerating the bit-split string matching algorithm using Bloom filters
Huang, Kun
Zhang, Dafang
Qin, Zheng
COMPUTER COMMUNICATIONS, 2010, 33 (15) : 1785 - 1794
[33] A Fuzzy Service Matching Algorithm Based on Bloom Filter
Zhao, Wendong
Peng, Laixian
Zhang, Jin
Tian, Chang
PROCEEDINGS OF 2012 IEEE 14TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, 2012, : 945 - 950
[34] A DSA-based and Efficient Scheme for Preventing IP Prefix Hijacking
Yang, Bo
2014 INTERNATIONAL CONFERENCE ON MANAGEMENT OF E-COMMERCE AND E-GOVERNMENT (ICMECG), 2014, : 87 - 92
[35] A CAM/WTA-based high speed and low power longest prefix matching circuit design
Tsai, Ruei-Jhe
Ting, Hsin-Wen
Lin, Chi-Sheng
Liu, Bin-Da
2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, 2006, : 426 - +
[36] A Hash-based Scalable IP lookup using Bloom and Fingerprint Filters
Yu, Heeyeol
Mahapatra, Rabi
Bhuyan, Laxmi
2009 17TH IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP 2009), 2009, : 264 - +
[37] Efficient Reversible Data Hiding Based on Prefix Matching and Directed LSB Embedding
Wu, Hanzhou
Wang, Hongxia
Hu, Yi
Zhou, Linna
DIGITAL-FORENSICS AND WATERMARKING, IWDW 2014, 2015, 9023 : 455 - 469
[38] An efficient search mechanism based on the concepts of bloom and random search filters
Chang, Chin-Chen
Lee, Tian-Fu
Leu, Jyh-Jong
Proceedings of the Fourth International Conference on Information and Management Sciences, 2005, 4 : 386 - 393
[39] Efficient Name Lookup Method Based on Hybrid Counting Bloom Filters
Xu K.
Li Y.
Xie G.
Zhang D.
Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2023, 60 (05): : 1136 - 1150
[40] A Matching Algorithm of Netfilter Connection Tracking Based on IP flow
Zhang, Ke
Wang, Juan
Ren, Dasen
2008 2ND INTERNATIONAL CONFERENCE ON ANTI-COUNTERFEITING, SECURITY AND IDENTIFICATION, 2008, : 199 - +

← 1 2 3 4 5 →