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 条
  • [1] Longest prefix matching using bloom filters
    Dharmapurikar, S
    Krishnamurthy, P
    Taylor, DE
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2003, 33 (04) : 201 - 212
  • [2] Longest prefix matching using bloom filters
    Dharmapurikar, S
    Krishnamurthy, P
    Taylor, DE
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (02) : 397 - 409
  • [3] Parallelisation of trie-based longest prefix matching for fast IP address lookups
    Park, J
    Jang, IY
    ELECTRONICS LETTERS, 2002, 38 (25) : 1757 - 1759
  • [4] On Adding Bloom Filters to Longest Prefix Matching Algorithms
    Lim, Hyesook
    Lim, Kyuhee
    Lee, Nara
    Park, Kyong-Hye
    IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (02) : 411 - 423
  • [5] An Enhanced Bloom Filter for Longest Prefix Matching
    Park, Gahyun
    Kwon, Minseok
    2013 IEEE/ACM 21ST INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2013, : 157 - 162
  • [6] A Hash Based Architecture of Longest Prefix Matching for Fast IP Processing
    Ghosh, Surajeet
    Baliyan, Maitraya
    PROCEEDINGS OF THE 2016 IEEE REGION 10 CONFERENCE (TENCON), 2016, : 228 - 231
  • [7] SRAM Based Longest Prefix Matching Approach for Multigigabit IP Processing
    Ray, Sanchita Saha
    Ghosh, Surajeet
    Sardar, Bhaskar
    2015 IEEE INTERNATIONAL CONFERENCE ON ADVANCED NETWORKS AND TELECOMMUNCATIONS SYSTEMS (ANTS), 2015,
  • [8] Hybrid Trie Based Approach for Longest Prefix Matching in IP Packet Processing
    Ghosh, Surajeet
    Kesharwani, Suraj
    Mishra, Vipul
    Ray, Sanchita Saha
    TENCON 2017 - 2017 IEEE REGION 10 CONFERENCE, 2017, : 1532 - 1537
  • [9] A fast IP Lookup scheme for longest-matching prefix
    Wuu, LC
    Pin, SY
    2001 INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND MOBILE COMPUTING, PROCEEDINGS, 2001, : 407 - 412
  • [10] A Hybrid Approach to CAM-Based Longest Prefix Matching for IP Route Lookup
    Sun, Yan
    Kim, Min Sik
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
12345