DPD
2010
13 years 9 months ago
2010
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
ICWS
2009
IEEE
13 years 10 months ago
2009
IEEE
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
INFOCOM
2010
IEEE
13 years 10 months ago
2010
IEEE
We propose the tracking of long duration flows as a new network measurement primitive. Long-duration flows are characterized by their long lived nature in time, and may not have hi...
TPDS
2010
13 years 10 months ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
TKDE
2010
13 years 10 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
TKDE
2010
13 years 10 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
TON
2002
13 years 12 months ago
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
CJ
2002
14 years 4 days ago
2002
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
SCN
2008
Springer
14 years 7 days ago
2008
Springer
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...
JCST
2008
14 years 8 days ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...