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

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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Shiozawa, Tsunemichi, Imlig, Norbert, Nagami, Kouichi, Oguri, Kiyoshi, Nagoya, Akira, Nakada, Hiroshi
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Computer systems
Constraint Satisfaction Problem
Electronics
Exact sciences and technology
Hardware
Internet Protocol
Internet Protocol Address
Reconfigurable Hardware
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Terminal Object
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-44614-1_90