| 摘要 |
CCN ROUTING USING HARDWARE-ASSISTED HASH TABLES One embodiment provides a system that facilitates forwarding of packets with variable length names. During operation, the system receives a packet with a hierarchically structured variable length identifier (HSVLI) which comprises contiguous name components ordered from a most general level to a most specific 10 level. The system performs a longest prefix match lookup by selecting an entry from a first data structure of entries. The entries indicate a name component, forwarding information for the name component, and a plurality of entry identifiers that chain an entry to another entry. If a size of the name component is less than or equal to a predetermined threshold, the system selects an entry based on the name 15 component. If the size is greater, the system selects an entry based on a compressed key which can be a hash of the name component. The system also resolves collisions associated with the selected entry. LLU) t d > co / / z z z E3 E3 C) U Zr r Z H ,- 0 0 07) -c 0 U0)0 / < ~ -~ CC ~ ( o* C) 0U< 0 <-c z 3: Cl) jl |
