Design and Analysis of Matching Circuit Architectures for a Closest Match Lookup

Authors:
Friederich Kupzog;Holger Blume;Tobias Noll;Kieran McLaughlin;Sakir Sezer;John McCanny
Affiliations:
RWTH Aachen University;RWTH Aachen University;RWTH Aachen University;Institute of Electronics, Communications and Information Technology at QUB;Institute of Electronics, Communications and Information Technology at QUB;Institute of Electronics, Communications and Information Technology at QUB
Venue:
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Year:
2006

Citing 0
Cited 2

A scalable packet sorting circuit for high-speed WFQ packet scheduling

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Fully hardware based WFQ architecture for high-speed QoS packet scheduling

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The massive growth in the use of Internet and the development of new real-time applications has put considerable strain on the techniques currently used for the lookup and retrieval of information essential for classification, routing, Quality of Service (QoS) and Internet security. This paper investigates the design and implementation of a number of closest value lookup circuits, suitable for deployment in a range of networking applications. Detailed descriptions of a number of matching circuit architectures are given and the results of hardware implementations for the Altera Stratix II FPGA are discussed and evaluated.