Abstract
An IP router has to match each incoming packet’s IP destination address against all stored prefixes in its forwarding table. This task is increasingly more challenging as the routers have to: not only keep up with the ultra-high link speeds, but also be ready to switch to the 128-bit IPv6 address space while the number of prefixes grows quickly. Commercially, many routers employ Ternary Content Addressable Memory (TCAM) to facilitate fast IP lookup. However, TCAMs are power-eager, expensive, and not scalable. We advocate in this paper to keep the forwarding table in trie data structures that are accessed in a pipeline manner. Especially, we propose a new scalable IPv6 forwarding engine based on a multibit trie architecture that can achieve a throughput of 3.1 Tera bits per second.
Chapter PDF
Similar content being viewed by others
References
Arano, T.: IPv4 Address Report. Potaroo Projection (2010), http://www.potaroo.net/tools/ipv4/index.html
Baboescu, F., Tullsen, D., Rosu, G., Singh, S.: A Tree Based Router Search Engine Architecture with Single Port Memories. ACM Sigarch Com. Arch. 33(2) (2005)
Bando, M., Chao, J.: Flashtrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps. In: IEEE Infocom (2010)
Chao, H.J., Liu, B.: High Performance Switches and Routers. Wiley, Chichester (2007)
Cormen, T., Leiserson, C., Rivest, R., Stien, C.: Introduction to Algorithms. McGraw-Hill, New York (2003)
Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small forwarding tables for fast routing lookups. ACM Sigcomm (1997)
Eatherton, W., Varghese, G., Dittia, Z.: Tree Bitmap: Hardware/Software IP Lookups with Incremental Updates. ACM Sigcomm Comp. Rev. 34(2) (2004)
Gupta, P., Lin, S., Mckeown, N.: Routing Lookups in Hardware at Memory Access Speeds. In: IEEE Infocom (1998)
Hanna, M., Demetriades, S., Cho, S., Melhem, R.: CHAP: Enabling Efficient Hardware-based Multiple Hash Schemes for IP Lookup. In: IFIP Networking (2009)
Hanna, M., Demetriades, S., Cho, S., Melhem, R.: Progressive Hashing for Packet Processing Using Set Associative Memory. In: IEEE/ACM ANCS (2009)
Hanna, M., Demetriades, S., Cho, S., Melhem, R.: Advanced Hashing Schemes for Packet Forwarding Using Set-Associative Memory Architectures. Journal of Distributed and Parallel Computing (JPDC) 71, 1–15 (2011)
Jiang, W., Prasanna, V.: Multi-Terabit IP Lookup Using Parallel Bidirectional Pipelines. In: ACM Computing Frontiers (2008)
Kim, K.S., Sahni, S.: Efficient Construction of Pipelined Multibit-Trie Router-Tables. IEEE Trans. on Comp. 56(1) (2007)
Li, Y.K., Pao, D.: Comparative Studies of Address Lookup Algorithms for IPv6. In: IEEE ICACT (2006)
Li, Z., Zheng, D., Ma, Y.: Tree, Segment Table, and Route Bucket: A Multistage Algorithm for IPv6 Routing Table Lookup. In: IEEE Infocom (2007)
Nilsson, S., Karlsson, G.: IP-Address Lookup Using LC-Tries. IEEE J. on Sel. Areas in Comm. 17(6) (1999)
RIS. Routing Information Service, http://www.ripe.net/ris/
Ruiz-snchez, M., Biersack, E., Dabbous, W.: Survey and Taxonomy of IP Address Lookup Algorithms. IEEE Network 15(2) (2001)
Shah, D., Gupta, P.: Fast Updating Algorithms for TCAMs. IEEE Micro Mag. 21(1) (2001)
Srinivasan, V., Varghese, G.: Fast Address Lookups Using Controlled Prefix Expansion. ACM Trans. Comp. Sys. 17(1) (1999)
Thoziyoor, S., Muralimanohar, N., Ahn, J.H., Jouppi, N.P.: CACTI 5.1: An Integrated Cache Timing, Power, and Area Model. Technical report, HP Labs
Varghese, G.: Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices. Morgan Kaufmann, San Francisco (2005)
Wang, G., Tzeng, N.-F.: TCAM-Based Forwarding Engine with Minimum Independent Prefix Set (MIPS) for Fast Updating. In: IEEE ICC (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Hanna, M., Cho, S., Melhem, R. (2011). A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries. In: Domingo-Pascual, J., Manzoni, P., Palazzo, S., Pont, A., Scoglio, C. (eds) NETWORKING 2011. NETWORKING 2011. Lecture Notes in Computer Science, vol 6640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20757-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-20757-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20756-3
Online ISBN: 978-3-642-20757-0
eBook Packages: Computer ScienceComputer Science (R0)