Large-scale SRAM-based IP lookup architectures using compact trie search structures.

Highlights: [•] We proposed two compact data structures for Internet Protocol (IP) lookup. [•] The node size variety leads to the memory inefficiency in hardware implementations. [•] Compact Trie Forest (CTF) uses multiple disjoint pipelines to solve the problem. [•] Compact Trie ∊ (CT ∊ ) splits nodes into sequentially connected multiple small nodes. [•] To support each data structure, two pipelined SRAM-based architectures are proposed. [Copyright &y& Elsevier]