An efficient IP address lookup scheme using balanced binary search with minimal entry and optimal prefix vector

Hyuntae Park, Hyejeong Hong, Sungho Kang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Although IP address lookup schemes using ternary content addressable memory (TCAM) can perform high speed packet forwarding, TCAM is much more expensive than ordinary memory in implementation cost. As a low-cost solution, binary search algorithms such as a binary trie or a binary search tree have been widely studied. This paper proposes an efficient IP address lookup scheme using balanced binary search with minimal entries and optimal prefix vectors. In the previous scheme with prefix vectors, there were numerous pairs of nearly identical entries with duplicated prefix vectors. In our scheme, these overlapping entries are combined, thereby minimizing entries and eliminating the unnecessary prefix vectors. As a result, the small balanced binary search tree can be constructed and used for a software-based address lookup in small-sized routers. The performance evaluation results show that the proposed scheme offers faster lookup speeds along with reduced memory requirements.

Original languageEnglish
Pages (from-to)3128-3131
Number of pages4
JournalIEICE Transactions on Communications
VolumeE94-B
Issue number11
DOIs
Publication statusPublished - 2011 Nov

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'An efficient IP address lookup scheme using balanced binary search with minimal entry and optimal prefix vector'. Together they form a unique fingerprint.

  • Cite this