Research On Distributed Data Storage Methods And Invulnerability

With the development of the information society,the development of the Internet ushered in the age of explosion,and the amount of data has accelerated.Traditional centralized data storage technology has been unable to adapt to the current situation due to limited equipment capabilities.Distributed storage systems surpass traditional centralized storage technologies with their excellent scalability,robustness,and efficiency.The current data storage methods consider the access efficiency and storage cost,and there is little research on data invulnerability.How to make the distributed data storage system have excellent robustness is one of the challenges facing today.This article first introduces the distributed data storage system and introduces two specific performances: cloud storage system and peer-to-peer(P2P)storage system.Then introduces the data storage method and consistency maintenance method of distributed data storage system,classifies related research,puts forward the classification standard and analyzes the relevant research methods in detail,and analyzes its application scenarios and challenges.For the data storage method of distributed data storage system,taking into account the data leakage problem is one of the biggest challenges facing the current data storage system,this paper proposes a data storage method that considers data access efficiency and security.The concept of safety distance proposed not only ensures the security of data,but also takes into account the different requirements of different user groups for data security.To minimize data access time,a node selection algorithm is proposed in this paper to minimize data access time while ensuring data security.The simulation proves that in terms of data access time,compared with the current data storage algorithms,the proposed algorithm is less than the current algorithm in terms of data access time while ensuring data security.For the data consistency maintenance of distributed data storage systems,in order to solve the problem of packet loss caused by network turbulence and network attacks,this paper proposes an adjustable and reliable consistency maintenance method(ARCOM).ARCOM propagates updates by constructing updates distribution ring(m UD-Ring).m UD-Ring uses the following four methods to enhance the consistency maintenance efficiency,including multiple query schemes to avoid packet loss,multi-point transmission that can achieve higher transmission efficiency,inquiring before distributing updates with the aim at reducing data redundancy,opening a cache in a node,which can avoid the loss of updates.Considering the failure of nodes and links,the paper presents a low-cost recovery strategy and makes a theoretical analysis.Simulation results through Omnet++ platform show that the ARCOM has a higher transmission efficiency,lower packet loss rate(close to 0,the other methods are between 15% and 80%)and lower data redundancy compared with the several current popular consistency maintenance schemes.