By Topic

Updating designed for fast IP lookup

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Natasa Maksic ; School of Electrical Engineering, Belgrade University, Serbia ; Zoran Chicha ; Aleksandra Smiljanić

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.

Published in:

2012 IEEE 13th International Conference on High Performance Switching and Routing

Date of Conference:

24-27 June 2012