An Implementation of Longest Prefix Matching for IP Router on Plastic Cell Architecture

Authors:
Tsunemichi Shiozawa;Norbert Imlig;Kouichi Nagami;Kiyoshi Oguri;Akira Nagoya;Hiroshi Nakada
Affiliations:
-;-;-;-;-;-
Venue:
FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Year:
2000

Citing 6
Cited 0

Micropipelines

Communications of the ACM
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Communicating logic: an alternative embedded stream processing paradigm

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
A Hardware Implementation of Constraint Satisfaction Problem Based on New Reconfigurable LSI Architecture

FPL '98 Proceedings of the 8th International Workshop on Field-Programmable Logic and Applications, From FPGAs to Computing Paradigm
Plastic Cell Architecture: Towards Reconfigurable Computing for General-Purpose

FCCM '98 Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines
The Plastic Cell Architecture for Dynamic Reconfigurable Computing

RSP '98 Proceedings of the Ninth IEEE International Workshop on Rapid System Prototyping

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce an implementation of the longest prefix matching operation by using the reconfigurable computer architecture called Plastic Cell Architecture (PCA). By using the characters of PCA, it is possible to build the computing mechanism, which suits the granularity of the problem and the structure of it. We apply them to design the longest prefix matching operation that is one of the key issues for the high-throughput Internet Protocol (IP) routers.