SEERDIS: a DHT-based resource indexing and discovery scheme for the data center

  • Authors:
  • Zhilim Zhang;Junying Zhang;Qiuyan Huo;Jingyu Chen;Xuezhou Xu

  • Affiliations:
  • School of Computer Science & Technology, Xidian University, Xi'an, China;School of Computer Science & Technology, Xidian University, Xi'an, China;School of Software Engineering Xidian University, Xi'an, China;School of Software Engineering Xidian University, Xi'an, China;School of Software Engineering Xidian University, Xi'an, China

  • Venue:
  • Proceedings of the 19th High Performance Computing Symposia
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.