Affiliations: Department of Information Management, Ming‐Hsin University of Science and Technology, Hsinchu 304, Taiwan, ROC E‐mail: schu@mis.must.edu.tw | Telecommunication Laboratories, Chunghwa Telecom Co., Ltd., Taipei 106, Taiwan, ROC E‐mail: ctchan@cht.com.tw | Department of Information Management, I‐Shou University, Kaohsiung 840, Taiwan, ROC E‐mail: leorean@isu.edu.tw | Institute of Computer Science and Information Technology, National Taichung Institute of Technology, Taichung 404, Taiwan, ROC E‐mail: abu@ntit.edu.tw
Note: [] Corresponding author.
Abstract: Nowadays, the commonly used table lookup scheme for IP routing is based on the so‐called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, which complicates the IP lookup. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new IP lookup scheme. By using the proposed scheme, the size of the forwarding table can be compressed to 360 Kbytes for a large routing table with 58 000 routing entries. The data structure for the incremental update is also introduced by adding 40% storage. The new data structure, could accomplish a single route update within 100 ns. Even where route flaps impede lookup performance, the performance degrades by only 0.05% with 4000 route updates per second. Furthermore, this scheme is IPv6 scalable.
