Effictive Routing Table Lookup with Bit Selection Scheme
碩士 === 國立臺灣科技大學 === 電子工程系 === 89 === Emerging high-speed network puts great demand on router performance. One major limitation of current router performance is the routing table lookup mechanism. For each incoming packet, a router performs a longest-prefix-match lookup. In the thesis, we...
Main Author: | 王錦煜 |
---|---|
Other Authors: | 陳郁堂 |
Format: | Others |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/67562054775445783019 |
Similar Items
-
A NEW Fast Image Encryption Scheme Based on Bit-Level Permutation and Lookup Table
by: JianDaLu, et al.
Published: (2011) -
MsBV: A Memory Compression Scheme for Bit-Vector-Based Classification Lookup Tables
by: Zilin Shi, et al.
Published: (2020-01-01) -
Second-Order Masked Lookup Table Compression Scheme
by: Annapurna Valiveti, et al.
Published: (2020-08-01) -
Study and Design of High-Speed IP Routing Lookup Schemes
by: Pi-Chung Wang, et al.
Published: (2001) -
High Speed Routing Table Lookups for Current and Next Generation Internet Routing
by: Hampson, Ernest, III
Published: (2002)