A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree

Abstract

Abstract-This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which is constructed by using the most specific prefixes in routing tables. MMSPT arranges the most specific prefixes as the keys in B-tree. Unlike the previous schemes, every prefixes in routing tables is stored exactly once in our MMSPT. For a routing table of n prefixes, MMSPT requires O(n) memory, and the time for search, insertion and deletion operations are O(log m n), O(mlog m n), and O(mlog m n), respectively (m is the order of the B-tree). Our experimental results conducted by using five real IPv4 routing tables show that MMSPT outperforms two existing B-tree data structures, PIBT (Prefix In B-Tree) and MRT (Multiway Range Tree), in all aspects. Moreover, since the complexities of MMSPT is not subject to the length of IP addresses, the proposed MMSPT can be easily extended to fit the IPv6.

Towards Dynamic and Scalable High-Speed IP Address Lookup Based on B+ Tree

“…MMSPT performs with a high speed for dynamic update and scalability in processing IP address lookup. However, there are still two shortcomings of MMSPT: (1) The lookup speed suffers from backtracking on MMSPT for the prefixes which are not the most specific prefixes defined in [13]. Especially with the rapid growth of Internet traffic, the times of backtracking lookup could increase, and this would dramatically decrease the throughput of routers.…”

“…Due to its importance, IP address lookup with longest prefix matching has received significant attention by researchers in the past few years [4]- [10]. Recently, with the rapid growth of internet traffic and IPv6 applications, there has been much renewed research interest in developing dynamic and scalable data structures for high-speed IP address lookup in a large-scale and dynamic forwarding table [11]- [13].…”

“…Therefore, packets processing speed of routers has become the major bottleneck of high performance networks. To keep up with 100 Gbps networks, high-speed IP address lookup is essential for designing wire-speed packet forwarding routers [13]. Secondly, due to the prevalence of the Internet and lots of new emerging network applications, the network traffic in backbone routers is doubling every two months.…”

“…The most related work to this paper is [13]. The authors in [13] proposed an improved dynamic IP lookup algorithm named MMSPT based on the work in [10].…”

“…The authors in [13] proposed an improved dynamic IP lookup algorithm named MMSPT based on the work in [10]. MMSPT performs with a high speed for dynamic update and scalability in processing IP address lookup.…”