A configuration optimization method, system and computer readable storage medium

Abstract

The present application provides a configuration optimization method, system and computer-readable storage medium, the method comprising obtaining a running tree and a backup tree with the same configuration; the running tree is used to save the global running configuration, and the backup tree is used to save the latest configuration; when the configuration in the backup tree is updated, a hanging node is configured for the backup tree; the hanging node is used to characterize the path of the newly added configuration in the backup tree; a difference tree is obtained by comparing the hanging node with the running tree; the difference tree is used to characterize the configuration difference between the backup tree and the running tree; and the running tree is updated according to the difference tree. The present application solves the problem of cumbersome configuration updates in the existing FRR technology through the above scheme.

Description

Technical Field

[0001] The present invention relates to the field of network communication technology, and in particular to a configuration optimization method, system and computer-readable storage medium. Background Art

[0002] In today's complex network environment, the open source software FRR (Free Range Routing) is widely used as a routing management module in various network architectures due to its high flexibility and scalability. FRR not only supports multiple routing protocols, but also provides a wealth of configuration options, allowing network administrators to customize and optimize network behavior according to different needs. However, the internal configuration management mechanism of FRR, especially the storage and processing of its configuration data, is crucial to understanding and optimizing its performance.

[0003] FRR uses a unique tree structure to manage its configuration data. This design allows configuration information to be organized in a clear and logical way, which is easy to manage and maintain. Specifically, FRR uses two independent trees to store configuration information: one tree A is responsible for storing the global running configuration, that is, the configuration that is actually in effect in the current network environment; and the other tree B is used to store the latest configuration data, which may be just entered by the network administrator through the command line interface (CLI) or configuration file import. In the configuration update process of FRR, a key step is to determine and apply configuration changes. To achieve this, the system needs to compare the differences between tree B (latest configuration) and tree A (global running configuration). This comparison process is completed by traversing all nodes of the two trees to generate a so-called "diff tree", which reflects all configuration changes required from tree A to tree B. Subsequently, FRR will perform corresponding configuration business processing based on this diff tree, such as updating routing tables, adjusting interface parameters, etc.

[0004] However, as the network scale expands and the configuration complexity increases, this configuration management mechanism based on traversal comparison gradually exposes performance bottlenecks. Especially when dealing with a large number of configurations, each configuration update requires a complete traversal and comparison of two huge trees, and the time complexity of this process grows exponentially. This not only leads to increased latency in configuration update operations, but may also cause a lag in the configuration taking effect during network peak hours, which in turn affects the stability and performance of the entire network. Summary of the invention

[0005] The present application provides a configuration optimization method, system and computer-readable storage medium to solve the problem of cumbersome configuration update in the existing FRR technology.

[0006] In a first aspect, the present application provides a configuration optimization method, the method comprising:

[0007] Obtain a running tree and a backup tree with the same configuration; the running tree is used to save the global running configuration, and the backup tree is used to save the full latest configuration;

[0008] When the configuration in the standby tree is updated, a hanging node is configured for the standby tree; the hanging node is used to represent the path of the newly added configuration in the standby tree;

[0009] Comparing the hanging node with the running tree, obtaining a difference tree; the difference tree is used to characterize the configuration difference between the standby tree and the running tree;

[0010] The running tree is configured and updated according to the difference tree.

[0011] Preferably, the step of configuring the hanging nodes for the standby tree further comprises configuring node pointers, node root paths and path table nodes for the hanging nodes;

[0012] The node pointer is set at the same level as the hanging node, and the node root path is configured on the hanging node.

[0013] Preferably, the backup tree includes a path chain and a database chain;

[0014] The path table node is configured on the path chain, and the node pointer and the node root path are configured on the database chain.

[0015] Preferably, the step of comparing the hanging node with the running tree includes:

[0016] Obtaining a hash table of the backup tree;

[0017] Determine the node pointer corresponding to the hanging node according to the hash table;

[0018] Determine the node root path of the hanging node according to the node pointer;

[0019] Determine the path table node according to the hash table;

[0020] The difference tree is obtained by comparing the node root path, the path table node and the running tree.

[0021] Preferably, the step of comparing the node root path, the root path and the running tree comprises:

[0022] Determine whether there is an original path on the running tree that is the same as the hanging node;

[0023] If yes, then delete the original path and the node corresponding to the original path on the running tree, and generate the difference tree according to the path of the hanging node and the corresponding hanging node;

[0024] If not, the distinction tree is generated according to the path of the hanging node and the corresponding hanging node.

[0025] Preferably, the step of updating the configuration of the running tree according to the difference tree comprises:

[0026] Determine whether the difference tree can operate normally;

[0027] If so, adding the difference tree to the running tree;

[0028] If not, the difference tree is retrieved again until the difference tree can run normally.

[0029] Preferably, the configuration of the hanging nodes of the backup tree is performed in an intersecting manner with the generation of the difference tree.

[0030] Preferably, the configuration of the hanging nodes of the standby tree and the generation of the difference tree cross-processing include:

[0031] configuring the node root path, and comparing the node root path with the running tree to obtain a first difference tree;

[0032] configuring the path table node, and obtaining a second difference tree according to comparing the path table node with the running tree;

[0033] The first distinction tree and the second distinction tree are combined to obtain the distinction tree.

[0034] In a second aspect, the present application further provides a configuration optimization system, the system comprising:

[0035] processor;

[0036] A memory, wherein the memory is used to store at least one executable instruction; the executable instruction enables the processor to execute the operation of any one of the configuration optimization methods described above.

[0037] In a third aspect, the present application further provides a computer-readable storage medium, wherein the storage medium stores at least one executable instruction, and when the executable instruction is executed on an electronic device, the electronic device executes the operation of any one of the configuration optimization methods described above.

[0038] As can be seen from the above content, the present application provides a configuration optimization method, system and computer-readable storage medium, the method comprising obtaining a running tree and a backup tree with the same configuration; the running tree is used to save the global running configuration, and the backup tree is used to save the latest configuration; when the configuration in the backup tree is updated, a hanging node is configured for the backup tree; the hanging node is used to characterize the path of the newly added configuration in the backup tree; a difference tree is obtained by comparing the hanging node with the running tree; the difference tree is used to characterize the configuration difference between the backup tree and the running tree; and the running tree is updated according to the difference tree. The present application solves the problem of cumbersome configuration updates in the existing FRR technology through the above scheme. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the technical solution of the present application, the drawings required for use in the embodiments are briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0040] Figure 1 A flowchart of a configuration optimization method for this application;

[0041] Figure 2 This is a flowchart for configuring the downlink node;

[0042] Figure 3 Flowchart for obtaining the difference tree;

[0043] Figure 4 A flowchart for obtaining a difference tree when identical paths exist;

[0044] Figure 5 A flowchart for performing configuration updates on the run tree;

[0045] Figure 6 A schematic diagram of the running book and backup tree when no configuration update occurs;

[0046] Figure 7 A schematic diagram for obtaining a first difference tree;

[0047] Figure 8 A schematic diagram for obtaining a second difference tree;

[0048] Fig. 9 A schematic diagram of obtaining a difference tree according to the first difference tree and the second difference tree;

[0049] Fig.10 This is a schematic diagram of a configuration optimization system for this application. DETAILED DESCRIPTION

[0050] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0051] As a high-performance routing protocol daemon, FRR (Fast Routing Router) is widely used in modern network architecture to provide efficient and reliable routing decision and forwarding services. One of its core design concepts is to use an innovative tree structure to manage its complex configuration data. This unique data organization method not only significantly improves the hierarchy and logic of configuration information, but also greatly simplifies subsequent management and maintenance work.

[0052] Specifically, FRR achieves effective management of configuration information by building two independent tree structures. The first tree, which we call Tree A, plays a vital role as it is responsible for storing global running configurations. These configurations represent key information such as routing policies and interface parameters that are actually in effect in the current network environment, and are the basis for ensuring the normal operation of the network. In contrast, the second tree B is specifically used to save the latest configuration data. This data may come from a variety of channels, including but not limited to immediate input from network administrators through the command line interface (CLI), or new configurations imported in batches through methods such as importing configuration files.

[0053] In FRR's configuration update mechanism, determining and applying configuration changes is a crucial step. To achieve this goal, FRR has designed a sophisticated comparison and update process. When the new configuration data is imported into Tree B, the system will start a comparison process. The core of this process is to compare all nodes between Tree B (the latest configuration) and Tree A (the global running configuration) one by one. By traversing every branch and leaf node of the two trees, the system can accurately identify the differences between the two and generate a so-called "diff tree" based on this. This diff tree is actually a detailed change guide that clearly lists all the steps and changes required to transition from the current global running configuration (Tree A) to the new configuration state (Tree B).

[0054] Based on this diff tree, FRR can intelligently perform the corresponding configuration business processing operations. This may include updating the routing table to reflect the new network topology, adjusting interface parameters to adapt to new network policies, or performing any other necessary configuration changes. This diff tree-based configuration update method not only ensures the accuracy and consistency of the configuration, but also greatly improves the flexibility and response speed of the configuration.

[0055] However, with the rapid development of network technology, the continuous expansion of network scale and the increasing complexity of configuration, this traditional configuration management mechanism based on traversal comparison has gradually exposed performance bottlenecks. Especially when dealing with complex networks with a large number of configuration items, each configuration update requires a complete traversal and comparison of two huge trees. The time complexity of this process is extremely high, and often increases exponentially with the increase in the number of configurations. This not only leads to a significant increase in the delay of configuration update operations, but may also cause serious lags in the effectiveness of configurations during network peak hours. This lag effect not only reduces the response speed and flexibility of the network, but may also have an adverse impact on the overall stability and performance of the network.

[0056] The present application provides the following embodiments to solve the above problems.

[0057] Figure 1 The present invention is a flowchart of a configuration optimization method.

[0058] See also Figure 1 It can be seen that this embodiment provides a configuration optimization method, which includes:

[0059] S100, obtain the running tree and the backup tree with the same configuration. Specifically, in this embodiment, before performing data configuration of FRR, it is necessary to first obtain the data tree structure in FRR, wherein the data tree structure includes the running book and the backup tree, wherein the running tree is used to save the global running configuration, and the backup tree is used to save the latest configuration of the whole amount.

[0060] Among them, FRR (Free Range Routing) is a key technology used to improve network reliability and stability. The main purpose of FRR is to quickly find alternative paths for data flows when a network failure occurs, thereby minimizing the service interruption time caused by the failure. This technology is crucial to ensuring the continuity of key services and user experience.

[0061] The implementation of FRR relies on its unique tree structure. This structure is centered on key nodes in the network (such as routers or switches) to build one or more logical trees. Each tree represents a possible traffic forwarding path, where the root node of the tree is usually the core device in the network, and the branches of the tree represent the traffic path from the root node to each leaf node (i.e., edge device or user terminal).

[0062] In the tree structure of FRR, each node plays a specific role. The root node is responsible for receiving traffic from upstream and deciding how to distribute the traffic to each branch based on the current network status (including fault information). The branch node is responsible for forwarding the traffic to the next node until it finally reaches the leaf node. This structural design enables FRR to quickly select an alternative path from the tree to bypass the fault point when a network failure is detected, thereby ensuring continuous transmission of traffic.

[0063] In order to implement the tree structure of FRR, a series of complex routing protocols and algorithms need to be configured. These protocols and algorithms can monitor the network status in real time and automatically trigger the FRR mechanism when a failure occurs. At the same time, in order to ensure the reliability and efficiency of FRR, network administrators also need to regularly maintain and optimize the tree structure to cope with changes in network topology and growth in traffic.

[0064] It should be noted that, according to the above, the running tree is used to run the configuration, and the backup tree is used to maintain the latest configuration. When the running tree runs normally, that is, when no configuration update occurs, the running tree and the backup tree are exactly the same in configuration.

[0065] The configuration of the running tree during normal operation and the configuration of the standby tree refer to Figure 6 .

[0066] The method further comprises:

[0067] S200, when the configuration in the backup tree is updated, configure the hanging nodes for the backup tree. Specifically, in this embodiment, the configuration is updated by configuring the hanging nodes, which replaces the existing technology of traversing and comparing the running tree and the backup tree separately to update the configuration, thereby reducing the amount of data traversal and comparison tasks.

[0068] The hanging node is used to represent the path of the newly added configuration in the backup tree. The hanging node and the corresponding newly added configuration can be directly found through the path, thereby avoiding traversing the entire backup tree.

[0069] Figure 2 This is a flowchart for configuring the downlink node.

[0070] See also Figure 2 It can be seen that, further, in some embodiments, the step of configuring the hanging nodes for the backup tree also includes configuring node pointers, node root paths and path table nodes for the hanging nodes.

[0071] In a network or data structure, a node usually refers to the basic unit that constitutes the network or structure. These nodes can be data elements, devices, computers, servers, etc. They are interconnected through certain connection methods (such as physical connection, logical connection, etc.) to form an overall network or structure.

[0072] The "relationship between the hanging nodes and the node root path (Root)" mainly involves the level and position of the node in the network or data structure. Root, or the root node, is the starting point or the highest level node of the entire network or data structure. In a tree structure (such as the directory tree of a file system, the structure tree of an XML document, etc.), the Root node is at the top level and is the ancestor of all other nodes. Other nodes extend downward from the Root node in the form of branches and child nodes.

[0073] In the root relationship between nodes, each node has a clear path pointing to the root node. This path defines the position of the node in the structure and also reflects the hierarchical relationship between the node and the root node. For example, in the file system, the path of a file (such as "C:\Users\Username\Documents\file.txt") clearly shows the hierarchical relationship of the file from the root node (i.e., drive C) to its current location.

[0074] In addition, the relationship between nodes and roots also affects data access and management. Since the root node is the starting point of the entire structure, operations on the root node (such as traversal, search, modification, etc.) usually involve the entire structure. Therefore, when designing a network or data structure, special attention should be paid to the selection and configuration of the root node to ensure efficient access and management of data.

[0075] A node pointer (Hash pointer) is a special form of a node pointer. It not only points to the location of the next node, but also contains the hash value of the next node content. A hash value is a fixed-length string calculated by a hash function, which represents the unique characteristics of the input data.

[0076] The introduction of Hash pointers brings several significant advantages:

[0077] Data integrity verification: Due to the uniqueness of the hash value, any modification to the node content will result in a change in its hash value. Therefore, by comparing the hash value in the Hash pointer with the hash value of the current node content, the integrity of the data can be verified to ensure that the data has not been tampered with during transmission or storage.

[0078] Decentralized trust: In distributed systems such as blockchain, hash pointers enable each node to independently verify the authenticity of data without relying on a centralized trust agency. This decentralized trust mechanism is the basis for blockchain technology to operate safely and reliably.

[0079] Efficient data structures: Hash pointers also make it possible to build efficient data structures, such as Merkle Tree. Merkle Tree is a tree data structure in which each non-leaf node stores the hash value of its two child nodes. This structure allows us to quickly verify the existence and integrity of data blocks while reducing the amount of computation and storage space required for data verification.

[0080] Preventing circular references: In linear data structures such as linked lists, Hash pointers can also be used to prevent circular references. By comparing the Hash pointer of the current node with the hash value of the visited node, closed loops can be detected and avoided, thereby ensuring the correctness and stability of the data structure.

[0081] Among them, see Figure 6 It can also be known that both the running tree and the backup tree have two branches. In the present embodiment, the two branches are respectively referred to as the path chain and the database chain, and the hanging nodes must also be hung on these two branches, wherein the path table node is configured on the path chain, and the node pointer and the node root path are configured on the database chain.

[0082] The method further comprises:

[0083] S300, comparing the hanging node with the running tree. Specifically, in this embodiment, by comparing the hanging node with the running tree that has not been updated, and thereby obtaining a difference tree with a newly added configuration, it can be understood that the difference tree is used to characterize the configuration difference between the backup tree and the running tree.

[0084] It should be noted that in step S300, the comparison is performed through the first node and the running tree, which can be understood as "picking" the difference tree from the backup tree after the comparison is completed.

[0085] Figure 3 Flowchart for obtaining the difference tree.

[0086] See also Figure 3 It can be seen that, further, in some embodiments, the step of comparing the hanging node with the running tree includes:

[0087] S310, obtaining the hash table of the backup tree. Specifically, in this embodiment, referring to the node pointer of the hanging node in the above step S200, it can be known that the hanging node needs to be obtained through the hash table, so the hash table corresponding to the backup tree needs to be obtained before comparison.

[0088] The step of comparing the hanging node with the running tree also includes:

[0089] S320, determining the node pointer corresponding to the hanging node according to the hash table;

[0090] S330, determining the node root path of the hanging node according to the node pointer;

[0091] S340, determining the path table node according to the hash table;

[0092] Specifically, in this embodiment, referring to step S320 to step S340, obtaining the node root path and the path table node can be understood as two "series" of processes, namely obtaining the node root path and the path table node respectively.

[0093] Among them, both the path table node and the node root path need to rely on the hash table to be finally obtained.

[0094] The step of comparing the hanging node with the running tree also includes:

[0095] S350, comparing the node root path, the path table node and the running tree to obtain the difference tree.

[0096] Specifically, in this embodiment, since the new configuration needs to be obtained through the path chain and the database chain of the backup tree, it is necessary to use the node root path and the path table node mounted on the path chain and the database chain respectively to obtain the new configuration and obtain the difference tree. The function of the difference tree can be understood as being used to characterize the configuration differences between the backup tree and the running tree.

[0097] Figure 4 The flowchart for obtaining the difference tree when the same path exists.

[0098] See also Figure 4 It can be seen that, further, in some embodiments, the step of comparing the node root path, the root path and the running tree includes:

[0099] S351, determining whether there is an original path on the running tree that is the same as the hanging node;

[0100] S352: If yes, then delete the original path and the node corresponding to the original path on the running tree, and generate the difference tree according to the path of the hanging node and the corresponding hanging node;

[0101] S353: If not, generate the distinction tree according to the path of the hanging node and the corresponding hanging node.

[0102] Specifically, in this embodiment, in some cases, the original running tree may have the original path that is the same as the path of the hanging node. If the running tree is directly updated without processing the original path, problems such as configuration duplication or configuration errors may occur.

[0103] Therefore, in this embodiment, before updating the configuration of the operation tree, it is necessary to first detect whether the original path exists on the operation tree. If so, the original path needs to be deleted before the difference tree can be generated.

[0104] According to step S310 to step S350, the generation of the difference tree requires two paths to be obtained, and the configuration of these two paths in the hanging nodes is not performed simultaneously, so the configuration of the hanging nodes of the backup tree and the generation of the difference tree are performed alternately.

[0105] Figure 7 A schematic diagram for obtaining a first difference tree;

[0106] Figure 8 A schematic diagram for obtaining a second difference tree;

[0107] Fig. 9 The figure is a schematic diagram of obtaining a difference tree according to the first difference tree and the second difference tree.

[0108] See also Figure 7 , Figure 8 as well as Fig. 9 It can be seen that, further, in some embodiments, the configuration of the hanging nodes of the backup tree and the generation of the difference tree are cross-cutting, including configuring the node root path, comparing the node root path with the running tree to obtain a first difference tree; configuring the path table node, comparing the path table node with the running tree to obtain a second difference tree; combining the first difference tree and the second difference tree to obtain the difference tree.

[0109] Specifically, in this embodiment, in the process of configuring the hanging node, the configuration is first performed on the database chain, the node root path and the node pointer are configured, and after the configuration of the database chain is completed, the first difference tree corresponding to the database chain is first obtained (refer to Figure 7 ).

[0110] After completing the configuration of the database chain and generating the first difference tree, the path chain is configured, the path table node is configured, and after completing the configuration of the path chain, the second difference tree of the chain corresponding to the path is obtained (refer to Figure 8 ).

[0111] After obtaining the first difference tree and the second difference tree, the final difference tree is generated according to the first difference tree and the second difference tree (refer to Fig. 9 ).

[0112] It should be noted that the difference tree generated here may also be directly obtained at the time point when the second difference tree is obtained, and the first difference tree and the second difference tree may not be combined.

[0113] The method further comprises:

[0114] S400, updating the configuration of the running tree according to the difference tree. Specifically, in this embodiment, after the difference tree is obtained, the running tree is updated by using the difference tree.

[0115] Figure 5 Flowchart for performing configuration updates on a run tree.

[0116] See also Figure 5 It can be seen that, further, in some embodiments, the step of updating the configuration of the running tree according to the difference tree includes:

[0117] S410, determining whether the difference tree can operate normally;

[0118] S420, if yes, then add the difference tree to the running tree;

[0119] S430: If not, reacquire the difference tree until the difference tree can operate normally.

[0120] Specifically, in this embodiment, in some cases, the newly added configuration or the configuration on the difference tree may not be able to run. If the configuration that cannot run is added to the running tree, it will have a significant impact on the operation of the entire configuration. Therefore, before updating the configuration, it is necessary to first perform an operation test on the difference tree to detect whether the configuration therein can run normally, and add the configuration that can run normally to the running tree, thereby realizing the configuration update.

[0121] Fig.10 This is a schematic diagram of a configuration optimization system for this application.

[0122] See also Fig.10 It can be seen that this embodiment also provides a configuration optimization system, the system comprising:

[0123] processor;

[0124] A memory, the memory is used to store at least one executable instruction; the executable instruction enables the processor to perform the operation of any one of the configuration optimization methods described in step S100 to step S400.

[0125] Furthermore, this embodiment also provides a computer-readable storage medium, in which at least one executable instruction is stored. When the executable instruction is executed on an electronic device, the electronic device executes an operation of the configuration optimization method described in any one of steps S100 to S400.

[0126] The advantages of this embodiment are as follows:

[0127] When configuring a large number of nodes, the nodes to be operated can be obtained quickly without traversing and comparing the backup tree and the running tree to obtain the difference tree, which greatly improves the configuration efficiency.

[0128] The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.

[0129] The above specific implementation methods further illustrate the purpose, technical solutions and beneficial effects of the present application in detail. It should be understood that the above are only specific implementation methods of the present application and are not used to limit the protection scope of the present application. Any modifications, equivalent substitutions, improvements, etc. made on the basis of the technical solutions of the present application should be included in the protection scope of the present application.

Claims

1. A configuration optimization method, characterized in that: The method comprises: Obtain a running tree and a backup tree with the same configuration; the running tree is used to save the global running configuration, and the backup tree is used to save the full latest configuration; When the configuration in the standby tree is updated, a hanging node is configured for the standby tree; the hanging node is used to represent the path of the newly added configuration in the standby tree; Comparing the hanging node with the running tree, obtaining a difference tree; the difference tree is used to characterize the configuration difference between the standby tree and the running tree; The running tree is configured and updated according to the difference tree.

2. A configuration optimization method according to claim 1, characterized in that: The step of configuring the hanging nodes for the standby tree also includes configuring node pointers, node root paths and path table nodes for the hanging nodes; The node pointer is set at the same level as the hanging node, and the node root path is configured on the hanging node.

3. A configuration optimization method according to claim 2, characterized in that: The backup tree includes a path chain and a database chain; The path table node is configured on the path chain, and the node pointer and the node root path are configured on the database chain.

4. A configuration optimization method according to claim 2, characterized in that: The step of comparing the hanging node with the running tree comprises: Obtaining a hash table of the backup tree; Determine the node pointer corresponding to the hanging node according to the hash table; Determine the node root path of the hanging node according to the node pointer; Determine the path table node according to the hash table; The difference tree is obtained by comparing the node root path, the path table node and the running tree.

5. A configuration optimization method according to claim 4, characterized in that: The step of comparing the node root path, the root path and the running tree comprises: Determine whether there is an original path on the running tree that is the same as the hanging node; If yes, then delete the original path and the node corresponding to the original path on the running tree, and generate the difference tree according to the path of the hanging node and the corresponding hanging node; If not, the distinction tree is generated according to the path of the hanging node and the corresponding hanging node.

6. A configuration optimization method according to claim 5, characterized in that: The step of updating the configuration of the running tree according to the difference tree comprises: Determine whether the difference tree can operate normally; If so, adding the difference tree to the running tree; If not, the difference tree is retrieved again until the difference tree can run normally.

7. A configuration optimization method according to claim 3, characterized in that: The configuration of the hanging nodes of the standby tree is performed in an intersecting manner with the generation of the difference tree.

8. A configuration optimization method according to claim 7, characterized in that: The configuration of the standby tree and the generation of the difference tree cross-processing include: configuring the node root path, and comparing the node root path with the running tree to obtain a first difference tree; configuring the path table node, and obtaining a second difference tree according to comparing the path table node with the running tree; The first distinction tree and the second distinction tree are combined to obtain the distinction tree.

9. A configuration optimization system, characterized in that: The system comprises: processor; A memory, wherein the memory is used to store at least one executable instruction; the executable instruction enables the processor to perform the operation of the configuration optimization method according to any one of claims 1-8.

10. A computer-readable storage medium, characterized in that: The storage medium stores at least one executable instruction, and when the executable instruction is executed on the electronic device, the electronic device executes the operation of the configuration optimization method according to any one of claims 1 to 8.

Images