论文信息 - Data Distribution Algorithm Using Time Based Weighted Distributed Hash Tables

Data Distribution Algorithm Using Time Based Weighted Distributed Hash Tables

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.

Zhiqun Deng | Rongling Lang

[1] Christian Scheideler,et al. Efficient, distributed data placement strategies for storage area networks (extended abstract) , 2000, SPAA '00.

[2] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[3] Christian Scheideler,et al. Consistent and compact data management in distributed storage systems , 2004, SPAA '04.

[4] Christian Scheideler,et al. Compact, adaptive placement schemes for non-uniform requirements , 2002, SPAA '02.

[5] Christian Schindelhauer,et al. Weighted distributed hash tables , 2005, SPAA '05.

[6] Artur Czumaj,et al. Randomized allocation processes , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[7] Dick H. J. Epema,et al. Replication in bandwidth-symmetric BitTorrent networks , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[8] Miron Livny,et al. Stork: making data placement a first class citizen in the grid , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[9] Christian Scheideler,et al. Perfectly Balanced Allocation , 2003, RANDOM-APPROX.

[10] Nalini Venkatasubramanian,et al. Data Placement in Intermittently Available Environments , 2002, HiPC.