Packet forwarding using pipelined multibit tries

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2006, Pages 802-807

  Lu, Wencheng ^a   Sahni, Sartaj ^a  

^a University of Florida   (United States)

Author keywords

Controlled prefix expansion; Dynamic programming; Fixed stride tries; Longest matching prefix; Packet classification; Variable stride tries

Indexed keywords

DATABASE SYSTEMS; DYNAMIC PROGRAMMING; HEURISTIC METHODS; PACKET NETWORKS; ROUTERS;

CONTROLLED PREFIX EXPANSION; MULTIBIT TRIES; PACKET CLASSIFICATION; VARIABLE STRIDE TRIES;

COMPUTER ARCHITECTURE;

EID: 34547338340     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2006.119     Document Type: Conference Paper

References (8)

1. A.Basu and G. Nailikar Fast Incremental Updates for Pipeline Forwarding Engines, InfoCom, 2003.
2. E.Horowitz, S.Sahni, and S.Rajasekeran, Computer Algorithms/C++, W. H. Freeman, NY, 1997.
3. K. Kim. and S. Sahni, Efficient construction of pipelined multibit-trie Router-Tables, Paper in Review.
4. M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, Survey and taxonomy of IP address lookup algorithms, IEEE Network, 2001, 8-23.
5. S. Sahni, K. Kim, and H. Lu, Data structures for one-dimensional packet classification using most-specific-rule matching, International Journal on Foundations of Computer Science, 14, 3, 2003, 337-358.
6. S. Sahni and K. Kim, Efficient construction of multibit tries for IP lookup, IEEE/ACM Transactions on Networking, 11, 4, 2003.
7. V. Srinivasan and G. Varghese, Faster IP lookups using controlled prefix expansion, ACM Transactions on Computer Systems, Feb: 1-40, 1999.
8. http//www.cise:ufl.edu/~wlu/pipelineld.pdf