Data Distribution Algorithm Using Time Based Weighted Distributed Hash Tables

Author

Lang, Rongling ; Deng, Zhiqun

Author_Institution

Sch. of Electron. & Inf. Eng., Beijing Univ. of Aeronaut. & Astronaut., Beijing

fYear

2008

fDate

24-26 Oct. 2008

Firstpage

210

Lastpage

213

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.

Keywords

data analysis; distributed processing; storage management; table lookup; data distribution algorithm; data distribution strategy; data node; distance function; multiparameters selection; storage node; time based weighted distributed hash tables; Aerodynamics; Bandwidth; Data engineering; Distributed computing; Distribution strategy; Educational institutions; Grid computing; Network servers; Peer to peer computing; Storage automation; data distribution; data node; storage node; weighted distributed hash tables;

fLanguage

English

Publisher

ieee

Conference_Titel

Grid and Cooperative Computing, 2008. GCC '08. Seventh International Conference on

Conference_Location

Shenzhen

Print_ISBN

978-0-7695-3449-7

Type

conf

DOI

10.1109/GCC.2008.44

Filename

4662866