Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
This paper identifies and defines a consistency model---causal consistency with convergent conflict handling, or causal+---that is the strongest achieved under these constraints and presents the design and implementation of COPS, a key-value store that delivers this consistency model across the wide-area.
Cuckoo Filter: Practically Better Than Bloom
Cuckoo filters support adding and removing items dynamically while achieving even higher performance than Bloom filters, and have lower space overhead than space-optimized Bloom filters.
There is more consensus in Egalitarian parliaments
Egalitarian Paxos is to the authors' knowledge the first protocol to achieve the previously stated goals efficiently, requiring only a simple majority of replicas to be non-faulty, using a number of messages linear in the number of replica to choose a command, and committing commands after just one communication round.
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
MICA optimizes for multi-core architectures by enabling parallel access to partitioned data, and for efficient parallel data access, MICA maps client requests directly to specific CPU cores at the server NIC level by using client-supplied information and adopts a light-weight networking stack that bypasses the kernel.
SybilGuard: defending against sybil attacks via social networks
This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks, based on the "social network "among user identities, where an edge between two identities indicates a human-established trust relationship.
Using RDMA efficiently for key-value services
This paper describes the design and implementation of HERD, a key-value system designed to make the best use of an RDMA network and believes that HERD further serves as an effective template for the construction of RDMA-based datacenter services.
Stronger Semantics for Low-Latency Geo-Replicated Storage
The evaluation shows that the Eiger system achieves low latency, has throughput competitive with eventually-consistent and non-transactional Cassandra, and scales out to large clusters almost linearly (averaging 96% increases up to 128 server clusters).
FAWN: a fast array of wimpy nodes
- D. Andersen, Jason Franklin, M. Kaminsky, Amar Phanishayee, Lawrence Tan, V. Vasudevan
- Computer ScienceSOSP '09
- 11 October 2009
The key contributions of this paper are the principles of the FAWN architecture and the design and implementation of FAWN-KV--a consistent, replicated, highly available, and high-performance key-value storage system built on a FAWN prototype.
SybilGuard: Defending Against Sybil Attacks via Social Networks
- Haifeng Yu, M. Kaminsky, Phillip B. Gibbons, A. Flaxman
- Computer ScienceIEEE/ACM Transactions on Networking
This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks, based on the ldquosocial networkrdquo among user identities, where an edge between two identities indicates a human-established trust relationship.
SybilLimit: A Near-Optimal Social Network Defense Against Sybil Attacks
The novel SybilLimit protocol is presented, which leverages the same insight as SybilGuard, but offers dramatically improved and near-optimal guarantees, and provides the first evidence that real-world social networks are indeed fast-mixing.