Research on general weighted distributed Hash tables algorithm for data placement

Geng Wang · Jisuanji gongcheng yu sheji · 2008

The data placement algorithm of networked based storage system in the dynamic network environment is studied.The current data placement algorithms are analyzed.The general weighted distributed hash tables algorithm is proposed,compared with the consistent hash algorithm and logarithm evaluation function,which considered the following conditions:The nodes storage space,the physical distance between data distribution nodes and data storage nodes,networks bandwidth.The simulation results show that the data can be fairly distributed.

Read the paper · More papers on PaperTik