This thesis is about the design and analysis of Bloom filter and multiple choice hash table variants for application settings with extreme resource requirements. We employ a very flexible methodology, combining theoretical, numerical, and empirical techniques to obtain constructions that are both analyzable and practical. First, we show that a wide class of Bloom filter variants can be effectiv...

Bloom filter (BF) is a space-efficient data structure that represents a large set of items and supports efficient membership queries. It has been widely proposed to employ Bloom filters in the routing entries so as to facilitate data-centric routing in network applications. The existing designs of Bloom filters, however, cannot effectively support in-network queries. Given a query for a data it...

We present a stateless defense against the Neighbor Discovery Denial-of-Service (ND-DoS) attack in IPv6. The ND-DoS attack consists of remotely flooding a target subnet with bogus packets destined for random interface identifiers; a different one for each malicious packet. The 128-bit IPv6 address reserves its 64 low-order bits for the interface ID. Consequently, the malicious packets are very ...

Probabilistic membership filters are a type of data structure designed to quickly verify whether an element of a large data set belongs to a subset of the data. While false negatives are not possible, false positives are. Therefore, the main goal of any good probabilistic membership filter is to have a small false-positive rate while being memory efficient and fast to query. Although Bloom filt...

Collaborative pattern mining is a pattern mining technique used in a distributed environment where each site participate collaboratively with one another for the discovery of patterns. Each individual site is capable of mining patterns and can communicate with other sites in the distributed environment. Currently existing work have failed to tackle various problems using this technique like eff...

Membership testing is the problem of testing whether an element is in a set of elements. Performing the test exactly is expensive space-wise, requiring the storage of all elements in a set. In many applications, an approximate testing that can be done quickly using small space is often desired. Bloom filter (BF) was designed and has witnessed great success across numerous application domains. B...

Internet of Things (IoT) devices, which have different characteristics in mobility and communication patterns from traditional mobile devices such as cellular phones, have come into existence as a new type of mobile devices. A strict mobility management scheme for providing highly mobile devices with seamless access is over-engineered for IoT devices’ mobility management. We revisit current mob...

Log-structured merge tree decomposes a large database into multiple parts: an in-writing part and several read-only ones. It achieves high write throughput as well as low read latency. However, read requests have to go through multiple structures to find the required data. In a distributed database system, different parts of the LSM-tree are stored distributedly. Data access issues extra networ...

The issue of privacy becomes more and more important. On the other hand, online collaboration among different parties is almost unavoidable. How to allow collaboration while protecting one’s privacy is an important problem and attracted a lot of attention. Unfortunately, most of the problems in this area still remain unsolved. In this paper, we investigate one of the fundamental problems called...

This paper presents an implementation technical solution of network forensics system for Chinese text content. The technical solution utilizes Bloom filter algorithm and Chinese word segmentation and metaaggregation algorithm(CWSMA) to preprocess and effectively store contents of the text aiming at technical challenges caused by characteristics of “unpredictability of the event features” and “u...