On Adding Bloom Filters to Longest Prefix Matching Algorithms
- 주제(키워드) Internet , router , IP address lookup , longest prefix matching , Bloom filter , multihashing , binary search on levels , leaf pushing
- 등재 SCIE, SCOPUS
- 발행기관 IEEE COMPUTER SOC
- 발행년도 2014
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000090775
- 본문언어 영어
- Published As http://dx.doi.org/10.1109/TC.2012.193
초록/요약
High-speed IP address lookup is essential to achieve wire-speed packet forwarding in Internet routers. Ternary content addressable memory (TCAM) technology has been adopted to solve the IP address lookup problem because of its ability to perform fast parallel matching. However, the applicability of TCAMs presents difficulties due to cost and power dissipation issues. Various algorithms and hardware architectures have been proposed to perform the IP address lookup using ordinary memories such as SRAMs or DRAMs without using TCAMs. Among the algorithms, we focus on two efficient algorithms providing high-speed IP address lookup: parallel multiple-hashing (PMH) algorithm and binary search on level algorithm. This paper shows how effectively an on-chip Bloom filter can improve those algorithms. A performance evaluation using actual backbone routing data with 15,000-220,000 prefixes shows that by adding a Bloom filter, the complicated hardware for parallel access is removed without search performance penalty in parallel-multiple hashing algorithm. Search speed has been improved by 30-40 percent by adding a Bloom filter in binary search on level algorithm.
more