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 …

Modern web services use in-memory caching extensively to increase throughput and reduce
latency. There have been several workload analyses of production systems that have fueled …

When network is undergoing problems such as congestion, scan attack, DDoS attack, etc.,
measurements are much more important than usual. In this case, traffic characteristics …

We present NetCache, a new key-value store architecture that leverages the power and
flexibility of new-generation programmable switches to handle queries on hot items and …

We describe the design and implementation of Open vSwitch, a multi-layer, open source
virtual switch for all major hypervisor platforms. Open vSwitch was designed de novo for …

In many networking systems, Bloom filters are used for high-speed set membership tests.
They permit a small fraction of false positive answers with very good space efficiency …

We present WiscKey, a persistent LSM-tree-based key-value store with a performance-
oriented data layout that separates keys from values to minimize I/O amplification. The …

We describe the design and implementation of FaRM, a new main memory distributed
computing platform that exploits RDMA to improve both latency and throughput by an order …

Growing main memory capacity has fueled the development of in-memory big data
management and processing. By eliminating disk I/O bottleneck, it is now possible to support …

This paper describes the design and implementation of HERD, a key-value system designed
to make the best use of an RDMA network. Unlike prior RDMA-based key-value systems …