IP lookup in software for large routing tables using DMP-tree data structure
Nuri A. Yazdani, H. Mohammadi · 2004
Making IP lookup fast and scalable is crucial in the Internet routers due to the fast increase in line speeds and routing table sizes. In this paper, we use DMP-Tree (dynamic M-way prefix tree) data structure to perform IP lookup in software. Experimental results show that our method is fast enough to support multi gigabit per second lines and it scales very well to routing tables with millions of entries. The proposed solution scales well to IPv6 with a reasonable overhead.