CN115277433A - Reliability evaluation method based on scheduling data network topological structure - Google Patents
Reliability evaluation method based on scheduling data network topological structure Download PDFInfo
- Publication number
- CN115277433A CN115277433A CN202210765524.4A CN202210765524A CN115277433A CN 115277433 A CN115277433 A CN 115277433A CN 202210765524 A CN202210765524 A CN 202210765524A CN 115277433 A CN115277433 A CN 115277433A
- Authority
- CN
- China
- Prior art keywords
- reliability
- network
- node
- access network
- data network
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a reliability evaluation method based on a scheduling data network topological structure. The method specifically comprises the steps of abstracting a dispatching data network, establishing a reliability model, further determining a transmission path set from a core layer master dispatching router to a convergence router by analyzing a topological structure of the dispatching data network, calculating the reliability of the whole end of each access network by using a chain simplification method and a graph variation method according to a special structure of the dispatching data network, and calculating the reliability of the two ends of a master dispatching center and each convergence router by combining the path set. And finally, calculating the comprehensive reliability of the scheduling data network. The method can complete the reliability evaluation and analysis of the network scheduling data network in a hierarchical manner by combining with the special topological structure of the scheduling data network, and has important theoretical and practical application value for the reliability analysis and research of the scheduling data network.
Description
Technical Field
The invention relates to a reliability evaluation method based on a scheduling data network topological structure.
Background
The power dispatching data network is a special data network for power dispatching production service, is formed by connecting router equipment in main dispatching centers at all levels, direct-dispatching power plants and substations through links, bears various power dispatching communication services, is significant in stability of the dispatching data network, and can cause power grid influence of a certain scale and cause immeasurable loss due to missing and instability of dispatching data. Therefore, when the network is designed for dispatching the data network, the reliability of data transmission is ensured, the stability of the network structure is ensured, the topological structure of the dispatching data network is special, and the redundancy is high.
Disclosure of Invention
The invention aims to provide a reliability evaluation method based on a scheduling data network topological structure, which can complete reliability evaluation and analysis of a network scheduling data network in a hierarchical manner by combining a special topological structure of the scheduling data network, and has important theoretical and practical application values for reliability analysis and research of the scheduling data network.
In order to achieve the purpose, the technical scheme of the invention is as follows: a reliability evaluation method based on a scheduling data network topological structure comprises the following steps:
step1, abstracting a scheduling data network, and establishing a reliability model;
step 2, confirming a minimum path set by combining the topological structure;
step 3, calculating the reliability of the whole end of the connected access network;
step4, calculating the reliability of the main dispatching center and the sink node;
and 5, calculating the comprehensive reliability of the scheduling data network.
Compared with the prior art, the invention has the following beneficial effects: the method can complete reliability evaluation and analysis of the network scheduling data network in a hierarchical manner by combining with a special topological structure of the scheduling data network, and has important theoretical and practical application value for reliability analysis and research of the scheduling data network.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Fig. 2 is a diagram of a dispatch data network architecture in accordance with an embodiment of the present invention.
FIG. 3 is a schematic illustration of an embodiment of the present invention.
Detailed Description
The technical scheme of the invention is specifically explained below with reference to the accompanying drawings.
The invention relates to a reliability evaluation method based on a topological structure of a scheduling data network, which specifically comprises the steps of abstracting the scheduling data network, establishing a reliability model, further determining a transmission path set from a core layer master router to a convergence router by analyzing the topological structure of the scheduling data network, calculating the reliability of all ends of each access network by using a chain simplification method and a graph variation method aiming at the special structure of the scheduling data network, and calculating the reliability of both ends of a master control center (namely a master control node) and each convergence router (namely an access node) by combining the path set. And finally, calculating the comprehensive reliability of the scheduling data network. As shown in FIG. 1, the method of the present invention comprises the following steps:
step1, abstracting and scheduling a data network, and establishing a reliability model.
And 2, confirming the minimum path set by combining the topological structure.
And 3, calculating the reliability of the whole access network end.
And 4, calculating the reliability of the main dispatching center and the sink node.
And 5, calculating the comprehensive reliability of the scheduling data network.
The concrete case is as follows:
step1, abstracting a scheduling data network into a topological structure diagram of nodes and edges under the condition that the nodes are completely reliable, and establishing a reliability model.
Abstracting a scheduled data network into a graph G = (N, E) composed of devices as nodes and links as edges, wherein N is a node set and sharesAnd E is a link set, and m links are shared. The reliability of the jth link is the probability that the link keeps normal communication, assuming that the node is completely reliable
pj∈[0，1]Wherein MTBF is mean time to failure. The reliability evaluation described herein, specifically, a reliability evaluation model for scheduling tasks based on a scheduling data center, is a probability that at least one path normally works in a multi-redundancy structure, and belongs to the connectivity reliability. And the reliability of the whole scheduling data network is further calculated by combining the similarity of the scheduling data network to the same-level scheduling topological structure.
And 2, on the basis of abstracting the topological structure of the dispatching network, determining a minimum path set of the dispatching data network which can be communicated with the access network by analyzing the redundant structure of the dispatching data network.
And determining a transmission path set from the scheduling data network to the access network according to the topological structure of the scheduling data network. When a data network master dispatching center and a local dispatching network are dispatched to communicate, in order to guarantee stability and reliability of communication, a plurality of selectable links are usually adopted, and high redundancy is provided. According to the service characteristics of different automatic systems and considering the principle of facilitating network expansion, the dispatching data network adopts a layered structure to form a network, a provincial dispatching master dispatching center and a standby dispatching center are used as core nodes to form a core layer, sink nodes of various grade cities form a sink layer, and access nodes of various grade cities and plant stations form an access layer.
A node (hereinafter referred to as a master node) in the backbone network directly connected to the provincial dispatching local area network is set as C, and a target access network set is set as T. Two convergence layer nodes which are accessed to the equipment of the access layer nearby are called access nodes and are responsible for service data access of local dispatching, transformer substations and direct dispatching power plants. The master node is communicated with the access node from the access nodei. The target access network set is various market-level access networks T = { T = { (T) }1，t2，...tbAnd b local access networks. For access network tiProvincial node to tiIs O (t)i)＝{r1，r2，...，rq}，rqThe path is composed of edges, the source node is a master node, and the target node is an access node.
In the invention, a master node is taken as a source node, an access point is taken as a target node, the reliability of two ends of two sources is analyzed, and due to the redundancy structure of a scheduling data network, 5 connecting lines exist between the master node and a lower layer router in the scheduling data network, wherein any one of the connecting lines is communicated, namely the communication. As shown in the attached figure 2: the core layer of the backbone network is composed of four provincial dispatching node groups, namely a provincial dispatching node A and a standby dispatching node A which are connected with each city level node. In the access network, two sink nodes are in charge of receiving backbone network data, and the minimum path is as follows in combination with the redundancy structure.
Line r1＝e1，r2＝e9，r3＝e11e12，r4＝e5e10e12，r5＝e6e10e12，r6＝e7e10e12，r7＝e1e3，r8＝e5e2e3，r9＝e6e2e3，r10＝e7e2e3,r11＝e11e10e2e3,r12＝e13，r13＝e1e2e10e12,. Wherein the dotted line is a link omitted from a portion of the two degree nodes.
Step 3, aiming at the special structure of the scheduling data network, combining a chain simplification method and a graph change method (FIG. 3 is a graph simplification example of an embodiment of the invention), calculating the access network tiThe reliability of (2);
scheduling data network t for each placeiCalculating the reliability R (t) of the whole terminal according to the topological structure characteristics of the local dispatching access networki). The device of the access layer is accessed to two nearby convergent layer nodes in a ring connection mode, the ring network is connected with the convergent nodes by adopting a plurality of simple ring networks, and each simple ring network is a chain containing a plurality of two-degree nodesThe structure, herein, employs a chain reduction to simplify the network. Furthermore, a graph change method is used, the number of degrees in the network is simplified to be 1, parallel links are simplified, and the deleted nodes and edges are replaced by new edges. When the graph has no two-degree nodes, one-degree nodes and parallel links, the number of nodes and edges in the graph is reduced, and the graph simplification process is finished. And finally, calculating the reliability of the whole terminal.
The communication reliability of the network is kept unchanged under the constraint condition of network simplification in graph change, so that a reduction factor lambda of the network reliability is obtained after each change, the reduction factor lambda is a proportionality coefficient of the network communication reliability before and after reduction, and the reliability of the whole terminal is
R＝λ*Rs
Wherein R is the connection reliability of the original network, RsTo reduce the connection reliability.
The diagram simplification process is as follows:
and Step1, reducing all two-degree nodes in the graph by using a chain simplification method. According to the chain simplification method, a new edge e is used for replacing all two-degree nodes and connected edges on a link, c is the number of edges on the link, and after simplification, the reliability of the new edge is
And a reduction factor of
And Step 2, all the first-degree nodes in the reduction graph are obtained, the first-degree nodes are simplified, edges and nodes of the corresponding nodes are directly removed, and the reduction factor is the probability of the primary edge.
Step 3, reducing the parallel links in the simplified graph, and replacing all the parallel links with a new link, particularly the sink node cannot be reduced. Multilink parallel simplified formula
Step4, if the graph has no second-degree node, first-degree node and parallel link, the graph change process is ended, and the reliability R of the whole end of the graph is calculatedsIf only the aggregation node is left in the graph, the reliability can be calculated by using a parallel formula, otherwise, the reliability is calculated by using an enumeration method, and further, the whole-end reliability R of the original graph is obtained by combining a reduction factor, namely the whole-end reliability R (t) of the access networki). Otherwise, returning to the first step.
Taking an access network in a certain area as an example, assuming that the reliability of all edges is 0.9, the reliability of the whole end of the access network in a certain area in Fuzhou is calculated, and the network topology is shown in the attached drawing.
Step1, according to the topological structure of an access network in a certain area, 10 second-degree nodes and two first-degree nodes are arranged in the graph, the second-degree nodes are simplified, and new edges e are obtained by reducing the two-degree nodes respectively1，e2，e3For e1With link simplification, c =4, the probability of the new edge after reduction is about 0.692, and the reduction factor is about 0.948. The reliability probabilities for e2 and e3 are calculated in the same way as 0.692 and 0.643 respectively, resulting in reduction factors of 0.948 and 0.919.
And Step 2, reducing the two one-degree nodes, wherein the reduction link probability is 0.9, and calculating to obtain a final reduction factor of 0.81.
Step 3, for parallel link e1，e2，e3The reduction was performed to obtain a reliability of 0.996.
And after Step4, the access network graph cannot be further reduced, calculating the full reliability according to a formula and a reduction factor, and obtaining the full reliability which is about 0.669.
Step4, combining the minimum path set in the step 2, calculating the access network t from the provincial dispatching center by using a non-intersection sum algorithmiDegree of reliability of
According to the minimum subgrade O (t)i) Calculating the time from the master control center to the access network tiReliability of both ends of the sink node. In the access network, the presence aggregation nodes and the regional aggregation nodes are responsible for processing data from the backbone network. Namely the communication probability from the provincial dispatching node as the source node to the access network sink node.
The disjoint sum method is an algorithm for calculating the network reliability by applying disjoint sum theorem. The network reliability is expressed as the sum of all the minimal sets of paths, and then this sum is normalized to the sum of disjoint terms, and the corresponding reliability is calculated. For the minimum way set O (t)i) There are q minimum way sets. Then the theoretical formula of the sum-of-sums algorithm is expressed as:
wherein
The probability that q-1 links are not kept connected for the forward link, but the q-th link is connected.
And 5, calculating the comprehensive reliability of the scheduling data network.
For an access network in a certain area, according to the reliability R (t) of the whole end of the access networki) P (t) of reliability from the master to both ends of the access networki). Calculating the comprehensive reliability R of the access networkiI.e. provincial, central, capable of interfacing with the access network tiThe probability that all nodes in the cluster remain connected. Scheduling data centers with access network t using the following calculationiIn between, there is a probability that at least one path will work properly.
Ri＝R(ti)*p(ti)
Because the backbone network in the scheduling data network adopts a multi-level redundancy structure and the access network structure is simpler, the invention provides the comprehensive reliability R of the scheduling data network by combining the similarity of the topological structures of the scheduling networks at all levels in the scheduling data networkl. The overall reliability calculation formula is as follows,
wherein b is the number of the city-level regions, wiFor each level of weight, the traffic data flow is large forThe larger the city rank, the larger the weight value. And evaluating the comprehensive network connectivity of the scheduling data network.
The above are preferred embodiments of the present invention, and all changes made according to the technical solutions of the present invention that produce functional effects do not exceed the scope of the technical solutions of the present invention belong to the protection scope of the present invention.
Claims (7)
1. A reliability evaluation method based on a scheduling data network topological structure is characterized by comprising the following steps:
step1, abstracting a scheduling data network, and establishing a reliability model;
step 2, confirming a minimum path set by combining the topological structure;
step 3, calculating the reliability of the whole end of the connected access network;
step4, calculating the reliability of the main dispatching center and the sink node;
and 5, calculating the comprehensive reliability of the scheduling data network.
2. The reliability assessment method based on the topology structure of the data scheduling network according to claim 1, wherein the step1 is implemented as follows: under the condition that the nodes are completely reliable, abstracting a scheduling data network into a topological structure diagram of the nodes and the edges, and establishing a reliability model, namely:
abstracting a scheduling data network into a graph G = (N, E) which is formed by taking equipment as a node and taking a link as an edge, wherein N is a node set, the total number of N nodes is set, 32836 is a link set, and the total number of m links is; the reliability of the jth link is the probability that the link keeps normal communication, assuming that the node is completely reliable
Where MTBF is the mean time to failure.
3. The reliability assessment method based on the topology of the data scheduling network according to claim 2, wherein the step 2 is implemented as follows: on the basis of an abstract scheduling data network topological structure, a minimum path set of a master node and a sink node is determined by analyzing a redundant structure of a scheduling data network, and the method specifically comprises the following steps:
setting a master node as C and a target access network set as 1; two sink nodes which are accessed to the equipment of the access layer nearby are called access nodes and are responsible for accessing service data of local dispatching, transformer substations and direct dispatching power plants; the master node is communicated with the access node from the access nodei(ii) a Target access network set T = { T = }1，t2，...tbB local access networks; for a connectivity access network tiHome node to tiIs O (t)i)＝{r1，r2，...，rq}，rqThe path is composed of edges, the source node is a master node, and the target node is an access node.
4. The reliability assessment method based on the topology of the data scheduling network according to claim 3, wherein the step 3 is implemented as follows: for each connectivity access network tiAccording to the topological structure characteristics of the connected access network, calculating the reliability R (t) of the whole terminali) (ii) a Simplifying a topological structure diagram of the connected access network by adopting a chain simplification method and a graph change method, and finally calculating the reliability of the whole terminal; specifically, the method comprises the following steps:
step1, reducing all two-degree nodes in the graph G by using a chain simplification method; according to the chain simplification method, a new edge e is used for replacing all two-degree nodes and connected edges on a link, c is the number of edges on the link, and after simplification, the reliability of the new edge is
And a reduction factor of
Step 2, reducing all first-degree nodes in the graph G, simplifying the first-degree nodes, directly removing edges and nodes of corresponding nodes, and taking a reduction factor as the probability of a primary edge;
step 3, reducing the parallel links in the simplified diagram, and replacing all the parallel links with a new link, wherein the parallel links are e1，e2，...，ekTotal k links, edge probability of
Sink nodes cannot be reduced; multilink parallel simplified formula
Step4, if the simplified graph does not have a second-degree node, a first-degree node and a parallel link, the graph simplifying process is finished, and the full-end reliability R of the graph is calculatedsIf only the sink node is left in the graph, the reliability is calculated by using a parallel formula, otherwise, the reliability is calculated by using an enumeration method, and further, the reliability R of the whole end is obtained by combining a reduction factor, namely the reliability R (t) of the whole end of the connected access networki) (ii) a Otherwise, returning to the first step.
5. The reliability assessment method based on the topology structure of the scheduling data network according to claim 4, wherein the reliability calculation formula of the whole end of the connected access network is as follows:
R＝λ*Rs
wherein, R is the reliability of the whole end of the connected access network.
6. The method for reliability assessment based on the topology of the scheduled data network according to claim 3, wherein the step4 is implemented as follows: and (3) combining the minimum path set in the step (2), calculating the connected access network t from the master node by using a non-intersection sum algorithmiThe reliability of (2) is specifically:
according to the minimum path set O (t)i) Calculating the connection from the master node to the connected access network tiReliability of both ends of (1); representing the network reliability as the sum of all the minimum path sets, then merging the sum into the sum of disjoint terms, and calculating the corresponding reliability; for the minimum way set O (t)i) There are q minimum way sets; then the theoretical formula of the sum-of-sums algorithm is expressed as:
wherein p (t)i) Master node to connectivity access network tiThe reliability of both ends of the optical fiber,
the probability that q-1 links are not connected for the front link and the q-th link is connected.
7. The reliability assessment method based on the topology of the data scheduling network according to claim 4, wherein the step 5 is implemented as follows:
according to the reliability R (t) of the whole end of the connected access networki) P (t) of reliability of the master node to both ends of the connectivity access networki) Calculating the comprehensive reliability R of the connected access networkiI.e. the master node can communicate with the access network tiThe probability that all nodes in the network are connected;
the following formula is adopted to calculate the t for the master node and the connected access networkiAt least one path is in normal operation:
Ri＝R(ti)*p(ti)
comprehensive reliability R of connected access networkiThe calculation formula is as follows,
wherein b is the number of the city level regions，wiAre weights of various levels.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210765524.4A CN115277433B (en) | 2022-07-01 | 2022-07-01 | Reliability evaluation method based on scheduling data network topology structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210765524.4A CN115277433B (en) | 2022-07-01 | 2022-07-01 | Reliability evaluation method based on scheduling data network topology structure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115277433A true CN115277433A (en) | 2022-11-01 |
| CN115277433B CN115277433B (en) | 2023-06-27 |
Family
ID=83763895
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210765524.4A Active CN115277433B (en) | 2022-07-01 | 2022-07-01 | Reliability evaluation method based on scheduling data network topology structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115277433B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103198429A (en) * | 2011-10-18 | 2013-07-10 | 国际商业机器公司 | Cost-effective and reliable utilities distribution network |
| CN107018011A (en) * | 2017-03-08 | 2017-08-04 | 北京航空航天大学 | A kind of network reduction method of holding network performance reliability |
| US20200007431A1 (en) * | 2018-06-27 | 2020-01-02 | National Tsing Hua University | Reliability evaluating method for multi-state flow network and system thereof |
| CN111008454A (en) * | 2019-10-23 | 2020-04-14 | 武汉大学 | Intelligent substation reliability assessment method based on information physical fusion model |
| US20200236038A1 (en) * | 2019-01-18 | 2020-07-23 | Rise Research Institutes of Sweden AB | Dynamic Deployment of Network Applications Having Performance and Reliability Guarantees in Large Computing Networks |
| CN112040506A (en) * | 2020-09-15 | 2020-12-04 | 海南科技职业大学 | Reliability evaluation method and device of wireless sensor network and storage medium |
| CN113886965A (en) * | 2021-09-30 | 2022-01-04 | 中国船舶重工集团公司第七一九研究所 | Ship water supply system reliability assessment method based on state enumeration method |
-
2022
- 2022-07-01 CN CN202210765524.4A patent/CN115277433B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103198429A (en) * | 2011-10-18 | 2013-07-10 | 国际商业机器公司 | Cost-effective and reliable utilities distribution network |
| CN107018011A (en) * | 2017-03-08 | 2017-08-04 | 北京航空航天大学 | A kind of network reduction method of holding network performance reliability |
| US20200007431A1 (en) * | 2018-06-27 | 2020-01-02 | National Tsing Hua University | Reliability evaluating method for multi-state flow network and system thereof |
| US20200236038A1 (en) * | 2019-01-18 | 2020-07-23 | Rise Research Institutes of Sweden AB | Dynamic Deployment of Network Applications Having Performance and Reliability Guarantees in Large Computing Networks |
| CN111008454A (en) * | 2019-10-23 | 2020-04-14 | 武汉大学 | Intelligent substation reliability assessment method based on information physical fusion model |
| CN112040506A (en) * | 2020-09-15 | 2020-12-04 | 海南科技职业大学 | Reliability evaluation method and device of wireless sensor network and storage medium |
| CN113886965A (en) * | 2021-09-30 | 2022-01-04 | 中国船舶重工集团公司第七一九研究所 | Ship water supply system reliability assessment method based on state enumeration method |
Non-Patent Citations (2)
| Title |
|---|
| JIAN LI,LEONARDO DUEÑAS-OSORIO,CHANGKUN CHEN 等: "Connectivity reliability and topological controllability of infrastructure networks: A comparative assessment", 《RELIABILITY ENGINEERING & SYSTEM SAFETY》 * |
| 林薇: "期望路径限制下二终端网络可靠性优化问题", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115277433B (en) | 2023-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110474806B (en) | Power communication network key node identification method | |
| CN109038794B (en) | QoS control-oriented extra-high voltage power grid system protection service path planning method | |
| CN112118176B (en) | Service reliability-oriented routing load optimization method for channel of integrated data network | |
| CN113705085B (en) | Intelligent power grid multi-level structure modeling and risk assessment method | |
| CN105932775B (en) | The analysis method that a kind of information system influences micro-capacitance sensor operational reliability | |
| CN114095075B (en) | Optical network fault recovery method based on service customization demand perception | |
| CN111475953A (en) | Energy supply reliability influence analysis method, device and equipment and storage medium | |
| CN111882125B (en) | Electric power information physical system cascading failure prediction method based on risk element theory | |
| CN110740394A (en) | Power optical transmission network optimization method and system based on site classification business classification | |
| CN113344280A (en) | Power failure plan optimization model constraint construction method and device considering load transfer | |
| CN114567562B (en) | Method for identifying key nodes of coupling network of power grid and communication network | |
| CN112014687A (en) | Layered positioning method for fault section of active power distribution network containing distributed power supply | |
| CN115347562A (en) | Method for rapidly arriving emergency repair of power distribution network under AI technology | |
| CN114386222A (en) | Power distribution network cooperative fault recovery method and system based on information physical system | |
| CN109858822B (en) | Information power fusion system reliability assessment method based on flow correlation analysis | |
| CN115277433A (en) | Reliability evaluation method based on scheduling data network topological structure | |
| CN114221901B (en) | Energy Internet CPS toughness scheduling method, system and storage medium thereof | |
| CN112231705B (en) | Information system reliability improving method based on secondary division | |
| CN114977185A (en) | Power grid partition and power grid key section identification method based on AP clustering algorithm | |
| CN114697222A (en) | Survivability virtual network mapping algorithm based on air-space-ground fusion network | |
| CN102957206A (en) | Smart grid-oriented multi-granularity off-line model splicing method | |
| CN112380159A (en) | IMA core processing system structure configuration method | |
| Luo et al. | Critical node identification of power wireless private communication network based on complex network | |
| CN113009274B (en) | Power distribution network fault section positioning method and system based on IELM algorithm | |
| CN114120630B (en) | Emergency power supply configuration method considering road traffic dynamic characteristics |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |