Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Faster IP lookups using controlled prefix expansion
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Efficient construction of multibit tries for IP lookup
IEEE/ACM Transactions on Networking (TON)
Tree bitmap: hardware/software IP lookups with incremental updates
ACM SIGCOMM Computer Communication Review
EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup
IEEE Transactions on Computers
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
Scalable, memory efficient, high-speed IP lookup algorithms
IEEE/ACM Transactions on Networking (TON)
Shape Shifting Tries for Faster IP Route Lookup
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
CAMP: fast and efficient IP lookup architecture
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Non-random generator for IPv6 tables
HOTI '04 Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium
Flashlook: 100-Gbps hash-tuned route lookup architecture
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Frugal IP lookup based on a parallel search
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Priority Tries for IP Address Lookup
IEEE Transactions on Computers
Low-power TCAMs for very large forwarding tables
IEEE/ACM Transactions on Networking (TON)
A Classified Multisuffix Trie for IP Lookup and Update
IEEE Transactions on Computers
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
IPv4 addresses have been exhausted, and the Internet is moving to IPv6. Many IP lookup algorithms have been proposed in the past. In this paper, we analyze their scalability and applicability to IPv6. In particular, we calculate the memory requirements of diverse lookup algorithms and compare them for different lookup table sizes, assuming the high lookup throughput of one lookup per memory access. The BPFL (Balanced Parallelized Frugal Lookup) algorithm requires the smallest external and internal memories for the examined IPv6 lookup tables. In BPFL, the lookup table is defined using the range selector, balanced trees, and bitmaps. Lookup algorithms based on hashing and TCAMs also use memory frugally.