A data synchronization method in heterogeneous multi-channel network

Abstract

The present invention provides a data synchronization method in a heterogeneous multi-channel network, which is used for data synchronization between nodes in a heterogeneous multi-channel network. The method first performs bidirectional neighbor discovery on the node interconnection channel, and performs multi-channel management from the perspective of neighbors. When a neighbor relationship is first established, all contents in the synchronization database are sent to the neighbor node; in the subsequent bidirectional neighbor maintenance phase, only the summary of the synchronization database of this node is included in the neighbor detection packet; if the summary information received by the neighbor node is inconsistent with its local storage, the request information is carried in the next neighbor detection packet; when the node receives the neighbor detection packet containing the request information, the synchronization database content is sent to the optimal channel of the neighbor. When the node establishes a neighbor relationship on a new channel, the synchronization database is no longer sent. The present invention reduces the bandwidth occupancy of data synchronization in a heterogeneous multi-channel network and avoids the avalanche effect caused by retransmission when the channel is unstable.

Description

Technical Field

[0001] The invention relates to a data synchronization method in a heterogeneous multi-channel network, which is used for data synchronization between nodes in the heterogeneous multi-channel network and belongs to the field of network communication. Background Art

[0002] In existing communication networks, in order to improve reliability, communication nodes are sometimes interconnected through various communication means, such as satellites, microwaves, high-speed stations, etc. The link properties of different channels vary greatly, and each node is cross-covered and networked through the above means, forming a typical heterogeneous multi-channel network. In addition, in order to meet the requirements of network control and situational awareness, communication nodes need to be able to collect node information such as interface traffic and synchronize the entire network. If the existing data synchronization method (such as the flooding diffusion mechanism of the OSPF protocol) is directly used for data synchronization in heterogeneous multi-channel networks, the existence of multiple channels between nodes will lead to a waste of bandwidth for data synchronization. In addition, when the confirmation retransmission mechanism of the OSPF protocol is applied to wireless networks, it may also cause an avalanche effect due to channel instability. Summary of the invention

[0003] In view of this, the present invention provides a data synchronization method in a heterogeneous multi-channel network environment, which cancels the active timeout retransmission mechanism, reduces the bandwidth occupancy of data synchronization in the heterogeneous multi-channel network to a certain extent, and avoids the avalanche effect caused by retransmission when the channel is unstable.

[0004] The technical problem to be solved by the present invention is achieved by the following technical solutions:

[0005] A data synchronization method in a heterogeneous multi-channel network comprises the following steps:

[0006] Step A: perform bidirectional neighbor discovery on the channel interface of the node, and perform multi-channel management between nodes from the perspective of neighbors;

[0007] Step B: When two adjacent nodes M and N complete bidirectional neighbor discovery on a certain interconnection channel K, first determine whether a neighbor relationship has been formed on other channels. If so, execute step C; otherwise, set channel K as the optimal channel for neighbor N and execute step D;

[0008] Step C, performing optimal channel selection of neighbor node N on node M, and determining whether the local synchronization database has been sent on other channels, if so, the method ends, otherwise, executing step D;

[0009] Step D: Node M sends all the contents in the synchronization database to node N and records them in the neighbor structure;

[0010] Step E: After receiving the synchronized database content from node M, node N calculates a summary of the content and merges the database content into the local database;

[0011] Step F: In the subsequent two-way neighbor maintenance phase, node M only includes the corresponding local node synchronization database summary in the neighbor detection packet;

[0012] Step G: If node N finds that the synchronization database summary of node M is inconsistent with the locally stored one when parsing the neighbor detection packet of node M, it will piggyback on the request for the latest synchronization database in the next neighbor detection packet sent;

[0013] Step H: When node M receives a neighbor detection packet with a request, it sends a node synchronization database to the optimal channel where the neighbor is located;

[0014] Step I: When a node generates or receives new data to be synchronized and needs to be flooded, it encapsulates it into an incremental update message and sends it to the optimal channel of each neighbor of the node, and updates the summary information of the local synchronization database at the same time;

[0015] Step J: When the node M and the node N lose the bidirectional neighbor relationship on a certain channel K, the neighbor optimal channel election process is re-executed.

[0016] Furthermore, in step A, bidirectional neighbor discovery means that when a node sends a neighbor detection packet, the packet content is accompanied by the device identifiers of all other nodes that the node can detect. When a neighbor detection packet is received from a neighbor node and the device identifiers of other nodes in the packet contain the node, it means that the node and the neighbor node are in the receiving channel.

[0017] A two-way neighbor relationship is formed.

[0018] Furthermore, in step A, the neighbor structure includes the device identifier of the neighbor, a list of all channel interfaces for discovering the neighbor, an optimal channel interface, a flag indicating whether to send the local synchronization database, and a sending time.

[0019] Furthermore, in step C, the optimal channel selection method for the neighbor is to traverse each channel interface of neighbor N, and obtain the channel delay, rated bandwidth, and used bandwidth information of the interface, and comprehensively select a link with small channel delay, large rated bandwidth, and low link load as the optimal channel for the neighbor.

[0020] Furthermore, in step D and step H, when the synchronous data is sent on the optimal channel of neighbor N, first check whether the synchronous data has been attached to the sending buffer of the optimal channel interface. If so, it will not be attached again; otherwise, the synchronous data will be attached to the sending buffer of the optimal channel interface, marked, and the sending will be started.

[0021] Furthermore, the channel usage is collected through periodic query or reporting by the channel device to obtain the used bandwidth information of the channel, and the ratio of the used bandwidth of the channel to the rated bandwidth is calculated. When the ratio is greater than or less than a preset value, the neighbor optimal channel election process is triggered.

[0022] Compared with the prior art, the present invention has the following beneficial effects:

[0023] The data synchronization method in a heterogeneous multi-channel network of the present invention reduces the bandwidth occupancy of data synchronization in a heterogeneous multi-channel network to a certain extent by transforming the neighbor structure, adding an optimal channel election mechanism, optimizing the synchronous data sending process in the heterogeneous multi-channel network, and avoiding the avalanche effect caused by retransmission when the channel is unstable. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1 It is a schematic diagram of the node neighbor structure organization relationship and neighbor structure of the data synchronization method in a heterogeneous multi-channel network in an embodiment of the present invention.

[0025] Figure 2 It is a schematic diagram of a heterogeneous multi-channel network environment of a data synchronization method under a heterogeneous multi-channel network in an embodiment of the present invention. Implementation

[0026] The present invention is further described below in conjunction with the accompanying drawings and specific embodiments.

[0027] A data synchronization method in a heterogeneous multi-channel network comprises the following steps:

[0028] Step A: Perform neighbor multi-channel management from the perspective of neighbors. The neighbor organization and neighbor structure of the node are as follows: Figure 1 As shown. Each communication node holds a neighbor list, and each element of the neighbor list is a neighbor structure; bidirectional neighbor discovery means that when a node sends a neighbor detection packet, the packet content is accompanied by the device identifiers of all other nodes that the node can detect. When a neighbor detection packet is received from a neighbor node and the device identifiers of other nodes in the packet contain this node, it means that this node and the neighbor node have formed a bidirectional neighbor relationship on the receiving channel. The device identifier can be a device ID or a core address of the device, etc. The neighbor structure contains the neighbor's router ID, a list of all channel interfaces that discover the neighbor, the optimal channel interface, a flag to indicate whether to send a local synchronization database, and the sending time, etc.

[0029] Step B: Figure 2Taking the heterogeneous multi-channel network environment as an example, nodes A, B, C and D are interconnected through satellite and microwave channels, and node D is interconnected with nodes E and F through microwave channels. Node A and node D perform neighbor discovery processes on microwave and satellite channels respectively. Taking the microwave channel as an example, node A first sends a neighbor detection packet, that is, a Hello packet. The sender is the device identifier of node A and the list of discovered neighbor device identifiers carried in the packet content is empty; when node D receives the Hello packet sent by node A, it creates a neighbor structure and stores the microwave channel interface in the interface list. When node D sends a Hello packet in the next Hello cycle, the list of discovered neighbor device identifiers carried in its Hello packet content is filled with the device identifier of node A; when node A receives the Hello packet from node D again, the other node device identifiers in the packet contain node A, and a bidirectional neighbor relationship is formed at this time. When node A and node D complete bidirectional neighbor discovery on a satellite channel, first determine whether a neighbor relationship has been formed on the microwave channel. If so, execute step C; otherwise, set the satellite channel as the optimal channel for neighbor D and execute step D.

[0030] Step C, indicating that node A and node D have formed a two-way neighbor relationship on the microwave channel, then node A and node D are interconnected through two channels at this time, so the optimal channel election is performed for neighbor node D on node A, and it is determined whether the local synchronization database has been sent on the microwave channel. If so, the method ends, otherwise execute step D; the optimal channel election method for the neighbor is to traverse each channel interface of neighbor N, and obtain the channel delay, rated bandwidth, and used bandwidth information of the interface, and comprehensively select the link with small channel delay, large rated bandwidth, and low link load as the optimal channel for the neighbor. The used bandwidth information of the channel can be obtained through periodic query or by collecting the channel usage through reporting by the channel device, and the ratio of the channel used bandwidth to the rated bandwidth is calculated. When the ratio is greater than or less than a certain value, the neighbor optimal channel election process is triggered.

[0031] Step D, node A sends all the contents in the synchronization database to node D through the optimal channel, i.e., the microwave channel, and records them in the neighbor structure; when sending the synchronization data, first check whether the synchronization data has been attached to the sending buffer of the microwave channel interface. If so, it will not be attached again; otherwise, the synchronization data will be attached to the sending buffer of the microwave channel interface, marked, and the sending will be started.

[0032] Step E: After receiving the synchronized database content from node A, node D calculates a summary of the content and merges the database content into the local database.

[0033] Step F: In the subsequent two-way neighbor maintenance phase, node A only includes the corresponding local node synchronization database summary in the neighbor detection packet.

[0034] Step G: If node D finds that the synchronization database summary of node A is inconsistent with the locally stored one when parsing the neighbor detection packet of node A, it will piggyback a request for the latest synchronization database of node A in the next neighbor detection packet to be sent.

[0035] Step H: When node A receives the neighbor detection packet with a request sent by node D, node A sends the node synchronization database to the optimal channel where neighbor node D is located, that is, the microwave channel.

[0036] Step I: When node A has new data to be synchronized and needs to be flooded, it is encapsulated as an incremental update message and sent to the optimal channel of each neighbor of node A, namely the microwave channel, and the summary information of the local synchronization database is updated at the same time; when node D receives the incremental update message from node A, it continues to send incremental update messages to nodes E and F, and updates the summary information of the local synchronization database at the same time.

[0037] Step J: When node A and node D lose the bidirectional neighbor relationship on a certain microwave channel, the neighbor optimal channel election process is re-executed.

[0038] The optimal channel selection method for a neighbor is to traverse each channel interface of neighbor N, obtain the channel delay, rated bandwidth, and used bandwidth information of the interface, and comprehensively select a link with small channel delay, large rated bandwidth, and low link load as the optimal channel for the neighbor. In this example, the microwave channel is judged to be more optimal based on the channel delay, bandwidth, and link load, so synchronization information is sent to the microwave channel instead of the satellite channel.

[0039] The used bandwidth information of the channel is collected periodically or reported actively by the channel, and a custom threshold is set based on the ratio of used bandwidth to rated bandwidth. For example, when the ratio is greater than 85%, between 30% and 85%, and less than 30%, the neighbor optimal channel selection process is triggered.

[0040] In summary, the present invention first performs two-way neighbor discovery on the node interconnection channel, and performs multi-channel management from the perspective of neighbors. When the neighbor relationship is first established, all contents in the synchronization database are sent to the neighbor node; in the subsequent two-way neighbor maintenance phase, only the summary of the synchronization database of this node is included in the neighbor detection packet; if the summary information received by the neighbor node is inconsistent with its local storage, the request information is carried in the next neighbor detection packet; when the node receives the neighbor detection packet containing the request information, it sends the synchronization database content to the optimal channel of the neighbor. When the node establishes a neighbor relationship on a new channel, the synchronization database is no longer sent. The present invention reduces the bandwidth occupancy of data synchronization in heterogeneous multi-channel networks and avoids the avalanche effect caused by retransmission when the channel is unstable.

[0041] The above contents are further detailed descriptions of the present invention in combination with specific preferred implementations and application scenarios, and it cannot be determined that the specific implementation of the present invention is limited to these descriptions. For a general technician in the technical field of the present invention, several simple deductions or substitutions can be made without departing from the concept of the present invention, which should be regarded as falling within the scope of protection of the present invention.

Claims

1. A data synchronization method in a heterogeneous multi-channel network, characterized in that: The following steps are involved: Step A: perform bidirectional neighbor discovery on the channel interface of the node, and perform multi-channel management between nodes from the perspective of neighbors; Step B: When two adjacent nodes M and N complete bidirectional neighbor discovery on a certain interconnection channel K, first determine whether a neighbor relationship has been formed on other channels. If so, execute step C; otherwise, set channel K as the optimal channel for neighbor N and execute step D; Step C, performing optimal channel selection of neighbor node N on node M, and determining whether the local synchronization database has been sent on other channels, if so, the method ends, otherwise, executing step D; Step D: Node M sends all the contents in the synchronization database to node N and records them in the neighbor structure; Step E: After receiving the synchronized database content from node M, node N calculates a summary of the content and merges the database content into the local database; Step F: In the subsequent two-way neighbor maintenance phase, node M only includes the corresponding local node synchronization database summary in the neighbor detection packet; Step G: If node N finds that the synchronization database summary of node M is inconsistent with the locally stored one when parsing the neighbor detection packet of node M, it will piggyback on the request for the latest synchronization database in the next neighbor detection packet sent; Step H: When node M receives a neighbor detection packet with a request, it sends a node synchronization database to the optimal channel where the neighbor is located; Step I: When a node generates or receives new data to be synchronized and needs to be flooded, it encapsulates it into an incremental update message and sends it to the optimal channel of each neighbor of the node, and updates the summary information of the local synchronization database at the same time; Step J: When the node M and the node N lose the bidirectional neighbor relationship on a certain channel K, the neighbor optimal channel election process is re-executed.

2. According to the data synchronization method in a heterogeneous multi-channel network as described in claim 1, it is characterized in that: In step A, bidirectional neighbor discovery means that when a node sends a neighbor detection packet, the packet content is accompanied by the device identifiers of all other nodes that the node can detect. When a neighbor detection packet is received from a neighbor node and the device identifiers of other nodes in the packet contain this node, it means that this node and the neighbor node have formed a bidirectional neighbor relationship on the receiving channel.

3. According to the data synchronization method in a heterogeneous multi-channel network as described in claim 1, it is characterized in that: In step A, the neighbor structure includes the neighbor's device identifier, a list of all channel interfaces for discovering the neighbor, the optimal channel interface, a flag indicating whether to send the local synchronization database, and the sending time.

4. The data synchronization method in a heterogeneous multi-channel network according to claim 1, characterized in that: In step D and step H, when the synchronous data is sent on the optimal channel of neighbor N, first check whether the synchronous data has been attached to the sending buffer of the optimal channel interface. If so, it will not be attached again; otherwise, the synchronous data will be attached to the sending buffer of the optimal channel interface, marked, and the sending will be started.

5. A data synchronization method in a heterogeneous multi-channel network according to claim 4, characterized in that: The channel usage is collected through periodic query or reporting by channel equipment to obtain the used bandwidth information of the channel, and the ratio of the used bandwidth of the channel to the rated bandwidth is calculated. When the ratio is greater than or less than the preset value, the neighbor optimal channel election process is triggered.

Images