369 search results - page 6 / 74 » Scalable Bloom Filters |
CJ
2002
13 years 7 months 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 ...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
NETWORK
2010
13 years 2 months ago
2010
In this article we propose a scalable and efficient destination-oriented multicast protocol for next-generation Internet. With DOM, each packet carries explicit destinations infor...
DSN
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
Since CDN simulations are known to be highly memory-intensive, in this paper, we argue the need for reducing the memory requirements of such simulations. We propose a novel memory...