| Summary: | 碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 96 === IP lookup effects the speed of the incoming packet to which output port, which is an important role in the router-table design. Since the Internet is changeable, the router-table must be dynamic for supporting insertion and deletion quickly. In this thesis, we propose Suffix B-Tree data structures for dynamic router-tables design to speed up IP lookup and update. The unique feature of our data structure is that one node can store more than one prefixes
to reduce the number of memory access. When lookup, it may search more prefixes in one node and find the longest matching prefix not matching until the leaf. When update, it needs not to reconstruct the table and also works quickly. As a byproduct, the proposed data structure not only minimizes operating time but also reduces
the number of memory access. The lookup and insertion take
O((2^m-1)(floor(W/m))), where W is the length of IP address and m is stride. The deletion takes O((2^m)(floor(W/m))). Furthermore, based on Suffix B-Tree, we also introduce another extended structure called Index Suffix B-tree which outperforms Suffix B-tree.
|
|---|
