| Summary: | 碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 101 === Recently, research community has drawn lots of attentions in the router virtualization that allows multiple virtual router instances running on the same physical router platform. Thus, the virtualized router should be able to handle packets from different virtual networks. Once the multiple virtual routing tables are merged, memory requirement can be reduced due to the common entries among virtual routing tables. Many previous works use trie-based methods to merge the virtual routing tables. In this thesis, we propose two range-based merging methods. The data structures are based on the dynamic multiway segment tree (DMST) that is implemented with standard B-tree structure. As our experimental results show, the two proposed methods perform much better than the trie-based ones in lookup speed, update performance, scalability, and have similar memory consumption.
|
|---|
