An Efficient Prefix Caching Scheme with Bounded Prefix Expansion for High-Speed IP Lookup

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

著者

• KIM Jinsoo

  Dept. of Computer Engineering, Konkuk University

• HAN Sangchul

  Dept. of Computer Engineering, Konkuk University

• KIM Junghwan

  Dept. of Computer Engineering, Konkuk University

• PARK Minkyu

  Dept. of Computer Engineering, Konkuk University

関連論文

• An Efficient Prefix Caching Scheme with Bounded Prefix Expansion for High-Speed IP Lookup

スポンサーリンク