Tablet computer data synchronization system

Abstract

The invention relates to the technical field of data synchronization, in particular to a tablet computer data synchronization system which comprises a topological entropy dynamic calculation module, a self-adaptive optimization control module, a game theory synchronization control module, a data transmission priority adjustment module and a synchronization task path optimization module. According to the invention, by dynamically quantifying the topological connection state between the devices and optimizing the data synchronization priority and resource allocation, the phenomenon of non-uniform occupation of device resources is reduced, the task allocation efficiency is improved, the data transmission sequence and path are adjusted based on real-time path load and stability monitoring, the delay risk of a high-load path is reduced, and the data transmission efficiency is improved. The optimal path is selected for the synchronization task according to the topology stability index, transmission interruption or data loss caused by an unstable path is avoided, a dynamically adjusted task plan and path configuration mechanism is adopted, the consistency, reliability and stability in the multi-device data synchronization process are improved, and the cross-device data synchronization requirement in the complex network environment is met.

Description

Technical Field

[0001] The present invention relates to the technical field of data synchronization, and in particular to a tablet computer data synchronization system. Background Art

[0002] The field of tablet computer data synchronization system technology includes data synchronization technology. The core content of the field of data synchronization technology is to solve the problem of data consistency between devices, including technical methods for transmitting, updating and managing data between different devices. This field systematically covers the communication protocols, synchronization mechanisms and data transmission process design between devices, and is mainly used for cross-device and cross-platform data exchange to ensure the consistency and integrity of data between multiple devices. Common data synchronization technologies include file synchronization, database synchronization and real-time data update, which achieve efficient data transmission and consistent update through specific communication methods and protocols.

[0003] Among them, the tablet computer data synchronization system refers to a technical solution for realizing data transmission and updating between tablet computer devices or between tablet computers and other devices. The subject of this patent is aimed at realizing the consistency of tablet computer data through the network. The technical matters covered include the identification, distribution and transmission of data packets through a specific synchronization protocol, and the use of data conflict detection and resolution mechanisms to ensure the accurate transmission of data between multiple devices. Specifically, through the preset communication protocol and data format, the real-time data collection, classification processing and dynamic synchronization are completed in the network environment, so as to meet the data consistency requirements of tablet computer devices in different application scenarios.

[0004] The existing technology lacks dynamic evaluation of the connection status between devices and changes in network topology, resulting in resource allocation relying on static rules, which is prone to the problem of high-load devices occupying too many resources. In terms of path selection, the transmission method based on preset paths cannot adapt to real-time network load changes, increasing data transmission delays and failure rates. Data synchronization task allocation fails to dynamically adjust resource occupancy and task priority, which may cause low-priority tasks to hinder critical data transmission. The lack of a comprehensive evaluation mechanism for path stability and load conditions makes it difficult to ensure the reliability and efficiency of data synchronization in complex networks. Summary of the invention

[0005] The purpose of the present invention is to solve the shortcomings in the prior art and to propose a tablet computer data synchronization system.

[0006] In order to achieve the above object, the present invention adopts the following technical solution: A tablet computer data synchronization system includes:

[0007] The topology entropy dynamic calculation module extracts the number and proportion of neighborhood connections based on the data synchronization node connection status and device network connection topology of the tablet computer, calculates the local topology entropy value and weights it as the global entropy value, extracts the difference between the global entropy value and the previous value as the global entropy difference, and generates the device topology entropy change;

[0008] The adaptive optimization control module extracts synchronization nodes and their topology entropy values ​​based on the change in topology entropy of the device, determines the priority by sorting according to the entropy value, extracts data packets of priority nodes, adjusts the order of data to be synchronized in combination with synchronization task grouping, regenerates the task plan, and generates a priority synchronization device list;

[0009] The game theory synchronization control module extracts bandwidth requirements, computing resource occupancy and remaining resource values ​​based on the priority synchronization device list, calculates the difference between the requirements and the remaining resources, allocates resource ratios, calculates the resource allocation equilibrium state based on resource usage, and obtains the resource allocation stability coefficient;

[0010] The data transmission priority adjustment module extracts the current load rate and topological stability of the transmission path based on the resource allocation stability coefficient, compares the path parameters, selects the path based on the load and stability, adjusts the transmission priority of the data packet and generates a transmission plan to generate an optimized transmission path configuration;

[0011] The synchronization task path optimization module extracts the topological stability index of the synchronization path based on the optimized transmission path configuration, calculates the stability difference between the current path and other paths, selects the path with the smallest difference to allocate synchronization tasks, establishes a path usage plan, and generates a task path stability value.

[0012] The device topology entropy change includes the number of neighborhood connections, the connection ratio, the global entropy value, and the global entropy difference. The priority synchronization device list specifically includes synchronization nodes, topology entropy values, synchronization task groups, and priority nodes. The resource allocation stability coefficient includes bandwidth requirements, computing resource occupancy, remaining resource value, and resource allocation equilibrium state. The optimized transmission path configuration includes transmission path load rate, topology stability, data packet transmission priority, and transmission plan. The task path stability value includes synchronization path topology stability index, path stability difference, and path usage plan.

[0013] As a further solution of the present invention, the step of obtaining the change amount of the device topology entropy is specifically as follows:

[0014] Based on the data synchronization node connection status and device network connection topology of the tablet computer, the connection status information of each node and its neighboring nodes is extracted, the number of direct connections of multiple nodes and the total number of connections of neighboring nodes are analyzed, the ratio of the number of node connections to the total number of neighborhood connections is calculated, and the node neighborhood connection status and connection number set is established;

[0015] Calling the node neighborhood connection status and connection quantity set, calculating the neighborhood connection ratio for each node according to the ratio of the number of direct connections to the total number of connections of the neighborhood nodes, filtering out nodes with abnormal connection ratios based on the ratio calculation results, and generating a neighborhood connection ratio set for the node;

[0016] Based on the neighborhood connection ratio set of the node, the local topological entropy value of each node is calculated, and the local topological entropy value is weighted and summarized using the formula:

[0017]

[0018] Calculate and generate the global topological entropy value;

[0019] Among them, H global represents the global topological entropy value, p i represents the proportion of neighborhood connections of node i, w i represents the critical weight of node i, n is the total number of nodes, and the sum symbol ∑ represents the weighted summary of the calculation results of all nodes;

[0020] Compare the current global topology entropy value with the previous global topology entropy value, calculate the difference based on the two global topology entropy values, determine whether the global entropy difference meets the preset change threshold condition, call the global topology entropy difference to perform topology change trend analysis, and generate the device topology entropy change amount.

[0021] As a further solution of the present invention, the step of obtaining the priority synchronization device list is specifically:

[0022] Based on the change in the topology entropy of the device, the synchronization node and the corresponding local topology entropy value are extracted, the topology entropy value of the node is called to sort all the synchronization nodes, and an entropy value priority sequence of the synchronization nodes is established;

[0023] Calling the entropy priority sequence of the synchronization node, combining the device synchronization task grouping information, adjusting the order of data to be synchronized of the nodes in the task group according to the entropy ranking result of the nodes in each task group, and generating a priority data synchronization order of the task group;

[0024] Based on the priority data synchronization order of the task grouping, the execution plan of the synchronization task is reorganized, and the priority position change between the current synchronization plan and the previous synchronization plan is analyzed, using the formula:

[0025]

[0026] Calculate the priority distribution adjustment amount and generate an updated task synchronization plan;

[0027] Among them, P syncRepresents the priority distribution adjustment of the synchronization plan, T i,new represents the priority position of node i in the updated synchronization task plan, T i,old represents the priority position of node i in the old synchronization task plan, w i represents the task weight coefficient of node i, n represents the total number of synchronization nodes, and the summation symbol ∑ represents the weighted summation of the priority differences of all nodes;

[0028] The updated task synchronization plan is called, and the synchronization nodes with the highest priority are screened according to the priority positions of the synchronization nodes, and the synchronization devices with higher priority are extracted to generate a priority synchronization device list.

[0029] As a further solution of the present invention, the step of obtaining the resource allocation stability coefficient is specifically as follows:

[0030] Extracting bandwidth requirements of multiple devices in the priority synchronization device list, analyzing the computing resource usage of each device's current task, calling the device resource remaining value, performing difference calculation between the bandwidth requirement and the remaining resource value, and generating a resource requirement difference set for the device;

[0031] Calling the resource requirement difference set of the device, analyzing the resource requirement priority of each device according to the resource requirement difference size and the total resource capacity, allocating resources by proportional calculation, and generating a device resource allocation ratio set;

[0032] The device resource allocation ratio set is called, and the formula is adopted in combination with the device resource usage:

[0033]

[0034] Calculate the balance state of device resource allocation and obtain the resource allocation stability coefficient;

[0035] Among them, B res represents the resource allocation stability coefficient, r i represents the amount of allocated resources of device i, a i represents the actual resource demand of device i, w i represents the weight coefficient of device i, n is the total number of devices, and the sum symbol ∑ represents the weighted calculation result of all devices.

[0036] As a further solution of the present invention, the step of obtaining the optimized transmission path configuration is specifically:

[0037] Calling the resource allocation stability coefficient, extracting the current load rate and topological stability of the transmission path, analyzing the proportion of the load value of each path relative to the total transmission capacity, calculating the stability coefficient of each path, and generating a path load and stability parameter set;

[0038] Calling the path load and stability parameter set, comparing multiple path parameters, screening paths that meet the requirements of lower load and higher stability based on the weight difference between load value and stability coefficient, and generating path optimization results;

[0039] The path optimization result is called, the transmission priority of the data packet is adjusted, the path transmission resources are reallocated, and the load value and stability parameter are combined to adopt the formula:

[0040]

[0041] Calculate the path transmission efficiency and generate the optimized transmission path configuration;

[0042] Among them, E path represents the path transmission efficiency, L i represents the load value of path i, L represents the average load value of all paths, S i represents the stability parameter of path i, w i represents the weight coefficient of path i, n is the total number of paths, δ is the transmission stability adjustment parameter, and the summation symbol ∑ represents the weighted calculation result of all path parameters.

[0043] As a further solution of the present invention, the step of obtaining the task path stability value is specifically as follows:

[0044] Based on the optimized transmission path configuration, extract the topological stability index of the synchronization path, analyze the stability data of the current path, call the stability index set of all paths, calculate the difference between the topological characteristics of each path and the overall average value, and generate path stability difference data;

[0045] Calling the path stability difference data, selecting the path with the smallest stability deviation value according to the comparison result between the stability deviation values ​​of the multiple paths and other paths, and generating a path use plan based on the synchronization task capacity of the current path and the load distribution of other paths;

[0046] The path usage plan is called, the expected load and stability parameters of the multiple paths are extracted, the difference distribution of the paths is analyzed, and the comprehensive stability level of the multiple paths is evaluated by normalized calculation in combination with the load fluctuation and synchronization stability of the paths. The formula is:

[0047]

[0048] Calculate the stability value of the task path and generate the task path stability value;

[0049] Among them, S path represents the stable value of the task path, D irepresents the stability difference of path i, D represents the average value of the stability differences of all paths, max(D) is the maximum value of the stability differences of all paths, n is the total number of paths, and the summation symbol ∑ represents the calculation result of the stability differences of all paths.

[0050] Compared with the prior art, the advantages and positive effects of the present invention are:

[0051] In the present invention, by dynamically quantifying the topological connection status between devices, data synchronization priority and resource allocation are optimized, the uneven occupation of device resources is reduced, and the efficiency of task allocation is improved. Based on real-time path load and stability monitoring, the data transmission order and path are adjusted to reduce the risk of delay in high-load paths. The synchronization task selects the optimal path based on the topological stability index to avoid transmission interruption or data loss caused by unstable paths. A dynamically adjusted task plan and path configuration mechanism is adopted to improve the consistency, reliability and stability of multi-device data synchronization process, and meet the cross-device data synchronization requirements in complex network environments. BRIEF DESCRIPTION OF THE DRAWINGS

[0052] Figure 1 is a system flow chart of the present invention;

[0053] Figure 2 A flowchart of the steps for obtaining the change in topological entropy of the device of the present invention;

[0054] Figure 3 A flowchart of the steps for obtaining a priority synchronization device list of the present invention;

[0055] Figure 4 A flow chart of the steps for obtaining the resource allocation stability coefficient of the present invention;

[0056] Figure 5 A flow chart of the steps for obtaining the optimized transmission path configuration of the present invention;

[0057] Figure 6 This is a flow chart of the steps for obtaining the stability value of the task path of the present invention. DETAILED DESCRIPTION

[0058] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0059] In the description of the present invention, it should be understood that the terms "length", "width", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, in the description of the present invention, "multiple" means two or more, unless otherwise clearly and specifically defined.

[0060] Embodiment 1

[0061] See also Figure 1 , a tablet computer data synchronization system comprises:

[0062] The topology entropy dynamic calculation module extracts the number and proportion of neighborhood connections based on the data synchronization node connection status and device network connection topology of the tablet computer, calculates the local topology entropy value and weights it as the global entropy value, extracts the difference between the global entropy value and the previous value as the global entropy difference, and generates the device topology entropy change;

[0063] The adaptive optimization control module extracts synchronization nodes and their topology entropy values ​​based on the change in device topology entropy, determines the priority by sorting according to the entropy value, extracts the data packets of the priority nodes, adjusts the order of the data to be synchronized in combination with the synchronization task grouping, regenerates the task plan, and generates a priority synchronization device list;

[0064] The game theory synchronization control module extracts bandwidth requirements, computes resource usage and remaining resource values ​​based on the priority synchronization device list, calculates the difference between requirements and remaining resources, allocates resource ratios, calculates resource allocation equilibrium status based on resource usage, and obtains resource allocation stability coefficients;

[0065] The data transmission priority adjustment module extracts the current load rate and topological stability of the transmission path based on the resource allocation stability coefficient, compares the path parameters, selects the path based on the load and stability, adjusts the transmission priority of the data packet and generates a transmission plan to generate an optimized transmission path configuration;

[0066] The synchronization task path optimization module is based on optimizing the transmission path configuration, extracting the topological stability index of the synchronization path, calculating the stability difference between the current path and other paths, selecting the path with the smallest difference to allocate synchronization tasks, establishing a path usage plan, and generating the task path stability value.

[0067] The change in device topology entropy includes the number of neighborhood connections, connection ratio, global entropy value, and global entropy difference. The priority synchronization device list includes synchronization nodes, topology entropy values, synchronization task groups, and priority nodes. The resource allocation stability coefficient includes bandwidth requirements, computing resource occupancy, remaining resource value, and resource allocation balance status. The optimized transmission path configuration includes transmission path load rate, topology stability, data packet transmission priority, and transmission plan. The task path stability value includes synchronization path topology stability index, path stability difference, and path usage plan.

[0068] See also Figure 2 , the specific steps for obtaining the change in device topology entropy are:

[0069] Based on the data synchronization node connection status and device network connection topology of the tablet computer, the connection status information of each node and its neighboring nodes is extracted, the number of direct connections of multiple nodes and the total number of connections of neighboring nodes are analyzed, the ratio of the number of node connections to the total number of neighborhood connections is calculated, and the node neighborhood connection status and connection number set is established;

[0070] The connection information of each node is extracted from the topological map, and the connection status of the nodes is analyzed one by one. The number of connections of each node is analyzed by marking the direct neighborhood connections, and the total number of connections with adjacent nodes is counted. The ratio of the number of direct connections to the total number of neighborhood connections is calculated. Through targeted processing and analysis of outliers and elimination of interference items, it is ensured that the extracted connection data is true and valid. The processed connection information is organized into a set of node neighborhood connection status and connection quantity. The node neighborhood connection status and connection quantity set is established.

[0071] Call the node neighborhood connection status and connection number set, calculate the neighborhood connection ratio for each node based on the ratio of the number of direct connections to the total number of connections of the neighborhood nodes, filter out the nodes with abnormal connection ratios based on the ratio calculation results, and generate the node's neighborhood connection ratio set;

[0072] The neighborhood connection ratio is calculated through the proportion value. For the connection ratio data of each node, the abnormal ratio nodes are screened out based on a specific threshold. By comparing the number of connections and their proportion characteristics one by one, the nodes whose connection ratio deviates from the normal range are identified and the interference data are eliminated. The corrected proportion data is reorganized into a proportion set to complete the generation of the neighborhood connection ratio set of the node.

[0073] Based on the neighborhood connection ratio set of the node, the local topological entropy value of each node is calculated, and the local topological entropy value is weighted and summarized using the formula:

[0074]

[0075] Calculate and generate the global topological entropy value;

[0076] Among them, H global represents the global topological entropy value, p i represents the proportion of neighborhood connections of node i, w i represents the critical weight of node i, n is the total number of nodes, and the sum symbol ∑ represents the weighted summary of the calculation results of all nodes;

[0077] formula:

[0078]

[0079] The benefit of the formula is that by adding the weight parameter w i Adjusting the importance of different nodes can more accurately reflect the structural characteristics of the global network topology and the differences in node importance.

[0080] Detailed explanation of the formula and the process of formula calculation and derivation:

[0081] First, the neighborhood ratio value p of each node is determined according to the value in the node neighborhood connection ratio set i , and take the logarithm of each ratio value, then multiply it by the corresponding ratio value to calculate the local entropy value of the node, and the local entropy value of the node is multiplied by the importance weight w i , sum up the weighted local entropy values ​​of all nodes to get the weighted total entropy value, and finally divide the weighted total entropy value by the sum of the weights to get the global topological entropy value;

[0082] Calculation example: Assume n = 3, and the neighborhood ratio of the node is p 1 =0.5,p 2 =0.3,p 3 =0.2, the corresponding weight is w 1 =2,w 2 =1,w 3 =3, the calculation steps are as follows:

[0083] w 1 ·(-p 1 ·ln(p 1 ))=2·(-0.5·ln(0.5))=0.693;

[0084] w 2 ·(-p 2 ·ln(p 2 ))=1·(-0.3·ln(0.3))=0.361;

[0085] w 3 ·(-p 3 ·ln(p 3 ))=3·(-0.2·ln(0.2))=0.964;

[0086]

[0087] Among them, H global represents the global topological entropy value, p i represents the neighborhood connection ratio of the node, w i represents the weight parameter, n is the total number of nodes, ∑ represents the calculation of weighted entropy value and weight sum, and the global topological entropy value is 0.336.

[0088] The results show that the global topological entropy value can quantify the current network connection status. A lower value indicates that the network connection tends to be concentrated, and a higher value indicates that the network connection is more dispersed.

[0089] Compare the current global topology entropy value with the previous global topology entropy value, calculate the difference between the two global topology entropy values, determine whether the global entropy difference meets the preset change threshold condition, call the global topology entropy difference to perform topology change trend analysis, and generate the device topology entropy change amount.

[0090] The difference between the two entropy values ​​is calculated by constructing a difference formula, and the global topology entropy difference is compared with the set threshold. The relationship between the difference and the threshold is used to determine whether the topology change trend is significant. The difference change characteristics are extracted in combination with the volatility of the previous data. The significant fluctuation segments are identified through partition comparison, and the device topology entropy change nodes that meet the change threshold are screened out. The device topology entropy change amount is generated.

[0091] See also Figure 3 , the specific steps for obtaining the priority synchronization device list are as follows:

[0092] Based on the change in device topology entropy, the synchronization nodes and the corresponding local topology entropy values ​​are extracted, the topology entropy values ​​of the nodes are called to sort all synchronization nodes, and the entropy value priority sequence of the synchronization nodes is established;

[0093] First, the local entropy value of each node is calculated based on the number and ratio of connections between each node and its neighboring nodes collected by monitoring. Get, p ij Represents the connection probability of node i to its neighboring node j. Next, the local entropy value of each synchronization node is sorted from high to low. During the sorting process, the dynamic weight adjustment method is used to refine the entropy value sorting priority, where the weight coefficient is dynamically allocated according to the importance of the node in the network. The importance of the node is calculated through its synchronization times and task participation frequency, and the entropy value priority sequence of the synchronization node is generated.

[0094] Call the entropy priority sequence of the synchronization node, combine the device synchronization task grouping information, adjust the order of data to be synchronized of the nodes in each task group according to the entropy ranking result of the nodes in the task group, and generate the priority data synchronization order of the task group;

[0095] First, for each task group, extract the nodes in the group and their entropy priority. On this basis, by determining the priority differences between the nodes in each group, calculate the average priority of each group, and use the formula Calculate the mean priority P within the group g , where R k represents the priority value of the kth node in the group, m represents the number of nodes in the group, and then dynamically adjusts the order of data to be synchronized among the nodes in the group according to the average priority of each task group. Specifically, the data packets are screened by comparing the size, transmission priority and synchronization frequency of the data packets to ensure that nodes with higher frequencies and higher entropy values ​​are synchronized first in each group, thus generating the priority data synchronization order of the task groups.

[0096] Based on the priority data synchronization order of task groups, reorganize the execution plan of synchronization tasks, analyze the change in priority position between the current synchronization plan and the previous synchronization plan, and use the formula:

[0097]

[0098] Calculate the priority distribution adjustment amount and generate an updated task synchronization plan;

[0099] Among them, P sync Represents the priority distribution adjustment of the synchronization plan, T i,new represents the priority position of node i in the updated synchronization task plan, T i,old represents the priority position of node i in the old synchronization task plan, w i represents the task weight coefficient of node i, n represents the total number of synchronization nodes, and the summation symbol ∑ represents the weighted summation of the priority differences of all nodes;

[0100] formula:

[0101]

[0102] The benefit of the formula is that through the dynamic weight parameter w i The synchronization priority adjustment of the node is weighted, so that the influence of high-weight nodes on the priority distribution adjustment is more significant. At the same time, the change in the node position T is combined i,new -T i,old The adjustment scope of synchronization plan can be accurately measured;

[0103] Detailed explanation of the formula and the process of formula calculation and derivation:

[0104] T i,newIndicates the priority position of node i in the new synchronization task plan, which is calculated by the importance of the node data packet and the task grouping weight. For example, if the node task weight is 0.3 and the data packet transmission priority is 0.6, then:

[0105] T i,new =0.3×0.6=0.18;

[0106] T i,old It represents the priority position of node i in the old synchronization task plan. It is calculated in the same way. Assuming it is 0.15, the position change is calculated:

[0107] |T i,new -T i,old |=|0.18-0.15|=0.03;

[0108] Weight parameter w i Indicates the importance of node i in the synchronization task, through the formula Calculate, f i Represents the task frequency of node i. For example, if the node task frequency is 5 and the total network task frequency is 50, then:

[0109]

[0110] Substitute the calculated values ​​of each node into the formula:

[0111]

[0112] The result shows that the priority adjustment of the synchronization task plan is 0.03, which means that the change in the priority distribution between the new task plan and the old plan is small, which helps to further evaluate the optimization degree of the synchronization task and the rationality of the node sorting.

[0113] Call the updated task synchronization plan, filter the synchronization nodes with the highest priority according to the priority positions of the synchronization nodes, extract the synchronization devices with higher priority, and generate a priority synchronization device list.

[0114] By comparing the priority values ​​of each node in the synchronization device, the importance of the node is calculated using the weight accumulation method. The weight value is determined by the node data transmission volume and the task grouping frequency. During the screening process, nodes with priority values ​​higher than a certain threshold are marked, and nodes with low priority values ​​are eliminated. The step of screening priority nodes uses the cumulative screening method to synchronize the nodes eliminated in each round into the new weight set, and calculate the weight changes one by one until the high-priority nodes completely cover the task grouping to be synchronized, and generate a priority synchronization device list.

[0115] See also Figure 4 , the specific steps for obtaining the resource allocation stability coefficient are:

[0116] Extract the bandwidth requirements of multiple devices in the priority synchronization device list, analyze the computing resource usage of each device's current task, call the device resource remaining value, calculate the difference between the bandwidth requirement and the remaining resource value, and generate a resource requirement difference set for the device;

[0117] The bandwidth request value of the task is extracted according to the task status record of the device. The peak, average and minimum values ​​of the current task bandwidth are calculated by monitoring the task execution data and real-time resource utilization rate of the device in each time slice. The bandwidth demand difference of each device is determined by comparing the remaining bandwidth capacity record of the device. The computing resource occupancy required for the task execution of the device is dynamically compared with the remaining resource value, and the current task occupancy rate of the device is calculated using the resource occupancy ratio formula. The occupancy rate is subtracted from the remaining resource to obtain the resource demand difference. The resource demand difference set obtained by calculation is used to establish the difference information used to describe the resource request of the priority device, and the resource demand difference set of the device is generated.

[0118] Call the resource requirement difference set of the device, analyze the resource requirement priority of each device according to the resource requirement difference size and total resource capacity, allocate resources through proportional calculation, and generate a device resource allocation ratio set;

[0119] According to the size of the resource difference value in the equipment task, by comparing the resource difference value with the current task priority of the equipment, the resource allocation benchmark parameters of the task grouping are extracted, and the equipment resource occupancy rate is proportionally allocated by allocating the benchmark parameters. The resource allocation ratio of each device is dynamically adjusted through the proportional allocation formula, and the adjustment fluctuation value of the allocation ratio is recorded. By comparing the resource allocation fluctuations of the equipment in each task group, the resource ratio set with the smallest fluctuation is extracted as the allocation plan, and the equipment resource allocation ratio set is generated through this process.

[0120] Call the device resource allocation ratio set, combined with the device resource usage, using the formula:

[0121]

[0122] Calculate the balance state of device resource allocation and obtain the resource allocation stability coefficient;

[0123] Among them, B res represents the resource allocation stability coefficient, r i represents the amount of allocated resources of device i, a i represents the actual resource demand of device i, w i represents the weight coefficient of device i, n is the total number of devices, and the sum symbol ∑ represents the weighted calculation result of all devices.

[0124] formula:

[0125]

[0126] The benefit of the formula is that, by introducing the weighted average calculation of the absolute difference between the resource allocation ratio and the resource demand ratio, the problem of unbalanced resource allocation can be effectively avoided, and the impact of the resource allocation of each device on the overall balance can be dynamically reflected.

[0127] Detailed explanation of the formula and the process of formula calculation and derivation:

[0128] Among them, B res represents the resource allocation stability coefficient, r i represents the amount of resources allocated to device i, which is determined by the real-time resource allocation record of the device. i represents the actual resource demand of device i, which is calculated by extracting the device demand in the task request record and combining it with the monitoring data. i It represents the weight coefficient of device i, which is dynamically adjusted according to the task priority and device resource occupancy rate. n is the total number of devices, which is determined by the number of devices in the priority device list. The summation symbol ∑ represents the weighted sum of the calculation results of all devices.

[0129] Assignment: Assume that the number of devices is 5, the priority weight coefficient w = [0.2, 0.3, 0.1, 0.25, 0.15], the device allocation resource r = [80, 60, 100, 70, 90], the actual demand a = [100, 50, 120, 80, 100], and substitute each parameter into the formula:

[0130] Step 1: Calculate the absolute difference and demand ratio for each device:

[0131]

[0132] Step 2: Calculate the weighted value:

[0133]

[0134] Step 3: Calculate the total stability factor:

[0135]

[0136] The result shows that the stability coefficient of the device's resource allocation is 0.163, which means that the current resource allocation is basically balanced, but there is a certain difference in resource allocation, and adjustments need to be made for devices with large differences in resource requirements.

[0137] See also Figure 5 , the specific steps for obtaining the optimized transmission path configuration are:

[0138] Call the resource allocation stability coefficient, extract the current load rate and topological stability of the transmission path, analyze the proportion of the load value of each path relative to the total transmission capacity, calculate the stability coefficient of each path, and generate a set of path load and stability parameters;

[0139] For each path, the load rate is calculated by monitoring the actual load data volume and the configured bandwidth capacity. The calculation formula for the load rate is: Where D i is the current transmission data volume of path i, which is obtained by summarizing the transmission volume per second monitored by the device log. i is the bandwidth capacity of path i, which is directly obtained through the device specification table and network management configuration. The topological stability of all paths is determined by the path volatility, and the volatility calculation formula is: where σ i is the load standard deviation of path i, calculated from the path load history, μ i is the average load rate of path i, which is directly obtained through the path monitoring log statistics. i With S i Recording is performed to generate a set of path load and stability parameters.

[0140] Call the path load and stability parameter set, compare the parameters of multiple paths, and select the paths that meet the requirements of low load and high stability based on the weight difference between the load value and the stability coefficient to generate the path optimization result;

[0141] All paths are compared and analyzed for load rate and stability parameters, and the normalized formula is used and The two are scaled uniformly, and the normalized result is L min With L max Represent the minimum and maximum load rates of all paths, S min With S max Represent the lowest and highest stability coefficients of all paths respectively. The normalized results are weighted and summed to calculate the preferred score of the path. The formula is U i =w L ·L i ′+w S ·S i ′, where w L and w S are the weights of the load rate and stability parameters respectively. The weight values ​​are allocated according to the current network load pressure. For example, when the current network pressure is high, w L Increase appropriately, sort the path optimization scores, select the paths with higher scores as the preferred paths, and generate the path optimization results.

[0142] Call the path optimization result, adjust the transmission priority of the data packet, reallocate the path transmission resources, combine the load value and stability parameters, and use the formula:

[0143]

[0144] Calculate the path transmission efficiency and generate the optimized transmission path configuration;

[0145] Among them, E path represents the path transmission efficiency, L i represents the load value of path i, represents the average load value of all paths, S i represents the stability parameter of path i, w i represents the weight coefficient of path i, n is the total number of paths, δ is the transmission stability adjustment parameter, and the summation symbol ∑ represents the weighted calculation result of all path parameters.

[0146] formula:

[0147]

[0148] The benefit of the formula is that by introducing the average deviation of the path load and the square root of the stability parameter for combined calculation, the contradiction between path load balance and stability is effectively balanced, and the actual transmission efficiency of the path under high load pressure can be comprehensively measured.

[0149] Detailed explanation of the formula and the process of formula calculation and derivation:

[0150] First, the path load rate L is obtained through the statistics of the path monitoring device i , for example, the transmission volume D of path 1 1 =500MB, path bandwidth C 1 =1000MB, then:

[0151]

[0152] The average load rate of all paths is given by the formula Calculation, for example, the load rates of the four paths are 0.5, 0.6, 0.4, and 0.7 respectively, then:

[0153]

[0154] The path stability parameter is given by the volatility formula Calculation, for example, the load data of path 1 is 0.48, 0.52, 0.49, 0.51, then

[0155]

[0156] but

[0157] The stability adjustment parameter δ = 0.01 is used to avoid the denominator being zero. Substitute all path parameters into the formula. For example, the data of the four paths are L 1 =0.5,L 2 =0.6,L 3 =0.4,L 4 =0.7, S 1 =0.028,S 2

[0158] =0.03,S 3 =0.025,S 4 =0.04, weight w 1 =0.25,w 2 =0.25,w 3 =0.25,w 4 =0.25, then the path transmission efficiency is:

[0159]

[0160] The result shows that the calculated result of the path transmission efficiency is 0.1265, indicating that the current path selection has achieved a certain balance between load balancing and stability. The rationality and efficiency of the optimized path configuration can be verified and evaluated by this indicator.

[0161] See also Figure 6 ,The specific steps for obtaining the stable value of the task path are:

[0162] Based on the optimized transmission path configuration, the topological stability index of the synchronization path is extracted. By analyzing the stability data of the current path, the stability index set of all paths is called, and the difference between the topological characteristics of each path and the overall average value is calculated to generate path stability difference data;

[0163] First, the topological stability index of each path is calculated, and its load rate fluctuation range is extracted. Specifically, it is obtained by calculating the ratio of the load change of the path within a period of time to the total load capacity. The path stability index is defined as the ratio of the load fluctuation rate to the maximum load change. Then, based on the load fluctuation range of the path, the paths whose load fluctuation range is within the stability threshold are screened out. Then, the topological characteristic data of the screened paths are further analyzed. By quantifying the ratio of the link usage frequency of each path to its average transmission delay, the topological link delay fluctuation is standardized, and the delay-load ratio parameter of each path is calculated. Then, based on this parameter, the link delay change trends of different paths under high load are compared, and the paths with smaller topological delay changes are selected. The stability index set is called to comprehensively compare the stability indicators and delay parameters of all paths, extract the comprehensive stability difference between the current path and other paths, and generate path stability difference data.

[0164] Call the path stability difference data, and select the path with the smallest stability deviation value based on the comparison results of the stability deviation values ​​of multiple paths with other paths. Generate a path usage plan based on the synchronization task capacity of the current path and the load distribution of other paths;

[0165] First, the path stability differences are graded, and the difference value less than a certain range is defined as a "low-difference path". Synchronous tasks are allocated according to the task capacity and load of the low-difference path, and the current task flow load rate and remaining load rate of the path are calculated. The path flow load rate and task capacity are normalized to generate a synchronization task priority sequence. Then, the path task capacity and task priority are matched and analyzed, and the weight of the task volume allocation adjustment range is calculated according to the priority of the path. The synchronization task flow load is adjusted by calculating the weight allocation, and the synchronization task volume is maximized. Allocation to the low-difference path, the task allocation rate and the ratio of the remaining flow of each path are calculated at the same time. Combined with the balanced allocation of the synchronization task volume of the low-difference path and the high-difference path, a path usage plan is generated.

[0166] Call the path usage plan, extract the expected load and stability parameters of multiple paths, analyze the difference distribution of the paths, combine the load fluctuation and synchronization stability of the paths, and evaluate the comprehensive stability level of the multiple paths through normalized calculation. The formula is:

[0167]

[0168] Calculate the stability value of the task path and generate the task path stability value;

[0169] Among them, S path represents the stable value of the task path, D i represents the stability difference of path i, represents the average value of all path stability differences, max(D) is the maximum value of all path stability differences, n is the total number of paths, and the summation symbol ∑ represents the calculation result of all path stability differences.

[0170] formula:

[0171]

[0172] The benefit of the formula is that it comprehensively evaluates the relative stability between paths by standardizing the stability differences of each path and combining it with the volatility calculation of the path. At the same time, it introduces the parameters of the average and maximum values ​​of the differences, further reducing the impact of stability deviation on path selection and improving the accuracy of path selection.

[0173] Detailed explanation of the formula and the process of formula calculation and derivation:

[0174] Suppose there are 5 paths in a network, namely P1, P2, P3, P4, and P5, and the stability difference data D of the paths is i The average values ​​of path stability differences are 12, 15, 9, 20, and 16 respectively. The formula is calculated as:

[0175]

[0176] The maximum value of the path stability difference is 20. Substitute the above data into the formula to calculate the path stability value S path :

[0177]

[0178] Calculate the absolute value of the difference between each path and the average value:

[0179]

[0180] Substitute the calculated value into the formula:

[0181]

[0182] The result shows that the task path stability value of the path is 0.844, which is close to the stability value of 1, indicating that the overall stability of the current path is high and can be used for efficient allocation of synchronization tasks. The value obtained by calculation can be directly used to generate the task path stability value.

[0183] The above are only preferred embodiments of the present invention and are not intended to limit the present invention in other forms. Any technician familiar with the profession may use the technical contents disclosed above to change or modify them into equivalent embodiments with equivalent changes and apply them to other fields. However, any simple modification, equivalent change and modification made to the above embodiments based on the technical essence of the present invention without departing from the technical solution of the present invention still falls within the protection scope of the technical solution of the present invention.

Claims

1. A tablet computer data synchronization system, characterized in that: The system comprises: The topology entropy dynamic calculation module extracts the number and proportion of neighborhood connections based on the data synchronization node connection status and device network connection topology of the tablet computer, calculates the local topology entropy value and weights it as the global entropy value, extracts the difference between the global entropy value and the previous value as the global entropy difference, and generates the device topology entropy change; The adaptive optimization control module extracts synchronization nodes and their topology entropy values ​​based on the change in topology entropy of the device, determines the priority by sorting according to the entropy value, extracts data packets of priority nodes, adjusts the order of data to be synchronized in combination with synchronization task grouping, regenerates the task plan, and generates a priority synchronization device list; The game theory synchronization control module extracts bandwidth requirements, computing resource occupancy and remaining resource values ​​based on the priority synchronization device list, calculates the difference between the requirements and the remaining resources, allocates resource ratios, calculates the resource allocation equilibrium state based on resource usage, and obtains the resource allocation stability coefficient; The data transmission priority adjustment module extracts the current load rate and topological stability of the transmission path based on the resource allocation stability coefficient, compares the path parameters, selects the path based on the load and stability, adjusts the transmission priority of the data packet and generates a transmission plan to generate an optimized transmission path configuration; The synchronization task path optimization module extracts the topological stability index of the synchronization path based on the optimized transmission path configuration, calculates the stability difference between the current path and other paths, selects the path with the smallest difference to allocate synchronization tasks, establishes a path usage plan, and generates a task path stability value.

2. The tablet computer data synchronization system according to claim 1, characterized in that: The device topology entropy change includes the number of neighborhood connections, the connection ratio, the global entropy value, and the global entropy difference. The priority synchronization device list specifically includes synchronization nodes, topology entropy values, synchronization task groups, and priority nodes. The resource allocation stability coefficient includes bandwidth requirements, computing resource occupancy, remaining resource value, and resource allocation equilibrium state. The optimized transmission path configuration includes transmission path load rate, topology stability, data packet transmission priority, and transmission plan. The task path stability value includes synchronization path topology stability index, path stability difference, and path usage plan.

3. The tablet computer data synchronization system according to claim 2, characterized in that: The steps for obtaining the change in device topology entropy are specifically as follows: Based on the data synchronization node connection status and device network connection topology of the tablet computer, the connection status information of each node and its neighboring nodes is extracted, the number of direct connections of multiple nodes and the total number of connections of neighboring nodes are analyzed, the ratio of the number of node connections to the total number of neighborhood connections is calculated, and the node neighborhood connection status and connection number set is established; Calling the node neighborhood connection status and connection quantity set, calculating the neighborhood connection ratio for each node according to the ratio of the number of direct connections to the total number of connections of the neighborhood nodes, filtering out nodes with abnormal connection ratios based on the ratio calculation results, and generating a neighborhood connection ratio set for the node; Based on the neighborhood connection ratio set of the node, the local topological entropy value of each node is calculated, and the local topological entropy value is weighted and summarized using the formula: Calculate and generate the global topological entropy value; Among them, H global represents the global topological entropy value, p i represents the proportion of neighborhood connections of node i, w i represents the critical weight of node i, n is the total number of nodes, and the sum symbol ∑ represents the weighted summary of the calculation results of all nodes; Compare the current global topology entropy value with the previous global topology entropy value, calculate the difference based on the two global topology entropy values, determine whether the global entropy difference meets the preset change threshold condition, call the global topology entropy difference to perform topology change trend analysis, and generate the device topology entropy change amount.

4. The tablet computer data synchronization system according to claim 3, characterized in that: The steps for obtaining the priority synchronization device list are specifically as follows: Based on the change in the topology entropy of the device, the synchronization node and the corresponding local topology entropy value are extracted, the topology entropy value of the node is called to sort all the synchronization nodes, and an entropy value priority sequence of the synchronization nodes is established; Calling the entropy priority sequence of the synchronization node, combining the device synchronization task grouping information, adjusting the order of data to be synchronized of the nodes in the task group according to the entropy ranking result of the nodes in each task group, and generating a priority data synchronization order of the task group; Based on the priority data synchronization order of the task grouping, the execution plan of the synchronization task is reorganized, and the priority position change between the current synchronization plan and the previous synchronization plan is analyzed, using the formula: Calculate the priority distribution adjustment amount and generate an updated task synchronization plan; Among them, P sync Represents the priority distribution adjustment of the synchronization plan, T i,new represents the priority position of node i in the updated synchronization task plan, T i,old represents the priority position of node i in the old synchronization task plan, w i represents the task weight coefficient of node i, n represents the total number of synchronization nodes, and the summation symbol ∑ represents the weighted summation of the priority differences of all nodes; The updated task synchronization plan is called, and the synchronization nodes with the highest priority are screened according to the priority positions of the synchronization nodes, and the synchronization devices with higher priority are extracted to generate a priority synchronization device list.

5. The tablet computer data synchronization system according to claim 4, characterized in that: The steps for obtaining the resource allocation stability coefficient are specifically as follows: Extracting bandwidth requirements of multiple devices in the priority synchronization device list, analyzing the computing resource usage of each device's current task, calling the device resource remaining value, performing difference calculation between the bandwidth requirement and the remaining resource value, and generating a resource requirement difference set for the device; Calling the resource requirement difference set of the device, analyzing the resource requirement priority of each device according to the resource requirement difference size and the total resource capacity, allocating resources by proportional calculation, and generating a device resource allocation ratio set; The device resource allocation ratio set is called, and the formula is adopted in combination with the device resource usage: Calculate the balance state of device resource allocation and obtain the resource allocation stability coefficient; Among them, B res represents the resource allocation stability coefficient, r i represents the amount of allocated resources of device i, a i represents the actual resource demand of device i, w i represents the weight coefficient of device i, n is the total number of devices, and the sum symbol ∑ represents the weighted calculation result of all devices.

6. The tablet computer data synchronization system according to claim 5, characterized in that: The steps for obtaining the optimized transmission path configuration are specifically as follows: Calling the resource allocation stability coefficient, extracting the current load rate and topological stability of the transmission path, analyzing the proportion of the load value of each path relative to the total transmission capacity, calculating the stability coefficient of each path, and generating a path load and stability parameter set; Calling the path load and stability parameter set, comparing multiple path parameters, screening paths that meet the requirements of lower load and higher stability based on the weight difference between load value and stability coefficient, and generating path optimization results; The path optimization result is called, the transmission priority of the data packet is adjusted, the path transmission resources are reallocated, and the load value and stability parameter are combined to adopt the formula: Calculate the path transmission efficiency and generate the optimized transmission path configuration; Among them, E path represents the path transmission efficiency, L i represents the load value of path i, L represents the average load value of all paths, S i represents the stability parameter of path i, w i represents the weight coefficient of path i, n is the total number of paths, δ is the transmission stability adjustment parameter, and the summation symbol ∑ represents the weighted calculation result of all path parameters.

7. The tablet computer data synchronization system according to claim 6, characterized in that: The steps for obtaining the task path stability value are specifically as follows: Based on the optimized transmission path configuration, extract the topological stability index of the synchronization path, analyze the stability data of the current path, call the stability index set of all paths, calculate the difference between the topological characteristics of each path and the overall average value, and generate path stability difference data; Calling the path stability difference data, selecting the path with the smallest stability deviation value according to the comparison result between the stability deviation values ​​of the multiple paths and other paths, and generating a path use plan based on the synchronization task capacity of the current path and the load distribution of other paths; The path usage plan is called, the expected load and stability parameters of the multiple paths are extracted, the difference distribution of the paths is analyzed, and the comprehensive stability level of the multiple paths is evaluated by normalized calculation in combination with the load fluctuation and synchronization stability of the paths. The formula is: Calculate the stability value of the task path and generate the task path stability value; Among them, S path represents the stable value of the task path, D i represents the stability difference of path i, represents the average value of all path stability differences, max(D) is the maximum value of all path stability differences, n is the total number of paths, and the summation symbol ∑ represents the calculation result of all path stability differences.

Images