Design of embedded TCAM based longest prefix match search engine

Manikandan, P.; Larsen, Bjørn B.; Einar, J.

doi:10.1016/j.micpro.2011.08.002

Cited by 4 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kasnavi et al (2005) demonstrates a lookup table solution with TCAM hardware-based LPM. Manikandan et al (2011) uses TCAM devices in a similar idea to accelerate LPM for a search engine. However, the high circuit density of TCAM suffers from high cost and programming complexity.…”

Section: Related Workmentioning

confidence: 99%

An efficient parallelization of longest prefix match and application on data compression

Özsoy

2016

The International Journal of High Performance Computing Applica

View full text Add to dashboard Cite

In this article, we describe a new approach to parallelize longest prefix match (LPM) algorithm through bit parallelism, also known as bit-vector approach. This approach makes use of bit-wise computations and leverages bit parallelism. The proposed parallel algorithm will be demonstrated in dictionary-based lossless data compression on general-purpose graphics processing units (GPGPUs). One of the main contributions of this work is redesigning the core part of the data compression algorithm and replacing it with the newly proposed bit-vector LPM solution. Using bit parallelism is a fundamentally new approach for data compression and promising in performance for hybrid CPU-GPU environments. The implementation of the new compression algorithm on GPUs improves the performance of the compression process compared to the previous attempts. Moreover, the bit-vector approach opens new opportunities for improvement and increases the applicability to popular heterogeneous environments.

show abstract

Section: Related Workmentioning

confidence: 99%

An efficient parallelization of longest prefix match and application on data compression

Özsoy

2016

The International Journal of High Performance Computing Applica

View full text Add to dashboard Cite

show abstract

Comparative study of power consumption of a NetFPGA-based forwarding node in publish–subscribe Internet routing

Zheng

Wang

2014

Computer Communications

View full text Add to dashboard Cite

An Efficient Match Search Approach Using Two-Dimensional Hash Function in Hardware-Based Dictionary Compression

Dong

2019

J CIRCUIT SYST COMP

View full text Add to dashboard Cite

The hardware-based dictionary compression is widely adopted for high speed requirement of real-time data processing. Hash function helps to manage large dictionary to improve compression ratio but is prone to collisions, so some phrases in match search result are not true matches. This paper presents a novel match search approach called dual chaining hash refining, which can improve the efficiency of match search. From the experimental results, our method showed obvious advantage in compression speed compared with other approach that utilizes single hash function described in the previous publications.

show abstract

Design of embedded TCAM based longest prefix match search engine

Cited by 4 publications

References 23 publications

An efficient parallelization of longest prefix match and application on data compression

An efficient parallelization of longest prefix match and application on data compression

Comparative study of power consumption of a NetFPGA-based forwarding node in publish–subscribe Internet routing

An Efficient Match Search Approach Using Two-Dimensional Hash Function in Hardware-Based Dictionary Compression

Contact Info

Product

Resources

About