Sciweavers

239 search results - page 16 / 48
» Blooms
Sort
View
GLOBECOM
2008
IEEE
13 years 8 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
SIGCOMM
2005
ACM
14 years 28 days ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...
CCS
2004
ACM
14 years 23 days 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...
TC
2011
13 years 1 months ago
Software-Based Cache Coherence with Hardware-Assisted Selective Self-Invalidations Using Bloom Filters
— Implementing shared memory consistency models on top of hardware caches gives rise to the well-known cache coherence problem. The standard solution involves implementing cohere...
Thomas J. Ashby, Pedro Diaz, Marcelo Cintra
ICCAD
2006
IEEE
98views Hardware» more  ICCAD 2006»
14 years 4 months ago
On the use of Bloom filters for defect maps in nanocomputing
Gang Wang, Wenrui Gong, Ryan Kastner