For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Performance Improvement of Packet Classification by Using Lookahead Caching
Pi-Chung WANG Chia-Tai CHAN Shuo-Cheng HU Chun-Liang LEE
IEICE TRANSACTIONS on Communications
Publication Date: 2004/02/01
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Internet, high-speed network, packet classification,
Full Text: PDF(849KB)
>>Buy this Article
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.