Updating designed for fast IP lookup

Abstract

Internet traffic is rapidly increasing, as well as the number of users. The increased link speeds result in smaller available time for the lookup and, hence, require faster lookup algorithms. There is a trade-off between complexities of the IP lookups and the IP lookup table updates. In this paper, we propose, implement and analyze lookup table updating for parallel optimized linear pipeline (POLP) lookup algorithm and balanced parallelized frugal lookup algorithm (BPFL). We compare POLP and BPFL update algorithms in terms of their execution times for real-world routing tables. In order to analyze the influence of updates on packet forwarding, we will observe the number of memory accesses when the lookup tables are updated due to the network topology changes. For both lookup algorithms, we measure the memory requirements as well. Our analysis will show that the BPFL update algorithm has the smaller memory requirements, while the POLP update algorithm is faster.