Browse > Article

Binary Search on Levels Using Bloom filter for IPv6 Address Lookup  

Park, Kyong-Hye (이화여자대학교 SoC Design Lab.)
Lim, Hye-Sook (이화여자대학교 SoC Design Lab.)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.34, no.4B, 2009 , pp. 403-418 More about this Journal
Abstract
IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.
Keywords
IPv6;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, 'Scalable high speed IP routing lookups', in Proc. ACM SIGCOMM Conf., Cannes, France, pp.25-35, 1997
2 Andrei Broder and Michael Mitzenmacher, 'Using multiple hash functions to improve IP lookups,' Proc. IEEE Infocom 2001, vol.3, pp. 1454-1463
3 Sarang Dharmapurikar, Praveen Krishamurthy, 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
4 S. M. Yong and H. T. Ewe, 'Robust Routing Table Design for IPv6 Lookup,' Proc. ICITA'05, 2005
5 Rich Seifert, 'The Switch book,' Wiley, 2000
6 N. Yazdani and P. S. Min, 'Fast and scalable schemes for the IP address lookup problem,' Proc. IEEE HPSR2000, pp. 83-92
7 Raj Jain, 'Comparison of Hashing Schemes for Address Lookup in Computer Networks,' in IEEE Transactions on Communications, 1989
8 IPv6 Operational Report. http://net-stats.ipv6.tilab.com/bgp/bgp-table-snapshot.txt/, June 2008
9 H. J. Chao, 'Next generation routers,' Proc. of the IEEE, vol.90, no.9, pp.1518-1558, Sep. 2002   DOI   ScienceOn
10 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
11 Yiu Keung Li and Derek Pao, 'Comparative Studies of Address Lookup Algorithms for IPv6,' Proc. ICACT 2006, pp.285-290, Feb 2006
12 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
13 Hyesook Lim and Yeojin Jung, A parallel multiple hashing architecture for IP address lookup, Proc. HPSR 2004, pp. 91- 95
14 Priyank Warkhede, Subhash Suri, and George Varghese. 'Multiway range trees: scalable IP lookup with fast updates,' Computer Networks, pp. 289-303, 2004
15 박경혜, 임혜숙, 'IP 주소 검색에서 블룸 필터를 사용한 다중 해싱 구조,' 정보과학회논문지: 데이타베이스, 제 36권 제 2호, pp. 84-98, 2009.4   과학기술학회마을
16 Alagukonar Ganapathy Alagupriya, 'Packet Classification Algorithms Using Bloom Filters', 이화여자대학교 대학원 2008년도 석사학위 청구논문
17 Jahangir Hasan, Srihari Cadambi, Venkatta Jakkula, and Srimat Chakradhar, 'Chisel: A storage-efficient, collision-free hash-based network processing Architecture,' Proc. ISCA 2006. pp. 203-215