Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The SDSC storage resource broker
CASCON '98 Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Cheap recovery: a key to self-managing state
ACM Transactions on Storage (TOS)
Stable High-Capacity One-Hop Distributed Hash Tables
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Bigtable: a distributed storage system for structured data
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Ceph: a scalable, high-performance distributed file system
OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Bigtable: A Distributed Storage System for Structured Data
ACM Transactions on Computer Systems (TOCS)
GFS: A Distributed File System with Multi-source Data Access and Replication for Grid Computing
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Cassandra: a decentralized structured storage system
ACM SIGOPS Operating Systems Review
Redundancy schemes for high availability in DHTs
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
High availability in DHTs: erasure coding vs. replication
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Hi-index | 0.00 |
A fundamental challenge in a data center is how to achieve high data availability and query efficiency at an appropriate storage cost. This paper presents a Distributed Hash Table (DHT) indexing and discovery scheme based on the single replication erasure code (Seerdis) for the Data Center. Seerdis gains high data availability with less storage space by using erasure code. In addition, the design of single replication in Seerdis can provide similar performance as replication schemes do for datacenter-based applications. Seerdis virtualizes each host into several nodes and each node corresponds to one data object with a high probability. Compared with existing resource indexing and discovery schemes, the benefits of Seerdis include increasing data availability and improving query efficiency.