Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...

The cuckoo filter data structure of Fan, Andersen, Kaminsky, and Mitzenmacher (CoNEXT 2014) performs the same approximate set operations as a Bloom filter in less memory, with better locality of reference, and adds the ability to delete elements as well as to insert them. However, until now it has lacked theoretical guarantees on its performance. We describe a simplified version of the cuckoo f...

We introduce the adaptive cuckoo filter (ACF), a data structure for approximate set membership that extends cuckoo filters by reacting to false positives, removing them for future queries. As an example application, in packet processing queries may correspond to flow identifiers, so a search for an element is likely to be followed by repeated searches for that element. Removing false positives ...

This paper presents a novel approach of designing linear phase FIR low pass filter using cuckoo Search Algorithm (CSA). FIR filter design is a multi-modal optimization problem. The conventional optimization techniques are not efficient for digital filter design. An iterative method is introduced to find the best solution of FIR filter design problem.Flat passband and high stopband attenuation a...

Network traffic control and classification have become increasingly dependent on deep packet inspection (DPI) approaches, which are the most precise techniques for intrusion detection prevention. However, increasing volumes link speed exert considerable pressure DPI to process packets with high performance in restricted available memory. To overcome this problem, we proposed dual cuckoo filter ...

Approximate set-membership tests, exemplified by Bloom filters [1], have numerous applications in networking and distributed systems. A Bloom filter is a compact data structure to quickly answer if a given item is in a set with some small false positive probability ε . Due to its simplicity and high space efficiency, Bloom filters become widely used in network traffic measurement, packet routin...

Internet protocol (IP) packet filtering as a firewall (FW) technology is one of the most widely researched networks functions over past two decades. IP process incoming and outgoing network packets by matching several headers fields with thousands predefined filters known filter-set. With development modern technologies such software-defined networking (SDN) increase in attacks threatening secu...

Distributed key-value systems have been widely used as elemental components of many Internet-scale services at sites such as Amazon, Facebook and Twitter. This thesis examines a system design approach to scale existing key-value systems, both horizontally and vertically, by carefully engineering and integrating techniques that are grounded in recent theory but also informed by underlying archit...