Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries

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.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, September 7, 2017 - 11:58:04 AM
Last modification on : Thursday, August 22, 2019 - 12:10:38 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Michel Hanna, Sangyeun Cho, Rami Melhem. A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries. 10th IFIP Networking Conference (NETWORKING), May 2011, Valencia, Spain. pp.406-419, ⟨10.1007/978-3-642-20757-0_32⟩. ⟨hal-01583419⟩



Record views


Files downloads