IP Lookup based on Bit-Mapping and Prefix-Covering
碩士 === 雲林科技大學 === 電子與資訊工程研究所 === 98 === IP lookup is the bottleneck in a router. IP lookup is to find the next hop of each incoming packet with a longest-prefix-match address in the routing table. In this paper we propose a scheme named IP Lookup based on Bit-mapping and Prefix-Covering (IPLBC) to c...
Main Authors: | Yao-Chung Hsu, 許耀中 |
---|---|
Other Authors: | Lih-Chyau Wuu |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/53643739058992463839 |
Similar Items
-
A Fast IP Lookup Scheme for Longest Prefix Matching
by: Yuan-chung Wang, et al.
Published: (2008) -
A Dynamic Indirect IP Lookup based on Prefix Relationships
by: Chih-Cheng Li, et al.
Published: (2012) -
Update-aware Controlled Prefix Expansion for Fast IP Lookups
by: Kuan-Ying Ho, et al.
Published: (2008) -
A Fast IP Lookup Scheme for Longest-Matching Prefix
by: Shou-Yu Pin, et al.
Published: (2001) -
Twin-bit based Fast IP Lookup and Incremental Update Algorithm
by: Cheng-che HSU, et al.
Published: (2006)