Binary search on levels using a Bloom filter for IPv6 address lookup

Authors:
Kyuhee Lim;Kyunghye Park;Hyesook Lim
Affiliations:
Ewha Womans University, Seoul, Korea;Ubiquoss Inc., Seoul, Korea;Ewha Womans University, Seoul, Korea
Venue:
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Year:
2009

Citing 4
Cited 0

Scalable high speed IP routing lookups

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Fast packet classification using bloom filters

Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Longest prefix matching using bloom filters

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new IP address lookup using a Bloom filter. The proposed algorithm is based on binary search on trie levels, and a Bloom filter pre-filters the levels which do not have matching nodes in performing the binary search on levels. Hence the number of memory access which affects the search performance is greatly reduced. Simulation result shows that an IPv6 address lookup can be performed with 1--3 memory accesses in average for an IPv6 routing data set with 1096 prefixes.