WO2024021746A1 - Data processing method, communication system, and related device - Google Patents

Abstract

Disclosed in embodiments of the present application are a data processing method, a communication system, and a related device, for use in improving the system reliability. The data processing method of the embodiments of the present application is applied to a first node, and comprises: obtaining a first data modification message from a client, the first data modification message indicating modification of first data stored in the first node; modifying the first data according to the first data modification message to obtain second data; sending to a second node a first data synchronization message carrying the second data, so that the second node performs data synchronization; receiving a first response message from the second node, the first response message indicating a data synchronization result of the second node; and processing the second data according to the first response message to obtain third data.

Description

Data processing methods, communication systems and related equipment

This application requires the priority of the Chinese patent application submitted to the State Intellectual Property Office of China on July 29, 2022, with the application number CN202210909739.9 and the invention name "Data processing method, communication system and related equipment", and its entire content has been approved This reference is incorporated into this application.

Technical field

This application relates to the field of communications, and in particular to data processing methods, communications systems and related equipment.

Background technique

There are a large number of concurrent read and write operations in a distributed system. Concurrent reading or modification of the same object may cause data inconsistency. When setting a distributed lock so that a process can read and write an object at the same time, you need to first Obtain the corresponding read lock and write lock to ensure data consistency.

The function of the distributed lock manager is implemented in the network lock (net lock). The lock request initiated by the client is forwarded to the corresponding lock manager via the top-shelf switch to provide lock management services. When the top-shelf switch fails, a backup switch is selected to provide services. However, since the backup switch does not synchronize data with the top-shelf switch, the original data is lost after the backup switch is started, and the service needs to be provided from scratch, which cannot maintain the system state before the failure, reducing the reliability of the system.

Contents of the invention

The present application provides a data processing method, a communication system and related equipment. The data processing method applied to the first node includes: the first node modifies the first data into the second data according to the first data modification message of the first client. . Then the first data synchronization message is sent to the second node, so that the second data is synchronized. Then, the second data is processed according to the data synchronization result indicated by the first response information of the second node, and the first target data with the same content as the data in the second node is obtained. Through information exchange between the first node and the second node, data synchronization between the first node and the second node is achieved. Even if one node fails, the other node can continue to provide services, which improves the reliability of the system.

The first aspect of this application provides a data processing method, which is applied to the first node and includes:

In addition to establishing communication connections, the first node and the second node can also perform role assignment. If the first node is the master node, then the second node is the backup node; accordingly, if the second node is the master node, then the second node is the backup node. The second node is the backup node. The first node establishes a communication connection with the first client and can obtain a first data modification message from the first client. The first data modification message indicates modification of the first data stored in the first node. After obtaining the first data modification message, the first node will modify the first data into the second data according to the first data modification message, and send a first data synchronization message to the second node. The first data synchronization message indicates The second node performs data synchronization, and the first data synchronization message corresponds to the second data. That is to say, the second node determines whether to modify the content of its own stored data to the content of the second data according to the first data synchronization message. Afterwards, the first node will receive a first response message from the second node. The first response message corresponds to the first data synchronization message and indicates the data synchronization result of the second node. According to the first response message, the first node processes the second data to obtain the first target data. The content of the first target data is the same as the content of the data currently stored in the second node (that is, the fourth data).

It should be noted that with different application scenarios, the content indicated by the data stored in the first node is different. For example, if the data processing method is applied in a distributed lock scenario, the content indicated by the data stored in the first node The content includes the status of distributed locks, specifically including lock release or lock occupation; if the data processing method is applied in a distributed arbitration scenario, the content indicated by the data stored in the first node includes the status after arbitration in the distributed system, specifically Including new master node information; in addition, the data stored in the first node can also indicate other contents, which are not limited here. For example, if the data processing method is applied in a distributed cache consistency scenario, the content indicated by the data stored in the first node includes cache information of a certain data, and the cache information indicates the client that caches a copy of the data.

It can be seen from the above technical solution that this application has the following advantages: after the first node modifies the first data into the second data according to the first data modification message of the first client, it will also send a first data synchronization message to the second node. , so that the second data can be synchronized. And based on the data synchronization result of the second node, the second data is further processed to obtain synchronization between the data in the first node and the data in the second node. Simply put, through information exchange between the first node and the second node, data synchronization between the first node and the second node is achieved. Even if one node fails, the other node can continue to provide services, improving the system reliability.

In a possible implementation of the first aspect, the first response message corresponds to fourth data in the second node, and the fourth data is obtained after the second node performs data synchronization on the third data according to the first data synchronization message. the data obtained. After obtaining the first response message, the first node will process the second data according to the content of the second data and the content of the fourth data indicated by the first response message. Specifically, if the content of the fourth data has been synchronized to the content of the second data, it means that the second node has performed data synchronization, then the content of the first target data is the content of the second data, that is to say, the first node The second data can be kept unchanged. Among them, the second node has performed data synchronization, including that the third data of the second node has the same content as the first data of the first node, or, although the content of the third data is different from the content of the first data, the content of the second node's third data is the same as that of the first data. The priority is not higher than the priority of the first node. If the content of the fourth data is different from the content of the second data, it means that the content of the third data is different from the content of the first data, and the priority of the second node is higher than the priority of the first node, so the second node maintains the priority of the first node. The content of the third data remains unchanged, that is, the content of the third data and the fourth data are the same. In this case, the first node will update the content of the second data to the content of the fourth data to obtain the first target data.

In this application, after the data is modified, the first node will send a data synchronization message to the second node, and determine whether the modified data still needs to be processed based on the response message of the second node, thereby ensuring that the first node communicates with the second node. Data synchronization between nodes further improves the reliability of the system.

In a possible implementation of the first aspect, if the data in the first node is modified, the value of the synchronization flag bit of the first node will also change. If the first node modifies the first data into the second data, the first node will set the value of the synchronization flag bit to the first value, and the first value indicates that the data stored in the first node has been modified. After the first node processes the second data to obtain the first target data, the value of the synchronization flag bit of the first node is updated to a second value. The second value indicates the data stored in the first node (that is, the first Target data) is synchronized with the data stored in the second node (ie, fourth data).

In this application, the first node can also set a synchronization flag bit. By querying the value of the synchronization flag bit, it can be identified whether the data in the first node and the second node are synchronized. The identification method is simple.

In a possible implementation of the first aspect, the second node can also receive a data modification message from the client and send a data synchronization message to the first node. Exemplarily, before the first node obtains the first data modification message from the client, the first node may also obtain a second data synchronization message from the second node. The second data The synchronization message instructs the first node to perform data synchronization, and the second data synchronization message corresponds to the fifth data stored in the second node. The fifth data is data obtained by the second node modifying the first historical data in the second node according to the second data modification message from the second client. The second client and the first client may be the same client or different clients, and the details are not limited here. After receiving the second data synchronization message, the first node will process the data currently stored in the first node according to the second data synchronization message and the first data status of the first node to obtain the first data.

In this application, both the first node and the second node can receive the client's data modification message and respond to the message. If the first node and the second node are used as the master node and backup node respectively, this application can achieve " "Hyperactive active-standby synchronization strategy" improves the flexibility of the technical solution of this application.

In a possible implementation of the first aspect, the first data status of the first node may indicate multiple contents, so that the first node processes currently stored data in different ways. Specifically, if the first data status indicates that the content of the data currently stored in the first node is the same as the content of the first historical data, it means that the first node needs to perform synchronous modification to change the content of the data currently stored in the first node. Update the content of the fifth data to obtain the first data; if the first data status indicates that the content of the data currently stored in the first node is different from the content of the first historical data, and the priority of the first node is not higher than that of the second The priority of the node means that the first node needs to be synchronously modified to update the content of the data currently stored in the first node to the content of the fifth data to obtain the first data; if the first data status indicates that the current data in the first node The content of the stored data is different from the content of the first historical data, and the priority of the first node is higher than the priority of the second node, which means that the first node does not need to be modified and the first node can determine the content of the first data. The same content as the data currently stored in the first node.

In this application, after receiving the data synchronization message from the second node, the first node determines whether data synchronization is required based on its own data status. When the data currently stored by the first node is the same as the first historical data content of the second node, the first node will modify the data to ensure data consistency between the two nodes; when the data currently stored by the first node When the data content of the second node is different from the first historical data content of the second node, the first node will combine the priorities of the two nodes to determine whether to modify the currently stored data to ensure that the data of the low-priority node follows The data of high-priority nodes avoids frequent modification or misoperation of data in high-priority nodes.

In a possible implementation of the first aspect, after the first node obtains the first data, a second response message corresponding to the second data synchronization message is sent to the second node. The second response message indicates the data synchronization result of the first node, that is, the content of the first data, so that the second node processes the fifth data according to the second response message, so that the processed fifth data is The content is the same as the content of the first data, that is, the data of the first node and the second node are synchronized.

In this application, the first node processes the data currently stored by the first node to obtain the first data according to the data synchronization message of the second node, and then feeds back the data synchronization result to the second node, so that the second node further processes its own storage. data, thereby ensuring data synchronization between the first node and the second node, further improving the reliability of the system.

In a possible implementation of the first aspect, after the first node obtains the first data, the data status of the first node is modified, and the value of the synchronization flag bit is set to the second value to represent the first The data of the node and the second node have been synchronized.

In a possible implementation of the first aspect, after the first node obtains the first target data, the first node may also obtain a third data synchronization message from the second node, the third data synchronization message indicating the first The node performs data synchronization, and the third data synchronization message corresponds to the sixth data stored in the second node. The sixth data is data obtained by the second node modifying the second historical data in the second node according to the third data modification message from the third client. Among them, any two clients among the third client, the second client and the first client can also be different clients, and the details are not limited here. After receiving the third data synchronization message, the first node processes the first target data according to the third data synchronization message and the second data status of the first node to obtain the second target data.

In this application, both the first node and the second node can receive the data modification message from the client and respond to the message. If the first node and the second node are used as the master node and the backup node respectively, this application can realize the "dual-active master-backup synchronization strategy", which improves the flexibility of the technical solution of this application. In addition, compared with the solution where only the master node can receive the client's message and then the backup node responds, the technical solution of this application reduces the response delay.

In a possible implementation of the first aspect, the second data status of the first node may indicate multiple contents, so that the first node processes the first target data in different ways. Specifically, if the second data status indicates that the content of the first target data in the first node is the same as the content of the second historical data, it means that the first node needs to perform synchronous modification to change the content of the first target data in the first node. Update to the content of the sixth data to obtain the second target data; if the second data status indicates that the content of the first target data in the first node is different from the content of the second historical data, and the priority of the first node is not higher than that of the second historical data, The priority of the second node means that the first node needs to be modified synchronously to update the content of the first target data in the first node to the content of the sixth data to obtain the second target data; if the second data status indicates that the first node The content of the first target data is different from the content of the second historical data, and the priority of the first node is higher than the priority of the second node, which means that the first node does not need to be modified and the first node can determine the second target. The content of the data is the same as the content of the first target data in the first node.

In this application, after receiving the data synchronization message from the second node, the first node determines whether data synchronization is required based on its own data status. When the first target data of the first node is the same as the second historical data content of the second node, the first node will modify the data to ensure data consistency between the two nodes; when the first node first When the content of the target data is different from the second historical data of the second node, the first node will combine the priorities of the two nodes to determine whether the first target data has been modified, thereby ensuring that the data of the low-priority node follows. The data of high-priority nodes avoids frequent modification or misoperation of data in high-priority nodes.

In a possible implementation of the first aspect, after the first node obtains the second target data, a third response message corresponding to the third data synchronization message is sent to the second node. The third response message indicates the data synchronization result of the first node, that is, the content of the second target data, so that the second node processes the sixth data according to the third response message, so that the processed sixth data The content of is the same as the content of the second target data, that is, the data of the first node and the second node are synchronized.

In this application, after the first node processes the first target data of the first node to obtain the second target data according to the data synchronization message of the second node, it can also feed back the data synchronization result to the second node, so that the second node can further process it. The data stored by itself ensures the data synchronization between the first node and the second node, further improving the reliability of the system.

In a possible implementation of the first aspect, after the first node obtains the second target data, the first node The data status of the node will be modified, and the value of the synchronization flag bit will be set to the second value to indicate that the data of the first node and the second node have been synchronized.

In a possible implementation of the first aspect, after the first node obtains the first target data, the first node also sends a fourth response message to the first client, and the fourth response message carries the first target data. .

In this application, the first node can not only obtain the client's data modification message, but also feed back to the client the final result after modification and synchronization. Similarly, the second node can also obtain the client's data modification message and feed back the final result after modification and synchronization to the client. That is to say, in this application, both the first node and the second node can obtain the request and feedback the results, thereby realizing the "dual-active active and backup synchronization strategy", further improving the flexibility and practicality of the technical solution of this application.

The second aspect of this application provides a data processing method, which is applied to the second node and includes:

The second node establishes a communication connection with the first node and can obtain the first data synchronization message from the first node. The first data synchronization message is used to instruct the second node to perform data synchronization. The first data synchronization message corresponds to the second data in the first node. The second data is the first node modifying the message according to the first data from the first client. Data obtained by modifying the first data in the first node. The first node and the second node can also perform role assignment. If the first node is the master node, then the second node is the backup node. Correspondingly, if the second node is the master node, then the second node is the backup node. After the second node obtains the first data synchronization message, it will process the third data stored in the second node according to the first data synchronization message and the first data status of the second node to obtain fourth data. The second node will send a first response message to the first node. The first response message indicates the data synchronization result of the second node, so that the first node processes the second data according to the data synchronization result to obtain the first target data. Finally, the second node The first target data in one node and the fourth data in the second node have the same data content, thus realizing data synchronization between different nodes.

It should be noted that with different application scenarios, the content indicated by the data stored in the second node is different. For example, if the data processing method is applied in a distributed lock scenario, the content indicated by the data stored in the second node includes the status of the distributed lock, specifically including lock release or lock occupation; if the data processing method is applied in a distributed lock scenario, In the arbitration scenario, the data stored in the second node indicates the status after arbitration in the distributed system, specifically including the new master node information; in addition, the data stored in the second node can also indicate other The content is not specifically limited here. For example, if the data processing method is applied in a distributed cache consistency scenario, the content indicated by the data stored in the second node includes cache information of a certain data, and the cache information indicates the client that caches a copy of the data.

In this application, after the data of the first node is modified, it will send a data synchronization message to the second node, so that the second node determines the data synchronization result based on its own data status, and feeds the result back to the first node, so that the first node further processes itself. data, ultimately achieving data synchronization between the first node and the second node, improving the reliability of the system.

In a possible implementation of the second aspect, since the first data status of the second node has multiple possibilities, the data synchronization results of the second node also have multiple possibilities. Specifically, if the first data status of the second node indicates that the content of the third data in the second node is the same as the content of the first data in the first node, it means that the first node and the second node were in data synchronization before. status, when the data of the first node is modified, the second node needs to be modified synchronously and update the content of the third data to the content of the second data to obtain the fourth data synchronized with the second data. If the first data status of the second node indicates that the content of the third data is different from the content of the first data, and the priority of the second node The priority is not higher than the priority of the first node, which means that the first node and the second node were not in a data synchronization state before, and the data of the second node needs to follow the data of the first node. Therefore, the second node will The content of the third data is updated to the content of the second data to obtain the fourth data synchronized with the second data.

In this application, after receiving the data synchronization message from the first node, the second node determines whether data synchronization is required based on its own data status. When the third data of the second node is the same as the first data of the first node, the second node will modify the data to ensure data consistency between the two nodes; when the third data is the same as the first data When the data content is different, the second node will combine the priorities of the two nodes to determine whether to modify the third data, thereby ensuring that the data of the low-priority node follows the data of the high-priority node, avoiding high priority The data in level nodes is frequently modified or misoperated.

In a possible implementation of the second aspect, if the first data status indicates that the content of the third data is different from the content of the first data, and the priority of the second node is higher than the priority of the first node, it means that the content of the third data is different from the content of the first data. One node and the second node were not in a data synchronization state before, and the data of the first node needs to follow the data of the second node. The third data in the second node remains unchanged, that is, it is determined that the content of the fourth data is the same as that of the second node. The contents of the three data are the same.

In this application, when the content of the third data is different from that of the first data, and the priority of the second node is higher than the priority of the first node, the second node will not modify the content of the third data, so that the lower priority The data of high-level nodes follows the data of high-priority nodes, preventing data in high-priority nodes from being frequently modified or misoperated.

In a possible implementation of the second aspect, after obtaining the fourth data, the second node will also update the first data state to a second data state, where the second data state indicates the relationship between the second node and the first node. data synchronization. Specifically, the value of the synchronization flag bit of the second node may be set to the second value.

In this application, the second node can also set a synchronization flag bit. By querying the value of the synchronization flag bit, it can be identified whether the data in the first node and the second node are synchronized. The identification method is simple.

In a possible implementation of the second aspect, the second node can also receive a data modification message from the client and send a data synchronization message to the first node. Exemplarily, before obtaining the first data synchronization message from the first node, the second node may also obtain a second data modification message from the second client. The second data modification message indicates modifying the data stored in the second node. First historical data. The second node will modify the first historical data according to the second data modification message, obtain the fifth data, and then send the second data synchronization message to the first node, so that the first node can perform data synchronization on the data currently stored by the first node. Get the first data. After performing data synchronization, the first node will send a second response message to the second node. The second node receives a second response message from the first node, the second response message indicates the data synchronization result of the first node, and processes the fifth data according to the second response message, so that the processed fifth data is consistent with the first node. One data synchronization. The second client and the first client may be the same client or different clients, and the details are not limited here.

In a possible implementation manner of the second aspect, after the second node obtains the processed fifth data, it also sends a response message to the second client, and the response message carries the processed fifth data.

In this application, both the first node and the second node can receive the data modification message from the client and respond to the message. If the first node and the second node are used as the master node and the backup node respectively, this application can realize the "dual-active master-backup synchronization strategy", which improves the flexibility of the technical solution of this application. In addition, compared with the solution where only the master node can receive the client's message and then the backup node responds, the technical solution of this application reduces the response delay.

In a possible implementation manner of the second aspect, since the content indicated by the second response message is different, the way in which the second node processes the fifth data is also different. If the second response message indicates that the content of the first data is synchronized to the content of the fifth data, then the second node will keep the content of the fifth data unchanged, that is, the content of the processed fifth data is the same as the fifth data. If the second response message indicates that the content of the first data is different from the content of the fifth data, it means that the priority of the first node is higher than the priority of the second node, and the second node needs to update the fifth data and change the fifth data. The content of the fifth data is updated to the content of the first data, and the modified fifth data is obtained.

In this application, after the second node modifies the data according to the data modification message of the second client, it will send a data synchronization message to the first node, and determine whether to further process the data modified according to the data modification message according to the synchronization result of the first node. data, thereby ensuring that the data in the first node and the second node are synchronized, further improving the reliability of the system.

In a possible implementation of the second aspect, after obtaining the modified fifth data, the second node will set the value of the synchronization flag bit to a second value, and the second value indicates that the first node and the second node Node data synchronization.

In a possible implementation of the second aspect, the second node may receive data modification messages from multiple clients at different points in time. Exemplarily, after sending the first response message to the first node, the second node may obtain a third data modification message from the third client. The third data modification message indicates modifying the second historical data stored in the second node. . Among them, any two clients among the third client, the second client and the first client can also be different clients, and the details are not limited here. According to the third data modification message, the second historical data is modified to obtain the sixth data. The second node will send a third data synchronization message to the first node, so that the first node performs data synchronization on the first target data to obtain the second target data. After obtaining the second target data, the first node sends a third response message to the second node. The third response message indicates the data synchronization result of the first node. The second node receives the third response message from the first node, and processes the sixth data according to the third response message, so that the processed fifth data is synchronized with the second target data.

In a possible implementation of the second aspect, after obtaining the processed sixth data, the second node also sends a response message to the third client, and the response message carries the processed sixth data.

In this application, the second node can receive data modification messages from clients at different times and respond; it can also receive data modification messages from different clients, which enriches the application scenarios of the technical solution of this application and improves the practicality of the technical solution. .

In a possible implementation manner of the second aspect, since the content indicated by the third response message is different, the way in which the second node processes the sixth data is also different. If the third response message indicates that the content of the second target data is synchronized to the content of the sixth data, then the second node will keep the content of the sixth data unchanged, that is, the content of the processed sixth data is the same as the sixth data. If the third response message indicates that the content of the second target data is different from the content of the sixth data, it means that the priority of the first node is higher than the priority of the second node, and the second node needs to update the sixth data. The content of the sixth data is updated to the content of the second target data, and the modified sixth data is obtained.

In this application, after the second node modifies the data according to the data modification message of the third client, it will send a data synchronization message to the first node, and determine whether to further process the data modified according to the data modification message according to the synchronization result of the first node. data, thereby ensuring that the data in the first node and the second node are synchronized, further improving the reliability of the system.

In a possible implementation of the second aspect, after obtaining the modified sixth data, the second node will set the value of the synchronization flag bit to a second value, and the second value indicates that the first node and the second node Node data synchronization.

The third aspect of the embodiment of the present application provides a communication system. The communication system includes a first node and a second node. The first node is used to perform the aforementioned first aspect and any of the possible implementations of the first aspect. Method, the second node is configured to execute the method shown in the aforementioned second aspect and any possible implementation manner of the second aspect.

A fourth aspect of this application provides a network device. The network device includes a first node, including:

A transceiver unit configured to obtain a first data modification message from the first client, where the first data modification message indicates modification of the first data stored in the first node.

A processing unit, configured to modify the first data according to the first data modification message to obtain the second data.

The transceiver unit is also configured to send a first data synchronization message to the second node, where the first data synchronization message carries the second data, so that the second node performs data synchronization.

The transceiver unit is also configured to receive a first response message from the second node, where the first response message indicates the data synchronization result of the second node.

The processing unit is also configured to process the second data according to the first response message to obtain the first target data.

The network device is configured to perform the method shown in the aforementioned first aspect and any possible implementation manner of the first aspect.

The fifth aspect of this application provides a network device. The network device includes a second node, including:

A transceiver unit configured to obtain a first data synchronization message from a first node. The first data synchronization message instructs the second node to perform data synchronization. The first data synchronization message corresponds to the second data in the first node. The second data It is the data obtained by the first node modifying the first data in the first node according to the first data modification message from the first client.

The processing unit is configured to process the third data stored in the second node according to the first data synchronization message and the first data status of the second node to obtain fourth data.

The transceiver unit is also configured to send a first response message to the first node. The first response message indicates the data synchronization result of the second node, so that the first node processes the second data to obtain the first target data according to the data synchronization result.

The network device is configured to perform the method shown in the aforementioned second aspect and any possible implementation manner of the second aspect.

The sixth aspect of this application provides a network device, including a processor, a memory and a communication interface. The processor, the memory and the communication interface are connected. The processor is configured to execute the aforementioned first aspect and any possible implementation of the first aspect. method shown.

The seventh aspect of this application provides a network device, including a processor, a memory and a communication interface. The processor, the memory and the communication interface are connected. The processor is configured to execute the aforementioned second aspect and any possible implementation of the second aspect. method shown.

The eighth aspect of the present application provides a computer-readable storage medium. The computer-readable storage medium stores a program. When the computer executes the program, the first aspect, any possible implementation manner of the first aspect, and the third aspect are executed. The method shown in the second aspect and any possible implementation manner of the second aspect.

A ninth aspect of the present application provides a computer program product, which is characterized in that when the computer program product is executed on a computer, the computer executes the first aspect, any possible implementation of the first aspect, the second aspect, and The method shown in any possible implementation of the second aspect.

The beneficial effects shown in any one of the fourth to ninth aspects of the present application are the first aspect and any implementation of the first aspect, and/or the second aspect and any implementation of the second aspect. The method is shown and will not be described again here.

Description of drawings

Figure 1a is a schematic diagram of the system architecture provided by the embodiment of the present application;

Figure 1b is another schematic diagram of the system architecture provided by the embodiment of the present application;

Figure 2 is a schematic flow chart of the data processing method provided by the embodiment of the present application;

Figure 3 is a schematic diagram of the data processing method provided by the embodiment of the present application;

Figure 4 is another schematic diagram of the data processing method provided by the embodiment of the present application;

Figure 5a is a schematic diagram of the read-write scenario provided by the embodiment of the present application;

Figure 5b is a schematic diagram of the write-write scenario provided by the embodiment of the present application;

Figure 6 is another schematic diagram of the data processing method provided by the embodiment of the present application;

Figure 7 is another schematic diagram of the data processing method provided by the embodiment of the present application;

Figure 8 is another schematic flow chart of the data processing method provided by the embodiment of the present application;

Figure 9 is another schematic flow chart of the data processing method provided by the embodiment of the present application;

Figure 10 is a schematic diagram of a communication system provided by an embodiment of the present application;

Figure 11 is a schematic structural diagram of a network device provided by an embodiment of the present application;

Figure 12 is another schematic structural diagram of a network device provided by an embodiment of the present application.

Detailed ways

The present application provides a data processing method, a communication system and related equipment. The data processing method applied to the first node includes: the first node modifies the first data into the second data according to the first data modification message of the first client. . Then the first data synchronization message is sent to the second node, so that the second data is synchronized. Then, the second data is processed according to the data synchronization result indicated by the first response information of the second node, and the first target data with the same content as the data in the second node is obtained. Through information exchange between the first node and the second node, data synchronization between the first node and the second node is achieved. Even if one node fails, the other node can continue to provide services, which improves the reliability of the system.

The embodiments of the present application are described below with reference to the accompanying drawings. Persons of ordinary skill in the art know that with the development of technology and the emergence of new scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

The terms "first", "second", etc. in the description and claims of this application and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that the terms so used are interchangeable under appropriate circumstances, and are merely a way of distinguishing objects with the same attributes in describing the embodiments of the present application. Furthermore, the terms "include" and "have" and any variations thereof, are intended to cover non-exclusive inclusion, such that a process, method, system, product or apparatus comprising a series of elements need not be limited to those elements but may include none Other elements that are clearly listed or inherent to such processes, methods, products or equipment. In addition, "at least one" means one or more, and "plurality" means two or more. "And/or" describes the association of associated objects, indicating that there can be three relationships, for example, A and/or B, which can mean: A exists alone, A and B exist simultaneously, and B exists alone, where A, B can be singular or plural. The character "/" generally indicates that the related objects are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, Including any combination of single items (items) or plural items (items). For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, c can be single or multiple .

First, please refer to Figure 1a and Figure 1b. Figure 1a and Figure 1b are both schematic diagrams of system architecture provided by embodiments of the present application.

As shown in Figure 1a, nodes S0 to S6 are deployed in a spine-leaf topology. The master node is deployed in the spine layer (i.e., the upper layer in Figure 1a), and in the leaf layer (i.e., the upper layer in Figure 1a). lower layer) to deploy backup nodes. Nodes in the spine layer are connected to nodes in the leaf layer in a full grid manner, that is, a connection relationship is established between any node in the spine layer and any node in the leaf layer.

For example, in the embodiment shown in Figure 1a, assume that the server cluster includes servers A1 to A9, the corresponding master node is node S1, and the corresponding backup node is node S6. The nodes directly connected to different servers in the server cluster can be the same or different, and there is no specific limit here. In the embodiment shown in Figure 1a, server A1, server A2 and server A3 are all directly connected to node S3; server A4 is directly connected to node S4.

It should be noted that Figure 1a is only a diagram of the system architecture provided in this application. In actual applications, the architecture composed of each node can also have many situations, for example, the number of upper-layer nodes is consistent with the number of lower-layer nodes; or Each node forms a more or less hierarchical architecture, which is not limited here.

In the embodiment shown in Figure 1b, the primary node S1 and the backup node S2 are included in a single-layer architecture, and a direct connection relationship is established between any two nodes. In actual applications, there are more possibilities for the connection relationship between each node, as long as the connection between the primary node and the backup node can be guaranteed, there is no specific limit here.

In the embodiment shown in Figure 1a, the number of nodes directly connected to each server is one. In practical applications, each server can also be directly connected to a larger number of nodes, which is not limited here. For example, in the embodiment shown in Figure 1b, there are two nodes directly connected to server A1 and server A2, namely node S0 and node S1 respectively; there are three nodes directly connected to server A5.

In this application, a client can also be deployed on each server, and the client sends a data modification request to the primary node or backup node.

It should be noted that the data processing method provided by the embodiment of the present application is applied to the first node or the second node. The first node and the second node may be switches or other network devices capable of data synchronization, such as servers. , the first node and the second node may be the same type of equipment, or may be different types of equipment, and there is no specific limitation here. The first node and the second node can perform role allocation. If the first node is the master node, then the second node is the backup node; accordingly, if the second node is the master node, then the first node is the backup node. Specifically, here No restrictions.

For example, assuming that the first node is the master node and the second node is the backup node, in the embodiment shown in Figure 1a, the first node is node S1 and the second node is node S6.

Next, assuming that the first node is the master node and the second node is the backup node, and assuming that the data processing method provided by this application is applied in a distributed lock scenario, the data processing method provided by the embodiment of this application will be described.

In a distributed lock scenario, the data type stored in the first node as the master node and the second node as the backup node includes the lock status. The process of the first node or the second node processing the client's lock request can be regarded as the process of the client initiating a read or write request to the first node or the second node. In this application, it is defined that when the lock acquisition is successful, the first node and the second node will modify their own lock status and perform a write operation; when the client lock acquisition fails, Section 1 Neither the node nor the second node needs to modify its own lock status to perform a read operation. Based on. For the convenience of description, in the subsequent description, reading and writing are used to represent the successful and failed scenarios of client lock acquisition.

In response to different requests from clients, the data processing method provided by this application includes three different scenarios, namely read-read scenario, read-write scenario, and write-write scenario.

In the read-read scenario, the operation of the primary node or the backup node does not involve the modification of the lock status, that is, the modification of the data stored on itself. Therefore, the data consistency of the primary and backup nodes can be guaranteed. The read-read scenario will not be explained here. .

In a read-write scenario or a write-write scenario, data modification on the active and backup nodes will be involved. The following uses the first node as the execution subject to explain the read-write scenario and the write-write scenario. Please refer to Figure 2. Figure 2 is a schematic flowchart of a data processing method provided by an embodiment of the present application, including the following steps:

201. Obtain the first data modification message from the first client. The first data modification message indicates modifying the first data stored in the first node.

Assume that a write operation occurs on the first node, that is, the first client sends a first data modification message to the first node with the intention of modifying the first data stored in the first node, that is, a write operation is performed on the first node. The first data modification message may be sent to the first node in the form of a message.

202. Modify the first data according to the first data modification message to obtain the second data.

The first node obtains the first data modification message and modifies the first data to obtain the second data.

203. Send a first data synchronization message to the second node, where the first data synchronization message carries the second data, so that the second node performs data synchronization.

Since the first data is modified, the first node will send a first data synchronization message to the second node to inform the second node that the data stored in the first node has been modified, so that the second node can perform data synchronization to maintain the first data synchronization message. Data consistency between one node and the second node. The first data synchronization message may be sent to the second node in the form of a message.

204. Receive a first response message from the second node, where the first response message indicates the data synchronization result of the second node.

After receiving the first data synchronization message, the second node will determine whether its own data needs to be modified based on its own data status, and send a first response message to the first node to inform the first node of the data synchronization result.

Since there are many possibilities for the data status of the second node, there are also many possibilities for the data synchronization results of the second node, which are explained below. For example, it is assumed that when the first data is stored in the first node, the third data is stored in the second node.

If the content of the third data is the same as the content of the first data, it means that the first node and the second node were in a state of data synchronization before. If the second node does not receive the data modification message from the client, then the second node The data will be modified according to the data in the first node, that is, the content of the third data will be modified to the content of the second data, thereby obtaining the fourth data. In this case, the second node may receive a read request from the client, that is, the operations of the first node and the second node correspond to the read-write scenario.

If the content of the third data is different from the content of the first data, the second node will consider the priorities of the two nodes to determine whether to modify the content of the third data. If the priority of the first node is higher than the priority of the second node, the second node will modify the content of the third data to the content of the second data to obtain the fourth data. If the priority of the first node is not is higher than the priority of the second node, then the second node will not modify the content of the third data. That is to say, the content of the fourth data obtained by the second node after data synchronization according to the first data synchronization message is the same as the content of the third data. The content is the same. In this case, the reason why the first data and the third data are different may be that the second node receives a data modification message from the client and modifies the data that was originally synchronized with the first data into the third data, that is, the first node and the third data are different. The operation of the second node corresponds to the write-write scenario.

The priority between the first node and the second node can be determined according to the roles of the first node and the second node. For example, the priority of the primary node is higher than the priority of the backup node; it can also be determined in other ways, For example, it is determined based on the identity number (ID) of each node. For example, a node with a larger ID value has a higher priority. There is no specific limit here.

205. Process the second data according to the first response message to obtain the first target data.

After the second node obtains the fourth data, it will send a first response message corresponding to the first data synchronization message to the first node, so that the first node processes the second data according to the first response message and obtains synchronization with the fourth data. the first target data. That is to say, the first response message corresponds to the fourth data in the second node, and the fourth data is the data obtained after the second node performs data synchronization on the third data according to the first data synchronization message.

After obtaining the first response message, the first node will process the second data according to the content of the second data and the content of the fourth data indicated by the first response message. Specifically, if the content of the fourth data has been synchronized to the content of the second data, it means that the second node has performed data synchronization, then the content of the first target data is the content of the second data, that is to say, the first node The second data can be kept unchanged. Among them, the second node has performed data synchronization, including that the third data of the second node has the same content as the first data of the first node, or, although the content of the third data is different from the content of the first data, the content of the second node's third data is the same as that of the first data. The priority is not higher than the priority of the first node.

If the content of the fourth data is different from the content of the second data, it means that the content of the third data is different from the content of the first data, and the priority of the second node is higher than the priority of the first node, so the second node maintains the priority of the first node. The content of the third data remains unchanged, that is, the content of the third data and the fourth data are the same. In this case, the first node will update the content of the second data to the content of the fourth data to obtain the first target data.

In this application, after the first node modifies the first data into the second data according to the first data modification message of the first client, it also sends a first data synchronization message to the second node, so that the second data is synchronized. And based on the data synchronization result of the second node, the second data is further processed to obtain synchronization between the data in the first node and the data in the second node. Simply put, through information exchange between the first node and the second node, data synchronization between the first node and the second node is achieved. Even if one node fails, the other node can continue to provide services, improving the system reliability. In addition, after the data is modified, the first node will send a data synchronization message to the second node, and determine whether the modified data still needs to be processed based on the response message of the second node, thereby ensuring the communication between the first node and the second node. Data synchronization between devices further improves the reliability of the system.

In some optional implementations, after the first node obtains the first target data, that is, after step 205, the first node will also send a fourth response message to the first client. The fourth response message corresponds to The first data modification message and the fourth response message of the first client carry the first target data, thereby informing the first client of the final result of the data modification.

In this application, the first node can not only obtain the client's data modification message, but also feedback modification synchronization to the client. The final result after. Similarly, the second node can also obtain the client's data modification message and feedback the final result after modification and synchronization to the client (the operation of the second node will be expanded upon when describing the data processing method using the second node as the execution subject). That is to say, in this application, both the first node and the second node can obtain the request and feedback the results, thereby realizing the "dual-active active and backup synchronization strategy", further improving the flexibility and practicality of the technical solution of this application.

In order to clearly illustrate the "dual-active active-standby synchronization strategy", please refer to Figure 3. Figure 3 is a schematic diagram of the data processing method provided by the embodiment of the present application.

As shown in Figure 3, the so-called "dual-active master-backup synchronization strategy" means that both the master node and the backup node can receive requests from clients and respond to requests. Compared with In the chain synchronization scheme, only the master node can receive the request and the backup node can respond, which reduces the response delay. In addition, data synchronization is performed between the primary node and the backup node to ensure data consistency. In general, the technical solution of this application can not only improve system reliability but also reduce latency, providing a data processing method with high reliability and low latency.

In some optional embodiments, if the data in the first node is modified, the value of the synchronization flag bit (synchronize, sync) of the first node will also change. If the first node modifies the first data into the second data, the first node will set the value of the synchronization flag bit to the first value, and the first value indicates that the data stored in the first node has been modified. After the first node processes the second data to obtain the first target data, the value of the synchronization flag bit of the first node is updated to a second value. The second value indicates the data stored in the first node (that is, the first Target data) is synchronized with the data stored in the second node (ie, fourth data).

The specific values of the first value and the second value can be selected according to actual application needs, and are not limited in this application. For example, the first value can be set to 1 and the second value can be set to 0.

In order to more clearly explain the process of data changes and sync value changes in the first node from steps 201 to 205, please refer to Figure 4, which is a schematic diagram provided by an embodiment of the present application.

To put it simply, as shown in Figure 4, the first node modifies the first data into the second data according to the first data modification message, and sets the value of the synchronization flag bit to 1 to indicate that the data of the first node has occurred. Modified. In order to ensure data synchronization between the first node and the second node, the first node sends a first data synchronization message to the second node, so that the second node synchronizes the third data into the fourth data and sets the synchronization flag bit. The value is set to 0 to indicate that the data of the second node is synchronized with the data of the first node. The first node receives a first response message indicating the data synchronization result of the second node. The first response message corresponds to the fourth data, so that the first node further processes the second data, obtains the first target data, and sets the synchronization flag The value of the bit is set to 0 to indicate that the first target data in the first node is synchronized with the fourth data in the second node.

In different scenarios, the data change process is slightly different. The following is a schematic diagram to illustrate the read-write scenario and write-write scenario respectively. Please refer to Figures 5a and 5b. Figure 5a is a schematic diagram of a read-write scenario provided by an embodiment of the present application, and Figure 5b is a schematic diagram of a write-write scenario provided by an embodiment of the present application.

As shown in Figure 5a, it is assumed that the data stored in the initial state of the primary node and the backup node are consistent, that is, the value (value) stored by the primary node and the backup node is 2, and the synchronization flag value is 0. Write operations then occur on the backup node while the primary node responds to read operations. At this time, the values written by the backup node have not yet been synchronized to the primary node. The read operation that occurred at the primary node returned a value that was not the latest, that is, the initial value V=2.

When a write operation occurs, the backup node sets the sync bit to 1 and sends a data synchronization message to the primary node. due to main section The sync at this point is 0, therefore, the data synchronization message takes effect, and the master node performs data modification to be consistent with the data of the backup node. After the backup node obtains the response message from the primary node, it modifies the value of its own synchronization flag and sets sync to 0.

In this application, the read operation indicates that the lock acquisition fails in the distributed lock management system. Therefore, after the lock acquisition of the master node fails, the client will re-initiate the lock request to obtain the latest data, that is, V=3.

As shown in Figure 5b, it is assumed that the active and standby nodes receive write requests at the same time, and the active and standby nodes receive different write requests. In the embodiment shown in Figure 5b, the master node modifies the data to V=2 according to the write request, and the backup node modifies the data to V=3 according to the write request. The master node and the backup node will send data synchronization requests to each other.

After receiving the data synchronization request from the other party, any node among the primary node and the backup node first confirms whether its own sync is 1. If sync=0, it means that the node has not changed its data, so it can directly accept the data synchronization request and modify its own data to the data corresponding to the data synchronization request. If sync=1, it means that the data of the node itself has also changed. At this time, it is determined whether the data synchronization request takes effect based on the priority agreed upon by the implementation (for example, the primary node is higher than the backup node). If the priority of the sending end is higher than the local one, the data synchronization request is applied, otherwise the request is rejected and the result is fed back to the sending end. According to the above method, the write request of the primary node will be applied and synchronized to the backup node, so the data of the primary node and the backup node are consistent.

In this application, the first node can also set a synchronization flag bit. By querying the value of the synchronization flag bit, it can be identified whether the data in the first node and the second node are synchronized. The identification method is simple.

In the embodiment shown in Figure 5b, the first node and the second node obtain the data modification request from the client at the same time. In practical applications, the time points at which the first node and the second node obtain the data modification request from the client can also be different. , this situation is explained below.

In some optional embodiments, before step 201, the first node may obtain a second data synchronization message from the second node. The second data synchronization message instructs the first node to perform data synchronization. The second data synchronization message corresponds to The fifth data stored in the second node (that is, the second data synchronization message carries the fifth data). The fifth data is data obtained by the second node modifying the first historical data in the second node according to the second data modification message from the second client. The first node processes the data currently stored in the first node according to the second data synchronization message and the first data status of the first node to obtain the first data.

The second client and the first client may be the same client or different clients, and the details are not limited here.

Since the first data status of the first node may indicate multiple contents, the first node may also process the currently stored data in different ways.

In some optional implementations, if the first data status indicates that the content of the data currently stored in the first node is the same as the content of the first historical data, it means that the first node needs to perform synchronous modification, and the current data in the first node The content of the stored data is updated to the content of the fifth data to obtain the first data.

In some optional implementations, if the first data status indicates that the content of the data currently stored in the first node is different from the content of the first historical data, and the priority of the first node is not higher than the priority of the second node , means that the first node needs to be modified synchronously, and the content of the data currently stored in the first node is updated to the content of the fifth data to obtain the first data.

In some optional implementations, if the first data status indicates that the content of the data currently stored in the first node is different from the content of the first historical data, and the priority of the first node is higher than the priority of the second node, This means that the first node does not need to be modified, and the first node can determine that the content of the first data is the same as the content of the data currently stored in the first node.

In this application, both the first node and the second node can receive the client's data modification message and respond to the message. If the first node and the second node are used as the master node and backup node respectively, this application can achieve " "Hyperactive active-standby synchronization strategy" improves the flexibility of the technical solution of this application. In addition, after receiving the data synchronization message from the second node, the first node will determine whether data synchronization is required based on its own data status. When the data currently stored by the first node is the same as the first historical data content of the second node, the first node will modify the data to ensure data consistency between the two nodes; when the data currently stored by the first node When the data content of the second node is different from the first historical data content of the second node, the first node will combine the priorities of the two nodes to determine whether to modify the currently stored data to ensure that the data of the low-priority node follows The data of high-priority nodes avoids frequent modification or misoperation of data in high-priority nodes.

In some optional implementations, after the first node obtains the first data, a second response message corresponding to the second data synchronization message is sent to the second node. The second response message indicates the data synchronization result of the first node, that is, the content of the first data, so that the second node processes the fifth data according to the second response message, so that the processed fifth data The content is the same as the content of the first data, that is, the data of the first node and the second node are synchronized.

In this application, the first node processes the data currently stored by the first node to obtain the first data according to the data synchronization message of the second node, and then feeds back the data synchronization result to the second node, so that the second node further processes its own storage. data, thereby ensuring data synchronization between the first node and the second node, further improving the reliability of the system.

In some optional implementations, after the first node obtains the first data, the data status of the first node will be modified, and the value of the synchronization flag bit will be set to a second value to indicate that the first node and the second Node data synchronization.

In order to more clearly illustrate the process of the first node obtaining the first data, please refer to Figure 6 , which is a schematic diagram provided by an embodiment of the present application.

To put it simply, as shown in Figure 6, the second node modifies the first historical data to the fifth data according to the second data modification message, and sets the value of the synchronization flag bit to 1 to represent the data of the second node. Modifications have occurred. In order to ensure data synchronization between the second node and the first node, the second node sends a second data synchronization message to the first node, so that the first node synchronizes the currently stored data into the first data and sets the synchronization flag bit. The value is set to 0 to indicate that the data of the first node is synchronized with the data of the second node. The second node receives a second response message indicating the data synchronization result of the first node. The second response message corresponds to the first data, so that the second node further processes the sixth data to obtain the processed sixth data, and The value of the synchronization flag bit is set to 0 to indicate that the processed sixth data in the second node is synchronized with the first data in the first node.

In some optional embodiments, after obtaining the first target data, the first node may also obtain a third data synchronization message from the second node. The third data synchronization message instructs the first node to perform data synchronization, and the third data synchronization message instructs the first node to perform data synchronization. The third data synchronization message corresponds to the sixth data stored in the second node (that is, the third data synchronization message carries the sixth data). The sixth data is the second historical data in the second node according to the third data modification message from the third client. The data obtained after modification. After receiving the third data synchronization message, the first node processes the first target data according to the third data synchronization message and the second data status of the first node to obtain the second target data.

Among them, any two clients among the third client, the second client and the first client can also be different clients, and the details are not limited here.

Since the second data status of the first node may indicate multiple contents, the first node may also process the first target data in different ways.

In some optional embodiments, if the second data status indicates that the content of the first target data in the first node is the same as the content of the second historical data, it means that the first node needs to perform synchronous modification, and the first node in the first node needs to perform synchronous modification. The content of the first target data is updated to the content of the sixth data to obtain the second target data.

In some optional embodiments, if the second data status indicates that the content of the first target data in the first node is different from the content of the second historical data, and the priority of the first node is not higher than the priority of the second node , means that the first node needs to be modified synchronously, and the content of the first target data in the first node is updated to the content of the sixth data to obtain the second target data.

In some optional embodiments, if the second data status indicates that the content of the first target data in the first node is different from the content of the second historical data, and the priority of the first node is higher than the priority of the second node, This means that the first node does not need to be modified, and the first node can determine that the content of the second target data is the same as the content of the first target data in the first node.

In this application, both the first node and the second node can receive the data modification message from the client and respond to the message. If the first node and the second node are used as the master node and the backup node respectively, this application can realize the "dual-active master-backup synchronization strategy", which improves the flexibility of the technical solution of this application. In addition, compared with the solution where only the master node can receive the client's message and then the backup node responds, the technical solution of this application reduces the response delay. In addition, after receiving the data synchronization message from the second node, the first node will determine whether data synchronization is required based on its own data status. When the first target data of the first node is the same as the second historical data content of the second node, the first node will modify the data to ensure data consistency between the two nodes; when the first node first When the content of the target data is different from the second historical data of the second node, the first node will combine the priorities of the two nodes to determine whether the first target data has been modified, thereby ensuring that the data of the low-priority node follows. The data of high-priority nodes avoids frequent modification or misoperation of data in high-priority nodes.

In some optional embodiments, after the first node obtains the second target data, a third response message corresponding to the third data synchronization message is sent to the second node. The third response message indicates the data synchronization result of the first node, that is, the content of the second target data, so that the second node processes the sixth data according to the third response message, so that the processed sixth data The content of is the same as the content of the second target data, that is, the data of the first node and the second node are synchronized.

In this application, after the first node processes the first target data of the first node to obtain the second target data according to the data synchronization message of the second node, it can also feed back the data synchronization result to the second node, so that the second node can further process it. The data stored by itself ensures the data synchronization between the first node and the second node, further improving the reliability of the system.

In some optional embodiments, after the first node obtains the second target data, the data status of the first node will Make modifications to set the value of the synchronization flag bit to the second value to indicate data synchronization between the first node and the second node.

In order to more clearly illustrate the process of the first node obtaining the second target data, please refer to Figure 7, which is a schematic diagram provided by an embodiment of the present application.

To put it simply, as shown in Figure 7, the second node modifies the second historical data to the sixth data according to the third data modification message, and sets the value of the synchronization flag bit to 1 to represent the data of the second node. Modifications have occurred. In order to ensure data synchronization between the second node and the first node, the second node sends a third data synchronization message to the first node, so that the first node synchronizes the first target data to the second target data and sets the synchronization flag bit. The value of is set to 0 to indicate that the data of the first node is synchronized with the data of the second node. The second node receives a third response message indicating the data synchronization result of the first node. The second response message corresponds to the second target data, so that the second node further processes the sixth data to obtain the processed sixth data, and The value of the synchronization flag bit is set to 0 to indicate that the processed sixth data in the second node is synchronized with the second target data in the first node.

Next, assume that the first node is the master node and the second node is the backup node. It is also assumed that the data processing method provided by this application is applied in a distributed lock scenario, and the second node is used as the execution subject. The data processing method provided by the embodiment of this application is The method is explained. Please refer to Figure 8. Figure 8 is a schematic flow chart of a data processing method provided by an embodiment of the present application, including the following steps:

801. Obtain the first data synchronization message from the first node. The first data synchronization message instructs the second node to perform data synchronization. The first data synchronization message corresponds to the second data in the first node. The second data is the first data synchronization message. Data obtained by the node modifying the first data in the first node according to the first data modification message from the first client.

The second node establishes a communication connection with the first node and can obtain the first data synchronization message from the first node.

802. Process the third data stored in the second node according to the first data synchronization message and the first data status of the second node to obtain fourth data.

Since the first data status of the second node has multiple possibilities, the data synchronization results of the second node also have multiple possibilities.

In some optional implementations, if the first data status of the second node indicates that the content of the third data in the second node is the same as the content of the first data in the first node, it means that the first node is the same as the second node. In the state of data synchronization, when the data of the first node is modified, the second node needs to modify it synchronously and update the content of the third data to the content of the second data to obtain the fourth data synchronized with the second data. data.

In some optional implementations, if the first data status of the second node indicates that the content of the third data is different from the content of the first data, and the priority of the second node is not higher than the priority of the first node, explain The first node and the second node were not in a data synchronization state before, and the data of the second node needs to follow the data of the first node. Therefore, the second node will update the content of the third data to the content of the second data, so as to Fourth data synchronized with the second data is obtained.

In some optional implementations, if the first data status indicates that the content of the third data is different from the content of the first data, and the priority of the second node is higher than the priority of the first node, it means that the first node is different from the first node. The two nodes were not in a data synchronization state before, and the data of the first node needs to follow the data of the second node. The third data in the second node remains unchanged, that is, the content of the fourth data and the content of the third data are determined. same.

In this application, after receiving the data synchronization message from the first node, the second node determines whether data synchronization is required based on its own data status. The third data at the second node has the same content as the first data at the first node. In the case of , the second node will modify the data to ensure data consistency between the two nodes; in the case where the content of the third data is different from the first data, the second node will combine the priorities of the two nodes , determine whether to modify the third data, thereby ensuring that the data of the low-priority node follows the data of the high-priority node, and avoiding frequent modification or misoperation of the data in the high-priority node.

803. Send a first response message to the first node. The first response message indicates the data synchronization result of the second node, so that the first node processes the second data to obtain the first target data according to the data synchronization result.

Through information interaction between the second node and the first node, the data content of the first target data in the first node and the fourth data in the second node are the same, thereby realizing data synchronization between different nodes.

In this application, after the data of the first node is modified, it will send a data synchronization message to the second node, so that the second node determines the data synchronization result based on its own data status, and feeds the result back to the first node, so that the first node further processes itself. data, ultimately achieving data synchronization between the first node and the second node, improving the reliability of the system.

In some optional implementations, after step 803, that is, after obtaining the fourth data, the second node will update the first data state to a second data state, and the second data state indicates that the second node is in contact with the first data state. Node data synchronization. Specifically, the value of the synchronization flag bit of the second node may be set to the second value.

For example, from step 801 to step 803, the data change process of the second node is as shown in the aforementioned Figure 4.

In this application, the second node can also set a synchronization flag bit. By querying the value of the synchronization flag bit, it can be identified whether the data in the first node and the second node are synchronized. The identification method is simple.

In some optional implementations, the second node can also receive a data modification message from the client and send a data synchronization message to the first node. Exemplarily, before obtaining the first data synchronization message from the first node, that is, before step 801, the second node may also obtain a second data modification message from the second client, and the second data modification message indicates modification. The first historical data stored in the second node. The second node will modify the first historical data according to the second data modification message, obtain the fifth data, and then send the second data synchronization message to the first node, so that the first node can perform data synchronization on the data currently stored by the first node. Get the first data. After performing data synchronization, the first node will send a second response message to the second node. The second node receives a second response message from the first node, the second response message indicates the data synchronization result of the first node, and processes the fifth data according to the second response message, so that the processed fifth data is consistent with the first node. One data synchronization.

The second client and the first client may be the same client or different clients, and the details are not limited here.

Since the content indicated by the second response message is different, the way the second node processes the fifth data is also different:

In some optional implementations, if the second response message indicates that the content of the first data is synchronized to the content of the fifth data, then the second node will keep the content of the fifth data unchanged, that is, the processed fifth data The content is the same as the fifth data.

In some optional implementations, if the second response message indicates that the content of the first data is different from the content of the fifth data, it means that the priority of the first node is higher than the priority of the second node, and the second node needs The fifth data is updated, and the content of the fifth data is updated to the content of the first data to obtain the modified fifth data.

In some optional implementations, if the second response message indicates that the content of the first data is different from the content of the fifth data, the content of the fifth data is updated to the content of the first data.

For example, the second node processes the first historical data and finally obtains the processed fifth data, as shown in the aforementioned Figure 6 .

In some optional implementations, after obtaining the processed fifth data, the second node also sends a response message to the second client, where the response message carries the processed fifth data.

In this application, both the first node and the second node can receive the data modification message from the client and respond to the message. If the first node and the second node are used as the master node and the backup node respectively, this application can realize the "dual-active master-backup synchronization strategy", which improves the flexibility of the technical solution of this application. Compared with the chain synchronization solution, in which only the master node can receive the client's message, and then the backup node responds, the technical solution of this application reduces the response delay. In addition, after the second node modifies the data according to the data modification message of the second client, it will send a data synchronization message to the first node, and determine whether to further process the data modified according to the data modification message based on the synchronization result of the first node. This ensures data synchronization between the first node and the second node, further improving the reliability of the system.

In some optional implementations, the second node may receive data modification messages from multiple clients at different points in time. Exemplarily, after sending the first response message to the first node, that is, after step 803, the second node may obtain the third data modification message from the third client. The third data modification message indicates modifying the second node. The second historical data stored in . According to the third data modification message, the second historical data is modified to obtain the sixth data. The second node will send a third data synchronization message to the first node, so that the first node performs data synchronization on the first target data to obtain the second target data. After obtaining the second target data, the first node sends a third response message to the second node. The third response message indicates the data synchronization result of the first node. The second node receives the third response message from the first node, and processes the sixth data according to the third response message, so that the processed fifth data is synchronized with the second target data.

Among them, any two clients among the third client, the second client and the first client can also be different clients, and the details are not limited here.

In some optional implementations, after obtaining the processed sixth data, the second node also sends a response message to the third client, where the response message carries the processed sixth data.

Since the content indicated by the third response message is different, the way the second node processes the sixth data is also different:

In some optional implementations, if the third response message indicates that the content of the second target data is synchronized to the content of the sixth data, then the second node will keep the content of the sixth data unchanged, that is, the processed sixth data The content of the data is the same as the sixth data.

In some optional implementations, if the third response message indicates that the content of the second target data is different from the content of the sixth data, it means that the priority of the first node is higher than the priority of the second node, and the second node It is necessary to update the sixth data, update the content of the sixth data to the content of the second target data, and obtain the modified sixth data.

In this application, the second node can receive data modification messages from clients at different times and respond; it can also receive data modification messages from different clients, which enriches the application scenarios of the technical solution of this application and improves the practicality of the technical solution. . After the second node modifies the data according to the data modification message of the third client, it will send a data synchronization message to the first node, and determine whether to further process the data modified according to the data modification message according to the synchronization result of the first node, thereby ensuring The data in the first node and the second node are synchronized, further improving the reliability of the system.

For example, the process in which the second node processes the second historical data and finally obtains the processed sixth data is as shown in the aforementioned Figure 7 .

It should be noted that in this application, the time point at which the first node and the second node receive the data modification message from the client is not limited. The first node and the second node may receive the data modification message from different clients at the same time, or at different times. Data modification messages from the same or different clients are received at the time point, and the details are not limited here.

Next, from the perspective of the communication system, taking the first node to perform data processing after acquiring the first data modification message from the first client, and the data processing method applied in the distributed lock scenario as an example, the embodiments of the present application are provided The data processing method is explained.

Please refer to Figure 9. Figure 9 is a schematic flow chart of a data processing method provided by an embodiment of the present application, including the following steps:

901. The first node obtains the first data modification message from the first client.

902. The first node modifies the first data and obtains the second data.

903. The first node sends the first data synchronization message to the second node.

Steps 901 to 903 are similar to steps 201 to 203 in the embodiment shown in FIG. 2 and will not be described again here.

904. The second node processes the third data and obtains the fourth data.

905. The first node receives the first response message from the second node.

906. The first node processes the second data and obtains the first target data.

Steps 905 and 906 are similar to steps 204 and 205 in the embodiment shown in FIG. 2 and will not be described again here.

907. The first node sends a fourth response message to the first client.

The fourth response message corresponds to the first data modification message of the first client, and the fourth response message carries the first target data, thereby informing the first client of the final result of the data modification.

In general, the client sends a lock request (including lock acquisition or lock release, etc.). If the data packet corresponding to the lock request reaches the first node first (the processing logic of the second node arriving first is the same as that of the first node), the One node starts to provide distributed lock services.

If the current distributed lock cannot be obtained (or the release fails), the first node directly returns the operation failure to the client.

If the current lock can be successfully obtained, the first node modifies its lock status to occupied and modifies the synchronization identifier sync to 1, indicating that the current lock status needs to be synchronized. At the same time, the first node sends a data synchronization message to the second node.

The second node receives the data synchronization message and checks whether its sync is 1. If sync is 0, it directly updates the status and feeds the result back to the first node. If sync=1, based on the predetermined priority, it is determined whether the priority of the sender of the data synchronization message is greater than itself. If the sender has a higher priority, the data is updated; otherwise, the update is rejected. And the data synchronization result is fed back to the first node of the sending end.

After receiving the results from the second node, the first node updates its own status, resets sync to 0, and feeds back the processing results of the first node to the client.

It should be noted that with different application scenarios, the content indicated by the data stored in the first node and the second node is different.

In the above example, the data processing method is applied in a distributed lock scenario. In this scenario, the content indicated by the data stored in the first node and the second node includes the status of the distributed lock, specifically including lock release or lock occupation. In practical applications, data processing methods can also be applied in other scenarios:

In some optional implementations, the data processing method can be applied in a distributed arbitration scenario. In this scenario, the content indicated by the data stored in the first node and the second node includes the status after arbitration in the distributed system. , specifically including new master node information.

In distributed arbitration scenarios, in order to ensure high reliability, a deployment model of one master and multiple backups is usually adopted. For example, in a distributed database, there is one primary node and multiple backup nodes. When the master node fails, a new master node needs to be elected. The first node or the second node provided by the embodiment of this application can carry the function of the distributed arbitration manager. After the main node of the database fails, this application provides the first node or the second node to process the election request, thereby determining the generation of the database. Create a new master node and store the new master node information.

In some optional implementations, if the data processing method is applied in a distributed cache consistency scenario, the content indicated by the data stored in the second node includes cache information of a certain data, and the cache information indicates caching a copy of the data. client.

In a distributed cache system, in order to speed up the data access process, remote data is usually cached locally to facilitate read and write operations. Therefore, there may be multiple copies of a certain piece of data. When a client needs to modify data, the client first needs to send invalid information to all clients that cache the data to tell them that the data object has been modified. In this scenario, the first node or the second node provided by the embodiment of the present application can store cache information of a certain data, that is, which clients have copies of the data. When modification is required, the first node or the second node can find the location of all replicas and send a data invalidation message. Route to other clients through connections between nodes.

Next, the communication system and related equipment provided by the embodiments of the present application will be described.

Please refer to Figure 10, which is a schematic structural diagram of a communication system provided by an embodiment of the present application.

As shown in Figure 10, the communication system 1000 includes a first node 1001 and a second node 1002. The first node 1001 can perform the operations performed by the first node in the embodiments shown in Figures 2 to 9, and the second node 1002 can The operations performed by the second node in the aforementioned embodiments shown in FIGS. 2 to 9 are performed, and details will not be described again here.

Please refer to Figure 11, which is a schematic structural diagram of a network device provided by an embodiment of the present application.

As shown in Figure 11, if the network device 1100 is a first node, the network device 1100 includes a transceiver unit 1101 and a processing unit 1102.

The transceiver unit 1101 is configured to obtain a first data modification message from the first client, where the first data modification message indicates modification of the first data stored in the first node.

The processing unit 1102 is configured to modify the first data according to the first data modification message to obtain the second data.

The transceiver unit 1101 is also configured to send a first data synchronization message to the second node, where the first data synchronization message carries the second data, so that the second node performs data synchronization.

The transceiver unit 1101 is also configured to receive a first response message from the second node, where the first response message indicates the data synchronization result of the second node.

The processing unit 1102 is also configured to process the second data according to the first response message to obtain the first target data.

In a possible implementation, the first response message corresponds to fourth data in the second node, and the fourth data is data obtained after the second node performs data synchronization on the third data according to the first data synchronization message.

The processing unit 1102 is specifically configured to: if the first response message indicates that the content of the fourth data is synchronized to the content of the second data, Then it is determined that the content of the first target data is the same as the content of the second data; if the first response message indicates that the content of the fourth data is different from the content of the second data, then the content of the second data is updated to the content of the fourth data. , get the first target data.

In a possible implementation, the processing unit 1102 is also configured to set the value of the synchronization flag bit of the first node to a first value, and the first value indicates that the data stored in the first node is modified; The value of the synchronization flag bit of the node is updated to a second value, and the second value indicates that the data stored in the first node is synchronized with the data stored in the second node.

In a possible implementation, the transceiver unit 1101 is also used to obtain a second data synchronization message from the second node. The second data synchronization message instructs the first node to perform data synchronization. The second data synchronization message corresponds to the second data synchronization message. The fifth data stored in the second node is data obtained by the second node modifying the first historical data in the second node according to the second data modification message from the second client. The second client and the first client may be the same client or different clients, and the details are not limited here.

The processing unit 1102 is also configured to process the data currently stored in the first node according to the second data synchronization message and the first data status of the first node to obtain the first data.

In a possible implementation, the processing unit 1102 is specifically configured to, if the first data status indicates that the content of the data currently stored in the first node is the same as the content of the first historical data, then convert the content of the data currently stored in the first node to The content of the data is updated to the content of the fifth data to obtain the first data; if the first data status indicates that the content of the data currently stored in the first node is different from the content of the first historical data, and the priority of the first node is not high to the priority of the second node, then update the content of the data currently stored in the first node to the content of the fifth data to obtain the first data; if the first data status indicates that the content of the data currently stored in the first node is the same as The content of the first historical data is different, and the priority of the first node is higher than the priority of the second node, then it is determined that the content of the first data is the same as the content of the data currently stored in the first node.

In a possible implementation, the transceiver unit 1101 is also configured to send a second response message corresponding to the second data synchronization message to the second node, where the second response message indicates the data synchronization result of the first node.

In a possible implementation, the processing unit 1102 is further configured to, if the first node obtains the first data, set the value of the synchronization flag bit of the first node to a second value to indicate that the first node and the second The node's data has been synchronized.

In a possible implementation, the transceiver unit 1101 is also used to obtain a third data synchronization message from the second node. The first target data synchronization message instructs the first node to perform data synchronization. The first target data synchronization message corresponds to The sixth data stored in the second node is data obtained by the second node after modifying the second historical data in the second node according to the third data modification message from the third client.

The processing unit 1102 is also configured to process the first target data according to the third data synchronization message and the second data status of the first node to obtain the second target data. Among them, any two clients among the third client, the second client and the first client can also be different clients, and the details are not limited here.

In a possible implementation, the processing unit 1102 is specifically configured to update the content of the first target data to the sixth data if the second data status indicates that the content of the first target data is the same as the content of the second historical data. The content of the second target data is obtained; if the second data status indicates that the content of the first target data is different from the content of the second historical data, and the priority of the first node is not higher than the priority of the second node, then the The content of one target data is updated to the content of the sixth data to obtain the second target data; if the second data status indicates that the content of the first target data is different from the second historical data If the content is different and the priority of the first node is higher than the priority of the second node, it is determined that the content of the second target data is the same as the content of the first target data.

In a possible implementation, the transceiver unit 1101 is also configured to send a third response message corresponding to the third data synchronization message to the second node, where the third response message indicates the data synchronization result of the first node.

In a possible implementation, the processing unit 1102 is also configured to modify the data status of the first node if the first node obtains the second target data, and set the value of the synchronization flag bit to the second value to represent the second target data. The data of the first node and the second node have been synchronized.

In a possible implementation, the transceiver unit 1101 is also configured to send a fourth response message to the first client, where the fourth response message carries the first target data.

The network device 1100 can perform the operations performed by the second node in the embodiments shown in FIGS. 2 to 9 , which will not be described again here.

As shown in Figure 11, if the network device 1100 is the second node, the network device 1100 includes a transceiver unit 1101 and a processing unit 1102.

The transceiver unit 1101 is used to obtain a first data synchronization message from the first node. The first data synchronization message instructs the second node to perform data synchronization. The first data synchronization message corresponds to the second data in the first node. The second data synchronization message instructs the second node to perform data synchronization. The data is data obtained by the first node modifying the first data in the first node according to the first data modification message from the first client.

The processing unit 1102 is configured to process the third data stored in the second node according to the first data synchronization message and the first data status of the second node to obtain fourth data.

The transceiver unit 1101 is also configured to send a first response message to the first node. The first response message indicates the data synchronization result of the second node, so that the first node processes the second data to obtain the first target data according to the data synchronization result.

In a possible implementation, the processing unit 1102 is specifically configured to, if the first data status indicates that the content of the third data is the same as the content of the first data, change the content of the third data to Update the content of the second data to obtain the fourth data; if the first data status indicates that the content of the third data is different from the content of the first data, and the priority of the second node level is not higher than the priority level of the first node, then the content of the third data is updated to the content of the second data to obtain the fourth data.

In a possible implementation, the processing unit 1102 is specifically configured to: if the first data status indicates that the content of the third data is different from the content of the first data, and the priority of the second node is higher than the priority of the first node, it is determined that the content of the fourth data is the same as the content of the third data.

In a possible implementation, the processing unit 1102 is also configured to update the first data state to a second data state, where the second data state indicates the data of the second node and the first node. Synchronize.

In a possible implementation, the transceiver unit 1101 is also configured to obtain a second data modification message from the second client, where the second data modification message indicates modification of the first historical data stored in the second node. .

The processing unit 1102 is also configured to modify the first historical data according to the second data modification message to obtain fifth data.

The transceiver unit 1101 is also configured to send a second data synchronization message to the first node, so that the first node performs data synchronization on the data currently stored in the first node to obtain the first data; receiving from the The first node's Two response messages, the second response message indicates the data synchronization result of the first node.

The processing unit 1102 is also configured to process the fifth data according to the second response message.

In a possible implementation, the processing unit 1102 is specifically configured to maintain the content of the fifth data if the second response message indicates that the content of the first data is synchronized to the content of the fifth data. constant. If the second response message indicates that the content of the first data is different from the content of the fifth data, the content of the fifth data is updated to the content of the first data.

In a possible implementation, the transceiver unit 1101 is also configured to obtain a third data modification message from a third client, where the third data modification message indicates modification of the second historical data stored in the second node. .

The processing unit 1102 is also configured to modify the second historical data according to the third data modification message to obtain sixth data.

The transceiver unit 1101 is also configured to send a third data synchronization message to the first node, so that the first node performs data synchronization on the first target data to obtain the second target data; and receives a third data synchronization message from the first node. A third response message indicating the data synchronization result of the first node.

The processing unit 1102 is also configured to process the sixth data according to the third response message.

In a possible implementation, the processing unit 1102 is specifically configured to maintain the content of the sixth data if the third response message indicates that the content of the second target data is synchronized to the content of the sixth data. The content remains unchanged; if the third response message indicates that the content of the second target data is different from the content of the sixth data, then the content of the sixth data is updated to the content of the second target data.

The network device 1100 can perform the operations performed by the second node in the embodiments shown in FIGS. 2 to 10 , which will not be described again here.

Next, please refer to Figure 12, which is a schematic structural diagram of a network device provided by an embodiment of the present application.

The network device 1200 includes: a processor 1201 and a memory 1202. One or more application programs or data are stored in the memory 1202.

Among them, the memory 1202 may be volatile storage or persistent storage. The program stored in memory 1202 may include one or more modules, and each module may be used to perform a series of operations performed by network device 1200 . Furthermore, the processor 1201 can communicate with the memory 1202 to execute a series of instruction operations in the memory 1202 on the network device 1200 . The processor 1201 can be a central processing unit (CPU) or a single-core processor. In addition, it can also be other types of processors, such as a dual-core processor, and the details are not limited here.

The network device 1200 may also include one or more communication interfaces 1203, and one or more operating systems, such as Windows Server ^™ , MacOSX ^™ , Unix ^™ , Linux ^™ , FreeBSD ^™ , etc.

The network device 1200 can perform the operations performed by the first node or the second node in the embodiment shown in FIG. 2 to FIG. 9 , and the operations performed by the network device in the embodiment shown in FIG. 10 , which will not be described again here.

Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working processes of the systems, devices and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be described again here.

In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative, for example, the unit Division is only a logical functional division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. On the other hand, the coupling or direct coupling or communication connection between each other shown or discussed may be through some interfaces, and the indirect coupling or communication connection of the devices or units may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or they may be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application can be integrated into one processing unit, each unit can exist physically alone, or two or more units can be integrated into one unit. The above integrated units can be implemented in the form of hardware or software functional units.

If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or contributes to the existing technology, or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of this application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and other media that can store program code. .

Claims (25)

A data processing method, characterized in that the method is applied to the first node, and the method includes: Obtaining a first data modification message from the first client, the first data modification message indicating modification of the first data stored in the first node; Modify the first data according to the first data modification message to obtain second data; Send a first data synchronization message to the second node, where the first data synchronization message carries the second data, so that the second node performs data synchronization; Receive a first response message from the second node, the first response message indicating the data synchronization result of the second node; Process the second data according to the first response message to obtain first target data. The method of claim 1, wherein the first response message corresponds to fourth data in the second node, and the fourth data is synchronization of the second node according to the first data. The data obtained after the message synchronizes the third data; Processing the second data according to the first response message includes: If the first response message indicates that the content of the fourth data is synchronized to the content of the second data, it is determined that the content of the first target data is the same as the content of the second data; If the first response message indicates that the content of the fourth data is different from the content of the second data, update the content of the second data to the content of the fourth data to obtain the first target data. . The method according to claim 1 or 2, characterized in that, after modifying the first data, the method further includes: Set the value of the synchronization flag bit of the first node to a first value, the first value indicating that the data stored in the first node is modified; After obtaining the first target data, the method further includes: The value of the synchronization flag bit of the first node is updated to a second value, and the second value indicates that the data stored in the first node is synchronized with the data stored in the second node. The method according to any one of claims 1 to 3, characterized in that, before obtaining the first data modification message from the client, the method further includes: Obtain a second data synchronization message from the second node, the second data synchronization message instructs the first node to perform data synchronization, and the second data synchronization message corresponds to the first data stored in the second node. Five data, the fifth data is data obtained by the second node modifying the first historical data in the second node according to the second data modification message from the second client; According to the second data synchronization message and the first data status of the first node, the data currently stored in the first node is processed to obtain the first data. The method according to claim 4, characterized in that, according to the second data synchronization message and the first data status of the first node, the data currently stored in the first node is processed to obtain the The first data includes: If the first data status indicates that the content of the data currently stored in the first node is different from the first historical data have the same content, then update the content of the data currently stored in the first node to the content of the fifth data to obtain the first data; If the first data status indicates that the content of the data currently stored in the first node is different from the content of the first historical data, and the priority of the first node is not higher than the priority of the second node, level, then update the content of the data currently stored in the first node to the content of the fifth data to obtain the first data; If the first data status indicates that the content of the data currently stored in the first node is different from the content of the first historical data, and the priority of the first node is higher than the priority of the second node , then it is determined that the content of the first data is the same as the content of the data currently stored in the first node. The method according to claim 4 or 5, characterized in that, after obtaining the first data, the method further includes: A second response message corresponding to the second data synchronization message is sent to the second node, where the second response message indicates the data synchronization result of the first node. The method according to any one of claims 1 to 6, characterized in that, after obtaining the first target data, the method further includes: Obtain a third data synchronization message from the second node, the first target data synchronization message instructs the first node to perform data synchronization, and the first target data synchronization message corresponds to the data stored in the second node. The sixth data, the sixth data is the data obtained by the second node modifying the second historical data in the second node according to the third data modification message from the third client; According to the third data synchronization message and the second data status of the first node, the first target data is processed to obtain second target data. The method of claim 7, wherein the first target data is processed according to the third data synchronization message and the second data status of the first node to obtain the second target data. ,include: If the second data status indicates that the content of the first target data is the same as the content of the second historical data, then the content of the first target data is updated to the content of the sixth data to obtain the Second target data; If the second data status indicates that the content of the first target data is different from the content of the second historical data, and the priority of the first node is not higher than the priority of the second node, then The content of the first target data is updated to the content of the sixth data to obtain the second target data; If the second data status indicates that the content of the first target data is different from the content of the second historical data, and the priority of the first node is higher than the priority of the second node, it is determined that the The content of the second target data is the same as the content of the first target data. The method according to claim 7 or 8, characterized in that, after obtaining the second target data, the method further includes: A third response message corresponding to the third data synchronization message is sent to the second node, where the third response message indicates the data synchronization result of the first node. The method according to any one of claims 1 to 9, characterized in that, after obtaining the first target data, the method further includes: Send a fourth response message to the first client, where the fourth response message carries the first target data. A data processing method, characterized in that the method is applied to the second node, and the method includes: Obtaining a first data synchronization message from the first node, the first data synchronization message instructs the second node to perform data synchronization, and the first data synchronization message corresponds to the second data in the first node, The second data is data obtained by the first node modifying the first data in the first node according to the first data modification message from the first client; Process the third data stored in the second node according to the first data synchronization message and the first data status of the second node to obtain fourth data; Send a first response message to the first node, the first response message indicating the data synchronization result of the second node, so that the first node processes the second data according to the data synchronization result to obtain First target data. The method according to claim 11, characterized in that, according to the first data synchronization message and the first data status of the second node, the third data stored in the second node is processed to obtain the third data. Four data, including: If the first data status indicates that the content of the third data is the same as the content of the first data, then the content of the third data is updated to the content of the second data to obtain the fourth data. ; If the first data status indicates that the content of the third data is different from the content of the first data, and the priority of the second node is not higher than the priority of the first node, then the The content of the third data is updated to the content of the second data, and the fourth data is obtained. The method according to claim 11, characterized in that, according to the first data synchronization message and the first data status of the second node, the third data stored in the second node is processed to obtain the third data. Four data, including: If the first data status indicates that the content of the third data is different from the content of the first data, and the priority of the second node is higher than the priority of the first node, it is determined that the third data The content of the fourth data is the same as the content of the third data. The method according to any one of claims 11 to 13, characterized in that, after obtaining the fourth data, the method further includes: The first data state is updated to a second data state, the second data state indicates data synchronization of the second node and the first node. The method according to any one of claims 11 to 14, characterized in that, before obtaining the first data synchronization message from the first node, the method further includes: Obtaining a second data modification message from the second client, the second data modification message indicating modification of the first historical data stored in the second node; Modify the first historical data according to the second data modification message to obtain fifth data; Send a second data synchronization message to the first node, so that the first node performs data synchronization on the data currently stored in the first node to obtain the first data; Receive a second response message from the first node, the second response message indicating the data synchronization result of the first node; The fifth data is processed according to the second response message. The method of claim 15, wherein processing the fifth data according to the second response message includes: If the second response message indicates that the content of the first data is synchronized to the content of the fifth data, then the content of the fifth data remains unchanged; If the second response message indicates that the content of the first data is different from the content of the fifth data, the content of the fifth data is updated to the content of the first data. The method according to any one of claims 11 to 16, characterized in that, after sending the first response message to the first node, the method further includes: Obtaining a third data modification message from a third client, the third data modification message indicating modification of the second historical data stored in the second node; Modify the second historical data according to the third data modification message to obtain sixth data; Send a third data synchronization message to the first node, so that the first node performs data synchronization on the first target data to obtain the second target data; Receive a third response message from the first node, the third response message indicating the data synchronization result of the first node; The sixth data is processed according to the third response message. The method of claim 17, wherein processing the sixth data according to the third response message includes: If the third response message indicates that the content of the second target data is synchronized to the content of the sixth data, then the content of the sixth data remains unchanged; If the third response message indicates that the content of the second target data is different from the content of the sixth data, the content of the sixth data is updated to the content of the second target data. A communication system, characterized in that the method communication system includes a first node and a second node, the first node is used to execute the method according to any one of claims 1 to 10, and the second node For performing the method of any one of claims 11 to 18. A network device, characterized in that the network device is a first node, including: A transceiver unit configured to obtain a first data modification message from the first client, where the first data modification message indicates modification of the first data stored in the first node; A processing unit configured to modify the first data according to the first data modification message to obtain second data; The transceiver unit is also configured to send a first data synchronization message to a second node, where the first data synchronization message carries the second data, so that the second node performs data synchronization; The transceiver unit is also configured to receive a first response message from the second node, where the first response message indicates the data synchronization result of the second node; The processing unit is further configured to process the second data according to the first response message to obtain first target data. A network device, characterized in that the network device is a second node, including: A transceiver unit configured to obtain a first data synchronization message from a first node, the first data synchronization message instructs the second node to perform data synchronization, and the first data synchronization message corresponds to the first data synchronization message in the first node. the second data, the second data is the first node modifying the first data according to the first data modification message from the first client The data obtained after modifying the first data in; A processing unit configured to process the third data stored in the second node according to the first data synchronization message and the first data status of the second node to obtain fourth data; The transceiver unit is also configured to send a first response message to the first node, where the first response message indicates the data synchronization result of the second node, so that the first node can , process the second data to obtain the first target data. A network device, characterized by including: a processor, a memory and a communication interface; The processor, the memory and the communication interface are connected; The processor is configured to perform the method according to any one of claims 1 to 10. A network device, characterized by including: a processor, a memory and a communication interface; The processor, the memory and the communication interface are connected; The processor is configured to perform the method according to any one of claims 11 to 18. A computer-readable storage medium, characterized in that the computer-readable storage medium stores instructions. When the instructions are run on a computer, the computer is caused to execute the method described in any one of claims 1 to 18. method. A computer program product, characterized in that, when the computer program product is executed on a computer, the computer executes the method according to any one of claims 1 to 18.