Sciweavers

165 search results - page 4 / 33
» Theory and Network Applications of Dynamic Bloom Filters
Sort
View
GLOBECOM
2007
IEEE
13 years 11 months ago
A New Design of Bloom Filter for Packet Inspection Speedup
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
Yang Chen, Abhishek Kumar, Jun Xu
CASES
2006
ACM
13 years 11 months ago
Reducing energy of virtual cache synonym lookup using bloom filters
Virtual caches are employed as L1 caches of both high performance and embedded processors to meet their short latency requirements. However, they also introduce the synonym proble...
Dong Hyuk Woo, Mrinmoy Ghosh, Emre Özer, Stua...
CCS
2004
ACM
13 years 10 months ago
Payload attribution via hierarchical bloom filters
Payload attribution is an important problem often encountered in network forensics. Given an excerpt of a payload, finding its source and destination is useful for many security ...
Kulesh Shanmugasundaram, Hervé Brönnim...
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...
SCN
2008
Springer
136views Communications» more  SCN 2008»
13 years 5 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci