Sciweavers

98 search results - page 3 / 20
» Fast packet classification using bloom filters
Sort
View
GLOBECOM
2008
IEEE
14 years 6 days ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong
CN
2006
124views more  CN 2006»
13 years 5 months ago
Packet classification using diagonal-based tuple space search
Multidimensional packet classification has attracted considerable research interests in the past few years due to the increasing demand on policy based packet forwarding and secur...
Fu-Yuan Lee, Shiuh-Pyng Shieh
SIGCOMM
2006
ACM
13 years 11 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
14 years 7 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou
ANCS
2005
ACM
13 years 11 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood