Browse > Article

Multiple Hashing Architecture using Bloom Filter for IP Address Lookup  

Park, Kyong-Hye (이화여자대학교 전자정보통신공학과)
Lim, Hye-Sook (이화여자대학교 전자정보통신공학과)
Publication Information
Journal of KIISE:Databases / v.36, no.2, 2009 , pp. 84-98 More about this Journal
Abstract
Various algorithms and architectures for IP address lookup have been studied to improve forwarding performance in the Internet routers. Previous IP address lookup architecture using Bloom filter requires a separate Bloom filter as well as a separate hash table in each prefix length, and hence it is not efficient in implementation complexity. To reduce the number of hash tables, it applies controlled prefix expansion, but prefix duplication is inevitable in the controlled prefix expansion. Previous parallel multiple-hashing architecture shows very good search performance since it performs parallel search on tables constructed in each prefix length. However, it also has high implementation complexity because of the parallel search structure. In this paper, we propose a new IP address lookup architecture using all-length Bloom filter and all-length multiple hash table, in which various length prefixes are accomodated in a single Bloom filter and a single multiple hash table. Hence the proposed architecture is very good in terms of implementation complexity as well as search performance. Simulation results using actual backbone routing tables which have $15000{\sim}220000$ prefixes show that the proposed architecture requires 1.04-1.17 memory accesses in average for an IP address lookup.
Keywords
IP address lookup; longest matching prefix; Hashing; Bloom Filter;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H. J Chao, 'Next generation routers,' Proc. of the IEEE, Vo1.90, No.9, pp, 1518-1558, Sep. 2002   DOI   ScienceOn
2 Hyesook Lim and JuHyoung Mun, 'An efficient IP address lookup algorithm using a priority trie,' Proc. GLOBECOM 2006. pp.1-5   과학기술학회마을
3 Changhoon Yim, Borni Lee, and Hyesook Lim, 'Efficient binary search for IP address lookup,' IEEE Communications Letters, Vol.9, No.7, pp. 652-654, Jul. 2005   DOI   ScienceOn
4 Hyesook Lim, Ji-Hyun Seo, and Yeo-Jin Jung, 'High speed IP address lookup architecture using hashing,' IEEE Communications Letters, Vol.7, No.10, pp. 502-504, October 2003   DOI   ScienceOn
5 http://www.potaroo.net
6 Hyesook Lim and Yeojin Jung, 'A parallel multiple hashing architecture for IP address lookup,' Proc. HPSR 2004, pp. 91-95
7 Jahangir Hasan, Srihari Cadambi, Venkatta Iakkula, and Srimat Chakradhar, 'Chisel: A storageefficient, collision-free hash-based network processing Architecture,' Proc. ISCA 2006. pp.203-215   DOI
8 S. Nilsson and G. Karlsson, 'IP address lookup using LC-tries,' IEEE Journal on Selected Area in Communication, Vol.17, pp. 1083-1092, June. 1999   DOI   ScienceOn
9 M.A. Ruiz-Sanchex, E.W. Biersack. and W. Dabbous, 'Survey and taxonomy of IP address lookup algorithms,' IEEE Network, pp. 8-23, March/April 2001   DOI   ScienceOn
10 Andrei Broder and Michael Mitzenmacher, 'Using multiple hash functions to improve IP lookups,' Proc. IEEE Infocom 2001, Vol.3, pp. 1454-1463
11 Sarang Dharmapurikar, Praveen Krisharnurthy, and David E. Taylor, 'Longest prefix matching using bloom filters,' IEEE/ACM Transactions on Networking, Vol.14, No.2, pp. 397-409, April 2006   DOI   ScienceOn
12 B. Lampson, V. Srinivasan, and G. Varghese, 'IP lookups using multiway and multicolumn search,' IEEE/ACM Trans. Networking, Vol.7, No.3, pp. 324-334, Jun. 1999   DOI   ScienceOn
13 N. Yazdani and P. S. Min, 'Fast and scalable schemes for the IP address lookup problem,' Proc. IEEE HPSR2000, pp, 83-92