2010 China-Ireland International Conferenceon Information and CommunicationsTechnologies (CIICT2010 E-BOOK)

Wuhan,China,10.10-10.11,2010

ISBN: 978-1-935068-30-3 Scientific Research Publishing, USA

E-Book 200pp Pub. Date: October 2010

Category: Engineering

Price: $40

Title: Efficient Pattern Matching with Counting Bloom Filter
Source: 2010 China-Ireland International Conferenceon Information and CommunicationsTechnologies (CIICT2010 E-BOOK) (pp 33-36)
Author(s): Yachao Zhou, School of Electronic Engineering,Dublin City University, Dublin, Ireland
Xiaojun Wang, School of Electronic Engineering,Dublin City University, Dublin, Ireland
Abstract: Fast multi-pattern matching plays an important role in Deep Packet Inspection. In this paper we present the hardware implementation of multi- pattern matching using parallel engines of Counting Bloom Filter (CBF). CBF is a space and time efficient data structure. It allows false positive and the exact match can be further confirmed by comparing with associated patterns. There are two hash tables, one with counters and one with corresponding patterns in each entry. We used pruning and list-balancing techniques based on CBF to reduce required memory with trade-off of processing complexity. In the implementation, there are multiple Bloom engines in parallel each of which consists of multiple Bloom filters for different pattern length. It is simulated in Modelsim and synthesized in Quartus II.
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top