High-Performance Longest Prefix Matching TCAM without Priority Encoder
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 98 === By recent studies, Internet core routers not only require fast search speed, but also high update rates. Ternary Content Addressable Memory is a kind of fully associative hardware storage device that has properties of high-performance and simplicity to implement...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/55027672323730385650 |
| Summary: | 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 98 === By recent studies, Internet core routers not only require fast search speed, but also high update rates. Ternary Content Addressable Memory is a kind of fully associative hardware storage device that has properties of high-performance and simplicity to implement IP routers. A high-performance TCAM design is proposed to solve the longest prefix matching (LPM) problem. Compared to the traditional LPM solution, the proposed TCAM does not require storing prefixes in the increasing order of prefix length so the priority encoder is not used in this approach. Furthermore, no pre-computation circuits or Multiple Match Detection circuits are employed in the proposed design. The proposed TCAM meets the requirement of high-speed OC-3072 (160 Gb/s) multi-gigabit/s Ethernet network using the TSMC 0.18 μm CMOS process with 1.8V supply voltage. The maximum frequency of the proposed structure is 340 MHz.
|
|---|