J Shanghai Jiaotong Univ Sci

Journal of Shanghai Jiaotong University(Science) >

2021 , Vol. 26 >Issue 4: 463 - 470

DOI: https://doi.org/10.1007/s12204-020-2253-5

Computer & Communication Engineering

Novel Data Placement Algorithm for Distributed Storage System  Based on Fault-Tolerant Domain

Expand
  • (1. School of Cyber Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China;
    2. School of Electronic Information Engineering, Shanghai DianJi University, Shanghai 200240, China)

Online published: 2021-06-06

Fold

Abstract

The 3-replica redundancy strategy is widely used to solve the problem of data reliability in large-scale distributed storage systems. However, its storage capacity utilization is only 33%. In this paper, a data placement algorithm based on fault-tolerant domain (FTD) is proposed. Owing to the fine-grained design of the FTD, the data reliability of systems using two replicas is comparable to that of current mainstream systems using three replicas, and the capacity utilization is increased to 50%. Moreover, the proposed FTD provides a new concept for the design of distributed storage systems. Distributed storage systems can take FTDs as the units for data placement, data migration, data repair and so on. In addition, fault detection can be performed independently and concurrently within the FTDs.

Key words： data reliability; failure domain; fault-tolerant domain; data placement; storage system; distributed system

Cite this article

SHI Lianxing (石连星), WANG Zhiheng (王志恒), LI Xiaoyong (李小勇) . Novel Data Placement Algorithm for Distributed Storage System  Based on Fault-Tolerant Domain[J]. Journal of Shanghai Jiaotong University(Science), 2021 , 26(4) : 463 -470 . DOI: 10.1007/s12204-020-2253-5

References

[1] PINHEIRO E, WEBER W D, BARROSO L A.Failure trends in a large disk drive population[C]//Proceedings of the 5th USENIX Conference onFile and Storage Technologies (FAST ’07). San Jose,CA, USA: USENIX Association, 2007: 17-29.
[2] CHEMAWAT S, GOBIOFF H, LEUNG S T. TheGoogle file system [J]. ACM SIGOPS Operating SystemsReview, 2003, 37(5): 29-43.
[3] SHVACHKO K, KUANG H R, RADIA S, et al. Thehadoop distributed file system [C]//2010 IEEE 26thSymposium on Mass Storage Systems and Technologies(MSST). Washington, DC, USA: IEEE, 2010: 1-10.
[4] WEIL S A, BRANDT S A, MILLER E L, et al. Ceph:A scalable, high-performance distributed file system[C]// Proceedings of the 7th Symposium on OperatingSystems Design and Implementation. Seattle, WA,USA: USENIX Association, 2006: 307-320.
[5] ADYA A, J. BOLOSKY W J, CASTRO M, et al.Farsite: Federated, available, and reliable storage foran incompletely trusted environment [C]//Proceedingsof the 5th symposium on Operating systems designand implementation (OSDI 2002). Boston, MA, USA:ACM, 2002, 36: 1-14.
[6] YANG S L, ZHANG G Y. Review of data recovery instorage systems based on erasure codes [J]. Journal ofFrontiers of Computer Science and Technology, 2017,11(10): 1531-1544(in Chinese).
[7] REED I S, SOLOMON G. Polynomial codes over certainfinite fields [J]. Journal of the Society for Industrialand Applied Mathematics, 1960, 8(2): 300-304.
[8] WEIL S A, BRANDT S A, MILLER E L, et al.CRUSH: Controlled, scalable, decentralized placementof replicated data [C]//Proceedings of the 2006ACM/IEEE Conference on Supercomputing. Tampa,USA: ACM, 2006: 122-133.
[9] HONICKY R J, MILLER E L. Replication under ucalableuashing: A family of algorithms for scalable decentralizeddata distribution [C]//Proceedings of 18thInternational Parallel and Distributed Processing Symposium(IPDPS 2004). Santa Fe, NM, USA: IEEE,2004: 1-10.
[10] The OpenStack Foundation. Swift’s overview andconcepts: The rings [EB/OL]. (2019-10-26) [2019-10-30]. https://docs.openstack.org/swift/latest/overviewring.html.
[11] XIN Q, MILLER E L, SCHWARZ S J T J E. Evaluationof distributed recovery in large-scale storage systems[C]//Proceedings of the 13th IEEE InternationalSymposium on High Performance Distributed Computing.Washington, DC, USA: IEEE, 2004: 172-181.
[12] BACHWANI R, GRYZ L, BIANCHINI R, et al.Dynamically quantifying and improving the reliabilityof distributed storage systems [C]//Proceedings ofthe 27th Symposium on Reliable Distributed Systems.Naples, Italy: IEEE, 2008: 85-94.
[13] BANERJEE S, DAS A, MAZUMDER A, et al. Onthe impact of coding parameters on storage requirementof region-based fault tolerant distributed file systemdesign [C]//Proceedings of the 2014 InternationalConference on Computing, Networking and Communications(ICNC). Washington, DC, USA: IEEE, 2014:78-82.
[14] LIAN Q, CHEN W, ZHANG Z. On the impact ofreplica placement to the reliability of distributed brickstorage systems [C]//25th IEEE International Conferenceon Distributed Computing Systems (ICDCS ’05).Washington, DC, USA: IEEE, 2005: 187-196.
[15] ZHANG L F, TAN X J, DU K. Optimal reliabilityanalysis for large scale storage systems [J]. ComputerEngineering and Applications, 2013, 49(1): 112-119(in Chinese).
[16] KARGER D, LEHMAN E, LEIGHTON T, et al. Consistent hashing and random trees: Distributed cachingprotocols for relieving hot spots on the World WideWeb [C]//Proceedings of the 29th annual ACM symposiumon Theory of computing. El Paso, Texas, USA:ACM, 1997: 654-663.

Options
Outlines

/

〈 〉