Abstract | ||
---|---|---|
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. |
Year | Venue | Keywords |
---|---|---|
2011 | SpringSim (HPC) | replication scheme,Seerdis gain,discovery scheme,high probability,high data availability,data center,data availability,query efficiency,single replication erasure code,DHT-based resource indexing,single replication |
Field | DocType | Volume |
World Wide Web,Information retrieval,Computer science,Search engine indexing,Data center | Conference | 43 |
Issue | ISSN | Citations |
2 | 0735-9276 | 0 |
PageRank | References | Authors |
0.34 | 16 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zhilim Zhang | 1 | 0 | 0.34 |
Junying Zhang | 2 | 153 | 21.12 |
Qiuyan Huo | 3 | 2 | 1.03 |
Jingyu Chen | 4 | 0 | 0.34 |
Xuezhou Xu | 5 | 3 | 1.73 |