A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries - NETWORKING 2011 - Part I Access content directly
Conference Papers Year : 2011

A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries

Michel Hanna
  • Function : Author
  • PersonId : 1015770
Sangyeun Cho
  • Function : Author
  • PersonId : 866049
Rami Melhem
  • Function : Author
  • PersonId : 866050

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.
Fichier principal
Vignette du fichier
978-3-642-20757-0_32_Chapter.pdf (416.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01583419 , version 1 (07-09-2017)

Licence

Attribution

Identifiers

Cite

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⟩
77 View
107 Download

Altmetric

Share

Gmail Facebook X LinkedIn More