In:
Applied Mechanics and Materials, Trans Tech Publications, Ltd., Vol. 644-650 ( 2014-9), p. 3365-3370
Abstract:
With the rapid development of the Internet, the number of firewall rules is increasing. The enormous quantity of rules challenges the performance of the packet classification that has already become a bottleneck in firewalls. This dissertation proposes a rapid and multi-dimensional algorithm for packet classification based on BSOL(Binary Search On Leaves), which is named FMPC(FastMulti-dimensional Packet Classification). Different from BSOL, FMPC cuts all dimensions at the same time to decompose rule spaces and stores leaf spaces into hash tables; FMPC constructs a Bloom Filter for every hash table and stores them into embedded SRAM. When classifying a packet, FMPC performs parallel queries on Bloom Filters and determines how to visit hash tables according to the results. Algorithm analysis and the result of simulations show: the average number of hash-table lookups of FMPC is 1 when classifying a packet, which is much smaller than that of BSOL; inthe worst case, the number of hash-table lookups of FMPCisO(logwmax+1), which is also smaller than that of BSOL in multi-dimensional environment, where w max is the length, in bits, of the dimension whose length is the longest..
Type of Medium:
Online Resource
ISSN:
1662-7482
DOI:
10.4028/www.scientific.net/AMM.644-650
DOI:
10.4028/www.scientific.net/AMM.644-650.3365
Language:
Unknown
Publisher:
Trans Tech Publications, Ltd.
Publication Date:
2014
detail.hit.zdb_id:
2251882-4
Permalink