Succinct Representation of Static Packet Forwarding Tables

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.

• Type: Conference
• Year: 2007
• Where: ICN
• Authors: Wencheng Lu, Sartaj Sahni
• Keywords: Compact Representations, ICN 2007, Packet Forwarding, Packet Forwarding Tables