Skip to main navigation Skip to search Skip to main content

Data distribution algorithm using time based weighted distributed hash tables

  • Northwestern Polytechnical University Xian

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A data distribution strategy using time based weighted distributed hash tables is proposed here. Distance function which is based on weighted distributed hash tables, takes the data distribution time between data node and the storage node, the bandwidth of storage nodes, and the physical distance between the data node and the storage node into consideration. From the simulation results, it is concluded that such multi-parameters selection related to the network ensured the data could be fairly distributed to the storage nodes.

Original languageEnglish
Title of host publicationProceedings - 7th International Conference on Grid and Cooperative Computing, GCC 2008
Pages210-213
Number of pages4
DOIs
StatePublished - 2008
Event7th International Conference on Grid and Cooperative Computing, GCC 2008 - Shenzhen, China
Duration: 24 Oct 2008 → 26 Oct 2008

Publication series

NameProceedings - 7th International Conference on Grid and Cooperative Computing, GCC 2008

Conference

Conference7th International Conference on Grid and Cooperative Computing, GCC 2008
Country/TerritoryChina
CityShenzhen
Period24/10/08 → 26/10/08

Keywords

  • Data distribution
  • Data node
  • Storage node
  • Weighted distributed hash tables

Fingerprint

Dive into the research topics of 'Data distribution algorithm using time based weighted distributed hash tables'. Together they form a unique fingerprint.

Cite this