An Implementation of Longest Prefix Matching for IP Router on Plastic Cell Architecture
FPL(2000)
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.
MoreTranslated text
Key words
reconfigurable computer architecture,longest prefix matching,computing mechanism,high-throughput internet protocol,ip router,plastic cell architecture,longest prefix,key issue,reconfigurable computing,computational mechanics,high throughput,internet protocol
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined