Smart power grid-oriented cluster state synchronization method and system
By dividing autonomous regions in the smart grid and establishing synchronization paths, monitoring connection mode and heartbeat information, and optimizing state synchronization operations, the impact of network connection changes in the smart grid on cluster state synchronization is solved, performance and availability are improved, and fault recovery is reduced Overhead and maintenance operations.
Patent Information
- Application Number
- CN202411256873.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-09
- Publication Date
- 2024-12-31
- Estimated Expiration
- 2044-09-09
AI Technical Summary
In the smart grid edge network environment, frequent changes in network connection mode and delays lead to the impact of cluster state synchronization performance and availability. The existing methods have failed to effectively deal with periodic network interruptions and connection mode mutations, introducing unnecessary failure recovery overhead and Frequent nodes are online and offline.
By obtaining network delay information between nodes, dividing autonomous regions, establishing synchronization paths, monitoring connection modes and heartbeat information, using exponential concession mechanisms and data synchronization topology, optimizing state synchronization operations, adapting to network delays and connection changes, and reducing failure recovery Overhead and maintenance operations.
It effectively reduces the impact of network delay and connection mode mutations on cluster state synchronization, improves performance and availability, reduces the space occupation when maintaining synchronous state, quickly perceives and adapts to new topology and connection modes, and improves the cluster's state synchronization performance.
Smart Images

Figure CN119232735A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of edge computing technology, and in particular to a cluster state synchronization method and system for a smart grid. Background Art
[0002] With the increasing popularity of edge computing concepts and smart terminal devices, the collaborative integration of "cloud-edge-end" has become a hot topic and is widely used to support typical application scenarios such as smart grids. At present, there are a large number of fixedly deployed edge computing servers and massive sensors such as smart meters in smart grid scenarios. At the same time, there are a large number of equipment such as patrol drones and operation and maintenance robots that need to move periodically to support applications such as routine inspections and status monitoring alarms. In such applications, task allocation and scheduling are completed based on the status information of the edge cluster, thereby efficiently utilizing edge computing resources. For example, information such as the available computing power, available memory, and available disk space of each node in the edge cluster needs to be aggregated to certain decision nodes in the cluster, and data such as the calculation results of the edge computing nodes needs to be synchronized within a specific range to support task scheduling and allocation.
[0003] However, in the edge network environment of smart grids, network connection modes and network delays may change frequently, and cluster state synchronization faces challenges. Edge environments usually do not have stable wired or wireless network connections, and periodic and intermittent network connection interruptions may occur during the execution of some tasks, resulting in network partitioning becoming the norm. For example, when performing maintenance tasks such as line patrol, operation and maintenance drones cannot always maintain connection with the ground cluster. In each cycle, only part of the connection window may be able to exchange data with the ground cluster. However, existing methods such as data distribution, state synchronization, and data consistency assurance usually regard network partitioning as an abnormal situation equivalent to node failure, and use sequential or eventual consistency assurance mechanisms to deal with this failure scenario, introducing unnecessary failure recovery overhead; on the other hand, since existing methods fail to fully consider the periodic characteristics of network interruptions, they may introduce frequent and unnecessary node online, offline, cluster topology maintenance and other node life cycle related operations, which may have a significant impact on cluster performance and availability.
[0004] In summary, there is an urgent need for a cluster state synchronization method and system for smart grids. According to the characteristics of the smart grid edge network, the corresponding node, cluster topology and network connection mode discovery and maintenance mechanism should be designed, the characteristics of the periodic network connection of the nodes in the network should be perceived, and the cluster should be guided to perform state synchronization operations at the appropriate time to reduce the impact of network delays and connection mode mutations, and improve the performance and availability of cluster state synchronization. Summary of the invention
[0005] The purpose of the present invention is to propose a cluster state synchronization method and system for smart grids to solve the performance and availability problems of cluster state synchronization caused by network connection mode and delay mutation in edge network environment.
[0006] The technical solution adopted by the present invention to achieve the above-mentioned purpose is as follows:
[0007] A cluster state synchronization method for a smart grid, wherein the cluster includes a management node and multiple working nodes, and the method includes the following steps:
[0008] Get network delay information between all nodes;
[0009] According to the obtained network delay information, multiple nodes whose network delays are less than a preset threshold are divided into the same autonomous area; for any two autonomous areas, the two nodes with the smallest network delays belonging to the two autonomous areas are used as seed nodes;
[0010] Establishing synchronization paths between the management node, the seed node, and neighboring nodes in the same autonomous area of the seed node;
[0011] Monitor the connection patterns between the autonomous regions and determine the connection windows between the autonomous region where the management node is located and other autonomous regions;
[0012] The seed nodes in each autonomous region obtain the status information of other nodes in the same autonomous region. Within the above connection window, the seed nodes transmit all the status information of the autonomous region to the management node along the synchronization path to complete the cluster status synchronization;
[0013] All status information obtained through management node output.
[0014] Furthermore, the management node collects the heartbeat information of all nodes in the autonomous area through the seed node, extracts features from the heartbeat information, obtains the interval and period of each heartbeat information, and determines the node survival and connection periodicity; then maintains a bitmap of heartbeat information for each autonomous area, and the survival of each node is marked with a binary bit; for disconnected autonomous areas, a binary bit is used to mark the survival of the entire area.
[0015] Furthermore, for nodes that fail within the connection window, first determine the connectivity from the failed node's neighboring nodes to other nodes in the autonomous region where the failed node is located, and confirm the failure range; for single-node failure, its neighboring nodes use a fixed interval to send heartbeat detection packets to the failed node, and the management node uses an exponential back-off mechanism to detect the health status of the failed node and obtain the connection window from the management node to the autonomous region; for multiple-node failures, obtain the connection window size of the autonomous region where the node is located, with 0.1 times the connection window size as the initial interval. When the time to the next connection window is less than 1 / 3 of the interval between the two connection windows, reduce the detection interval to 0.02 times the connection window size until a connection window is detected to restore the connection with the failed node.
[0016] Furthermore, the same mark is set for nodes whose network delay is less than a preset threshold, and the autonomous region is divided according to the set mark; for failed nodes, they are added to the autonomous region divided last time. If the autonomous region divided last time does not exist, they are added to the autonomous region to which the random neighbor node belongs, and the autonomous region allocation of all nodes is completed.
[0017] Furthermore, for every two autonomous regions, the connectivity data of the seed nodes is obtained every fixed time window, and the average delay and delay variance in the past time window are continuously recorded; when the average delay and delay variance deviate from the average value of the past time window by more than a preset threshold, the time period when the last network delay was stable is recorded as the connection window of the two autonomous regions.
[0018] Furthermore, a data synchronization topology is created for each autonomous region, and a spanning tree is constructed with the management node that initiates state synchronization as the root node, and the seed nodes of the autonomous region as its child nodes; the neighbor nodes of the seed nodes are used as the lower-level child nodes of the seed nodes in the spanning tree to form a complete synchronization path.
[0019] Further, when two autonomous areas are located in a connection window, the two autonomous areas are regarded as the same autonomous area and a synchronization path is generated to perform data exchange within the connection window.
[0020] Furthermore, the most recent state information snapshot is saved through the seed node, and the synchronization progress is recorded; when the state synchronization is performed within the connection window, the synchronization progress is updated.
[0021] Furthermore, when it is impossible to connect to the corresponding autonomous area within the connection window, all unsent state information is merged and state synchronization is attempted again in the next connection window.
[0022] A cluster state synchronization system for smart grids, wherein the cluster includes a management node and multiple working nodes, and the system includes: an agent module deployed on the working node, and a node management module, a cluster management module, a topology management module and a state management module deployed on the management node; wherein:
[0023] The proxy module is responsible for obtaining network delay information between all nodes;
[0024] The node management module is responsible for monitoring the survival status and network delay information of all nodes;
[0025] The cluster management module is responsible for dividing multiple nodes whose network delays are less than a preset threshold into the same autonomous region based on the acquired network delay information; for any two autonomous regions, the two nodes with the smallest network delay belonging to the two autonomous regions are used as seed nodes; monitoring the connection mode between each autonomous region, and determining the connection window between the autonomous region where the management node is located and other autonomous regions;
[0026] The topology management module is responsible for establishing synchronization paths between management nodes, seed nodes, and neighboring nodes in the same autonomous area of the seed nodes;
[0027] The state management module is responsible for the seed nodes in each autonomous area to obtain the state information of their neighbor nodes. Within the above connection window, the seed node, as a working node, transmits all the state information of itself and its neighbor nodes to the management node along the synchronization path to complete the cluster state synchronization, and outputs all the obtained state information through the management node.
[0028] Compared with the prior art, the present invention has the following advantages:
[0029] 1. For scenarios where edge nodes and small clusters (i.e., autonomous regions) are regularly disconnected in smart grid scenarios, it can effectively reduce fault recovery overhead to improve cluster state synchronization performance;
[0030] 2. When there are many states to be synchronized and they are piled up, the present invention can effectively reduce the space occupied when maintaining the synchronization state through state information snapshots and improved fault tolerance mechanisms, thereby improving cluster state synchronization performance;
[0031] 3. When the connection status changes, the method proposed by the present invention can quickly perceive and adapt to the new cluster topology and connection mode, thereby improving cluster availability. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Figure 1 A module architecture diagram of a cluster state synchronization system for a smart grid in an embodiment;
[0033] Figure 2It is a deployment diagram of a cluster state synchronization system for a smart grid in an embodiment. DETAILED DESCRIPTION
[0034] In order to make the various technical features and advantages or technical effects in the above technical solutions of the present invention more obvious and easy to understand, they are described in detail below with reference to the accompanying drawings.
[0035] The embodiment of the present invention provides a cluster state synchronization method and system for smart grid. The module composition of the system is as follows: Figure 1 As shown in the figure, it mainly includes cluster management module, node management module, topology management module, state management module and agent module. The deployment, main responsibilities and interaction methods of each module mainly include:
[0036] The cluster consists of management nodes and working nodes. The cluster status is synchronized between working nodes. The cluster management module, node management module, topology management module and status management module are deployed on the management node, and the proxy module is deployed on the working node.
[0037] The proxy module interacts with the state management module and the node management module, and is responsible for reporting network status information such as the network delay of each node in the cluster, and performing specific cluster status synchronization tasks;
[0038] The node management module interacts with the cluster management module, topology management module, and proxy module, and is responsible for maintaining the global view of the nodes in the cluster and performing node lifecycle management;
[0039] The cluster management module interacts with the node management module and the topology management module. It is responsible for determining the autonomous region based on the current and historical network connection status of the cluster and maintaining basic information such as the connection window of each autonomous region in the cluster. An autonomous region is a small cluster in the cluster with a stable network topology and interconnected nodes.
[0040] The topology management module interacts with the cluster management module and the node management module, and is responsible for recording and maintaining the connectivity of each node in the cluster, and determining the node status synchronization path based on the node connection mode;
[0041] The state management module maintains the latest state in the cluster and interacts with the topology management module and the proxy module to complete cluster state synchronization based on the current network connectivity and mode triggers;
[0042] Users or upper-level applications interact with the status management module to define the status information that needs to be monitored and synchronized, and obtain the latest status of the cluster.
[0043] As a preferred implementation, the specific steps performed by the proxy module are as follows:
[0044] 1) Regularly detect the network delay between the current node and neighboring nodes and report it to the node management module;
[0045] 2) Continue to try to establish a connection with the management node. When the connection window with the management node is entered and the connection is successfully established, it interacts with the cluster management module and the node management module to report the network delay and obtain the autonomous area where the current node is located;
[0046] 3) If it is a seed node, it is also responsible for collecting status, merging status, and forwarding status to other autonomous regions;
[0047] 4) If it is not a seed node, it obtains the status information that needs to be synchronized from the seed node and sends its own status;
[0048] 5) Continue to execute steps 1) to 4) to complete state synchronization.
[0049] As a preferred implementation, the specific steps performed by the node management module are as follows:
[0050] 1) Interact with the topology management module to obtain the current node connectivity;
[0051] 2) Interact with the cluster management module to obtain the current autonomous area division;
[0052] 3) Interact with the proxy module on the autonomous region seed node to continuously collect the heartbeat information of all nodes in each autonomous region;
[0053] 4) Extract features from the heartbeat information, obtain the interval and period of each heartbeat information, and judge the node viability and connection periodicity;
[0054] 5) A bitmap of heartbeat information is maintained for each autonomous region, and the entire disconnected autonomous region is marked with one binary bit to reduce space usage;
[0055] 6) For nodes that are within the connection window but fail due to a fault or network partition, first determine the connectivity from the failed node's neighbor nodes to other nodes in the autonomous region where the failed node is located to confirm the failure scope;
[0056] 7) In the case of single node failure, its neighbor nodes send heartbeat detection packets to the failed node at fixed intervals; the management node uses an improved exponential back-off mechanism to detect the health status of the failed node, interacts with the cluster management module to obtain the connection window from the management node to the autonomous area, and sends heartbeat detection packets to the failed node starting at 100 millisecond intervals. When a timeout is detected, the next retry interval is twice the previous one, and the maximum retry interval is 0.5 times the connection window size.
[0057] 8) For multi-node failures, first interact with the cluster management module to obtain the connection window size of the autonomous area where the node is located, and use 0.1 times the connection window size as the initial interval. When the time to the next connection window is less than one-third of the interval between two connection windows, reduce the detection interval to 0.02 times the connection window to restore the connection with the failed node in the next connection window as much as possible;
[0058] 9. Repeat steps 1) to 8) to continuously record the global view and life cycle information of the node for use by other modules.
[0059] As a preferred implementation, the specific steps performed by the cluster management module are as follows:
[0060] 1) Interact with the node management module to obtain the node list and the inter-node delay data reported by the proxy module;
[0061] 2) Interact with the topology management module to obtain the connectivity data of the nodes;
[0062] 3) For each surviving node in the node list, determine the delay from the node to its neighboring node;
[0063] 4) When the delay between two nodes is less than a specific threshold, that is, when the physical distance between the two nodes is close, they are considered to be in the same autonomous region. When the two nodes do not have autonomous region marks, autonomous region marks are set for the two nodes. Otherwise, the two nodes and the nodes with the same autonomous region mark as the two nodes are set to the same mark;
[0064] 5) Repeat steps 3) to 4) to set an autonomous region mark for each node, and preliminarily complete the autonomous region division;
[0065] 6) For failed nodes, add them to the autonomous region of the previous round. If there is no autonomous region in the previous round, add them to the autonomous region of the random neighbor node. So far, the autonomous region allocation of all nodes is completed;
[0066] 7) For each autonomous region, compare the delay from the surviving nodes in the autonomous region to the nodes outside the autonomous region, and select the two points with the smaller delay as the seed nodes between the two autonomous regions;
[0067] 8) Traverse all autonomous regions found in step 5) in turn, and determine the seed nodes from each autonomous region to other autonomous regions;
[0068] 9) For every two autonomous areas, obtain the seed node connectivity data from the topology management module every fixed time window, and continuously record the average delay and delay variance in the past time window;
[0069] 10) When the average delay and delay variance change suddenly, record the time period when the delay was stable last time as the connection window of the two autonomous regions;
[0070] 11) Repeat steps 1) to 10) to continuously update the connection mode and autonomous area for use by other modules.
[0071] As a preferred implementation, the specific steps performed by the topology management module are as follows:
[0072] 1) Interact with the cluster management module to obtain the current autonomous area information and connection mode information;
[0073] 2) Interact with the node management module to obtain the current node global view and life cycle;
[0074] 3) Create a data synchronization topology for each autonomous region collected in step 1), build a spanning tree with the node that initiates state synchronization as the root, and the seed node of the autonomous region as its child node. Then, for each node in the spanning tree, its neighbor node is used as its child node in the spanning tree, so as to form a complete synchronization path;
[0075] 4) According to the connection mode information collected in step 1), when two autonomous areas are in the connection window, their synchronization paths are merged, that is, the two autonomous areas are regarded as the same and a synchronization path is generated to support fast exchange of data within the connection window;
[0076] 5) Repeat steps 1) to 4) to continuously update node connectivity and synchronization paths for use by other modules.
[0077] As a preferred implementation, the specific steps performed by the state management module are as follows:
[0078] 1) Interact with the topology management module to obtain the current connectivity and synchronization path;
[0079] 2) interact with the agent modules on the seed nodes in each autonomous area, send connectivity and synchronization paths, and trigger state synchronization;
[0080] 3) The seed nodes in the autonomous area interact with other nodes to determine the status information and synchronization scope that need to be synchronized, and each node regularly synchronizes status information to the seed nodes;
[0081] 4) The seed node saves the most recent state information snapshot and records the synchronization progress. When it is in the connection window, it performs state synchronization, sends the state to the management node and the seed node in the target autonomous area, and updates the synchronization progress.
[0082] 5) When it is impossible to connect to the corresponding autonomous area within the connection window, merge all unsent state information and try state synchronization again in the next connection window;
[0083] 6) When a seed node receives status information from other seed nodes, it synchronizes within its own autonomous region.
[0084] A specific example is provided below:
[0085] 1) If Figure 2 As shown in the figure, the cluster consists of a ground cluster and two small UAV clusters (i.e., small clusters 1 to 2). The ground small cluster includes a management node (i.e., node 1) and two computing nodes (i.e., nodes 2 to 3, which are working nodes). The two small UAV clusters each include three working nodes (i.e., nodes 4 to 6 and nodes 7 to 9).
[0086] 2) Two small drone clusters collect and process image information for different areas. Based on the currently available resources of the cluster, they decide and schedule nodes to complete data processing and transmit the results back.
[0087] 3) The state to be synchronized includes the resource information of each node in each drone cluster and the task processing result information, among which the resource information needs to be reported to node 1, and the task processing result information needs to be reported to node 1 and all nodes 2 to 9 in each drone cluster;
[0088] 4) The proxy modules on all nodes 2 to 9 first monitor the network delay between themselves and their neighboring nodes, and report to the node management module on node 1 when they can connect to node 1;
[0089] 5) The cluster management module on node 1 collects the delays of all nodes 1 to 9, sets the threshold to 2 milliseconds, collects the delays between nodes 1 to 3 of 1 millisecond, the delays between nodes 4 to 6 of 1 millisecond, and the delays between nodes 7 to 9 of 1 millisecond, and thus, nodes 1 to 3 are marked as autonomous region 1, nodes 4 to 6 are marked as autonomous region 2, and nodes 7 to 9 are marked as autonomous region 3;
[0090] 6) The cluster management module collects that the delay from node 1 to node 4 between autonomous region 1 and autonomous region 2 is the smallest, and marks node 1 and node 4 as seed nodes; the delay from node 1 to node 8 between autonomous region 1 and autonomous region 3 is the smallest, and marks node 1 and node 8 as seed nodes; the delay from node 5 to node 7 between autonomous region 2 and autonomous region 3 is the smallest, and marks node 5 and node 7 as seed nodes;
[0091] 7) The cluster management module sets the monitoring time window to 10 seconds, and monitors that the connection mode between autonomous area 1 and autonomous area 2 is connected for 50 seconds and interrupted for 50 seconds, the connection mode between autonomous area 1 and autonomous area 3 is connected for 100 seconds and interrupted for 30 seconds, and the connection mode between autonomous area 2 and autonomous area 3 is connected for 20 seconds and interrupted for 60 seconds; the cluster management module saves this connection mode and connection window size (i.e., 50 seconds, 100 seconds, 20 seconds);
[0092] 8) The topology management module generates a synchronization path. Taking autonomous region 2 as an example, when reporting resource status, the proxy module on nodes 5-6 transmits the status information to node 4, and node 4 transmits the status information to node 1 when entering the connection window; when located in the connection window, nodes 4-6 directly transmit the status information to node 1;
[0093] 9) The state management module continuously collects state information from autonomous region 2 and autonomous region 3, and sends the state and topology information to be collected to the proxy module of each node; the nodes in autonomous region 2 and autonomous region 3 follow the current topology and complete data synchronization;
[0094] 10) The node management module continuously monitors the survival status and delay information of all nodes;
[0095] 11) When node 6 in autonomous region 2 fails, nodes 4-5 detect the failure of node 6 and report it to the node management module; nodes 4-5 use 50 milliseconds as a fixed interval to detect the health status of node 6, and node 1 uses an improved exponential back-off method to detect the health status of node 6. The maximum detection interval is half of the connection window between autonomous region 1 and autonomous region 2, that is, 25 seconds;
[0096] 12) When node 9 in autonomous region 3 switches to connect to small cluster 1, the cluster management module senses a sudden change in the connection mode of node 9 in the next window, and re-divides the autonomous region, dividing nodes 4 to 6 and node 9 into the same autonomous region;
[0097] 13) The cluster management module continuously monitors the changes in node delays and completes the autonomous area division.
[0098] Although the present invention has been disclosed as above by way of embodiments, it is not intended to limit the present invention. Appropriate modifications or equivalent substitutions of the technical solutions of the present invention made by ordinary technicians in the field should all be included in the protection scope of the present invention. The protection scope of the present invention shall be based on what is defined in the claims.
Claims
1. A cluster state synchronization method for smart grid, characterized in that: The cluster includes a management node and multiple working nodes. The method includes the following steps: Get network delay information between all nodes; According to the obtained network delay information, multiple nodes whose network delays are less than a preset threshold are divided into the same autonomous area; for any two autonomous areas, the two nodes with the smallest network delays belonging to the two autonomous areas are used as seed nodes; Establishing synchronization paths between the management node, the seed node, and neighboring nodes in the same autonomous area of the seed node; Monitor the connection patterns between the autonomous regions and determine the connection windows between the autonomous region where the management node is located and other autonomous regions; The seed nodes in each autonomous region obtain the status information of other nodes in the same autonomous region. Within the above connection window, the seed nodes transmit all the status information of the autonomous region to the management node along the synchronization path to complete the cluster status synchronization; All status information obtained through management node output.
2. The method according to claim 1, characterized in that The management node collects the heartbeat information of all nodes in the autonomous area through the seed node, extracts features from the heartbeat information, obtains the interval and period of each heartbeat information, and determines the node survival and connection periodicity; then maintains a bitmap of heartbeat information for each autonomous area, and the survival of each node is marked with a binary bit; for disconnected autonomous areas, a binary bit is used to mark the survival of the entire area.
3. The method according to claim 1, characterized in that For nodes that fail within the connection window, first determine the connectivity of the failed node's neighbor nodes to other nodes in the autonomous region where the failed node is located to confirm the failure range; for single-node failure, its neighbor nodes use a fixed interval to send heartbeat detection packets to the failed node, and the management node uses an exponential back-off mechanism to detect the health status of the failed node and obtain the connection window from the management node to the autonomous region; for multiple-node failure, obtain the connection window size of the autonomous region where the node is located, with 0.1 times the connection window size as the initial interval. When the time to the next connection window is less than 1 / 3 of the interval between two connection windows, reduce the detection interval to 0.02 times the connection window size until a connection window is detected to restore the connection with the failed node.
4. The method according to claim 1, characterized in that The same mark is set for nodes whose network delay is less than the preset threshold, and the autonomous region is divided according to the set mark; for failed nodes, they are added to the autonomous region divided last time. If the autonomous region divided last time does not exist, they are added to the autonomous region to which the random neighbor node belongs, and the autonomous region allocation of all nodes is completed.
5. The method according to claim 1, characterized in that For every two autonomous regions, the connectivity data of the seed nodes is obtained at fixed time windows, and the average delay and delay variance in the past time windows are continuously recorded; when the average delay and delay variance deviate from the average value of the past time windows by more than the preset threshold, the time period when the last network delay was stable is recorded as the connection window of the two autonomous regions.
6. The method according to claim 1, characterized in that Create a data synchronization topology for each autonomous region, build a spanning tree with the management node that initiates state synchronization as the root node, and the seed node of the autonomous region as its child node; The neighbor nodes of the seed node are used as the lower-level child nodes of the seed node in the spanning tree to form a complete synchronization path.
7. The method according to claim 1, characterized in that When two autonomous areas are located in a connection window, the two autonomous areas are regarded as the same autonomous area and a synchronization path is generated to perform data exchange within the connection window.
8. The method according to claim 1, characterized in that The most recent state information snapshot is saved through the seed node, and the synchronization progress is recorded; after the state synchronization is performed within the connection window, the synchronization progress is updated.
9. The method according to claim 1, characterized in that When it is impossible to connect to the corresponding autonomous area within the connection window, all unsent state information is merged and state synchronization is attempted again in the next connection window.
10. A cluster state synchronization system for smart grid, used to implement the method according to any one of claims 1 to 9, characterized in that: The cluster includes a management node and multiple working nodes. The system includes: an agent module deployed on the working node, and a node management module, a cluster management module, a topology management module and a state management module deployed on the management node; wherein: The proxy module is responsible for obtaining network delay information between all nodes; The node management module is responsible for monitoring the survival status and network delay information of all nodes; The cluster management module is responsible for dividing multiple nodes whose network delays are less than a preset threshold into the same autonomous region based on the acquired network delay information; for any two autonomous regions, the two nodes with the smallest network delay belonging to the two autonomous regions are used as seed nodes; monitoring the connection mode between each autonomous region, and determining the connection window between the autonomous region where the management node is located and other autonomous regions; The topology management module is responsible for establishing synchronization paths between management nodes, seed nodes, and neighboring nodes in the same autonomous area of the seed nodes; The state management module is responsible for the seed nodes in each autonomous area to obtain the state information of their neighbor nodes. Within the above connection window, the seed node, as a working node, transmits all the state information of itself and its neighbor nodes to the management node along the synchronization path to complete the cluster state synchronization, and outputs all the obtained state information through the management node.
Citation Information
Patent Citations
Edge computing platform architecture
CN114301809A
Internet of things data distribution and storage method and system in edge environment
CN115102986A
Large-scale wide-area distributed cluster member failure detection method and system
CN115801626A
Space-based system edge cloud architecture and self-organizing system and method
CN115801774A
High-availability distributed system and method based on LRPaxos algorithm
CN117687789A
