| Summary: | 碩士 === 東吳大學 === 資訊管理學系 === 100 === The Internet is growing very rapidly in both the size and the traffic. In order to eliminate the bottleneck caused by routers due to the growing internet traffic and routing table entries. Research should be conducted on methods of reducing the time required for IP lookup which can allow routers to have high packet forwarding efficiency. Router packet forwarding capacity depends on the IP lookup performance, and IP lookup is a major bottleneck in high-performance routes.
In this paper, we propose a fast and updateable indirect IP lookup scheme for dynamic routing tables that can dynamically insert and delete prefixes. Our scheme not only is more suited for implementation in dynamic routing tables, but will also retain the high lookup efficiency in indirect lookup. We adopt a compressed bitmap data structure for saving memory space and develop a prefix parent relationship data structure for dynamically update prefixes.
In accordance with such a data structure, will be able to quickly lookup the destination address corresponding to the next hop and efficient implementation of the forwarding table to add, delete and update of the prefix. Through the data structure and corresponding algorithms, even if the application in today's routing table with up to more than 400,000 entries. The scheme still has a high performance of the IP lookup.
|
|---|
