CN113673064A - Directed h-degree-based network damage resistance optimization method - Google Patents
Directed h-degree-based network damage resistance optimization method Download PDFInfo
- Publication number
- CN113673064A CN113673064A CN202110910861.3A CN202110910861A CN113673064A CN 113673064 A CN113673064 A CN 113673064A CN 202110910861 A CN202110910861 A CN 202110910861A CN 113673064 A CN113673064 A CN 113673064A
- Authority
- CN
- China
- Prior art keywords
- network
- degree
- nodes
- directed
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 56
- 238000000034 method Methods 0.000 title claims abstract description 41
- 230000006378 damage Effects 0.000 title claims abstract description 21
- 238000004364 calculation method Methods 0.000 claims abstract description 13
- 238000004445 quantitative analysis Methods 0.000 claims abstract description 6
- 238000012216 screening Methods 0.000 claims abstract description 4
- 238000004422 calculation algorithm Methods 0.000 claims description 10
- 238000004891 communication Methods 0.000 claims description 10
- 230000006872 improvement Effects 0.000 claims description 2
- 230000008859 change Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 239000012634 fragment Substances 0.000 description 4
- 238000013178 mathematical model Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000002708 enhancing effect Effects 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 244000131360 Morinda citrifolia Species 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 235000017524 noni Nutrition 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/55—Detecting local intrusion or implementing counter-measures
- G06F21/554—Detecting local intrusion or implementing counter-measures involving event detection and direct action
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2119/00—Details relating to the type or aim of the analysis or the optimisation
- G06F2119/02—Reliability analysis or reliability optimisation; Failure analysis, e.g. worst case scenario performance, failure mode and effects analysis [FMEA]
Abstract
The invention provides a network anti-damage performance optimization method based on directed h degree. The directed h-degree-based network damage resistance optimization method comprises the following steps: s1, analyzing the equipment guarantee network, and abstracting the equipment guarantee system into a network structure according to the main body and the structure of the equipment guarantee system; and S2, calculating directed h degrees by the equipment support network nodes, selecting the anti-destruction enhanced nodes, carrying out quantitative analysis on the equipment support system by adopting the directed h degrees to carry out quantitative calculation, and screening out the nodes needing to enhance the anti-destruction performance. The directed h degree-based network damage resistance optimization method provided by the invention adopts the redundant link-based network topology optimization, does not damage the existing network structure, reduces the network risk by changing the distribution of the nodes based on the node optimization, improves the network safety by increasing the links and improving the redundancy, and obviously improves the network safety.
Description
Technical Field
The invention relates to the technical field of network equipment reliability, in particular to a network anti-damage performance optimization method based on directed h-degree.
Background
The equipment guarantee network is formed by coexistence and change of various structures, the topological structure of the equipment guarantee network can show the characteristic of 'no scale' consciously or unconsciously, and in the no-scale network, the faults of distributed nodes and key subnetworks can cause the whole network to crash and further cause serious results, so that the equipment guarantee network not only provides an important means for effectively preventing network attacks and improving survivability, but also provides an important guarantee for network safety by researching the hole-leakage-proof strategy of the distributed nodes and discussing the network topology optimization scheme.
The network is divided into a weighted information network and an unweighted information network according to whether weights exist between links. The weight information network is divided into a directed weight network and an undirected weight network, the traditional network structure research mainly aims at the undirected network and the weight network, although most shared information networks are undirected and weighted networks and can use h degree to carry out quantitative analysis, but many networks in military operation are directed networks, in the networks, two directions of the same node are connected and cannot be combined to carry out h degree calculation, and therefore, aiming at the directed weight information network, the original h degree still needs to be improved. So as to better reflect the importance degree and the function of the network node and provide a theoretical basis for improving the damage resistance of the network.
Therefore, a network damage resistance optimization method oriented to the directed weight network needs to be researched, optimization is performed from two aspects of selection of the damage resistance enhancement nodes and improvement of communication reliability, a mathematical model of the above contents is established, and network damage resistance optimization is performed.
Therefore, it is necessary to provide a network anti-damage performance optimization method based on directed h-degree to solve the above technical problems.
Disclosure of Invention
The invention provides a network damage resistance optimization method based on directed h degree, which solves the problems that the existing network equipment can not simultaneously consider the selection of a damage resistance enhancement node of an equipment guarantee network and improve the communication reliability, can not obtain an optimal network topology scheme, can not ensure the timely transmission of information, and is lack of the capability of resisting interrupt risks.
In order to solve the technical problem, the directed h-degree-based network anti-damage performance optimization method provided by the invention comprises the following steps of:
s1, analyzing the equipment guarantee network, and abstracting the equipment guarantee system into a network structure according to the main body and the structure of the equipment guarantee system;
s2, calculating directed h degrees by the equipment security network nodes, selecting an anti-destruction enhanced node, carrying out quantitative analysis on the equipment security system by adopting the directed h degrees to carry out quantitative calculation, and screening out the node needing to enhance the anti-destruction performance;
s3, ensuring a network h-optimization centralization model by the equipment;
s4, designing redundant links to improve the survivability of the network, designing an adjacent network with a ring link connected with distributed nodes, arranging a plurality of adjacent networks to have a plurality of ring links, and measuring whether the optimized topology is optimal or not according to the average shortest path among the nodes in the network;
and S5, comprehensively considering to obtain a network topology structure optimization scheme.
Preferably, in step S1, the device protection network adopts a tree-like device protection network structure, that is, a device protection network is protected from a higher-level node to a lower-level node.
Preferably, in step S2, the directional h-degree is divided into an ingress h-degree and an egress h-degree, and the ingress h-degree and the egress h-degree respectively represent ingress and egress connections of the node.
Preferably, in the step S2, the essence of the h-in centrality and the h-out centrality is to normalize the h-in degree and the h-out degree thereof without changing the grade thereof, for comparing nodes from different networks or dynamic networks.
Preferably, in the step S2, after the directional h-degree of each node is calculated, the nodes are sorted from large to small, and a point with a large value needs to be determined as an enhanced survivor node for a node with a large influence on the network, and the node is improved by adopting redundancy or changing the network structure.
Preferably, in the step S3, the h-degree algorithm emphasizes that the central node should have two conditions at the same time: a first connection having a plurality of nodes; second, the connection to other nodes should be tighter.
Preferably, in step S4, the segment networks are connected by a link, so that there is at least one link between any two nodes in the whole network, thereby realizing communication between any two nodes.
Preferably, in step S5, the nodes need to be strengthened from the destruction resistance and the connection reliability of the network need to be improved.
Preferably, in the step S5, for the enhanced survivor node, the method may be improved by adopting redundancy or changing the network structure, and for the h-center value of the whole network, the weight of the modified edge may be adopted to optimize.
Preferably, in the step S5, the damaged network may be optimized by using a network topology optimization strategy based on redundant links.
Compared with the related technology, the directed h degree-based network anti-damage performance optimization method provided by the invention has the following beneficial effects:
the invention provides a network anti-damage performance optimization method based on directed h degree, which optimizes the anti-damage performance of an equipment guarantee network, researches an optimization method oriented to network reliability, and establishes a mathematical model and a solving algorithm for optimizing the anti-damage performance of the network under the conditions of simultaneously considering the selection of anti-damage enhanced nodes of the equipment guarantee network and improving the communication reliability.
1. The directed h degree can reflect the node importance degree of the directed network better than the h degree.
2. The h degree of the network center can better reflect the damage resistance of the whole network, and a new objective function and index are provided for the structural optimization of the network.
3. The method comprises the steps of (1) adopting network topology optimization based on redundant links, (1) not damaging the existing network structure, reducing network risks by changing the distribution of the nodes based on the node optimization, on the other hand, improving the network security by only increasing the links and improving the redundancy rate without changing the connection relation between the existing nodes based on the redundant link optimization scheme, and (2) obviously improving the network security, wherein the network optimized by adopting a hierarchical processing method is more prone to tree shapes, and once attacked, the network is likely to be divided into a plurality of segments. Link-based optimization schemes reduce the likelihood of such situations.
Drawings
FIG. 1 is a schematic diagram of an equipment secured network optimization process of the present invention;
FIG. 2 is a diagram of an equipment assurance system architecture;
FIG. 3 is a calculation example of the click-in h value and the click-out h value of A;
fig. 4 is a change situation of the h value of the whole network center after a certain node is deleted;
fig. 5 shows a ring-shaped interchange structure formed by connecting the central nodes of each network segment;
FIG. 6 is a comparison before and after optimization;
Detailed Description
The invention is further described with reference to the following figures and embodiments.
Please refer to fig. 1-6, wherein fig. 1 is a schematic diagram illustrating an apparatus-guaranteed network optimization process according to the present invention; FIG. 2 is a diagram of an equipment assurance system architecture; FIG. 3 shows an example of calculation of the click-in h value and the click-out h value of A. The directed h-degree-based network anti-damage performance optimization method comprises the following steps:
s1, analyzing the equipment guarantee network, and abstracting the equipment guarantee system into a network structure according to the main body and the structure of the equipment guarantee system;
s2, calculating directed h degrees by the equipment security network nodes, selecting an anti-destruction enhanced node, carrying out quantitative analysis on the equipment security system by adopting the directed h degrees to carry out quantitative calculation, and screening out the node needing to enhance the anti-destruction performance;
s3, ensuring a network h-optimization centralization model by the equipment;
s4, designing redundant links to improve the survivability of the network, designing an adjacent network with a ring link connected with distributed nodes, arranging a plurality of adjacent networks to have a plurality of ring links, and measuring whether the optimized topology is optimal or not according to the average shortest path among the nodes in the network;
and S5, comprehensively considering to obtain a network topology structure optimization scheme.
Referring to FIG. 1, the nodes in FIG. 1 represent warehouse or equipment usage units, the lines represent supply relationships, and the values on the lines represent the number of supplies.
In the device security system network, the network node represents an entity participating in device security, and the connection line in the network represents a spare part flow, an information flow, a fund flow, and the like, and the device security network structure of the device security system in fig. 1 can be obtained according to the supply relationship.
Because the equipment guarantee system is a directed weighting network and cannot perform quantitative analysis by using the traditional h degree, the directed h degree is introduced for quantitative calculation, nodes needing to enhance the anti-damage performance are screened out, in addition, different network topological structures also have great influence on the anti-damage performance of the network, and how to select the anti-damage enhancement nodes and improve the communication reliability of the network when the network is constructed has important significance for improving the anti-damage performance of the network.
In step S1, the device-secured network adopts a tree-like device-secured network structure, i.e., a device is secured from a higher-level node to a lower-level node.
In step S2, the directional h-degree is divided into an h-degree entry and an h-degree exit, and the h-degree entry and the h-degree exit respectively represent the entry and the exit of the node.
Survivability refers to the ability of the system to complete various functions after the system is damaged, in 1999, Albert put forward a non-scale network model by researching networks such as the world Wide Web, a cell network and the like, put two models, namely a random network model and a non-scale network model into two types of attacks, namely random attack and deliberate attack, and carried out a great deal of research on the network survivability of static topology, and Ellison et al put forward a set of framework for analyzing the survivability of the information system.
Ellison provides a concept of information system survivability and an SNA evaluation method, wherein the survivability refers to the capability of completing the task of a system in the face of attack and failure within a certain time, and the SNA method is a method for analyzing the information system survivability framework.
The nodes and the edges are the basis of the network, and the h degree can effectively measure the nodes and the related relation thereof. And determining that the enhanced nodes of the directed weighted network are measured by adopting directed h degrees.
The directional h degree is divided into an in-h degree and an out-h degree, which are defined as follows.
Define 2. Out-h-degree (ho), and in the directed weight network, the Out-h degree ho (n) of a node n means that the node maintains an Out-relation of h0(n) or more with other h0(n) nodes at most.
According to the definition, the h-in degree and the h-out degree respectively represent the connection in and the connection out of the node. A high degree of going in h (or going out h) indicates that the node not only links many other nodes, but is also maintained. Relatively strong in-links (or out-links) with these linked nodes. This directed h-degree can be computed programmatically and quickly.
In step S2, the essence of the h-in centrality and the h-out centrality is to normalize the h-in degree and the h-out degree thereof without changing the levels thereof for comparing nodes from different networks or dynamic networks.
In step S2, after the directional h-degree of each node is calculated, the nodes are sorted from large to small, and a point with a large value needs to be determined as an enhanced survivor node for a node with a large influence on the network, and the node is improved by adopting redundancy or changing the network structure.
Referring to fig. 3 and 4 again, fig. 3 shows the result of step-by-step calculation of data in the result table obtained by the program calculation, note that: the link weight of a is (6, 4, 4, 2, 2) from large to small, and thus the link weight of a is (6, 4, 4, 2, 2). The intensity of a is 6+4+4+2+2 ═ 18, and the in-h degree is 2 (the intensity of 3in-link is greater than or equal to 2). In addition, the outbound link weight of a is (4, 4, 2), so its outbound degree is 4+4+2 ═ 10, its outbound degree is 2 (the strength of 2 outbound links is greater than or equal to 2),
in a network with N nodes, ni (N) denotes the number of neighbor nodes of node N that maintain an intra-link with node N, no (N) is the number of neighbor nodes of node N that maintain an out-link with node N, and di (N) and do (N) denote in-degree and out-degree of node N. Then the following inequality is easily checked:
0≤hI(n)≤NI(n)<N (1)
0≤ho(n)≤No(n)<N (2)
dI(n)≥h2I(n) (3)
do(n)≥h2o(n) (4)
in a directed weighting network with N nodes (N >1), the in-h-centrality (CHI (N)) of node N is defined as:
in a directed weighting network with N nodes (N >1), the out-h-centrality (cho (N)) of a node N is defined as:
the following equations can be derived from equations (1), (2).
The essence of the in-h centrality and out-h centrality is to normalize their in-h and out-h degrees without changing their rank, so they may be used to compare nodes from different networks or dynamic networks.
After the directed h degree of each node is calculated, the nodes are sorted from large to small, points with large numerical values are nodes with large influence on the network and need to be determined as reinforced survivor nodes, the nodes can be improved in a mode of redundancy or changing the network structure, and the calculation and sorting results of the directed h degree are shown in the table:
in said step S3, the h-degree algorithm emphasizes that the central node should have two conditions at the same time: a first connection having a plurality of nodes; second, the connection to other nodes should be tighter.
For the directed h degree, when the number of in-contacts (or out-contacts) of the node is 0, the degree of in-h (or out-h) is 0, and when the number of in-contacts (or out-contacts) of the node is large but the strength is 1, the degree of in-h (or out-h) is only 1. When the number of the incoming contacts (or the outgoing contacts) of the node is 1, the incoming degree (or the outgoing degree) is not larger than l no matter how the strength of the contact takes a value
An objective function: the equipment guarantees h centrality of overall out-degree and in-degree of the network:
the model needs to satisfy the following constraints:
the h-degree algorithm emphasizes that the central node should have two conditions at the same time: a first connection having a plurality of nodes; second, the connection to other nodes should be tighter. Therefore, for the directed h degree, when the number of in-contacts (or out-contacts) of the node is 0, the in-h degree (or out-h degree) is 0, and when the number of in-contacts (or out-contacts) of the node is large but the strength is 1, the in-h degree (or out-h degree) is only 1. When the number of incoming contacts (or outgoing contacts) of a node is 1, the incoming degree (or outgoing degree) is not larger than l no matter how the strength of the contact is, as shown in formulas (3) and (4).
The established model can be solved by adopting a directed h-centrality algorithm. Example results of the solution are shown in FIG. 4:
fig. 4 shows the change situation of the h value of the whole network center after deleting a certain node, and it can be seen from the graph that the h value of the network center after deleting 12, 13, 14 points is almost zero, which means that the three points are very important, and are consistent with the previous analysis result of the enhanced damage point, and the validity of the method is verified again
And the calculation codes and the flow of h degrees are directed.
The calculation procedure for the directed h-degree is shown below.
And step two, coding the h value of the network center.
The calculation procedure for the hub h value is shown below.
In step S4, the segment networks are connected by a link, so that there is at least one link between any two nodes in the whole network, and communication between any two nodes is realized.
Taking the topology of the ring network as an example, there is a distributed node in the network, when the node is damaged, the edge connected to the node will also fail, and since the nodes adjacent to the distributed node are not all connected to each other, after losing the aggregativity of the distributed node, the nodes will be included in a plurality of network fragments. Such network fragments are referred to herein as a contiguous network of distributed nodes.
For the whole network, under the condition of losing distributed nodes, a plurality of node pairs cannot communicate with each other, when the network is attacked, corresponding measures must be taken to ensure the connectivity between the remaining nodes in order to ensure the communication between the remaining nodes, therefore, the segmented network is connected by one link, so that at least one link is arranged between any two nodes in the whole network, and the communication between any two nodes can be realized.
The algorithm for selecting the average shortest path among the nodes in the network to measure whether the optimized topology is optimal is as follows:
for the network a, the topology optimization algorithm is specifically as follows:
the first step is that the node Noni with the maximum degree which does not participate in optimization in the network A is found;
secondly, constructing a network Ai' which comprises all nodes except the Nodei;
thirdly, Ai 'is formed by a plurality of network fragments which are respectively marked as Ai 1', Ai2 ', … and Ain';
fourthly, counting the number of nodes in Ai1 ', Ai 2', … and Ain ', and marking as Ni 1', Ni2 ', … and Nin';
and fifthly, finding out geometric center nodes in the Ai1 ', Ai 2', … and Ain 'network fragments, and marking the geometric center nodes as Nodei 1', Nodei2 ', … and Nodein', wherein each center node has the shortest total distance to other nodes in the network.
And sixthly, assuming that Ni1 ' > Ni2 ' > … > Nin ' is adopted, then the central nodes of each network slice are connected, and the formed annular overpass structure is shown in FIG. 5.
Seventhly, marking the Nodei as an optimized node;
and eighth step, counting the number of the optimized nodes and judging whether the optimized proportion meets the requirement of the scheme. If successful, the optimization procedure is terminated, otherwise the first step is repeated.
We adopt 10, 100 and 800 network nodes to perform damage simulation respectively, and optimize by the proposed method, and the obtained results are shown in fig. 6.
As can be seen from fig. 6, the result after optimization is better than that before optimization, indicating that the optimization method is feasible and effective.
In step S5, it is necessary to take comprehensive consideration from the two aspects of enhancing the nodes for survivability and improving the connection reliability of the network.
And after adding the survivability enhancing nodes, fusing a network topology structure optimization strategy based on the redundant links, and making an optimization scheme aiming at the topology structure of the equipment security network.
In step S5, for the enhanced survivor node, the method of redundancy or changing the network structure may be used to improve, and for the h-center value of the whole network, the weight of the modified edge may be used to optimize.
In step S5, the damaged network may be optimized by using a network topology optimization strategy based on redundant links.
Compared with the related technology, the directed h degree-based network anti-damage performance optimization method provided by the invention has the following beneficial effects:
the method is characterized in that the anti-damage performance of the equipment security network is optimized, an optimization method oriented to the network reliability is researched, and a mathematical model and a solving algorithm for optimizing the anti-damage performance of the network are established under the conditions that the selection of the anti-damage enhanced nodes of the equipment security network and the communication reliability are considered at the same time.
1. The directed h degree can reflect the node importance degree of the directed network better than the h degree.
2. The h degree of the network center can better reflect the damage resistance of the whole network, and a new objective function and index are provided for the structural optimization of the network.
3. By adopting the network topology optimization based on the redundant link, (1) the existing network structure is not damaged. The optimization based on the nodes reduces the network risk by changing the distribution of the nodes, on the other hand, the optimization scheme based on the redundant links does not change the connection relationship among the existing nodes, but improves the network security by increasing the links and improving the redundancy, and (2) the network security is obviously improved, the network optimized by adopting the hierarchical processing method is more prone to tree shapes, and once attacked, the network is likely to be divided into a plurality of segments. Link-based optimization schemes reduce the likelihood of such situations.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. A network anti-damage performance optimization method based on directed h degree is characterized by comprising the following steps:
s1, analyzing the equipment guarantee network, and abstracting the equipment guarantee system into a network structure according to the main body and the structure of the equipment guarantee system;
s2, calculating directed h degrees by the equipment security network nodes, selecting an anti-destruction enhanced node, carrying out quantitative analysis on the equipment security system by adopting the directed h degrees to carry out quantitative calculation, and screening out the node needing to enhance the anti-destruction performance;
s3, ensuring a network h-optimization centralization model by the equipment;
s4, designing redundant links to improve the survivability of the network, designing an adjacent network with a ring link connected with distributed nodes, arranging a plurality of adjacent networks to have a plurality of ring links, and measuring whether the optimized topology is optimal or not according to the average shortest path among the nodes in the network;
and S5, comprehensively considering to obtain a network topology structure optimization scheme.
2. The method for optimizing network anti-damage performance based on directed h-degree as claimed in claim 1, wherein in step S1, the device-assurance network adopts a tree-like device-assurance network structure, i.e. device assurance from a higher-level node to a lower-level node.
3. The method for optimizing network anti-damage performance based on directional h-degree as claimed in claim 1, wherein in the step S2, the directional h-degree is divided into an ingress h-degree and an egress h-degree, and the ingress h-degree and the egress h-degree respectively represent ingress and egress connections of the node.
4. The method for optimizing anti-damage performance of network according to claim 1, wherein in step S2, the essence of h-centrality and h-centrality is to normalize the h-centrality and h-centrality without changing their levels for comparing nodes from different or dynamic networks.
5. The directed h-degree-based network damage-resistance performance optimization method according to claim 1, wherein in step S2, after the directed h-degrees of each node are calculated, the directed h-degrees are sorted from large to small, and a node with a large numerical value, which has a large influence on the network, needs to be determined as an enhanced damage-resistance node and is improved by adopting redundancy or changing a network structure.
6. The directed h-degree-based network anti-damage performance optimization method according to claim 1, wherein in the step S3, the h-degree algorithm emphasizes that the central node should have two conditions at the same time: a first connection having a plurality of nodes; second, the connection to other nodes should be tighter.
7. The method for optimizing network damage resistance performance based on h-degree direction of claim 1, wherein in step S4, the segment networks are connected by a link, so that there is at least one link between any two nodes in the whole network, thereby realizing communication between any two nodes.
8. The directed h-degree-based network damage resistance optimization method of claim 1, wherein in the step S5, it is required to take comprehensive consideration from the two aspects of damage resistance enhancement nodes and improvement of network connection reliability.
9. The method for optimizing network damage resistance performance based on h-degree directed algorithm according to claim 8, wherein in step S5, for the enhanced nodes, the enhancement can be performed by redundancy or changing the network structure, and for the h-center value of the whole network, the optimization can be performed by changing the weight of the edge.
10. The method for optimizing the damage-resistant performance of the network according to claim 9, wherein in step S5, the damaged network can be optimized by using a network topology optimization strategy based on redundant links.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110910861.3A CN113673064A (en) | 2021-08-10 | 2021-08-10 | Directed h-degree-based network damage resistance optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110910861.3A CN113673064A (en) | 2021-08-10 | 2021-08-10 | Directed h-degree-based network damage resistance optimization method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113673064A true CN113673064A (en) | 2021-11-19 |
Family
ID=78542049
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110910861.3A Pending CN113673064A (en) | 2021-08-10 | 2021-08-10 | Directed h-degree-based network damage resistance optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113673064A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115190020A (en) * | 2022-05-23 | 2022-10-14 | 清华大学 | Method and device for optimizing survivability of regional network |
| CN116596532A (en) * | 2022-11-07 | 2023-08-15 | 北京天德科技有限公司 | Supervision method based on real-time suspicious transaction identification and supervision blockchain wallet |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020071392A1 (en) * | 2000-10-25 | 2002-06-13 | Telecommunications Research Laboratories, An Alberta Corporation | Design of a meta-mesh of chain sub-networks |
| CN105406988A (en) * | 2015-10-26 | 2016-03-16 | 中国电子科技集团公司第二十八研究所 | Software-definition survivable network construction method |
| CN107733719A (en) * | 2017-11-06 | 2018-02-23 | 中国电子科技集团公司第二十八研究所 | A kind of software definition is anti-to ruin network intact path restoration methods |
-
2021
- 2021-08-10 CN CN202110910861.3A patent/CN113673064A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020071392A1 (en) * | 2000-10-25 | 2002-06-13 | Telecommunications Research Laboratories, An Alberta Corporation | Design of a meta-mesh of chain sub-networks |
| CN105406988A (en) * | 2015-10-26 | 2016-03-16 | 中国电子科技集团公司第二十八研究所 | Software-definition survivable network construction method |
| CN107733719A (en) * | 2017-11-06 | 2018-02-23 | 中国电子科技集团公司第二十八研究所 | A kind of software definition is anti-to ruin network intact path restoration methods |
Non-Patent Citations (10)
| Title |
|---|
| 严国强;张杰勇;李辉;: "基于软件定义网络的抗毁网络仿真", 指挥信息系统与技术, no. 05, 31 December 2016 (2016-12-31), pages 47 - 52 * |
| 刘浩然;王星淇;覃玉华;邓玉静;尹荣荣;: "具有抗毁性的无线传感器网络有向拓扑模型", 控制理论与应用, no. 06, 31 December 2020 (2020-12-31), pages 44 - 50 * |
| 吴俊, 谭跃进: "复杂网络抗毁性测度研究", 《系统工程学报》, 26 May 2005 (2005-05-26), pages 128 - 131 * |
| 张逸斋, 郭平, 赵娟, 等.: "基于冗余链路的无尺度网络拓扑结构优化研究", 《通信技术》, 24 April 2009 (2009-04-24), pages 146 - 148 * |
| 李际超, 吴俊, 谭跃进, 等: "基于有向自然连通度的作战网络抗毁性研究", 《复杂系统与复杂性科学》, 13 May 2016 (2016-05-13), pages 25 - 31 * |
| 王晓磊;杨岳湘;何杰;: "基于多重属性的P2P网络节点重要性度量方法", 计算机应用, no. 2, 15 December 2014 (2014-12-15), pages 14 - 17 * |
| 王甲生, 吴晓平, 陈泽茂, 等: "修复策略下典型拓扑结构复杂网络抗毁性研究", 《海军工程大学学报》, 2 November 2015 (2015-11-02), pages 75 - 79 * |
| 韦小铃;阳建中;: "节点失效模式下复杂网络结构抗毁性优化仿真", 计算机仿真, no. 05, 15 May 2018 (2018-05-15), pages 255 - 259 * |
| 顾宏波;万玺;王智源;: "基于冗余链路的通信网络拓扑结构优化及抗毁伤性仿真", 系统工程, no. 03, 28 March 2010 (2010-03-28), pages 84 - 90 * |
| 黄仁全, 李为民, 董雯, 等: "基于复杂网络抗毁性与ADMPDE算法的网络拓扑结构优化", 《空军工程大学学报（自然科学版》, 9 January 2013 (2013-01-09), pages 60 - 65 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115190020A (en) * | 2022-05-23 | 2022-10-14 | 清华大学 | Method and device for optimizing survivability of regional network |
| CN115190020B (en) * | 2022-05-23 | 2023-09-26 | 清华大学 | Regional network survivability optimization method and device |
| CN116596532A (en) * | 2022-11-07 | 2023-08-15 | 北京天德科技有限公司 | Supervision method based on real-time suspicious transaction identification and supervision blockchain wallet |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113673064A (en) | Directed h-degree-based network damage resistance optimization method | |
| Liu et al. | Analysis of vulnerabilities in maritime supply chains | |
| Zhou et al. | A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm | |
| Yamada et al. | Genetic algorithms for job-shop scheduling problems | |
| CN111193629B (en) | Fault propagation method for dynamic load cascade failure of multilayer information network | |
| Yarlagadda et al. | Fast algorithm for computing the reliability of a communication network | |
| Sun et al. | Construction of a multi-echelon supply chain complex network evolution model and robustness analysis of cascading failure | |
| Dagdeviren | Weighted connected vertex cover based energy-efficient link monitoring for wireless sensor networks towards secure internet of things | |
| Zhu et al. | Expanding a complex networked system for enhancing its reliability evaluated by a new efficient approach | |
| CN110046838A (en) | A kind of rail traffic industrial chain configuration method based on multilayer complex network | |
| Ashrafi et al. | The failure probability of components in three-state networks with applications to age replacement policy | |
| CN106603294A (en) | Comprehensive vulnerability assessment method based on power communication network structure and state | |
| CN115719186A (en) | Regional traffic network toughness assessment method and system | |
| Berman et al. | Probabilistic location problems with discrete demand weights | |
| Kim et al. | Bicriteria network design using a spanning tree-based genetic algorithm | |
| CN115310587A (en) | Abnormal graph node detection method based on bridge automatic encoder | |
| CN108090616A (en) | A kind of electric system Active Splitting optimal section searching method | |
| Dorronsoro et al. | Adaptive neighborhoods for cellular genetic algorithms | |
| Yang | Reliability comparison between plain-based and cluster-based linear wireless sensor networks | |
| Das et al. | Generating proactive humanitarian aid networks with guided topology and small-world effect | |
| Liu et al. | Information spreading dynamics on adaptive social networks | |
| CN109526018A (en) | A kind of linear wireless sensor network performance analysis method with backbone node | |
| Zhao et al. | An approach to generate damage strategies for inter-domain routing systems based on multi-objective optimization | |
| Liu et al. | Fault-Tolerant Secure Routing Based on Trust Evaluation Model in Data Center Networks | |
| Mohsin et al. | An Innovative Topologies Based on Hypercube Network Interconnection |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |