A perfect-hashing scheme for fast IP lookup

Authors:
Yun-Zhao Li
Affiliations:
School of Computer Science, National University of Defense and Technology, Chang Sha and Southwest Electronics and Telecommunication Technology Research Institute, Cheng Du, China
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Year:
2009

Citing 5
Cited 0

Fast address lookups using controlled prefix expansion

ACM Transactions on Computer Systems (TOCS)
Fast hash table lookup using extended bloom filter: an aid to network processing

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Explicit constructions for perfect hash families

Designs, Codes and Cryptography
Scalable multigigabit pattern matching for packet inspection

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
TCAM Architecture for IP Lookup Using Prefix Properties

IEEE Micro

Quantified Score

Hi-index	0.00

Visualization

Abstract

IP lookup is widely performed in many network applications, including route lookup, packet classification and network monitoring. Hashing scheme is an important technology for it and can gain O(1) average memory access per lookup. But collisions exist in common hash scheme, which need multiple memory accesses, affecting the worst-case throughput critically. A perfect-hashing scheme was proposed. By combining Bloom Filter (BF) and Contend Addressable Memory (CAM) together, it eliminated collisions at a low price. Through a combination of analysis and simulations we show that this algorithm is significantly faster than common hash scheme in the worst case performance.