T-cache: Dependency-free ternary rule cache for policy-based forwarding

Y Wan, H Song, Y Xu, Y Wang, T Pan… - … -IEEE Conference on …, 2020 - ieeexplore.ieee.org
Ternary Content Addressable Memory (TCAM) is widely used by modern routers and
switches to support policy-based forwarding. However, the limited TCAM capacity does not …

T-cache: Efficient policy-based forwarding using small tcam

Y Wan, H Song, Y Xu, Y Wang, T Pan… - IEEE/ACM …, 2021 - ieeexplore.ieee.org
Ternary Content Addressable Memory (TCAM) is widely used by modern routers and
switches to support policy-based forwarding due to its incomparable lookup speed and …

Parallel name lookup for named data networking

Y Wang, H Dai, J Jiang, K He… - 2011 IEEE Global …, 2011 - ieeexplore.ieee.org
Name-based route lookup is a key function for Named Data Networking (NDN). The NDN
names are hierarchical and have variable and unbounded lengths, which are much longer …

CompactDFA: Generic state machine compression for scalable pattern matching

A Bremler-Barr, D Hay, Y Koral - 2010 Proceedings IEEE …, 2010 - ieeexplore.ieee.org
Pattern matching algorithms lie at the core of all contemporary Intrusion Detection Systems
(IDS), making it intrinsic to reduce their speed and memory requirements. This paper …

Parallel IP lookup using multiple SRAM-based pipelines

W Jiang, VK Prasanna - 2008 IEEE International Symposium …, 2008 - ieeexplore.ieee.org
Pipelined SRAM-based algorithmic solutions have become competitive alternatives to
TCAMs (ternary content addressable memories) for high throughput IP lookup. Multiple …

Efficient lookup methods for ternary content addressable memory and associated devices and systems

M Hamdi, D Lin - US Patent 9,077,669, 2015 - Google Patents
Lookup techniques are described, which can achieve improvements in energy efficiency,
speed, and cost, of IP address lookup, for example, in devices and systems employ ing …

Clue: Achieving fast update over compressed table for parallel lookup with reduced dynamic redundancy

T Yang, R Duan, J Lu, S Zhang… - 2012 IEEE 32nd …, 2012 - ieeexplore.ieee.org
The sizes of routing table in backbone routers continue to keep a rapid growth and some of
them currently increase up to 400K entries [1]. An effective solution to deflate the large table …

Data tables in content addressable memory

JA Wickeraad - US Patent 10,586,594, 2020 - Google Patents
Examples disclosed herein relate, in one aspect, to an electronic device including a
processor, a lookup engine, and a content addressable memory (CAM) including a plurality …

Sequence-preserving parallel IP lookup using multiple SRAM-based pipelines

W Jiang, VK Prasanna - Journal of Parallel and Distributed Computing, 2009 - Elsevier
SRAM (static random access memory)-based pipelined algorithmic solutions have become
competitive alternatives to TCAMs (ternary content addressable memories) for high …

A comparative review of scalable lookup algorithms for IPv6

A Smiljanić, Z Čiča - Computer Networks, 2012 - Elsevier
IPv4 addresses have been exhausted, and the Internet is moving to IPv6. Many IP lookup
algorithms have been proposed in the past. In this paper, we analyze their scalability and …