An implementation of longest prefix matching for IP router on plastic cell architecture

Tsunemichi Shiozawa, Norbert Imlig, Kouichi Nagami, Kiyoshi Oguri, Akira Nagoya, Hiroshi Nakada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationField-Programmable Logic and Applications
Subtitle of host publicationThe Roadmap to Reconfigurable Computing - 10th International Conference, FPL 2000, Proceedings
EditorsReiner W. Hartenstein, Herbert Grunbacher
PublisherSpringer Verlag
Pages805-809
Number of pages5
ISBN (Print)3540678999, 9783540678991
DOIs
Publication statusPublished - 2000
Externally publishedYes
Event10th International Conference on Field-Programmable Logic and Applications, FPL 2000 - Villach, Austria
Duration: Aug 27 2000Aug 30 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1896
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Field-Programmable Logic and Applications, FPL 2000
Country/TerritoryAustria
CityVillach
Period8/27/008/30/00

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'An implementation of longest prefix matching for IP router on plastic cell architecture'. Together they form a unique fingerprint.

Cite this