Ccn Routing Using Hardware-assisted Hash Tables

Abstract

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 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 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.


Claims
Download PDF
Document Preview
Document History
  • Publication: Mar 7, 2017
  • Application: Dec 15, 2014
    US US 201414570144 A
  • Priority: Dec 15, 2014
    US US 201414570144 A

Sign in to the Lens

Feedback