IEICE Transactions on Communications
Online ISSN : 1745-1345
Print ISSN : 0916-8516
Regular Section
An Efficient Prefix Caching Scheme with Bounded Prefix Expansion for High-Speed IP Lookup
Junghwan KIMMinkyu PARKSangchul HANJinsoo KIM
Author information
JOURNALS RESTRICTED ACCESS

2012 Volume E95.B Issue 10 Pages 3298-3301

Details
Abstract

Prefix caching improves the performance of IP lookup by exploiting spatial and temporal locality of IP references. However, it cannot cache non-leaf prefixes, so several prefix expansion schemes have been proposed to handle those prefixes. Such schemes have some drawbacks to incur modification of routing table or severe miss penalty. We propose an efficient prefix expansion scheme which achieves good performance without additional burden to lookup scheme. In the proposed scheme a non-leaf prefix is expanded to the length of the longest immediate descendant prefix when it is cached. Evaluation result shows our scheme achieves very low miss ratio even though it does not increase the size of routing table and cache miss penalty.

Information related to the author
© 2012 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top