| 摘要 |
The invention relates to a dynamic planning based quick data synchronizing method. The method includes the following steps: a data source node sends synchronization message to each to-be-synchronized node; the to-be-synchronized node generate a network topological graph according to a setting period and sleep for a period time according to the size of an update data packet; obtaining nodes connected with the to-be-synchronized nodes and updated successively and determining a cost function value of each node according to a dynamic planning algorithm; a path corresponding to the minimum cost function value is the shortest transmission path and performing data transmission along said path; comparing an MD5 code in the transmission and an MD5 code in a received synchronization message, concluding the transmission if the MD5 code in the transmission is consistent with MD5 code in the received synchronization message and searching a sub-optimal path for data transmission if the e MD5 code in the transmission is not consistent with MD5 code in the received synchronization message. Compared with the prior art, the method provided by the invention has advantages of improving data synchronization rate, reducing server load and improving data synchronization system reliability and the like. |
