Performance Improvement of Packet Classification by Using Lookahead Caching
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.2 pp.377-379
- Publication Date
- 2004/02/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Switching
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Pi-Chung WANG, Chia-Tai CHAN, Shuo-Cheng HU, Chun-Liang LEE, "Performance Improvement of Packet Classification by Using Lookahead Caching" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 2, pp. 377-379, February 2004, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_2_377/_p
Copy
@ARTICLE{e87-b_2_377,
author={Pi-Chung WANG, Chia-Tai CHAN, Shuo-Cheng HU, Chun-Liang LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Improvement of Packet Classification by Using Lookahead Caching},
year={2004},
volume={E87-B},
number={2},
pages={377-379},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Performance Improvement of Packet Classification by Using Lookahead Caching
T2 - IEICE TRANSACTIONS on Communications
SP - 377
EP - 379
AU - Pi-Chung WANG
AU - Chia-Tai CHAN
AU - Shuo-Cheng HU
AU - Chun-Liang LEE
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2004
AB - 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.
ER -
English
