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. Copyright © 2010 ACM.
| Original language | English |
|---|---|
| Title of host publication | ANCS 2010 - Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems |
| Publisher | IEEE |
| ISBN (Electronic) | 9781450303798 |
| ISBN (Print) | 978-1-4244-9127-8 |
| Publication status | Published - 2010 |
| Event | 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2010 - La Jolla, CA, United States Duration: 25 Oct 2010 → 26 Oct 2010 |
Conference
| Conference | 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2010 |
|---|---|
| Place | United States |
| City | La Jolla, CA |
| Period | 25/10/10 → 26/10/10 |
Research Keywords
- IP address lookup
- Packet forwarding
- Pipelined architecture