Performance Improvement of Packet Classification by Using Lookahead Caching

Pi Chung Wang*, Chia Tai Chan, Shuo Cheng Hu, Chun Liang Lee

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


Rectangle search is a well-known packet classification scheme which is based on multiple hash accesses for different filter length. It shows good scalability with respect to the number of filters; however, the performance is not fast enough to fulfill the high-speed requirement of packet classification. In this paper, we propose a lookahead caching which can significantly improve the performance of hash-based algorithm. The basic idea is to filter out the un-matched probing case by using dual-hash architecture. The experimental results indicate that the proposed scheme can improve the performance by the factor of two for the 2-dimension (source prefix, destination prefix) filter database.

Original languageEnglish
Pages (from-to)377-379
Number of pages3
JournalIEICE Transactions on Communications
Issue number2
StatePublished - Feb 2004


  • High-speed network
  • Internet
  • Packet classification


Dive into the research topics of 'Performance Improvement of Packet Classification by Using Lookahead Caching'. Together they form a unique fingerprint.

Cite this