Bit-shuffled trie: a new approach for IP address lookup

Authors:
Derek Pao;Ziyan Lu
Affiliations:
City University of Hong Kong;City University of Hong Kong
Venue:
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Year:
2010

Citing 3
Cited 0

Tree bitmap: hardware/software IP lookups with incremental updates

ACM SIGCOMM Computer Communication Review
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine

IEEE Transactions on Computers
Range Tries for scalable address lookup

Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

IP address lookup is a fundamental operation in packet forwarding. Using multi-level index tables to find out the next-hop value is an attractive approach due to its simplicity. However, memory efficiency is relatively low because prefixes are sparsely distributed in the address space. In this poster, we shall outline a new approach to construct memory efficient index tables based on a technique called bit-shuffling. The proposed method is evaluated using a real-life IPv4 routing table with 321K prefixes. The lookup tables occupy 0.8MB memory.