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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages805-809
Number of pages5
Volume1896
ISBN (Print)3540678999, 9783540678991
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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Internet protocols
Prefix
Router
Routers
Plastics
Reconfigurable Architectures
Computer Architecture
Computer architecture
Cell
Granularity
High Throughput
Throughput
Computing
Architecture
Character
Design

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Shiozawa, T., Imlig, N., Nagami, K., Oguri, K., Nagoya, A., & Nakada, H. (2000). An implementation of longest prefix matching for IP router on plastic cell architecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1896, pp. 805-809). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1896). Springer Verlag.

An implementation of longest prefix matching for IP router on plastic cell architecture. / Shiozawa, Tsunemichi; Imlig, Norbert; Nagami, Kouichi; Oguri, Kiyoshi; Nagoya, Akira; Nakada, Hiroshi.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1896 Springer Verlag, 2000. p. 805-809 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1896).

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

Shiozawa, T, Imlig, N, Nagami, K, Oguri, K, Nagoya, A & Nakada, H 2000, An implementation of longest prefix matching for IP router on plastic cell architecture. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1896, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1896, Springer Verlag, pp. 805-809, 10th International Conference on Field-Programmable Logic and Applications, FPL 2000, Villach, Austria, 8/27/00.
Shiozawa T, Imlig N, Nagami K, Oguri K, Nagoya A, Nakada H. An implementation of longest prefix matching for IP router on plastic cell architecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1896. Springer Verlag. 2000. p. 805-809. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Shiozawa, Tsunemichi ; Imlig, Norbert ; Nagami, Kouichi ; Oguri, Kiyoshi ; Nagoya, Akira ; Nakada, Hiroshi. / An implementation of longest prefix matching for IP router on plastic cell architecture. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1896 Springer Verlag, 2000. pp. 805-809 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{38175e9c638d43988e9474198eac3916,
title = "An implementation of longest prefix matching for IP router on plastic cell architecture",
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.",
author = "Tsunemichi Shiozawa and Norbert Imlig and Kouichi Nagami and Kiyoshi Oguri and Akira Nagoya and Hiroshi Nakada",
year = "2000",
language = "English",
isbn = "3540678999",
volume = "1896",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "805--809",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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

M3 - Conference contribution

SN - 3540678999

SN - 9783540678991

VL - 1896

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 805

EP - 809

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -