Schedule Algorithm Based on Data Relativity
Wei Zhang · Jisuanji gongcheng · 2010
This paper analyzes the relevancy quantitatively in Distributed Storage Network(DSN) in the view of attributes relativity of data share.Based on the analysis,it presents a new mean-weight clustering algorithm in distributed storage networks based on the idea of dispersing correlative data share on different storage nodes.According to the simulative test,the algorithm can greatly lower compromising probability after taking the datarelativity into consideration.