Performance Improvement of Packet Classification by Using Lookahead Caching(Switching)

スポンサーリンク

概要

• 論文の詳細を見る

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

• 社団法人電子情報通信学会の論文
• 2004-02-01

著者

• Wang Pi-chung

  Telecommunication Laboratories Chunghwa Telecom Co. Ltd

• Wang Pi

  Institute Of Computer Science And Information Technology National Taichung Institute Of Technology:t

• Lee Chun-liang

  Department Of Computer Science And Information Engineering Chang Gung University

• CHAN Chia-Tai

  Department of Info. Management, Ming-Hsin University of Science and Tech.

• LEE Chun-Liang

  Telecommunication Laboratories, Chunghwa Telecom Co., Ltd

• Chan Chia-tai

  Institute Of Biomedical Engineering National Yang Ming University

• Chan Chia

  Telecommunication Laboratories Chunghwa Telecom Co. Ltd.

関連論文

• Packet Classification with Hierarchical Cross-Producting
• Performance Improvement of Packet Classification by Using Lookahead Caching(Switching)
• Scalable Packet Classification Using Condensate Bit Vector(Internet Technology V)
• An Efficient Conflict Detection Algorithm for Packet Filters

スポンサーリンク