Bloom filter (BF) has been widely used to support membership query, ie, to judge whether a
given element x is a member of a given set S or not. Recent years have seen a flourish …

Many network solutions and overlay networks utilize probabilistic techniques to reduce
information processing and networking costs. This survey article presents a number of …

We consider the problem of computing the intersection of private datasets of two parties,
where the datasets contain lists of elements taken from a large domain. This problem has …

We present a simple dictionary with worst case constant lookup time, equaling the
theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et …

This paper presents Ethane, a new network architecture for the enterprise. Ethane allows
managers to define a single network-wide fine-grain policy, and then enforces it directly …

We present a simple and efficient dictionary with worst case constant lookup time, equaling
the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger …

A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow
membership queries on a set that can be changing dynamically via insertions and deletions …

To motivate this survey, we begin with a simple problem that demonstrates a powerful
fundamental idea. Suppose that n balls are thrown into n bins, with each ball choosing a bin …

Hash tables are fundamental components of several network processing algorithms and
applications, including route lookup, packet classification, per-flow state management and …

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 …