Hierarchical Data Placement Policy in Large-Scale Network Storage Systems

This paper analyses and compares existing data placement policies of large-scale network systems and research fruit of data placement policy,combining semi-definite programming algorithm and dynamic interval mapping algorithm,the hierarchical data placement policy is proposed.Semi-definite programming algorithm can solve the problem that storing the file with different copies distributes,so it can assure different copies of a file to distribute on different storage devices.Dynamic interval mapping algorithm assures good adaptability of large-scale network storage systems.Theory analysis and experiment show that the hierarchical data placement proposed by this paper can assure adaptability,data reliability and high speed of dada access of large-scale network storage systems.