Optimal cloud storage problem in the distributed cloud data centers by the discrete PSO algorithm

The cloud storage problem is one of the interesting and important topics in the fields of cloud computing and big data. From the viewpoint of optimization, one discrete PSO algorithm is mainly utilized to handle with the cloud storage problem of the distributed data centers in China´s railway and copy with the data between two data centers. This paper briefly introduces the objectives and the constraints of the cloud storage problem on the basis of the existing China´s railway network topology. In order to achieve the good performance considering the smallest transmitting distance, one discrete PSO algorithm essentially marries each other between two data center sets. Numerical results highlight that the discrete PSO algorithm can provide the guideline for the suboptimal cloud storage strategy of China´s railway when the number of the distributed data centers is equal to 15, 17 and 18.