By Topic

An active routing prefix caching algorithm for IP address 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
$31 $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)
Guo-sheng Zhu ; Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Shao-hua Yu ; Jin-you Dai

A lot of IP address lookup algorithms have been widely studied. Among them we have thorough investigated the caching based algorithms. It is based on the locality assumption of Intenet traffic which is questionable especially in high speed backbone. There is enough locality if routing prefixes are cached instead of individual IP addresses. However the previous prefix caching scheme need to do complete or partial prefix expansion to cache corresponding prefix which will lead to prefix table explosion and make incremental updates difficult. A new active prefix caching algorithm based on prefixes covering relationship is proposed in this paper. Incremental updates are supported without prefix expansion. Performance evaluation shows our proposed scheme has higher cache hit rate, less memory space than previous schemes.

Published in:

Communications and Networking in China, 2009. ChinaCOM 2009. Fourth International Conference on

Date of Conference:

26-28 Aug. 2009