A storage method for dynamically reconfiguring storage data

Abstract

The application discloses a kind of storage methods of dynamic reconfiguration storage data, comprising the following steps: receiving data dynamic change timer to time message, read object ABC, initiate the request of object ABC re-write;After receiving the write request of object ABC, according to current time and object name hash modulo calculation obtains the storage algorithm index in storage algorithm table, if algorithm index is consistent with the algorithm index of last write, then re-calculate and obtain;Object ABC is sliced according to storage algorithm and is handled;According to strip, data block is encoded to obtain encoding block, and these encoding blocks are sent to different logical storage units;Wait until encoding block is successfully landed, record log, log format;T3=rand (X), restart timer, duration is T3.The storage method of dynamic reconfiguration storage data provided by the application has the advantages that the reliability of storage system is strong, the security of storage data is high.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of cloud storage, in particular to a storage method for dynamically reconstructing storage data. BACKGROUND

[0002] With the development of the Internet, especially the development of cloud computing, big data and the Internet of Things, the Internet+ ecology is becoming more and more rich, and the explosive growth of various data follows. The traditional monolithic storage has been unable to meet the growing data requirements, and more and more enterprises and users choose to host data on distributed cloud storage.

[0003] However, the traditional distributed cloud storage increases the predictability of data due to its fixed overall topology and fixed storage path, and passive defense is difficult to prevent increasingly complex attack methods, which seriously threatens the data security of enterprises and users. Based on the above security problems, it is now necessary to periodically change the data storage algorithm in the storage system and periodically reconstruct the storage method for data blocks in the storage system, improve the uncertainty of the storage system, and thus improve the security of the stored data. SUMMARY

[0004] The present application provides a storage method for dynamically reconstructing storage data, which has the advantages of strong reliability of the storage system and high security of the stored data, and solves the problem of low uncertainty and security of the existing storage system.

[0005] According to the storage method for dynamically reconstructing storage data provided by the embodiment of the present application, the following steps are included:

[0006] After receiving the data dynamic change timer expiration message, reading object ABC, initiating a request for re-writing object ABC;

[0007] After receiving the write request of object ABC, the storage algorithm index in the storage algorithm table is obtained by hash modulo calculation according to the current time and object name, and if the algorithm index is consistent with the algorithm index of the last write, the algorithm index is recalculated and obtained;

[0008] According to the storage algorithm, object ABC is processed by striping and slicing;

[0009] The data blocks are encoded according to the strips to obtain encoded blocks, and the encoded blocks are sent to different logical storage units;

[0010] After the encoded blocks are successfully written to the disk, a log is recorded, and the log format is:

[0011] T3 = rand (X), restart the timer, and the duration is T3.

[0012] Preferably, the reading object ABC includes the following steps:

[0013] read the log corresponding to object ABC, and obtain the storage algorithm corresponding to object ABC;

[0014] read a sufficient number of encoding blocks from the logical storage unit according to the setting of the storage algorithm;

[0015] decode the corresponding encoding blocks and merge the corresponding strips according to the decoding algorithm in the storage algorithm to obtain the original object ABC.

[0016] Preferably, the request for initiating the re-writing of object ABC comprises the following steps:

[0017] After receiving the write request of object ABC, the storage algorithm index in the storage algorithm table is obtained by hash modulo calculation according to the current time and the object name, and the corresponding storage algorithm is obtained according to the algorithm index;

[0018] According to the storage algorithm, object ABC is sliced and processed by strip;

[0019] Encode the data blocks by strip to obtain the encoding blocks, and send these encoding blocks to different logical storage units;

[0020] After the encoding block is successfully written, a log is recorded, and the log format is:

[0021] T2 = rand (X), restart the timer, and the duration is T2.

[0022] Preferably, the storage algorithm dynamic change comprises the following steps:

[0023] The duration of the timer is calculated by a random algorithm, and the timer is started;

[0024] After the timer expires, the configuration parameters of the new storage algorithm are generated, and the new storage algorithm is generated;

[0025] Insert the storage algorithm table, and calculate the duration of the timer by a random algorithm again, and start the timer.

[0026] The technical scheme provided by the embodiment of the application can include the following beneficial effects:

[0027] The application periodically updates the storage algorithm and the storage data block, wherein the duration of the timer is generated by a random algorithm, which increases the randomness of the storage algorithm of the storage system, and also increases the randomness of the storage data block, and does not affect the integrity and correctness of data reading, achieves the effect of active defense and effectively interferes with the attack chain, and enhances the reliability of the storage system and the security of the storage data. BRIEF DESCRIPTION OF DRAWINGS

[0028] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the embodiments description will be briefly introduced. Obviously, the drawings in the following description are some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative effort.

[0029] Figure 1 A flowchart of the storage method of dynamically reconstructing storage data according to the present application;

[0030] Figure 2 A flowchart of the storage method of dynamically reconstructing storage data according to the present application;

[0031] Figure 3 A flowchart of reading object ABC in step S1 according to the present application;

[0032] Figure 4 A flowchart of reading object ABC in step S1 according to the present application;

[0033] Figure 5 A flowchart of initiating the request of re-writing object ABC in step S1 according to the present application;

[0034] Figure 6 A flowchart of initiating the request of re-writing object ABC in step S1 according to the present application;

[0035] Figure 7 A flowchart of dynamically changing the storage algorithm according to the present application;

[0036] Figure 8 A flowchart of dynamically changing the storage algorithm according to the present application. DETAILED DESCRIPTION

[0037] The technical solutions in the embodiments of the present application will be described clearly and completely with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are some embodiments of the present application, but not all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of the present application.

[0038] It should also be understood that the terms used in the present application specification are only for the purpose of describing particular embodiments and are not intended to limit the present application. As used in the present application specification and the appended claims, the singular forms "a", "an" and "the" are intended to include the plural forms unless the context clearly indicates otherwise.

[0039] It should be further understood that the term "and / or" as used herein in the specification and in the claims, if any, means one or the other or both of the listed terms.

[0040] Referring to Figure 1 and Figure 2 , the present application provides a storage method 10 for dynamically reconstructing storage data, comprising the following steps:

[0041] Step S1: receiving a data dynamic change timer expiration message, reading object ABC, and initiating a request for re-writing object ABC;

[0042] Step S2: after receiving the write request of object ABC, calculating the storage algorithm index in the storage algorithm table according to the current time and the object name, and if the algorithm index is consistent with the algorithm index of the last write, recalculating and obtaining;

[0043] Step S3: performing striping and slicing processing on object ABC according to the storage algorithm;

[0044] Step S4: encoding the data blocks according to the strips to obtain encoded blocks, and sending the encoded blocks to different logical storage units;

[0045] Step S5: after the encoded blocks are successfully written to the disk, recording a log, and the log format is

[0046] Step S6: T3 = rand(X), restarting the timer for a duration of T3.

[0047] In this embodiment, the log format of step S5 is (ABC, the current version number of ABC, the storage algorithm index).

[0048] Referring to Figure 3 and Figure 4 , the reading of object ABC in step S1 comprises the following steps:

[0049] Step S11: reading the log corresponding to object ABC to obtain the storage algorithm corresponding to object ABC;

[0050] Step S12: reading a sufficient number of encoded blocks from the logical storage unit according to the setting of the storage algorithm;

[0051] Step S13: decoding the corresponding encoded blocks and merging the corresponding strips according to the decoding algorithm in the storage algorithm to obtain the original object ABC.

[0052] Referring to Figure 5 and Figure 6 , the request for re-writing object ABC in step S1 comprises the following steps:

[0053] Step S101: After receiving the write request of the object ABC, the storage algorithm index in the storage algorithm table is obtained according to the hash modulo calculation of the current time and the object name, and the corresponding storage algorithm is obtained according to the algorithm index;

[0054] Step S102: The object ABC is sliced according to the storage algorithm;

[0055] Step S103: The data blocks are encoded according to the strip to obtain the encoded blocks, and the encoded blocks are sent to different logical storage units;

[0056] Step S104: After the encoded blocks are successfully written, a log is recorded, and the log format is

[0057] Step S105: T2=rand(X), restart the timer, and the duration is T2.

[0058] In the embodiment, the log format of step S104 is (ABC, the current version number of ABC, the storage algorithm index).

[0059] Please refer to Figure 7 and Figure 8 , the storage method 10 for dynamically reconstructing storage data further includes a storage algorithm dynamic change, and the storage algorithm dynamic change includes the following steps:

[0060] Step S7: The duration of the timer is calculated by a random algorithm, and the timer is started;

[0061] Step S8: After the timer is timed out, the configuration parameters of the new storage algorithm are generated, and the new storage algorithm is generated;

[0062] Step S9: Insert the storage algorithm table, and calculate the duration of the timer again by a random algorithm, and start the timer.

[0063] The configuration parameters of step S8 are (strip_size=x, strip_width=y, and the encoding algorithm is xxx).

[0064] The technical scheme provided by the embodiment of the application can include the following beneficial effects:

[0065] The application periodically updates the storage algorithm and the storage data block, the duration of the timer is generated by a random algorithm, the randomness of the storage algorithm of the storage system is increased, the randomness of the storage data block is also increased, the integrity and correctness of data reading are not affected, the effect of active defense and effective interference of the attack chain is achieved, and the reliability of the storage system and the security of the storage data are enhanced.

[0066] The above merely illustrates the specific embodiments of the present application, but the protection scope of the present application is not limited thereto, and any skilled person in the art can easily think of various equivalent modifications or replacements within the technical range disclosed by the present application, and these modifications or replacements shall be covered within the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A storage method of dynamically reconfiguring storage data, characterized by, Comprising the following steps: Upon receiving the data dynamic change timer expiration message, read object ABC, initiate a request for re-writing object ABC, wherein the length of the timer is randomly generated by an algorithm; Upon receiving the write request for object ABC, calculate the storage algorithm index in the storage algorithm table according to the current time and object name by hash modulo calculation, and re-calculate if the algorithm index is consistent with the last write algorithm index; According to the storage algorithm, slice the object ABC into strips; Encode the data blocks according to the strips to obtain encoded blocks, and send these encoded blocks to different logical storage units; After the encoded blocks are successfully written to disk, record the log, and the log format is: T3 = rand(X), restart the timer with a length of T3.

2. The storage method of claim 1, wherein, The read object ABC comprises the following steps: Read the log corresponding to object ABC to obtain the storage algorithm corresponding to object ABC; According to the storage algorithm, read a sufficient number of encoded blocks from the logical storage unit; According to the decoding algorithm in the storage algorithm, decode the corresponding encoded blocks and merge the corresponding strips to obtain the original object ABC.

3. The storage method of claim 1, wherein, The request for re-writing object ABC comprises the following steps: Upon receiving the write request for object ABC, calculate the storage algorithm index in the storage algorithm table according to the current time and object name by hash modulo calculation, and obtain the corresponding storage algorithm according to the algorithm index; According to the storage algorithm, slice the object ABC into strips; Encode the data blocks according to the strips to obtain encoded blocks, and send these encoded blocks to different logical storage units; After the encoded blocks are successfully written to disk, record the log, and the log format is: T2 = rand(X), restart the timer with a length of T2.

4. The storage method of claim 1, wherein, The storage algorithm dynamically changes, comprising the following steps: Calculate the timer length by a random algorithm and start the timer; After the timer expires, generate new configuration parameters for the storage algorithm and generate a new storage algorithm; Insert the storage algorithm table, and calculate the timer length by a random algorithm again and start the timer.

Images