Method and system for protecting data of storage trunk transportation network nodes based on timestamp
By calculating the operation strength and query interval of the trunk, the grouping conditions of the tree protocol are constructed, which solves the problem of time stamp sequence query within the same group in the tree protocol, reduces security risks and query difficulty, and ensures efficient data protection.
Patent Information
- Application Number
- CN202411476513.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-22
- Publication Date
- 2024-12-27
- Estimated Expiration
- 2044-10-22
AI Technical Summary
In the tree protocol, timestamps within the same group cannot effectively ensure the order of sequence, resulting in security risks, and the difficulty of querying increases, affecting the data protection effect.
By calculating the operation intensity and query interval of the trunk at each time of the day, combining the inter-group query difficulty and safety hazards, the grouping conditions of the tree protocol are constructed to avoid timestamp grouping within the same group, and ensure the difficulty and security of query.
It effectively avoids the time stamp security risks caused by improper grouping of tree protocols, maintains efficient query performance, and ensures data security and query difficulty.
Smart Images
Figure CN119003553B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of transport network node data protection, and specifically to a timestamp-based storage trunk transport network node data protection method and system. Background Art
[0002] The storage trunk storage service is a kind of item storage service provided by the transportation network node of the financial service center to the bank. When depositing items in the bank, the item deposit data needs to be recorded, and the item deposit records need to be safely stored to prevent tampering. The item deposit record storage method based on timestamp can effectively ensure the security of item deposit records and is widely used in deposit data storage.
[0003] The record storage method based on timestamp can query the order of two timestamps, effectively preventing data tampering. Among the timestamp generation methods, the more commonly used method is the tree protocol, which has the advantage of being able to quickly query two timestamps, but the disadvantage is that it cannot guarantee that the order of two timestamps in the same group has not been tampered with.
[0004] When the tree protocol generates timestamps, timestamps within a certain period of time will be grouped into the same group. The more timestamps there are in the same group, the more likely it is that timestamps of multiple recorded data from the same storage box will be grouped into the same group. When two timestamps from the same storage box of a bank are in the same group in the tree protocol, the order of the two timestamps cannot be queried, which may provide the tree protocol storage party with an opportunity to swap the order of timestamps, causing security risks. Summary of the invention
[0005] In order to solve the above technical problems, the present application provides a method and system for protecting data of a storage trunk transportation network node based on timestamps. The technical solutions adopted are as follows:
[0006] In a first aspect, an embodiment of the present application provides a timestamp-based storage trunk transportation network node data protection method, the method comprising the following steps:
[0007] Obtain the number of storage operations and the timestamp of the storage data for each storage tail box at each time of the day under the historical preset days;
[0008] A tree protocol is used to group the timestamps of the storage data stored in all storage tail boxes in the transportation network nodes; wherein the conditions for grouping are:
[0009] A1, using the time interval between different times of the storage trunk and the target time of the day, weighting the number of storage operations at different times, and calculating the operation intensity of the storage trunk at the target time of the day; the average level of the operation intensity of the storage trunk at the same target time in all historical preset days is used as the storage operation intensity of the storage trunk at the target time;
[0010] A2, based on the storage operation intensity of all storage trunks in the transportation network nodes at the target time, weight the query intervals of the corresponding storage trunks at the target time, and calculate the inter-group query difficulty at the target time;
[0011] A3, based on the storage operation intensity of all storage trunks in the transportation network nodes at the target time, weight the number of timestamps in the group where the corresponding storage trunk is located at the target time, and calculate the group generation discriminant value at the target time in combination with the inter-group query difficulty at the target time; use the group generation discriminant value to construct the grouping condition of the tree protocol.
[0012] Preferably, the timestamp of the stored data is a message digest of the stored data obtained by using a hash algorithm.
[0013] Preferably, in step A1, the weight used in the weighting process is determined by the negative correlation mapping result of the time interval.
[0014] Preferably, in step A1, the operation intensity is determined by a weighted sum of the number of storage operations at all times except the target time within the day.
[0015] Preferably, the query interval is determined by:
[0016] Each storage tail box is provided with a counter, and the count value counted by the counter of the storage tail box is recorded as the query interval;
[0017] The counting method is: when the tree protocol generates a group, the count value is increased by 1; when the timestamp of the nth storage tail box is added to a group, the count value is reset to 0.
[0018] Preferably, in step A2, the inter-group query difficulty is determined by an average level of a weighted sum of query intervals for all storage tail boxes in the transportation network node at the target time.
[0019] Preferably, in step A3, when the corresponding storage tail box has not performed a storage operation or has not performed tree protocol grouping at the target time, the number of timestamps of the corresponding storage tail box in the group where the corresponding storage tail box is located at the target time is set to 0.
[0020] Preferably, the method for determining the group generation discriminant value is:
[0021] In step A3, the average level of the weighted sum of the number of timestamps in the group to which all the storage tail boxes in the transportation network node belong at the target time is calculated;
[0022] The difference between the inter-group query difficulty and the average level is used as the group generation discriminant value at the target time.
[0023] Preferably, the grouping condition of the tree protocol is constructed by using the group generation discriminant value, including: when the group generation discriminant value is less than or equal to 0, the tree protocol generates a new group at the target time; otherwise, no new group is generated.
[0024] In the second aspect, an embodiment of the present application also provides a timestamp-based storage trunk transportation network node data protection system, including a memory, a processor, and a computer program stored in the memory and running on the processor, and when the processor executes the computer program, it implements the steps of any one of the above-mentioned timestamp-based storage trunk transportation network node data protection methods.
[0025] This application has at least the following beneficial effects:
[0026] The present application aims at the potential safety hazard of timestamps caused by improper grouping of tree protocols when using a tree protocol to store timestamps of storage trunks, and proposes a data protection method for storage trunk transportation network nodes based on timestamps, including: using the time interval between different moments of all historical preset days and the target moment of the day for the storage trunk, calculating the weighted average level of the number of storage operations at different moments, which is used to characterize the probability of storage operations of the storage trunk at different moments in a day, and avoiding the grouping results of multiple timestamps belonging to the same storage trunk in the same group in the tree protocol; combining the storage operation intensity and the query interval of the storage trunk at the target moment, calculating the query difficulty between groups at the target moment, which is used to characterize that at the beginning of a certain moment, a new group is added to the tree protocol, and the tree protocol is given a new group. The increased difficulty of timestamp query caused by the protocol is calculated to ensure that the tree protocol has a lower query difficulty; based on the storage operation intensity and the number of timestamps of the storage tail box in the group where the target time is located, and combined with the inter-group query difficulty at the target time, the group generation discrimination value at the target time is calculated to characterize the increased query difficulty and the size of the security risk brought to the tree protocol by adding a new group in the tree protocol before a certain time, and use the group generation discrimination value to weigh the query difficulty and the security risk to construct the grouping condition of the tree protocol; its beneficial effect is that, since the query difficulty and the security risk are first extracted, and the grouping condition is constructed by weighing the two, it is possible to avoid the timestamp security risk caused by improper grouping of the tree protocol while ensuring the efficient query performance of the tree protocol. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present application 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 application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0028] Figure 1 A flowchart of a timestamp-based method for protecting data in a storage trunk transportation network node is provided for one embodiment of the present application.
[0029] Figure 2 A schematic diagram of data distribution of the number of storage operations of a storage tail box at all times in a day provided by an embodiment of the present application.
[0030] Figure 3 A flow chart of a method for constructing tree-type protocol grouping conditions provided in one embodiment of the present application.
[0031] Figure 4 A schematic diagram of the distribution of the operation intensity of a storage trunk at all times of the day provided in one embodiment of the present application. DETAILED DESCRIPTION
[0032] In order to further explain the technical means and effects adopted by the present application to achieve the predetermined invention purpose, the following is a detailed description of the specific implementation method, structure, features and effects of the timestamp-based storage trunk transportation network node data protection method and system proposed in the present application 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. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.
[0033] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
[0034] The specific scheme of the timestamp-based storage trunk transportation network node data protection method and system provided by the present application is described in detail below with reference to the accompanying drawings.
[0035] An embodiment of the present application provides a timestamp-based storage trunk transportation network node data protection method and system.
[0036] Specifically, the following timestamp-based storage trunk transportation network node data protection method is provided, please refer to Figure 1 , the method comprises the following steps:
[0037] The first step is to obtain the number of storage operations and the timestamp of the storage data for each storage tail box at various times of the day under the historical preset days.
[0038] In the data protection of the transportation network nodes, the storage data of the user's storage trunk will be recorded. For example, what items the user deposited at a certain time and what items the user took out at a certain time, the system will record this information. The user's storage data is recorded as a string of binary bit streams.
[0039] Furthermore, a binary bit stream is used as input, a hash value calculation method is adopted, and the necessary parameter is the hash function type. Preferably, the embodiment of the present application adopts the SHA-1 algorithm (Secure Hash Algorithm 1), outputs a message digest consisting of a 20-byte hash value, and records it as the timestamp of the stored data. Among them, the SHA-1 algorithm is a well-known technology and will not be described in detail.
[0040] When using the tree protocol, multiple timestamps are grouped together. When grouping, it should be avoided that timestamp data of different actions of the same storage trunk exist in the same group. Therefore, the grouping rules of the tree protocol need to be adjusted.
[0041] This implementation analyzes the historical storage operation data of the storage trunk, calculates the usage rules of the storage trunk, and uses the rules to construct the grouping rules of the tree protocol to avoid storing multiple timestamps of the same storage trunk in the same group of the tree protocol, which affects the query of the order of two timestamps and may provide the tree protocol storage party with an opportunity to swap the order of timestamps, causing security risks.
[0042] The storage operation data obtained in this embodiment is the number of storage operations of each storage tail box at each time of each day. For the historical data of the storage tail box operation, this embodiment sets the historical number of days D to 60, and the collection time interval T is set to 1 minute, that is, the storage data and the number of storage operations of each storage tail box every minute of each day within the historical 60 days are collected.
[0043] In the embodiment of the present application, a data distribution diagram of the number of storage operations at all times in a day is shown in the attached figure. Figure 2 shown.
[0044] exist Figure 2 In the figure, the horizontal axis is time / minute, and the vertical axis is the number of storage operations / times. Each straight line in the figure represents the number of storage operations performed by the storage trunk in the corresponding minute. The size of the value is used to reflect the frequency of storage trunk operations in a day.
[0045] At this point, the above method can be used to obtain the number of storage operations and the timestamp of the storage data for each storage tail box at each time of each day under the historical preset days.
[0046] In the second step, a tree protocol is used to group the timestamps of the storage data stored in all storage tail boxes in the transportation network nodes.
[0047] In the embodiment of the present application, the flowchart of the method for constructing the tree-type protocol grouping condition is as shown in the attached Figure 3 As shown, specifically:
[0048] A1, using the time interval between different times of the day and the target time of the day, weight the number of storage operations at different times, and calculate the operation intensity of the storage box at the target time of the day; the average level of the operation intensity of the storage box at the same target time under all historical preset days is used as the storage operation intensity of the storage box at the target time.
[0049] When constructing the grouping of the tree protocol, it is necessary to obtain the operation rules of a single storage tail box. If the storage tail box is frequently operated in the same period of time, then the grouping should be carried out more during this period to ensure that when performing tree structure grouping, the timestamp of the same storage tail box is avoided as much as possible to be put into the same group.
[0050] Based on this, the present application calculates the operation intensity of the storage trunk at any target time in a day to characterize the usage pattern of the nth storage trunk at that time, specifically:
[0051] Preferably, in an embodiment of the present application, the time intervals between the target moment and the other different moments on the same day are calculated respectively; the negative correlation mapping result of the time interval is used as the weight, the number of deposit operations at all other moments on the same day is weighted and summed, and the result of the weighted sum is used as the operation intensity.
[0052] Optionally, the negative correlation mapping may be implemented by negative linear mapping, negative exponential mapping, or by setting adjustment parameters.
[0053] Specifically, in one implementation of the embodiment of the present application, taking the nth storage tail box as an example, the operation intensity of the nth storage tail box at the mth moment in the dth day is calculated. The expression is: ; In the formula, represents the operation intensity of the nth storage trunk at the mth time in the dth day, M represents the number of time in a day, represents the number of storage operations of the nth storage tail box at the kth time in the dth day, m and k represent the mth time and the kth time in the dth day respectively, represents the preset zero elimination parameter, and the value of this embodiment is 1 in order to avoid the situation where the denominator is 0.
[0054] It should be understood that The larger the value of , that is, the closer the moment to the target moment m, the more storage operations the storage tail box has, which is used to reflect that the nth storage tail box has performed more intensive storage operations at the mth moment on the dth day.
[0055] In the embodiment of the present application, a distribution diagram of the operation intensity of the storage trunk at all times in a day is shown in the attached figure. Figure 4 shown.
[0056] exist Figure 4 In the figure, the horizontal axis is time / minute, the vertical axis is operation intensity, and each straight line in the figure represents the operation intensity of the storage trunk at the corresponding minute.
[0057] Furthermore, the average of all operation intensities of the nth storage trunk at the mth time within D days is calculated to obtain the storage operation intensity of the nth storage trunk at the mth time .
[0058] It should be understood that the intensity of the storage operation The larger the value is, the more likely the nth storage box is to be concentrated at the mth moment of the day. In this case, the tree protocol of timestamps should be grouped at shorter time intervals to avoid multiple timestamps belonging to the nth storage box in the same group in the tree protocol, and to shorten the time used to sequentially query the densely stored timestamps at the mth moment.
[0059] A2, based on the storage operation intensity of all storage trunks in the transportation network nodes at the target time, weight the query intervals of the corresponding storage trunks at the target time, and calculate the inter-group query difficulty at the target time.
[0060] When grouping, if the tree protocol grouping is frequently performed, although it can effectively avoid the appearance of multiple timestamps belonging to the nth storage box in the same group, it will also result in too many interval groups between two consecutive timestamps recording the nth storage box, and it will take more time to query the timestamps of the nth storage box sequentially.
[0061] Accordingly, a counter is set for each storage tail box, and the count value of the counter of the nth storage tail box is recorded as the query interval The counting method is: when the tree protocol generates a group, the count value is increased by 1; when the timestamp of the nth storage tail box is added to a group, the count value is reset to 0.
[0062] It should be understood that the query interval represents the number of groups between the group to which the nth storage box last joined and the current group. The more groups there are, the more timestamps need to be calculated when performing a timestamp sequential query on the nth storage box. When using a tree protocol to manage timestamps, the slower the timestamp query on the nth storage box, the worse the timestamp management effect.
[0063] Furthermore, the present application analyzes the difficulty of inter-group query of the storage trunk at the target time by combining the query interval and storage operation intensity of the storage trunk at the target time, which is used to characterize how much difficulty it will bring to the query of the tree protocol if a new group is immediately created at the current target time.
[0064] Furthermore, the query interval of the nth storage box at the target time is obtained, and the mth time is taken as the target time. When the query interval of the nth storage box at the mth time is larger, the query difficulty caused by adding a group in the tree protocol increases more obviously.
[0065] For the nth storage tail box, if its storage operation intensity at the mth moment is greater, it is more likely to perform a timestamp recording operation at the mth moment. The shorter the time the tree protocol waits for the nth storage tail box to perform a storage operation before adding a new group, the easier it is to reduce the query difficulty of the nth storage tail box at the cost of a smaller time interval.
[0066] Therefore, at the mth moment, the greater the storage operation intensity of the nth storage tail box, the more important its query interval is in calculating the difficulty of inter-group queries. At this time, the tree protocol should stop generating new groups and wait for the nth storage tail box to generate a timestamp to reduce the query difficulty of the timestamp in the tree protocol.
[0067] Preferably, in an embodiment of the present application, the storage operation intensity of each storage tail box at the target time is used as a weight, and the query interval of the storage tail box at the target time is weighted; the average level of the weighted sum of all storage tail boxes in the transportation network node at the target time is used as the inter-group query difficulty.
[0068] In one implementation of the present application, the inter-group query difficulty at the mth moment is calculated. The expression is: ; In the formula, represents the difficulty of inter-group query at the mth moment, N represents the number of storage trunks in the transportation network node, represents the query interval of the nth storage box at the mth time, It represents the storage operation intensity of the nth storage trunk at the mth moment.
[0069] It should be understood that the greater the query interval of the nth storage box at the mth moment, the greater the difficulty of inter-group query; the greater the storage operation intensity of the nth storage box at the mth moment, the greater the impact of the query interval of the nth storage box on the difficulty of inter-group query. Finally, the greater the difficulty of inter-group query, it means that at the mth moment, if the tree protocol generates a new group, the greater the overall query difficulty of the storage box will increase, and the more it should stop generating new groups at this time to ensure that the tree protocol has a lower query difficulty.
[0070] A3, based on the storage operation intensity of all storage trunks in the transportation network nodes at the target time, weight the number of timestamps in the group where the corresponding storage trunk is located at the target time, and calculate the group generation discriminant value at the target time in combination with the inter-group query difficulty at the target time; use the group generation discriminant value to construct the grouping condition of the tree protocol.
[0071] Before the target time starts, the timestamps that have been recorded in the current tree protocol group should be counted. If the timestamps that have been recorded in the group belong to the same storage tail box, a new group should be generated before the target time starts to store the new timestamps. Otherwise, no new group will be generated, and the existing group will be continued to store the new timestamps.
[0072] At the same time, among the timestamps already recorded in the group, the storage tail box corresponding to one of the timestamps is obtained, and the storage operation intensity of the storage tail box at the target time is obtained. If the storage operation intensity of the storage tail box at the target time is greater, the existing group will continue to store the newly recorded timestamps at the target time. The storage tail box corresponding to the newly added timestamp is more likely to be the same storage tail box as the storage tail box corresponding to the existing timestamp. At this time, the time sequence of the timestamps of the storage tail boxes is easier to be changed, and the security risks brought are greater. At this time, a new group should be generated before the target time starts. At the same time, the greater the inter-group query difficulty calculated at the target time, the more it is not advisable to generate a new group before the target time starts.
[0073] In the embodiment of the present application, the specific process of calculating the group generation discrimination value at the target time is:
[0074] This embodiment takes the mth moment as an example. First, at the mth moment, there are multiple timestamps in the current group where the tree protocol is located. Each timestamp corresponds to a storage tail box. If there are multiple timestamps in the group corresponding to the same storage tail box, it is considered that the multiple timestamps cannot complete the order query, causing security risks. At this time, the number of timestamps in the group where the nth storage tail box is located at the mth moment is obtained. .
[0075] Further, calculate the group generation discriminant value at the mth moment The expression is: ; In the formula, represents the group generation discriminant value at the mth moment, represents the difficulty of inter-group query at the mth moment, represents the storage operation intensity of the nth storage trunk at the mth moment, is the number of storage trunks in the transportation network node, Indicates the number of timestamps of the nth storage tail box in the group at the mth moment.
[0076] It is worth noting that when the nth storage tail box has not been stored at the mth moment or has not been grouped by the tree protocol, .
[0077] It should be understood that when the number of timestamps of the nth storage tail box in the group at the mth moment is The more there are, the larger the space for changing the time sequence of the timestamp data of the nth storage tail box, and the greater the security risk of continuing to use the existing group instead of generating a new group; when the storage operation intensity of the nth storage tail box at the mth moment is The larger the value, the greater the possibility of generating a timestamp about the storage tail box in the current group. At this time, the more timestamps are repeated in the storage tail box, the greater the security risk of continuing to use the existing group instead of generating a new group. Therefore, the number of timestamps and storage operation intensity The product of can represent the security risks brought by continuing to use the current group. At the same time, when the inter-group query difficulty at the mth moment The larger the value is, the greater the query difficulty will be after the current group generates a new group, and the new group should not be generated.
[0078] Finally, the query difficulty between groups and the average level of safety hazards in all luggage storage The difference is calculated to obtain the group generation discriminant value. The smaller the group generation discriminant value is, the smaller the query difficulty and security risks caused by generating a new group are, and the new group should be generated before the mth moment.
[0079] Furthermore, when the group generation discrimination value is less than or equal to 0, the tree protocol generates a new group at the mth time; otherwise, no new group is generated and the current group record timestamp continues to be used.
[0080] The third step is to group and store the timestamps through the constructed tree protocol grouping conditions to protect the data of the trunk transportation network nodes.
[0081] Finally, using the grouping conditions, the storage tail box timestamps of the transportation network nodes are grouped through the tree protocol. The specific method is as follows:
[0082] First, the transportation network node of the financial service center acts as the timestamp service provider to generate, issue, store and verify timestamps.
[0083] The specific process of generating the timestamp is as follows:
[0084] When the nth storage tail box in the transportation network node is operated by the user, the transportation network node obtains the user's storage data, which is a string of binary bit streams. Further, the binary bit stream is used as input, and the SHA-1 algorithm is used to output a message digest consisting of a 20-byte hash value, which is recorded as the timestamp of the storage data.
[0085] The issuance of the timestamp is specifically given by the transportation network node, which sends the generated hash value as the timestamp to the user.
[0086] Among them, the specific implementation method of using tree protocol storage in the group storage process of timestamps is:
[0087] The timestamps generated by the nodes in the transportation network are obtained in real time, and the continuously generated timestamps are used as input to continuously input the calculation model, where the calculation model adopts a tree protocol algorithm, the necessary parameters are the grouping conditions of the tree protocol, and the output is the storage data of the tree protocol.
[0088] The grouping conditions of the tree protocol are:
[0089] When the historical user data collected is less than D days, a fixed grouping condition is used, specifically: when the total number of timestamps continuously input is greater than, grouping is performed immediately; where N is the total number of storage tail boxes in the transportation network node.
[0090] When the collection time of historical user data exceeds D days, the method in the second step of this embodiment is adopted to calculate the group generation discrimination value at the end of each moment to determine whether the tree protocol generates a new group at that moment.
[0091] The timestamp verification specifically includes:
[0092] When the user needs to search for the timestamp sequence, the user provides two timestamps, which are used as input, and the storage data of the tree protocol is used as input, and the structure tree protocol search algorithm is used to calculate, and the output is the order in which the two timestamps are stored in the tree protocol, and the timestamp comparison is completed. Among them, the structure tree protocol search algorithm is a well-known technology and will not be repeated.
[0093] Among them, the tree protocol can prevent the user's timestamp storage order from being tampered with and protect the deposit operation data; through sequential search, it can determine the specific order in which the user's operations occur when performing the deposit tail box operation, which is conducive to the user's investigation of the deposit operation of the deposited items and ensure the safety of the items.
[0094] Since this embodiment calculates the storage operation intensity according to the user's storage operation habits, analyzes the query operation difficulty and security risks of the tree protocol, and extracts features of the query operation difficulty and security risks, a balance is made between the two to complete the tree protocol grouping, thereby avoiding the timestamp security risks caused by improper tree protocol grouping while ensuring the efficient query performance of the tree protocol.
[0095] Based on the same inventive concept as the above method, an embodiment of the present application also provides a timestamp-based storage trunk transportation network node data protection system, including a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, it implements the steps of the timestamp-based storage trunk transportation network node data protection method described in any one of the above methods.
[0096] The various embodiments in the present application are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.
[0097] It should be noted that, unless otherwise specified and limited, terms such as "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a circuit structure, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such article or device. In the absence of further restrictions, an element defined by the sentence "including one..." does not exclude the existence of other identical elements in the article or device including the element. In addition, the term "and\or" used herein includes any and all combinations of one or more related listed items.
[0098] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention herein. The present application is intended to cover any variations, uses or adaptations of the present application, which follow the general principles of the present application and include common knowledge or customary technical means in the art that are not invented by the present application.
[0099] It should be understood that the present application is not limited to the exact construction that has been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof.
Claims
1. A method for protecting data of a storage trunk transportation network node based on timestamp, characterized in that: The method comprises the following steps: Obtain the number of storage operations and the timestamp of the storage data for each storage tail box at each time of the day under the historical preset days; A tree protocol is used to group the timestamps of the storage data stored in all storage tail boxes in the transportation network nodes; wherein the conditions for grouping are: A1, using the time interval between different times of the storage trunk and the target time of the day, weighting the number of storage operations at different times, and calculating the operation intensity of the storage trunk at the target time of the day; the average level of the operation intensity of the storage trunk at the same target time in all historical preset days is used as the storage operation intensity of the storage trunk at the target time; A2, based on the storage operation intensity of all storage trunks in the transportation network nodes at the target time, weight the query intervals of the corresponding storage trunks at the target time, and calculate the inter-group query difficulty at the target time; A3, based on the storage operation intensity of all storage trunks in the transportation network nodes at the target time, weight the number of timestamps in the group where the corresponding storage trunk is located at the target time, and calculate the group generation discriminant value at the target time in combination with the inter-group query difficulty at the target time; use the group generation discriminant value to construct the grouping condition of the tree protocol.
2. The method for protecting network node data based on timestamps for storage trunk transportation according to claim 1, characterized in that: The timestamp of the stored data is a message digest of the stored data obtained by using a hash algorithm.
3. The method for protecting data of a storage trunk transportation network node based on timestamp according to claim 1, characterized in that: In step A1, the weight used in the weighting process is determined by the negative correlation mapping result of the time interval.
4. The method for protecting data of a storage trunk transportation network node based on timestamp according to claim 1, characterized in that: In step A1, the operation intensity is determined by weighted summing the number of registration operations at all times except the target time within the day.
5. The method for protecting data of a storage trunk transportation network node based on timestamp according to claim 1, characterized in that: The method for determining the query interval is: Each storage tail box is provided with a counter, and the count value counted by the counter of the storage tail box is recorded as the query interval; The counting method is: when the tree protocol generates a group, the count value is increased by 1; when the timestamp of the nth storage tail box is added to a group, the count value is reset to 0.
6. The method for protecting data of a storage trunk transportation network node based on timestamp according to claim 1, characterized in that: In step A2, the inter-group query difficulty is determined by the average level of the weighted sum of the query intervals of all the storage tail boxes in the transportation network node at the target time.
7. The method for protecting data of a storage trunk transportation network node based on timestamp according to claim 1, characterized in that: In step A3, when the corresponding storage tail box has not performed a storage operation or has not been grouped by the tree protocol at the target time, the number of timestamps of the corresponding storage tail box in the group where the corresponding storage tail box is located at the target time is set to 0.
8. The method for protecting data of a storage trunk transportation network node based on timestamp according to claim 1, characterized in that: The method for determining the group generation discriminant value is: In step A3, the average level of the weighted sum of the number of timestamps in the group to which all the storage tail boxes in the transportation network node belong at the target time is calculated; The difference between the inter-group query difficulty and the average level is used as the group generation discriminant value at the target time.
9. The method for protecting data of a storage trunk transportation network node based on timestamp according to claim 1, characterized in that: The grouping condition of the tree protocol is constructed by using the group generation discriminant value, including: when the group generation discriminant value is less than or equal to 0, the tree protocol generates a new group at the target time; otherwise, no new group is generated.
10. A timestamp-based storage tail box transportation network node data protection system, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the steps of the timestamp-based storage tail box transportation network node data protection method as described in any one of claims 1-9 are implemented.