165 search results - page 3 / 33 » Theory and Network Applications of Dynamic Bloom Filters |
SIGMETRICS
2010
ACM
13 years 9 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
SIGCOMM
2005
ACM
13 years 10 months ago
2005
ACM
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...
CONEXT
2009
ACM
13 years 6 months ago
2009
ACM
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
LCN
2005
IEEE
13 years 10 months ago
2005
IEEE
—TCP/IP protocol suite carries most application data in Internet. TCP flow retrieval has more security meanings than the IP packet payload. Hence, monitoring the TCP flow has mor...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Bloom Filters (BFs) are fundamental building blocks in various network security applications, where packets from high-speed links are processed using state-of-the-art hardwareba...