By Topic

Multilevel aligned IP prefix caching based on singleton information

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)
Woei-Luen Shyu ; Dept. of Electr. Eng., Nat. Chung Cheng Univ., Chia, Taiwan ; Cheng-Shong Wu ; Ting-Chao Hou

IP caching has been time-proven to be capable of offloading routing-lookup modules. However, in evaluating the performance of IP caching, the cache size is a dominant factor. In this paper, we propose a caching scheme, named aligned-prefix caching (APC). APC takes advantage of prefix caching to reduce the cache size requirement. However, APC requires a routing-lookup module that can indicate whether an aligned prefix is cacheable or not. Thus, we propose a marking scheme, named aligned-ancestor poisoning, for tree-based routing tables. Our trace-driven simulations show that aligned-24 prefix caching can reduce the cache size requirement by about 50%, compared with the conventional destination caching scheme.

Published in:

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:3 )

Date of Conference:

17-21 Nov. 2002