A High-Speed Railway Data Placement Strategy Based on Cloud Computing

Abstract:

The application of high-speed railway data, which is an important component of China's transportation science data sharing, has embodied the typical characteristics of data-intensive computing. A reasonable and effective data placement strategy is needed to deploy and execute data-intensive applications in the cloud computing environment. Study results of current data placement approaches have been analyzed and compared in this paper. Combining the semi-definite programming algorithm with the dynamic interval mapping algorithm, a hierarchical structure data placement strategy is proposed. The semi-definite programming algorithm is suitable for the placement of files with various replications, ensuring that different replications of a file are placed on different storage devices. And the dynamic interval mapping algorithm could guarantee better self-adaptability of the data storage system. It has been proved both by theoretical analysis and experiment demonstration that a hierarchical data placement strategy could guarantee the self-adaptability, data reliability and high-speed data access for large-scale networks.

• Periodical: Applied Mechanics and Materials (Volumes 135-136)
• Pages: 43-49
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.135-136.43
• Online since: October 2011
• Authors: Han Ning Wang, Wei Xiang Xu, Chao Long Jia
• Keywords: Cloud Computing, Data Placement, Data-Intensive, High-Speed Railway (HSR)

References

[1] Jin Ma, Acquisitions, & Technical Services, vol. 30, 2006, pp.3-17.

[2] Laurent Amsaleg Philippe Bonnet Michael J. Franklin, Data Engineering, vol. 20, Sep. 1997, No. 3.

[3] Amol Deshpande, Zachary Ives, Adaptive Query Processing, Foundations and Trends in Databases, vol. 1, 2007, pp.1-140.

[4] ChenA, Goes P, GuPta A, European Journal of Operational Research, vol. 168, 2006, pp.200-220.

[5] Ismail H. Toroslu, Ahmet Cosar, Information Processing Letters, vol. 92, 2004, p.149–155.

[6] Ben Leinfelder, Jing Tao, Duane Costa, Matthew B. Jones, Mark Servilla, Margaret O'Brien, Chad Burt, Ecological Informatics, vol 5, 2010, pp.3-8.

[7] Uwe Schindler , Michael Diepenbroek, Computers & Geosciences, vol. 34, 2008, p.1947-(1955).

[8] Gary Chartrand, Ping Zhang, Introduction to Graph Theory, Beijing: POSTS & TELECOM PRESS, (2005).

[9] Hongyu Chen, MICROELECTRONICS & COMPUTER, vol. 22 , 2005, pp.32-35.