Locality protection configuration method for network survivability

Abstract

The invention discloses a locality protection configuration method for network survivability, belongs to the technical field of urban public service network security, and aims to solve the technical problem that an existing network survivability protection strategy cannot well cope with dynamic and complex attacks / failures to make configuration adjustment. The method comprises the steps that the coupling network edge weight of a first node pair is obtained according to the sensitivity of two nodes in the first node pair to the cost / price change of each other, the degree of each node is counted according to the existing coupling network edge weight, and the number of newly added protection edges of the protection strategy each time is limited. Therefore, a protection edge most worthy of protection is selected according to the degree of each node, and the product of the degrees of the two nodes is used as a protection weight; every time a network attack / cascade fault occurs, a new protection edge is added on the basis of the last protection result according to the rule, and the network survivability protection strategy can have high real-time dynamic performance.

Description

Technical Field

[0001] The present invention relates to a local protection configuration method for network anti-destruction, belonging to the technical field of urban public utility network security. Background Art

[0002] Urban public utility networks (such as electricity, gas, water supply, transportation, and heating) are developing towards a highly interconnected and intelligent direction, and the economic, physical, and information coupling between systems is becoming increasingly close.

[0003] The interconnectedness of urban public utility networks also amplifies systemic risks. When a node in a single network is attacked or fails, the risk can spread rapidly through cross-layer dependencies, triggering cascading failures and leading to large-scale disruptions of high-value public services. Traditional network resilience protection strategies primarily include resource allocation (RA) and local degree allocation (LDA). The RA strategy optimizes the allocation of bandwidth, computing resources, and link redundancy within the network to ensure rapid dispatch of backup resources in the event of a network failure or attack, maintaining normal network operation and connectivity. The LDA strategy increases the degree of certain key nodes or strengthens weakly connected parts of the network to ensure that when some nodes or links fail, the network can maintain stable connectivity in local areas and avoid global collapse.

[0004] However, network attacks or crashes on nodes and edges also tend to be dynamic and complex. Existing network invulnerability protection strategies cannot effectively respond to dynamic and complex attacks / failures and make configuration adjustments. Summary of the Invention

[0005] The purpose of this application is to overcome the deficiencies in the prior art and to provide a local protection configuration method for high-value and interconnected public service networks that can dynamically and adaptively respond to network attacks / failures.

[0006] To achieve the above objectives, this application is implemented using the following technical solutions:

[0007] In a first aspect, the present application provides a method for configuring local protection for network anti-destruction, comprising:

[0008] Acquire multiple node network structures, extract first node pairs with economic relevance from the multiple node network structures, wherein two nodes in the first node pair are from different node network structures; and acquire coupling network edge weights of the first node pairs based on the sensitivity of the two nodes in the first node pair to each other's cost / price changes;

[0009] In response to detecting that the node network structure is subject to a network attack / cascading failure:

[0010] The degree of each node is calculated based on the weights of all coupled network edges corresponding to each node;

[0011] Selecting a set number of second node pairs from all nodes according to the degree product between the two nodes;

[0012] On the basis of configuring the original protection edge of the local degree protection strategy, a new protection edge is added to the configured local degree protection strategy according to the second node pair, and the protection weights of the original protection edge and the new protection edge are respectively configured according to the product of the degrees of the second node pairs corresponding to the original protection edge and the new protection edge.

[0013] In some embodiments of the first aspect of the present application,

[0014] The coupling network edge weight is obtained by calculating the following formula:

[0015] ,

[0016] Where, and Respectively represent the node network structure to which the two nodes in the first node pair belong, is the edge weight of the coupling network, For the The corresponding cost / price change when the cost / price changes at another node in the node network structure. For the The cost / price change corresponding to a node in a 4-node network structure when the cost / price change occurs at another node.

[0017] In some embodiments of the first aspect of the present application, selecting a set number of second node pairs from all nodes according to the product of the degrees between the two nodes includes:

[0018] Get the degree of each node;

[0019] Sort all nodes by degree;

[0020] The two nodes with the largest degree are selected in sequence as the second node pair, and the two nodes of each second node pair are not repeated.

[0021] In some embodiments of the first aspect of the present application, selecting a set number of second node pairs from all nodes according to the product of the degrees between the two nodes includes:

[0022] Multiple rounds of random sampling of two nodes to form multiple pairs of second nodes;

[0023] Get the degree product of each pair of second nodes;

[0024] A plurality of second node pairs having the largest degree product are selected according to a set number.

[0025] In some embodiments of the first aspect of the present application,

[0026] The two nodes of the second node pair belong to different node network structures respectively.

[0027] In some embodiments of the first aspect of the present application, the method of selecting a set number of second node pairs from all nodes based on the degree product between the two nodes also includes that the two node combinations contained in each pair of second node pairs are unique.

[0028] In some embodiments of the first aspect of the present application,

[0029] The protection weight is calculated by the following formula:

[0030] ,

[0031] Where, and are the two nodes of the second node pair corresponding to the protection edge, To protect the edge The protection weight, and It is the sum of the weights of all coupled network edges corresponding to the two nodes of the protection edge.

[0032] In a second aspect, the present application also provides a computer device comprising a processor and a memory connected to the processor, wherein a computer program is stored in the memory. When the computer program is executed by the processor, the steps of the method for configuring local protection for network anti-destruction as described in any embodiment of the first aspect are performed.

[0033] In a third aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method for configuring local protection for network anti-destruction as described in any embodiment of the first aspect.

[0034] In a fourth aspect, the present application also provides a computer program product, comprising a computer program / instruction, characterized in that when the computer program / instruction is executed by a processor, the steps of the method for configuring local protection for network anti-destruction described in any embodiment of the first aspect are implemented.

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

[0036] The local degree protection configuration method for network anti-destruction provided by this application obtains the coupling network edge weight of the first node pair based on the sensitivity of the two nodes in the first node pair to each other's cost / price changes, thereby realizing cross-network protection based on economic benefits as the clue and basic requirement. According to the existing coupling network edge weight, the degree of each node is counted. The degree represents the economic importance of each node in the interconnected multi-network structure. The number of protection edges added each time by the protection strategy is limited. Therefore, the most worthy protection edge is selected based on the degree of each node, and the product of the degrees of its two nodes is used as the protection weight. Each time a network attack / cascade failure occurs, the original protection edge may collapse and disappear, and the node association topology between the original multiple node network structure will also change. Therefore, new protection edges are added according to the above rules based on the results of the previous protection. This can achieve a network anti-destruction protection strategy with high real-time dynamics and can adaptively adjust the current protection edge selection and protection weight according to the previous protection results. By gradually adding protection edges, the protection configuration strategy is dynamically adjusted in real time during the attack process to ensure that the protection measures are accurately adapted to the current vulnerable area and avoid the waste of resources caused by one-time large-scale adjustments. Compared with static protection methods, this application can more efficiently deal with multi-step attacks and dynamic failures, significantly enhance the network's real-time defense capabilities and adaptability, and is suitable for robustness optimization needs in complex network environments. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the technical solutions in the present application or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0038] Figure 1 is a flowchart of the steps of the method for configuring local protection for network anti-destruction provided by this embodiment;

[0039] Figure 2 This is an example diagram of a node power network in the node network structure of an urban public utility system;

[0040] Figure 3 This is an example diagram of a node natural gas network in the node network structure of an urban public utility system;

[0041] Figure 4 This is an example diagram of a water supply network in the node network structure of an urban public utility system;

[0042] Figure 5 This is an example diagram of a subway network in the node network structure of an urban public utility system;

[0043] Figure 6 This is an example diagram of a heating network in the node network structure of an urban public utility system;

[0044] Figure 7 is based on Figures 2 to 6 Example diagram of the generated cross-network economic coupling topology;

[0045] Figure 8 This is the decay curve of the maximum connected subgraph size with the number of attack rounds in the network simulation attack experiment under three conditions: original network, LDA protected network, and dynamic LDA protected network;

[0046] Figure 9 This is the decay curve of the maximum connected subgraph size with the number of attack rounds in the network simulation attack experiment under three conditions: original network, RA-LDA protected network, and dynamic LDA protected network;

[0047] Figure 10 A flowchart showing the steps for optimizing a city public utility system using the local protection configuration method for network anti-destruction provided in this embodiment;

[0048] Figure 11 This is a schematic block diagram of the principles of the computer device provided in this embodiment. DETAILED DESCRIPTION

[0049] It should be noted that: Figures 2 to 6 The node numbers in the middle are all node numbers within a single network. Figure 7 Different nodes in the network come from different networks. Figures 2 to 6 This is only a schematic illustration of a single network topology. Figure 7 To those from Figures 2 to 6 The nodes are renumbered. Figures 2 to 6 The node number and Figure 7 Node numbers with the same number do not represent the same node.

[0050] The technical solution of the present invention is described in detail below through the accompanying drawings and specific embodiments. It should be understood that the embodiments of the present application and the specific features in the embodiments are detailed descriptions of the technical solution of the present application, rather than limitations on the technical solution of the present application. Unless there is a conflict, the embodiments of the present application and the technical features in the embodiments can be combined with each other.

[0051] The term "and / or" in this document simply describes a relationship between related objects, indicating that three possible relationships exist. For example, "A and / or B" can mean: A exists alone, A and B exist simultaneously, or B exists alone. Additionally, the character " / " in this document generally indicates an "or" relationship between the related objects.

[0052] Example 1:

[0053] Figure 1 This is a flow chart of a method for configuring local protection for network anti-destruction in the first embodiment of the present invention. This flow chart only shows the logical sequence of the method described in this embodiment. In other possible embodiments of the present invention, different methods may be used without conflict. Figure 1 The steps shown or described are accomplished in the order shown.

[0054] See also Figure 1 , the method of this implementation specifically includes the following steps:

[0055] Acquire multiple node network structures, extract first node pairs with economic relevance from the multiple node network structures, wherein two nodes in the first node pair are from different node network structures; and acquire coupling network edge weights of the first node pairs based on the sensitivity of the two nodes in the first node pair to each other's cost / price changes;

[0056] In response to detecting that the node network structure is subject to a network attack / cascading failure:

[0057] The degree of each node is calculated based on the weights of all coupled network edges corresponding to each node;

[0058] Selecting a set number of second node pairs from all nodes according to the degree product between the two nodes;

[0059] On the basis of configuring the original protection edge of the local degree protection strategy, a new protection edge is added to the configured local degree protection strategy according to the second node pair, and the protection weights of the original protection edge and the new protection edge are respectively configured according to the product of the degrees of the second node pairs corresponding to the original protection edge and the new protection edge.

[0060] The multi-node network structure can be derived through topological node analysis of high-value urban public utility networks such as electricity, gas, water supply, transportation, and heating, with each node corresponding to a physical asset. Extracting economically relevant first node pairs from the multi-node network structure aims to economically couple high-value urban public utility networks to each other, facilitating subsequent cross-network protection. In this embodiment, the coupled network edge weights of the first node pairs are derived based on the sensitivity of the two nodes in the first node pair to each other's cost / price changes, achieving cross-network protection based on economic benefits as the basis and fundamental requirement. Based on the existing coupled network edge weights, the degree of each node is calculated. The degree represents the economic importance of each node in the interconnected multi-network structure. The protection strategy adds a limited number of protection edges at a time. Therefore, the most deserving protection edge is selected based on the degree of each node, and the protection weight is calculated by multiplying the degrees of two nodes. With each network attack or cascading failure, existing protection edges may collapse and disappear, and the node topology of the existing multi-node network structure will also change. Therefore, adding new protection edges according to the above rules based on the results of the previous protection can achieve a highly dynamic and real-time network resilience protection strategy, adaptively adjusting the selection and weighting of protection edges based on the previous protection results. By coupling the network edge weight association mechanism, the nonlinear dependencies of multiple dimensions, such as energy drive (e.g., electricity supporting natural gas compression) and resource coordination (e.g., heating network dependence on water supply), are analyzed, revealing the nonlinear dependency mechanisms across system infrastructure. By incrementally adding protection edges, the protection configuration strategy is dynamically adjusted in real time during the attack, ensuring that protection measures are precisely adapted to the current vulnerable areas and avoiding the waste of resources caused by large-scale adjustments at once. Compared with static protection methods, the present invention can more efficiently deal with multi-step attacks and dynamic failures, significantly enhance the real-time defense capability and adaptability of the network, and is suitable for robustness optimization requirements in complex network environments.

[0061] Example 2:

[0062] This embodiment provides a method for configuring local protection for network anti-destruction. This embodiment is optimized based on the first embodiment to improve the technical effect and refine the technical solution. For details not fully described in this embodiment, please refer to the first embodiment.

[0063] Example 1 mentions obtaining multiple node network structures. As one example, refer to Figures 2 to 6, can analyze high-value urban utility networks such as electricity, gas, water, transportation, and heating. Using assets as nodes, the analysis results of these utility networks are organized into a single network node topology. Within each utility network's node topology, some nodes have economic connections only with other nodes within their own network, while others have economic connections with nodes in other utility networks. These are the nodes we focus on.

[0064] Identify these nodes with cross-network economic relevance, refer to Figure 7 Connecting economically relevant nodes to form first node pairs creates a cross-network economic coupling topology composed of multiple first node pairs. The numbers on the lines, such as 0.4 and 0.2, represent the tendency of the two first node pairs to change synchronously with changes in each other's costs / prices, i.e., cost / price changes, and serve as coupling network edge weights. A node may simultaneously have first node pair relationships with multiple nodes from other utility networks. For this node, the coupling network edge weight is used to evaluate each first node pair. Therefore, the sum of the coupling network edge weights can be used to evaluate the importance of a node in the entire cross-network economic coupling topology node structure.

[0065] Network attacks or cascading failures often occur in succession. When they first occur, Figure 7 The cross-network economic coupling topology shown is complete. The degree of each node is calculated by summing the weights of all coupled network edges corresponding to each node. The degree of each node represents its importance in the cross-network economic coupling topology. After the degree of each node is known, the second node pair is selected based on the degree product between the two nodes. The connection between these second node pairs is the candidate protection edge for local degree protection configuration. In order to ensure that the most economically valuable protection edge can be protected during each attack / crash, the number of newly added protection edges each time can be set (for example, 5). Then, when the first attack / crash occurs, the five largest second node pairs are selected based on the degree product, and the connection between the second node pairs is configured as the protection edge configuration for this local degree protection. The protection weight of each protection edge is set according to the degree product.

[0066] For subsequent network attacks / cascading failures, the previous attack may cause some nodes in the node network structure to collapse and disappear, resulting in Figure 7The mid-span economic coupling topology is no longer complete; some first node pairs and their coupled network edge weights no longer exist. Therefore, the degree of each node must be recalculated. Some previously high-degree nodes have seen their degrees decrease in this protection edge configuration due to the loss of some first node pairs, while other less-affected nodes may have relatively high degrees. Therefore, based on the remaining cross-network economic coupling topology, five new second node pairs are selected. The connections between these second node pairs are used as new protection edges, along with the remaining protection edges, for this local degree protection configuration. The protection weights of the new and old protection edges are updated.

[0067] It is not difficult for those skilled in the art to see that Figure 10 Each network attack or cascading failure triggers a new protection edge and adjusts its weight based on the previous protection configuration, achieving dynamic optimization of edge allocation. Those skilled in the art can also perform five common robustness evaluations on the protected coupled network. Using these evaluation metrics, they can analyze the network's dynamic evolution and optimize urban utility networks.

[0068] As one embodiment, the coupling network edge weight can be regarded as an elastic coefficient and is calculated by the following formula:

[0069] ,

[0070] Where, and Respectively represent the node network structure to which the two nodes in the first node pair belong, is the edge weight of the coupling network, For the The corresponding cost / price change when the cost / price changes at another node in the node network structure. For the The cost / price change corresponding to a node in a 4-node network structure when the cost / price change occurs at another node.

[0071] The first embodiment mentions selecting a set number of second node pairs from all nodes based on the degree product between two nodes, as one embodiment, including:

[0072] Get the degree of each node;

[0073] Sort all nodes by degree from high to low;

[0074] The two nodes with the highest degree are selected as the second node pair, and the two nodes in each second node pair are unique. If the nodes with the highest degree are ABCDE, and the number of second node pairs is set to 3, then the three second node pairs (AB), (AC), and (AD) are obtained.

[0075] Different from the above, this implementation also provides another way to obtain the second node pair, including:

[0076] Multiple pairs of second node pairs are randomly sampled from the remaining nodes in the cross-network economic coupling topology. There is no limit to the number of candidate second node pairs, and all node combinations can be exhausted. Second node pairs can be determined based on existing first node pair relationships within the cross-network economic coupling topology, or two nodes without a first node pair relationship can be selected as second node pairs. The degree product of each second node pair is then calculated, and multiple second node pairs are sorted from largest to smallest by degree product. A set number of second node pairs with the largest degree products are selected, and local degree protection weights are assigned based on these second node pairs. Compared to the previous strategy, this strategy has greater dynamic adaptability to irregular network attacks and cascading failures due to the randomness of node sampling, but requires more computing resources and is less responsive.

[0077] As one embodiment, it should be stipulated that the two nodes of the second node pair belong to different node network structures, so as to improve cross-network protection capability.

[0078] As one embodiment, the two node combinations contained in each pair of second node pairs are unique. For example, the second node pairs (AB) and (BA) should be regarded as the same second node pair, and the newly added protection edges in each iterative protection should not be repeated to maximize the protection efficiency.

[0079] As one embodiment, the protection weight is calculated by the following formula:

[0080] ,

[0081] Where, and are the two nodes of the second node pair corresponding to the protection edge, To protect the edge The protection weight, and To protect the edge Two nodes and The sum of the weights of all coupled network edges corresponding to each node. The sum of the coupled network edge weights is 0.2+0.3+0.4=0.9, and the node The sum of the coupling network edge weights is 0.3+0.5=0.8, and the protection weight is 0.72.

[0082] refer to Figure 8 and Figure 9,Under the same conditions of the test environment and attack scenario, the unprotected (i.e. Figure 8 、 9 The original network) - the LDA protected network configured with traditional locality protection (i.e. Figure 8 LDA protection network) - LDA protection network configured based on the local degree protection configuration method of this embodiment (ie Figure 8 、 9 The network simulation attack experiments under three conditions: the dynamic LDA protection network and the LDA protection network with no protection and the hybrid RA-LDA protection strategy in the existing technology (i.e. Figure 9 (RA-LDA protection network) - Based on the LDA protection network configured by the local degree protection configuration method of this embodiment, a network simulation attack experiment under three conditions was conducted to obtain the maximum connected subgraph size after each round of attack. The larger the maximum connected subgraph size, the better the attack protection effect. By comparison, it was found that compared with the LDA protection network configured with traditional local degree protection, the network protection efficiency of the network configured by the local degree protection configuration method provided by this embodiment was improved by 9.90%, and compared with the LDA protection network configured with the hybrid RA-LDA protection strategy, the network protection efficiency of the network configured by the local degree protection configuration method provided by this embodiment was improved by 9.18%. The above data comparison shows that the local degree protection configuration method proposed by the present invention can effectively improve the robustness and anti-destruction performance of the network after configuring the LDA protection network, and has better protection performance. The LDA protection network configured with traditional local degree protection and the LDA protection network configured with a hybrid RA-LDA protection strategy have a lag in identifying key and important protection edges, and use fixed rules to identify key protection edges and their protection weights. The method provided in this embodiment can flexibly and dynamically configure important protection edges for the LDA protection network. By tracking network status changes in real time and dynamically adjusting protection schemes, it eliminates the response delay problem of static strategies and ensures the timeliness of protection measures through an attack step-by-step feedback mechanism. It solves the problem of attenuated protection effectiveness of traditional methods under complex attack modes and improves defense accuracy with a local degree dynamic allocation mechanism. It overcomes the computational burden brought by global optimization and realizes efficient configuration of protection resources through distributed decision-making, ultimately achieving an optimal balance between network robustness and resource consumption.

[0083] As one example, when performing initial protection, a complete copy of the original node network structure is generated, creating a copy called a "protection network diagram." All subsequent operations involving network structure modifications are performed on this copy, ensuring that the original network data remains unchanged, facilitating comparative analysis and traceability verification.

[0084] It is worth noting that Figure 7 The degree of each node in is visualized by the radius of the black circle.

[0085] Example 3:

[0086] This embodiment provides a computer device, including a processor and a memory connected to the processor, wherein a computer program is stored in the memory. When the computer program is executed by the processor, the steps of the local protection configuration method for network anti-destruction provided in Embodiment 1 or 2 are performed.

[0087] The computer device may be a server or an electronic terminal. As one embodiment, Figure 11 The computer device includes a processor, a memory, an input / output interface (I / O) and a communication interface. The processor, the memory and the input / output interface are connected via a system bus, and the communication interface is connected to the system bus via the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store data obtained and generated in the local protection configuration method for network anti-destruction. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, it implements the local protection configuration method for network anti-destruction provided in embodiment one or two.

[0088] Those skilled in the art will understand that Figure 11 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0089] The computer device provided in this embodiment has the same technical effects as those in Embodiment 1 or 2, and will not be described in detail here.

[0090] Example 4:

[0091] This embodiment provides a computer-readable storage medium having a computer program stored thereon. When the program is executed by a processor, the steps of the method for configuring local protection for network anti-destruction provided in the first or second embodiment are implemented.

[0092] The computer-readable storage medium provided in this embodiment has the same technical effects as those in Embodiment 1 or 2, and will not be described in detail here.

[0093] Embodiment 5:

[0094] This embodiment provides a computer program product having a computer program stored thereon. When executed by a processor, the computer program implements the steps of the method for configuring localized protection for network survivability provided in Embodiment 1 or Embodiment 2. The computer program product provided in this embodiment can be transmitted, distributed, and downloaded in the form of a signal via the Internet.

[0095] The computer program product provided in this embodiment has the same technical effects as those in Embodiment 1 or 2, and will not be described in detail here.

[0096] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Furthermore, the present application may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0097] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0098] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0099] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0100] Thus, features defined as "first", "second", etc. may include one or more of the features explicitly or implicitly. In the description of the present invention, unless otherwise specified, "plurality" means two or more.

[0101] In the description of the present invention, it should be noted that, unless otherwise expressly specified or limited, the terms "mounted," "connected," and "connected" should be understood in a broad sense. For example, they may refer to fixed connections, detachable connections, or integral connections; mechanical connections or electrical connections; direct connections or indirect connections through an intermediate medium; and internal communication between two components. Those skilled in the art will understand the specific meanings of the above terms in the present invention based on specific circumstances.

[0102] The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A method for configuring local protection for network anti-destruction, characterized in that: include: Acquire multiple node network structures, and extract first node pairs having economic relevance from the multiple node network structures, wherein two nodes in the first node pairs come from different node network structures; Obtaining the coupling network edge weight of the first node pair according to the sensitivity of the two nodes in the first node pair to each other's cost / price changes; In response to detecting that the node network structure is subject to a network attack / cascading failure: The degree of each node is calculated based on the weights of all coupled network edges corresponding to each node; Selecting a set number of second node pairs from all nodes according to the degree product between the two nodes; On the basis of configuring the original protection edge of the local degree protection strategy, a new protection edge is added to the configured local degree protection strategy according to the second node pair, and the protection weights of the original protection edge and the new protection edge are respectively configured according to the product of the degrees of the second node pairs corresponding to the original protection edge and the new protection edge.

2. The method for configuring local protection for network anti-destruction according to claim 1, characterized in that: The coupling network edge weight is obtained by calculating the following formula: ， Where, and Respectively represent the node network structure to which the two nodes in the first node pair belong, is the edge weight of the coupling network, For the The corresponding cost / price change when the cost / price changes at another node in the node network structure. For the The cost / price change corresponding to a node in a 4-node network structure when the cost / price change occurs at another node.

3. The method for configuring local protection for network anti-destruction according to claim 2, wherein: The step of selecting a set number of second node pairs from all nodes according to the degree product between the two nodes includes: Get the degree of each node; Sort all nodes by degree; The two nodes with the largest degree are selected in sequence as the second node pair, and the two nodes of each second node pair are not repeated.

4. The method for configuring local protection for network survivability according to claim 2, wherein: The step of selecting a set number of second node pairs from all nodes according to the degree product between the two nodes includes: Multiple rounds of random sampling of two nodes to form multiple pairs of second nodes; Get the degree product of each pair of second nodes; A plurality of second node pairs having the largest degree product are selected according to a set number.

5. The method for configuring local protection for network anti-destruction according to claim 3 or 4, characterized in that: The two nodes of the second node pair belong to different node network structures respectively.

6. The method for configuring local protection for network survivability according to claim 5, wherein: The step of selecting a set number of second node pairs from all nodes according to the product of the degrees between the two nodes also includes that the combination of two nodes included in each pair of second node pairs is unique.

7. The method for configuring local protection for network survivability according to claim 1, wherein: The protection weight is calculated by the following formula: ， Where, and are the two nodes of the second node pair corresponding to the protection edge, To protect the edge The protection weight, and It is the sum of the weights of all coupled network edges corresponding to the two nodes of the protection edge.

8. A computer device, characterized in that: The method comprises a processor and a memory connected to the processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the steps of the method for configuring local protection for network anti-destruction according to any one of claims 1 to 7 are executed.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the steps of the method for configuring local protection for network anti-destruction according to any one of claims 1 to 7 are implemented.

10. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instruction is executed by a processor, the steps of the method for configuring local protection for network anti-destruction according to any one of claims 1 to 7 are implemented.

Images