A High-performance Pipeline Longest Prefix Matching Circuit
碩士 === 國立中興大學 === 資訊科學與工程學系 === 96 === In this paper, we will propose a High-performance Pipeline Longest Prefix Matching circuit, the circuit solve package routing on the internet router. In this paper we discussed previous solution for the longest prefix matching, in detail we explained our circui...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Online Access: | http://ndltd.ncl.edu.tw/handle/42040295720572640074 |