TY - GEN
T1 - An implementation of longest prefix matching for IP router on plastic cell architecture
AU - Shiozawa, Tsunemichi
AU - Imlig, Norbert
AU - Nagami, Kouichi
AU - Oguri, Kiyoshi
AU - Nagoya, Akira
AU - Nakada, Hiroshi
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=47649098685&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=47649098685&partnerID=8YFLogxK
U2 - 10.1007/3-540-44614-1_90
DO - 10.1007/3-540-44614-1_90
M3 - Conference contribution
AN - SCOPUS:47649098685
SN - 3540678999
SN - 9783540678991
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 805
EP - 809
BT - Field-Programmable Logic and Applications
A2 - Hartenstein, Reiner W.
A2 - Grunbacher, Herbert
PB - Springer Verlag
T2 - 10th International Conference on Field-Programmable Logic and Applications, FPL 2000
Y2 - 27 August 2000 through 30 August 2000
ER -