|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
11th IEEE Symposium on Computers and Communications (ISCC'06)
Packet Forwarding Using Pipelined Multibit Tries
Cagliari, Sardinia, Italy
June 26-June 29
ISBN: 0-7695-2588-1
| ASCII Text | x | ||
| Wencheng Lu, Sartaj Sahni, "Packet Forwarding Using Pipelined Multibit Tries," 2012 IEEE Symposium on Computers and Communications (ISCC), pp. 802-807, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ISCC.2006.119, author = {Wencheng Lu and Sartaj Sahni}, title = {Packet Forwarding Using Pipelined Multibit Tries}, journal ={2012 IEEE Symposium on Computers and Communications (ISCC)}, volume = {0}, year = {2006}, issn = {1530-1346}, pages = {802-807}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.119}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE Symposium on Computers and Communications (ISCC) TI - Packet Forwarding Using Pipelined Multibit Tries SN - 1530-1346 SP802 EP807 A1 - Wencheng Lu, A1 - Sartaj Sahni, PY - 2006 KW - Packet classification KW - longest matching prefix KW - controlled prefix expansion KW - fixed-stride tries KW - variable-stride tries KW - dynamic programming. VL - 0 JA - 2012 IEEE Symposium on Computers and Communications (ISCC) ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.119
We propose a heuristic for the construction of variablestride multibit tries. These multibit tries are suitable for packet forwarding using a pipelined architecture. The variable-stride tries constructed by our heuristic require upto 1/32 of the per-stage memory required by optimal pipelined fixed-stride tries. We also develop a tree packing heuristic, which dramatically reduces the per-stage memory required by fixed- and variable-stride multibit tries constructed for pipelined architectures. On publicly available router databases, our tree packing heuristic reduces the maximum per-stage memory required by optimal pipelined fixed-stride tries
Index Terms:
Packet classification, longest matching prefix, controlled prefix expansion, fixed-stride tries, variable-stride tries, dynamic programming.
Citation:
Wencheng Lu, Sartaj Sahni, "Packet Forwarding Using Pipelined Multibit Tries," iscc, pp.802-807, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.