본문 바로가기
  • Home

A Hybrid Prefix Cashing Scheme for Efficient IP Address Lookup

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2015, 20(12), pp.45-52
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Jinsoo Kim 1 Junghwan Kim 1

1건국대학교

Accredited

ABSTRACT

We propose a hybrid prefix caching scheme to enable high speed IP address lookup. All prefixes loaded in a prefix cache should not be overlapped in address range for correct IP lookup. So, every non-leaf prefix needs to be expanded not so as to be overlapped. The shorter expanded prefix is more preferable because it can cover wider address range just as an single entry in a prefix cache. We exploits advantages of two dynamic prefix expansion techniques, bounded prefix expansion technique and bitmap-based prefix expansion technique. The proposed scheme uses dual bound values whereas just one bound value is used in bounded prefix expansion. Our elaborated technique make the dual bound values be associated with several subtries flexibly using bitmap information, rather than with fixed subtries. We evaluate the performance of the proposed scheme in terms of the average length of the expanded prefixes and cache miss ratio. The experiment results show the proposed scheme has lower cache miss ratio than other previous schemes including both bounded prefix expansion and bitmap-based expansion irrespective of the cache size.

Citation status

* References for papers published after 2023 are currently being built.