| Summary: | 碩士 === 雲林科技大學 === 電子與資訊工程研究所 === 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 convert a routing table into a forwarding table to improve IP lookup performance. The forwarding table consisits of Bitmap, Start List, Intra Segment Cover List, and Inter Segment Cover List. Bitmap is used as index to Start List. The others store the prefixes information and the covering relationship between prefixes is stored in Inter Segment Cover List or Intra Segment Cover List. By our forwarding table, the number of memory access at most is 3 during an IP lookup, and it can be updated without reconstructing from scratch when the routing table changes. The simulation reveals that IPLBC outperforms MRT [18] and DTBM [19] in terms of search performance and update performance.
|
|---|
