Distributed data security storage method, device and system

Abstract

The invention relates to the technical field of data processing, in particular to a distributed data secure storage method, device and system. According to the method, differences of all nodes in a distributed system are analyzed to obtain a weighted net diagram of the nodes, the backup number of any data is determined by combining the characteristic that different data have different confidentiality requirements, and backup nodes are further obtained according to the storage ratio and the activeness of the data, so that all the nodes of a storage system can be stored in a balanced mode, and the storage efficiency is improved. And completing multi-node backup of the data. On the premise of ensuring the safety of distributed data storage, redundant backup is reduced as much as possible, the backup effect is improved to the maximum extent, and the safety and redundancy of a distributed storage system are well balanced.

Description

Technical Field

[0001] The present invention relates to the field of data processing technology, and in particular to a distributed data secure storage method, device and system. Background Art

[0002] Distributed storage system is to store data in multiple independent devices. Traditional network storage system uses centralized storage server to store all data. Storage server becomes the bottleneck of system performance and the focus of reliability and security, which cannot meet the needs of large-scale storage applications. Distributed network storage system adopts scalable system structure, uses multiple storage servers to share storage load, and uses location server to locate storage information. It not only improves the reliability, availability and access efficiency of the system, but also makes it easy to expand.

[0003] Distributed storage systems also have some security risks. Due to the characteristics of numerous nodes, non-fixed structure, and wide distribution, it is difficult to effectively ensure the security of the actual data in the storage. When a single node is damaged, data loss may occur. Therefore, it is often necessary to synchronize the data to other nodes during storage, which can reduce the impact of single node failures and ensure data recoverability and security.

[0004] In the prior art, the security of data in distributed storage systems is improved by combining node heterogeneity with a multi-copy mechanism. However, the existing methods quantify heterogeneity only from the functional similarities and differences, and lack analysis of the data itself, resulting in load imbalance and redundancy in the number of backups, making it impossible to achieve a good balance between the security and redundancy of distributed storage systems. Summary of the invention

[0005] In order to solve the technical problem that the security and redundancy of the distributed storage system in the prior art cannot be well balanced, the purpose of the present invention is to provide a distributed data security storage method, device and system, and the technical solution adopted is as follows: In a first aspect, a distributed data secure storage method is provided, the method comprising: Step S1: Obtain node information in a distributed data storage system; Step S2: Obtain the difference between any two nodes according to the functional difference and interaction between the nodes; Step S3: obtaining a candidate backup node for the data to be backed up according to the security requirements of the data to be backed up and the aggregation of differences between the node to which the data belongs and the selectable nodes; Step S4: Select the final backup node from the candidate backup nodes according to the activity and storage conditions of the candidate backup nodes; Step S5: Synchronously store the data to be backed up in all final backup nodes to complete the distributed data security storage.

[0006] Furthermore, the step S1 of acquiring the node information in the distributed data storage system specifically includes: For any distributed data storage system, any computer is regarded as a node, any node is split into different components with independent functions, and the component set of each node is obtained; Get the set of vulnerabilities of the software or hardware of any node.

[0007] Furthermore, the step S2 specifically includes: According to the number of components of the intersection and union of any two nodes and the number of vulnerabilities of the intersection and union of the two nodes, the functional difference of the two nodes is obtained; Obtain the interaction status of the two nodes according to the amount of data transmitted between the two nodes, the number of intersection nodes and the number of union nodes of all node sets with data transmission between the two nodes; The difference between the two nodes is obtained according to the functional difference and interaction status of the two nodes.

[0008] Furthermore, the amount of data transmitted between the two nodes is negatively correlated with the difference between the two nodes, and the ratio of the number of intersection nodes to the number of union nodes is negatively correlated with the difference between the two nodes.

[0009] Furthermore, the step S3 specifically includes: Obtain the number of backups of the data to be backed up according to the number of node classes, the number of encryption and verification steps of the data to be backed up, and the number of the most encryption and verification steps of all data; Obtain the comprehensive difference between the data to be backed up and any backup scheme to be selected based on the number of backups of the data to be backed up, the average difference between the node to which the data to be backed up belongs and all nodes in each node class, and the average difference between all nodes of any two node classes of the backup scheme to be selected; All nodes of the candidate backup solution with the largest comprehensive difference are recorded as candidate backup nodes.

[0010] Furthermore, the node class is specifically: clustering the undirected weighted network graph of nodes until all nodes join the cluster or are marked as noise points, and any noise point and any cluster are recorded as a node class; the backup plan to be selected is composed of a combination of multiple node classes.

[0011] Furthermore, the step S4 is specifically as follows: according to the data storage capacity of the backup node on the backup day and the previous day, the storage capacity of the backup node, and the total storage space of the backup node, the suitable backup degree of each backup node is obtained, and the backup node with the largest suitable backup degree is recorded as the final backup node.

[0012] Furthermore, the growth rate of the data storage capacity of the candidate backup node on the backup day compared to the day before the backup, and the ratio of the storage capacity of the candidate backup node to the total storage space of the candidate backup node are negatively correlated with the backup suitability of the candidate backup node.

[0013] In a second aspect, the present invention provides a distributed data security storage device, the device comprising: A node information acquisition module is used to acquire node information in a distributed data storage system; The difference acquisition module is used to obtain the difference between any two nodes according to the functional difference and interaction between the nodes; A candidate backup node acquisition module is used to acquire the candidate backup node of the data to be backed up according to the security requirements of the data to be backed up and the aggregation of differences between the node to which it belongs and the selectable nodes; The final backup node acquisition module is used to select the final backup node from the candidate backup nodes according to the activity and storage status of the candidate backup nodes; The storage execution module is used to synchronously store the data to be backed up in all final backup nodes.

[0014] In a third aspect, the present invention provides a distributed data security storage system, the system comprising the above-mentioned distributed data security storage device and also comprising a plurality of nodes composed of a plurality of computers.

[0015] The present invention has the following beneficial effects: the present invention analyzes the differences of all nodes in the distributed data storage system, obtains an undirected weighted mesh diagram of the nodes, determines the number of backups of any data in combination with the characteristics that different data have different confidentiality requirements, and further obtains backup nodes according to the storage ratio and activity of the data, so that each node of the storage system can store evenly and complete multi-node backup of the data. The present invention is conducive to reducing redundant backup as much as possible and maximizing the backup effect under the premise of ensuring the security of distributed data storage, so that the security and redundancy of the distributed storage system are well balanced. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present invention or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0017] Figure 1 A flow chart of a distributed data secure storage method provided by an embodiment of the present invention.

[0018] Figure 2 An undirected weighted network graph of a distributed data storage system provided by an embodiment of the present invention.

[0019] Figure 3 A block diagram of a distributed data security storage device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0020] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the following is a detailed description of a distributed data security storage method, device and system proposed in accordance with the present invention, its specific implementation method, structure, characteristics and effects, in combination with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by technicians in the technical field of the present invention.

[0021] The following describes in detail a specific scheme of a distributed data security storage method, device and system provided by the present invention in conjunction with the accompanying drawings.

[0022] First, see Figure 1 , which shows a flow chart of a distributed data security storage method provided by an embodiment of the present invention, the method comprising the following steps: Step S1: Obtain node information in the distributed data storage system.

[0023] Among them, obtaining the node information in the distributed data storage system in step S1 specifically includes: for any distributed data storage system, taking any computer as a node, splitting any node into different components with independent functions, and obtaining the component set of each node; obtaining the vulnerability set of the software or hardware of any node.

[0024] More specifically, for any distributed data storage system, any computer is taken as a node, and any node is split into several components with independent functions. Different components with the same function are recorded as heterogeneous components. For example, the CPU type or operating system type is a function. X86 and Arm are two types of CPUs, that is, two components of one function, which are heterogeneous components. For another example, Windows 10, Centos 8, and Red Hat 7 are three types of operating systems, that is, three components of one function, which are heterogeneous components. The distributed data storage system can be recorded as a collection of several components with several functions, recorded as , , ,in represents the distributed data storage system, represents the i-th function, represents the jth component of the ith function, n represents the number of functions, and m represents the number of components corresponding to any function. Therefore, any node is a collection of several components, and thus the component collection of each node is obtained. In addition, the collection of vulnerabilities of the software or hardware of any node is obtained, which is recorded as the vulnerability set of any node, and recorded as .

[0025] In a distributed data storage system, different nodes have different functional components and different interactions. If there are two backup nodes with high similarity, then there is little need to back up both backup nodes. If both backup nodes are backed up, the backup redundancy will be relatively high. Therefore, it is necessary to understand the differences between nodes. Based on this, this implementation sets the following steps.

[0026] Step S2: Obtain the difference between any two nodes based on the functional difference and interaction between the nodes.

[0027] Among them, step S2 specifically includes: obtaining the functional difference of the two nodes according to the number of components of the intersection and union of any two nodes, and the number of vulnerabilities of the intersection and union of the two nodes; obtaining the interaction between the two nodes according to the amount of data transmitted between the two nodes, the number of intersection nodes of all node sets with data transmission between the two nodes, and the number of union nodes; obtaining the difference between the two nodes according to the functional difference and interaction of the two nodes.

[0028] More specifically, for the component sets of any two nodes, the difference between the two nodes is first manifested in the difference in components. When the components of all functions of the node are heterogeneous components, the difference of the node is the largest, wherein the intersection of the component sets of the two nodes is the same components of the two nodes, and the union is all the components of the two nodes. The ratio of the intersection to the union can reflect the proportion of the same components of the two nodes and reflect the similarity. At the same time, considering that the vulnerability of the node is the main cause of the attack, if the vulnerabilities of the two nodes are the same, then the difference of the nodes is relatively small, wherein the intersection of the vulnerability sets of the two nodes is the same vulnerability, and the union is all vulnerabilities. The ratio of the intersection and the union of the vulnerability sets also reflects the similarity. The smaller the similarity of the component sets and the smaller the similarity of the vulnerability sets, the greater the difference between the nodes. This difference is mainly reflected in the functional difference. Therefore, the mathematical calculation formula for the functional difference of any two nodes first constructed in this embodiment is as follows: In the formula, , It represents the number of intersection components and the number of union components of any two nodes. Obviously, each node has functions and components corresponding to the functions, so the component set of any two nodes is not 0. Furthermore, the number of union components of any two nodes is ; , It represents the number of intersection vulnerabilities and the number of union vulnerabilities of the two nodes. Obviously, each component is not 100% perfect and has vulnerabilities. Therefore, the number of union vulnerabilities of the two nodes is ; exp() represents the exponential function with the natural constant e as the base; Indicates the functional difference between any two nodes.

[0029] In the above-constructed mathematical calculation formula for the functional difference between any two nodes, the ratio of the number of intersection components and the number of union components of any two nodes can reflect the proportion of the same components of the two nodes, reflecting the similarity of the two nodes; the ratio of the number of intersection vulnerabilities and the number of union vulnerabilities of the two nodes reflects the similarity of the functional vulnerabilities of the two components; the smaller the similarity of the component sets and the smaller the similarity of the vulnerability sets, the greater the functional difference between the nodes. That is, the ratio of the number of intersection components and the number of union components of the two nodes is negatively correlated with the functional difference between the two nodes, and the ratio of the number of intersection vulnerabilities and the number of union vulnerabilities of the two nodes is also negatively correlated with the functional difference between the two nodes.

[0030] Based on the functional differences, in actual operation, if there is frequent data transmission between two nodes, then these two nodes have a large amount of identical data, and when a node is attacked, it is more likely to choose another node to attack, so for data backup, this node should not be selected for backup. On the contrary, when the data transmission between the two nodes is less and the number of common nodes for data transmission is less, the difference between the two nodes is greater. Therefore, based on the interaction of the nodes, the mathematical calculation formula for the difference between any two nodes constructed in this embodiment is as follows: In the formula, Represents the difference between any two nodes; Indicates the functional difference between the two nodes; Indicates the amount of data transmitted between the two nodes; , The number of nodes in the intersection and union of all the node sets with data transmission between the two nodes is represented. Since each node in the distributed system has data transmission, it is obvious that the number of nodes in the union of all the node sets with data transmission between the two nodes is ; exp() represents the exponential function with the natural constant e as the base.

[0031] In the mathematical calculation formula for the difference between any two nodes constructed above, the functional difference between the two nodes is The difference between any two nodes Obviously, the correlation is positive. The amount of data transmitted between the two nodes The difference between the two nodes Negative correlation: the ratio of the number of intersection nodes and the number of union nodes of all node sets with data transmission between the two nodes is negatively correlated with the difference between the two nodes. The less data transmission between the two nodes and the fewer common nodes with data transmission, the greater the difference between the two nodes.

[0032] After obtaining the difference between any two nodes, the difference is regarded as the distance weight, so all the nodes of the distributed storage system can be drawn into an undirected weighted network graph. When selecting backup nodes for backup data, in order to ensure security and keep the number of backups as small as possible, the difference between the backup nodes and the nodes to which the data to be backed up belongs should be as large as possible, and the difference between the backup nodes should also be as large as possible. Since there are too many nodes and some similar nodes, the undirected weighted network graph can be clustered according to the difference, and the number of backups can be selected with reference to the clustering situation. On the other hand, different data have different security requirements. The number of backups can be further determined by referring to the encryption and verification steps of the data to be backed up, and then the backup nodes to be selected can be preliminarily determined based on the clustering situation. Therefore, this embodiment further sets the following steps.

[0033] Step S3: Obtain the backup node to be selected for the data to be backed up according to the security requirements of the data to be backed up and the aggregation of differences between the node to which the data belongs and the selectable nodes.

[0034] Among them, step S3 specifically includes: obtaining the number of backups of the data to be backed up according to the number of node classes, the number of encryption and verification steps of the data to be backed up, and the number of the most encrypted and verified steps in all data; obtaining the comprehensive difference between the data to be backed up and any backup scheme to be selected according to the number of backups of the data to be backed up, the average difference between the node to which the data to be backed up belongs and all the nodes in each node class, and the average difference between all nodes of any two node classes of the backup scheme to be selected; recording all the nodes of the backup scheme to be selected with the largest comprehensive difference as the backup nodes to be selected. It should be noted that the node class is specifically: clustering the undirected weighted network graph of the nodes until all nodes join the clustering cluster or are marked as noise points, and recording any noise point and any clustering cluster as a node class; in addition, the backup scheme to be selected is composed of a combination of multiple node classes.

[0035] More specifically, first, all nodes of the distributed storage system can be drawn into an undirected weighted network graph, as shown in the attached figure. Figure 2 As shown in the figure , Respectively represent nodes , The weights and nodes between , The weights between them are used to cluster the undirected weighted network graph of the nodes. The DBSCAN algorithm is used to cluster the first node As a starting point, set the minimum neighbor distance to (half of the mean of the differences between all nodes), set the minimum number of clustered neighbors to 2; starting from the starting point, find all its neighboring points within the minimum neighboring distance range, if the number is greater than or equal to the minimum number of clustered neighbors, add these points to the current cluster cluster, and mark these points as visited, then repeatedly find their neighboring points from the visited points and add them to the cluster until there are no more points to add; continue to select starting points from unvisited points and repeat the operation until all points are added to the cluster or do not meet the joining conditions and are marked as noise points, record any noise point and any cluster cluster as a node class, and obtain several node classes of the weighted network graph of the node.

[0036] Secondly, since each node class is a node with similar differences, when selecting backup nodes for backup data, you can select a node from each node class. Then you need to consider the necessity of the number of backups, that is, how many node classes should be selected from to back up the data to be backed up. The more encryption and verification steps the data undergoes, the greater the security requirements of the data to be backed up, and the more node classes should be selected from. In this embodiment, the mathematical calculation formula for the number of backups of the data to be backed up is constructed as follows: In the formula, Indicates the number of backups of data to be backed up; Indicates the number of node classes; Indicates the number of steps that all data has been encrypted and verified at most; Indicates the number of encryption and verification steps of the data to be backed up.

[0037] In the above-constructed mathematical calculation formula for the number of backups of data to be backed up, the number of node classes The number of backups to be backed up The basic value of each node class is a node with similar differences. When selecting a backup node for backup data, generally select a node from each node class. The number of steps for encryption and verification of the data to be backed up The most number of steps with encryption and verification of all data The greater the difference, the greater the security requirement of the data to be backed up, and the higher the necessity of backup. is the number of node classes The smaller the difference, the smaller the security requirement of the data to be backed up, and the lower the necessity of backup, the more backups need to be made. is the number of node classes is reduced on the basis of .

[0038] Getting the number of backups After that, the data with the largest difference from the data to be backed up The node classes are the candidate backup nodes. At the same time, the differences between the node classes need to be considered. All node classes are combined into several candidate backup schemes consisting of N node classes, and the comprehensive difference between the data to be backed up and any candidate backup scheme is calculated. In this embodiment, the mathematical calculation formula for the comprehensive difference between the data to be backed up and any candidate backup scheme is as follows: In the formula, Indicates the comprehensive difference between the data to be backed up and any backup solution to be selected; Indicates the number of node types for the backup solution to be selected; Indicates the average difference between the node to which the data to be backed up belongs and all nodes in the hth node class; It represents the average difference between all nodes of any two node classes in the backup solution to be selected.

[0039] In the above-constructed mathematical calculation formula for the comprehensive difference between the data to be backed up and any backup solution to be selected, Indicates the comprehensive difference between the data to be backed up and all node classes of the backup scheme to be selected. It represents the comprehensive difference between all node classes of the backup scheme to be selected. The two together reflect the comprehensive difference of the backup scheme to be selected.

[0040] In this way, the comprehensive difference between the data to be backed up and any candidate backup scheme is obtained, and the N node classes of the candidate backup scheme with the largest comprehensive difference are used as the backup scheme for the data to be backed up, and all nodes are used as candidate backup nodes.

[0041] Due to differences in data storage capacity and storage growth rate among the candidate backup nodes, not all of them are suitable as backup nodes for the data to be backed up. For example, a node may have a large amount of data stored by users recently, and it may be used to store data later. At the same time, the remaining storage capacity of the node itself is relatively small. In order to make the storage of all nodes more balanced, it should be avoided for backup. Therefore, among the candidate backup nodes, the appropriate backup degree of all nodes should be calculated, and nodes with a greater degree of suitable backup should be used as backup nodes to ensure load balancing of the storage system. Therefore, this embodiment further sets the following steps: Step S4: Select the final backup node from the candidate backup nodes according to the activity and storage conditions of the candidate backup nodes.

[0042] Among them, step S4 is specifically as follows: according to the data storage capacity of the backup node to be selected on the day of backup and the previous day, the storage capacity of the backup node to be selected, and the total storage space of the backup node to be selected, the appropriate backup degree of each backup node to be selected is obtained, and the backup node to be selected with the largest appropriate backup degree is recorded as the final backup node. Since the slower the data growth rate of the node and the smaller the storage proportion, the higher the appropriate backup degree of the node. Therefore, the mathematical calculation formula for the appropriate backup degree of any backup node to be selected constructed in this embodiment can be expressed as: In the formula, Indicates the appropriate backup degree of any candidate backup node; , Indicates the data storage capacity of the backup node to be selected on the backup day and the previous day; Indicates the storage capacity of the backup node to be selected; Represents the total storage space of the candidate backup node. Since each candidate backup node has a total storage space, obviously, ; In the mathematical calculation formula for the appropriate backup degree of any candidate backup node constructed above, Indicates the ratio between the data storage capacity of the backup node to be selected on the day of backup and the day before. Indicates the growth rate of the data storage capacity of the candidate backup node on the backup day and the previous day, and its suitability for backup of any candidate backup node Negative correlation: the slower the data storage growth rate of the candidate backup node on the backup day and the day before, the more appropriate the backup degree of any candidate backup node is. The higher; Indicates the percentage of the node's storage and its suitability for backup compared to any candidate backup node Negative correlation: the smaller the storage ratio is, the more suitable the backup degree of any candidate backup node is. That is, the growth rate of the data storage capacity of the candidate backup node on the backup day compared with the day before the backup, and the ratio of the storage capacity of the candidate backup node to the total storage space of the candidate backup node are negatively correlated with the suitability of the candidate backup node for backup.

[0043] Furthermore, the node with the highest degree of suitability for backup in each node class in the backup scheme is obtained, that is, the final backup node.

[0044] Step S5: Synchronously store the data to be backed up in all final backup nodes to complete the distributed data security storage.

[0045] Specifically, the data to be backed up is synchronously stored in all final backup nodes to complete the data backup. It should be noted that the weighted network diagram of the storage system nodes is updated in real time to ensure the classification effect of the node class, thereby ensuring the best selection of data backup nodes and ensuring the balance between data security and redundancy.

[0046] At this point, the data security storage of the arbitrary distributed data storage system is completed. In this way, redundant backup can be reduced as much as possible, the backup effect can be maximized, and the security and redundancy of the distributed storage system can be well balanced.

[0047] Second, see Figure 3 , which shows a distributed data security storage device provided by an embodiment of the present invention, the device comprising: The node information acquisition module 101 is used to acquire node information in the distributed data storage system; The difference acquisition module 102 is used to acquire the difference between any two nodes according to the functional difference and interaction between the nodes; The candidate backup node acquisition module 103 is used to acquire the candidate backup node of the data to be backed up according to the security requirements of the data to be backed up and the aggregation of the differences between the node to which the node belongs and the selectable nodes; The final backup node acquisition module 104 is used to select the final backup node from the candidate backup nodes according to the activity and storage conditions of the candidate backup nodes; The storage execution module 105 is used to synchronously store the data to be backed up in all the final backup nodes.

[0048] Furthermore, the device also includes: A function difference acquisition module, used for acquiring the function difference of any two nodes according to the number of components of the intersection and union of the two nodes and the number of vulnerabilities of the intersection and union of the two nodes; An interaction status acquisition module, used to acquire the interaction status of the two nodes according to the amount of data transmitted between the two nodes, the number of intersection nodes and the number of union nodes of all node sets with data transmission between the two nodes; A backup quantity acquisition module is used to acquire the backup quantity of the data to be backed up according to the number of nodes, the number of encryption and verification steps of the data to be backed up, and the number of the most encryption and verification steps of all data; The comprehensive difference acquisition module is used to obtain the comprehensive difference between the data to be backed up and any backup scheme to be selected based on the number of backups of the data to be backed up, the average difference between the node to which the data to be backed up belongs and all nodes of each node class, and the average difference between all nodes of any two node classes of the backup scheme to be selected.

[0049] In a third aspect, this embodiment provides a distributed data security storage system, which includes any one of the above-mentioned distributed data security storage devices and also includes multiple nodes composed of multiple computers.

[0050] The present embodiment provides a distributed data security storage method, device and system. The method first obtains node information in a distributed data storage system; then, according to the functional differences and interactions between the nodes, obtains the difference between any two nodes; according to the security requirements of the data to be backed up and the aggregation of the differences between the node to which it belongs and the selectable nodes, obtains the backup nodes to be selected for the data to be backed up; according to the activity and storage conditions of the backup nodes to be selected, selects the final backup nodes from the backup nodes to be selected; finally, the data to be backed up is synchronously stored in all the final backup nodes to complete the distributed data security storage. In this way, each node of the distributed data security system can store evenly and complete the multi-node backup of the data, which is conducive to reducing redundant backup as much as possible while ensuring the security of distributed data storage.

[0051] It should be noted that the sequence of the above embodiments of the present invention is only for description and does not represent the advantages and disadvantages of the embodiments. The processes depicted in the accompanying drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0052] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A distributed data security storage method, characterized in that: The method comprises: Step S1: Obtain node information in a distributed data storage system; Step S2: Obtain the difference between any two nodes according to the functional difference and interaction between the nodes; Step S3: obtaining a candidate backup node for the data to be backed up according to the security requirements of the data to be backed up and the aggregation of differences between the node to which the data belongs and the selectable nodes; Step S4: Select the final backup node from the candidate backup nodes according to the activity and storage conditions of the candidate backup nodes; Step S5: Synchronously store the data to be backed up in all final backup nodes to complete the distributed data security storage.

2. A distributed data secure storage method according to claim 1, characterized in that: The step S1 of acquiring the node information in the distributed data storage system specifically includes: For any distributed data storage system, any computer is regarded as a node, any node is split into different components with independent functions, and the component set of each node is obtained; Get the set of vulnerabilities of the software or hardware of any node.

3. A distributed data security storage method according to claim 2, characterized in that: The step S2 specifically includes: According to the number of components of the intersection and union of any two nodes and the number of vulnerabilities of the intersection and union of the two nodes, the functional difference of the two nodes is obtained; Obtain the interaction status of the two nodes according to the amount of data transmitted between the two nodes, the number of intersection nodes and the number of union nodes of all node sets with data transmission between the two nodes; The difference between the two nodes is obtained according to the functional difference and interaction status of the two nodes.

4. A distributed data security storage method according to claim 3, characterized in that: The amount of data transmitted between the two nodes is negatively correlated with the difference between the two nodes, and the ratio of the number of intersection nodes to the number of union nodes is negatively correlated with the difference between the two nodes.

5. A distributed data security storage method according to claim 1, characterized in that: The step S3 specifically includes: Obtain the number of backups of the data to be backed up according to the number of node classes, the number of encryption and verification steps of the data to be backed up, and the number of the most encryption and verification steps of all data; Obtain the comprehensive difference between the data to be backed up and any backup scheme to be selected based on the number of backups of the data to be backed up, the average difference between the node to which the data to be backed up belongs and all nodes in each node class, and the average difference between all nodes of any two node classes of the backup scheme to be selected; All nodes of the candidate backup solution with the largest comprehensive difference are recorded as candidate backup nodes.

6. A distributed data secure storage method according to claim 5, characterized in that: The node class is specifically: clustering the undirected weighted network graph of nodes until all nodes join the cluster or are marked as noise points, and any noise point and any cluster are recorded as a node class; the backup plan to be selected is composed of a combination of multiple node classes.

7. A distributed data secure storage method according to claim 1, characterized in that: The step S4 is specifically as follows: according to the data storage capacity of the backup node on the backup day and the previous day, the storage capacity of the backup node, and the total storage space of the backup node, the suitable backup degree of each backup node is obtained, and the backup node with the largest suitable backup degree is recorded as the final backup node.

8. A distributed data secure storage method according to claim 7, characterized in that: The growth rate of the data storage capacity of the candidate backup node on the backup day compared with the day before the backup, and the ratio of the storage capacity of the candidate backup node to the total storage space of the candidate backup node are negatively correlated with the suitability of the candidate backup node for backup.

9. A distributed data security storage device, characterized in that: The device includes: A node information acquisition module is used to acquire node information in a distributed data storage system; The difference acquisition module is used to obtain the difference between any two nodes according to the functional difference and interaction between the nodes; A candidate backup node acquisition module is used to acquire the candidate backup node of the data to be backed up according to the security requirements of the data to be backed up and the aggregation of differences between the node to which it belongs and the selectable nodes; The final backup node acquisition module is used to select the final backup node from the candidate backup nodes according to the activity and storage status of the candidate backup nodes; The storage execution module is used to synchronously store the data to be backed up in all final backup nodes.

10. A distributed data security storage system, characterized in that: The system includes a distributed data security storage device as described in claim 9, and also includes multiple nodes composed of multiple computers.

Images