Research of Cloud Storage and Improved Distributed Strategy of Data Storage

Article Preview

Abstract:

In this paper, an extensible system prototype of cloud storage is designed. Considering the load balance of cloud storage system, an improved data storage strategy based on consistent hashing algorithm is proposed in this paper. The strategy adopts virtual nodes to storage data and real–time monitoring of load rate of each storage node to adjust load balancing of the whole storage system. In the improved strategy, the priority is introduced into the storage system to rapidly improve the utilization rate of the new storage nodes. The strategy can effectively optimize the performance of the whole storage system, and improve the overall effect of the load balancing.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1812-1816

Citation:

Online since:

January 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Balaehandra Reddy, Ramakrishna Paturi, Atanu Rakshit: Research and application of cloud storage. Intelligent Systems and Applications(ISA), 2010 2nd Ihternational Workshop. Vol. 3(2010).

Google Scholar

[2] Wenying Zeng, Yuelong Zhao, Kairi Ou etal: Research on cloud storage architecture and key technologies/Proceedings of the 2nd International Conference on Interaction Seciences: Information Technology, Culture and Human. New York: ACM(2009).

DOI: 10.1145/1655925.1656114

Google Scholar

[3] Yibo Xue, Chengqi Yi: Cloud Storage, ZTE TECHNOLOGY JOURNAL. Vol. 2(2012), pp.57-60.

Google Scholar

[4] Jingli Zhou, Zhengda Zhou: Improved data distribution strategy for cloud storage system. Journal of Computer Applications. Vol. 2(2012), pp.309-312.

DOI: 10.3724/sp.j.1087.2012.00309

Google Scholar

[5] Karger D, A Sherman, etal: Web caching with consistent hashing. Computer Networks Vol. 31(2011), pp.1203-1213.

DOI: 10.1016/s1389-1286(99)00055-9

Google Scholar

[6] Karger D, Lehman E, etal: Consistent hashing and random trees: Distributed caching protocols for relieving hotspots on the World Wide Web/Proceedings of the 29th Annual ACM Symposium on Theory of Computing: ACM (1997), pp.654-663.

DOI: 10.1145/258533.258660

Google Scholar