DocumentCode
2548858
Title
Succinct Representation of Static Packet Forwarding Tables
Author
Lu, Wencheng ; Sahni, Sartaj
Author_Institution
Univ. of Florida, Gainesville
fYear
2007
fDate
22-28 April 2007
Firstpage
78
Lastpage
78
Abstract
We develop algorithms for the compact representation of the trie structures that are used for Internet packet forwarding. Our compact representations are experimentally compared with competing compact representations for packet forwarding tables and found to simultaneously reduce the number of memory accesses required for a lookup as well as the memory required to store the forwarding table.
Keywords
Internet; memory protocols; table lookup; tree data structures; Internet; compact representation; memory accesses; static packet forwarding tables; succinct representation; table lookup; Binary trees; Data structures; Information science; Internet;
fLanguage
English
Publisher
ieee
Conference_Titel
Networking, 2007. ICN '07. Sixth International Conference on
Conference_Location
Martinique
Print_ISBN
0-7695-2805-8
Electronic_ISBN
0-7695-2805-8
Type
conf
DOI
10.1109/ICN.2007.88
Filename
4196271
Link To Document