CN105072028B - A kind of electric power wide area protection communication network transmission fault fault-tolerance approach - Google Patents
A kind of electric power wide area protection communication network transmission fault fault-tolerance approach Download PDFInfo
- Publication number
- CN105072028B CN105072028B CN201510441940.9A CN201510441940A CN105072028B CN 105072028 B CN105072028 B CN 105072028B CN 201510441940 A CN201510441940 A CN 201510441940A CN 105072028 B CN105072028 B CN 105072028B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- ant
- transmission
- communication 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.)
- Expired - Fee Related
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 69
- 238000004891 communication Methods 0.000 title claims abstract description 35
- 238000013459 approach Methods 0.000 title claims abstract description 10
- 239000003016 pheromone Substances 0.000 claims description 32
- FGUUSXIOTUKUDN-IBGZPJMESA-N C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 Chemical compound C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 FGUUSXIOTUKUDN-IBGZPJMESA-N 0.000 claims description 8
- 238000000034 method Methods 0.000 claims description 8
- GNFTZDOKVXKIBK-UHFFFAOYSA-N 3-(2-methoxyethoxy)benzohydrazide Chemical compound COCCOC1=CC=CC(C(=O)NN)=C1 GNFTZDOKVXKIBK-UHFFFAOYSA-N 0.000 claims description 3
- 101000911390 Homo sapiens Coagulation factor VIII Proteins 0.000 claims description 3
- 102000057593 human F8 Human genes 0.000 claims description 3
- 229940047431 recombinate Drugs 0.000 claims description 3
- 230000007704 transition Effects 0.000 claims description 3
- 210000002230 centromere Anatomy 0.000 claims 1
- 238000005516 engineering process Methods 0.000 abstract description 12
- 230000002159 abnormal effect Effects 0.000 abstract description 3
- 238000013467 fragmentation Methods 0.000 abstract 1
- 238000006062 fragmentation reaction Methods 0.000 abstract 1
- 230000005611 electricity Effects 0.000 description 2
- 238000010606 normalization Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 241000272814 Anser sp. Species 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of electric power wide area protection communication network transmission fault fault-tolerance approaches; including setting source node S, transmission quality step destination node D and Centroid step, between source node S and destination node D found 3 or more the Uncrossed transmission path steps of node, calculate each transmission path, by the Uncrossed transmission path of node according to path quality sequence step, information data packet fragmentation coding step; for the data slice step of each transmission path distribution transmission, destination node reorganizing packets step.Patent of the present invention provides a kind of failure tolerant strategy applied to the transmission of electric power wide area protection communication network; its essence is exactly when exception or failure occurs in electric power wide area protection communication network; Network Abnormal or failure are handled by multipath Fault Tolerance Control Technology, network code Fault Tolerance Control Technology and load balancing Fault Tolerance Control Technology, to ensure the reliability and real-time of information transmission.
Description
Technical field
The present invention relates to a kind of communication network transmission fault fault-tolerance approach, especially a kind of electric power wide area protection communication network transmission
Failure tolerant method belongs to technical field of power system communication.
Background technology
The information of all kinds of smart machines of wide area protection communication network transmission electric system, when will make control device that may face
Prolong the problems such as uncertain, path is uncertain, data-bag lost, information causality are lost, especially data-bag lost may be to electricity
Force system causes imponderable loss, even results in total system and disintegrates and collapses feedback, meets real-time and can therefore, it is necessary to design
Realize that the strategy of failure tolerant, patent of the present invention provide a kind of event applied to power telecom network transmission while requirement by property
Hinder fault-tolerant strategy, essence is exactly to pass through the fault-tolerant skill of multipath when exception or failure occurs in electric power wide area protection communication network
Art, network code fault-toleranr technique and load balancing fault-toleranr technique processing Network Abnormal or failure, to ensure information transmission can
By property and real-time.
In the transmission process of electric power wide area protection communication network of today, such as terminal device transmits PMU to control centre
When the data such as information, GOOSE information, RTU information and SCADA information, what we used is all single path transmission technology.However,
Increasingly complicated, business demand with present electric power wide area protection communication network topology gradually enriches, and single path is transmitted in electricity
Load imbalance problem in power wide area protection communication network is also more serious, while it is there is also the delay of data transmission is big,
The low problem of safety difference and reliability in transmission process.And the electric power wide area protection that is applied to that patent of the present invention is proposed leads to
Include mainly three technologies more than the failure tolerant strategy of letter net transmission can solve the problems, such as：Multipath technology, encoding and decoding
Technology (Reed-Solomon coding techniques), load-balancing technique.These technologies solve in electric power wide area protection communication network
The problem of load imbalance, also reduces the delay of data transmission, and the safety of simultaneous transmission is also improved, their application
It ensure that transmission of the information in electric power wide area protection communication network high real-time and high reliability.
Invention content
The technical problem to be solved by the present invention is to：A kind of electric power wide area protection communication network transmission fault fault-tolerance approach is provided.
The technical solution used in the present invention is：
A kind of electric power wide area protection communication network transmission fault fault-tolerance approach, includes the following steps：
Step a：Set source node S in the electric power wide area protection communication network topology, destination node D and it is N number of in
Heart node, N>=1：The source node S is Regional Control Center 1, and the destination node D is Regional Control Center 2；The center
Node is the node in addition to the source node S, destination node D in the electric power WAN communication network；
Step b：N items are found between source node S and destination node D in the electric power wide area protection communication network topology
The above Uncrossed transmission path Path of nodei, i=1,2,3,4 ... n, n ＞ 3；
Step c：Calculate the transmission quality P of each transmission pathi, i=1,2,3,4 ... n, n ＞ 3；
Step d：Each transmission path is ranked up according to transmission quality；
Step e：The information packet transmitted in the electric power wide area protection communication network is placed in source node S, and by a*M
The data packet of byte resolves into the M data slice that size is a bytes, and the M data slice is encoded：
Step f：According to each path transmission quality PiDistribute the quantity of the data slice after the source node S coding, road
Diameter transmission quality PiThe data slice that higher path allocation arrives is more；
Step g：N number of coded data piece that destination node D is received, M-R≤N≤M recombinate former data packet, and R is to allow
Lose most data slice numbers.
The step b, is made of step in detail below：
Step b-1：Parameter initialization：Setting ant number is K, and the pheromones intensity on side (i, j) is τij,1≤i,j≤
N, the inspiration degree that node i is transferred to node j are ηij, 1≤i, j≤N, information heuristic greedy method be α, expected heuristic value β,
LbestAnd LworstThe path length of respectively optimal worst ant experience, maximum iteration Ncmax, ant is by path
The delay undergone when (i, j) is Tij, 1≤i, j≤N, the maximum link availability on path (i, j) is Eij, 1≤i, j≤N,
Pheromones volatilization parameter is ρ, 0 ＜ ρ ＜ 1, the constant parameter ε, 0 ＜ ε ＜ 1 that algorithm is introduced；
Step b-2：Each ant is placed in the source node S；
Step b-3：It is followed successively by each ant selection path：It comprises the steps of；
Step b-3-1：Current ant is set as the 1st ant, i.e. k=1；
Step b-3-2：Path is selected for current ant：It is made of step by step following：
Step b-3-2-1：Calculate the state transition probability that t moment ant k is transferred to node j by node i
Wherein, allowedkIndicate that ant k allows the node set of selection, τ in next stepij(t) indicate t moment path (i,
J) the pheromones track intensity on, ηij(t) indicate that t moment ant is transferred to the expected degree of node j from node i；
T in above formulaijBy ant the delay that node j is undergone, E are transferred to from node iij(t) it is on t moment path (i, j)
Link availability；
τij(t+n)=ρ Δs τij(t)+Δτij(t,t+n) (3)
τ in above formulaij(t+n) indicate that information content of the t+n moment on path (i, j), ρ are pheromones volatilization factor, Δ τij
(t) the pheromones increment on path (i, j), Δ τ in this cycle are indicatedij(t, t+n) indicates t moment and is passed through between the t+n moment
Cross the pheromones increment on path (i, j)；
Step b-3-3：Update local rule：
τ(r,s)←(1-ρ)·τ(r,s)+ρ·Δτ(r,s) (4)
1- ρ are pheromones residual factor in formula, and τ (r, s) is measured the pheromones track between node r and node s, Δ τ (r,
S) the pheromones increment between node r and node s；
Step b-3-4：Update current ant, k ← k+1；
Step b-3-5：Judge whether current ant is last ant, if so, step b-4 is turned to, if not, turning
To b-3-2；
Step b-4：Choose optimal and worst ant；
Step b-5：Global update rule is executed to optimal ant：
τ(r,s)←(1-α)·τ(r,s)+α·Δτ(r,s) (5)
Step b-6：Global update rule is executed to worst ant：
Step b-7：Judge whether to reach preset iteration termination condition, if so, output information element value updates table, according to
Practical connection status between network topology interior joint is selected successively under the conditions of the intermediate node for meeting selection path is Uncrossed
Each chain road pheromones are worth maximum transmission path in routing diameter, and the Uncrossed transmission path of a plurality of node is selected by rule,
And step c is turned to, if not, turning to step b-3.
Preset iteration termination condition in the step b-7 is to reach preset execution numberOr do not have continuously
There is the algebraically for more thering is solution to occur to reach preset number.
The step c, is made of step in detail below：
Path transmission quality P in the step ciIt is by whole link quality Pi'=min (Pi 1,Pi 2,Pi 3,...,
Pi n) normalization be calculated, Pi jFor ant group algorithm pheromones value react the i-th paths jth -1 jump jth hop node between
Quality, wherein i ∈ (1,2,3..., m), j ∈ (1,2,3..., n), wherein m be transmission path total quantity, n be wherein certain
The total quantity of node on transmission paths.
The step f, is made of step in detail below：
The coded data piece quantity distributed on the i-th paths in the step f is Ri=(N+R) Pi。
It is using advantageous effect caused by above-mentioned technical proposal：
Patent of the present invention provides a kind of failure tolerant strategy applied to the transmission of electric power wide area protection communication network, essence
Exactly when exception or failure occurs in electric power wide area protection communication network, held by multipath Fault Tolerance Control Technology, network code
Wrong control technology and load balancing Fault Tolerance Control Technology processing Network Abnormal or failure, to ensure information transmission reliability and
Real-time.
Illustrate book
The invention will be further described with reference to the accompanying drawings and examples.
Fig. 1 is the flow chart of the present invention；
Fig. 2 is the flow chart of step b of the present invention.
Specific implementation mode
Embodiment 1：
As shown in Figure 1, a kind of electric power wide area protection communication network transmission fault fault-tolerance approach, includes the following steps：
Step a：Set source node S in the electric power wide area protection communication network topology, destination node D and it is N number of in
Heart node, N>=1：The source node S is Regional Control Center 1, and the destination node D is Regional Control Center 2；The center
Node is the node in addition to the source node S, destination node D in the electric power WAN communication network；
Step b：It is searched out between source node S and destination node D in the electric power wide area protection communication network topology
Three Uncrossed transmission paths of node, respectively Path1、Path2、Path3；
Step c：Calculate the transmission quality of each transmission path
Pi, i=1,2,3 (P1=0.3, P2=0.5, P3=0.2)；
Step d：Each transmission path P has been ranked up according to transmission quality2＞ P1＞ P3；
Step e：The information packet transmitted in the electric power wide area protection communication network is placed in source node S, and will
The data packet of 100*10 bytes resolves into 10 data slices that size is 100 bytes, and the M=10 data slice is compiled
Code：
Step f：According to each path transmission quality PiDistribute the quantity of the data slice after the source node S coding, road
Diameter Path2Distribution 5 coded data pieces of transmission, path P ath1Distribution 3 coded data pieces of transmission, path P ath3Distribution transmission 2
A coded data piece；
Step g：The N=8 coded data piece that destination node D is received, M-R≤N≤M recombinate former data packet, R=3
To allow to lose most data slice numbers.
The step b, is made of step in detail below：
Step b-1：Parameter initialization：Setting ant number is K, and the pheromones intensity on side (i, j) is τij,1≤i,j≤
N, the inspiration degree that node i is transferred to node j are ηij, 1≤i, j≤N, information heuristic greedy method be α, expected heuristic value β,
LbestAnd LworstThe path length of respectively optimal worst ant experience, maximum iteration areAnt is by path
The delay undergone when (i, j) is Tij, 1≤i, j≤N, the maximum link availability on path (i, j) is Eij, 1≤i, j≤N,
Pheromones volatilization parameter is ρ, 0 ＜ ρ ＜ 1, the constant parameter ε, 0 ＜ ε ＜ 1 that algorithm is introduced；
Step b-2：Each ant is placed in the source node S；
Step b-3：It is followed successively by each ant selection path：It comprises the steps of；
Step b-3-1：Current ant is set as the 1st ant, i.e. k=1；
Step b-3-2：Path is selected for current ant：It is made of step by step following：
Step b-3-2-1：Calculate the state transition probability that t moment ant k is transferred to node j by node i
Wherein, 1≤i, j≤N, 1≤k≤K, allowedkIndicate that ant k allows the node set of selection, τ in next stepij
(t) the pheromones track intensity on t moment path (i, j), η are indicatedij(t) indicate that t moment ant is transferred to node j from node i
Expected degree；
T in above formulaijBy ant the delay that node j is undergone, E are transferred to from node iij(t) it is the chain on path (i, j)
Road availability；
τij(t+n)=ρ Δs τij(t)+Δτij(t,t+n) (3)
τ in above formulaij(t+n) indicate that information content of the t+n moment on path (i, j), ρ are pheromones volatilization factor, Δ τij
(t) the pheromones increment on path (i, j), Δ τ in this cycle are indicatedij(t, t+n) indicates t moment and is passed through between the t+n moment
Cross the pheromones increment on path (i, j)；
Step b-3-3：Update local rule：
τ(r,s)←(1-ρ)·τ(r,s)+ρ·Δτ(r,s) (4)
1- ρ are pheromones residual factor in formula, and τ (r, s) is measured the pheromones track between node r and node s, Δ τ (r,
S) the pheromones increment between node r and node s；
Step b-3-4：Update current ant, k ← k+1；
Step b-3-5：Judge whether current ant is last ant, if so, step b-4 is turned to, if not, turning
To b-3-2；
Step b-4：Choose optimal and worst ant；
Step b-5：Global update rule is executed to optimal ant：
τ(r,s)←(1-α)·τ(r,s)+α·Δτ(r,s) (5)
Step b-6：Global update rule is executed to worst ant：
Step b-7：Judge whether to reach preset iteration termination condition, if so, output information element value updates table, according to
Practical connection status between network topology interior joint is selected successively under the conditions of the intermediate node for meeting selection path is Uncrossed
Each chain road pheromones are worth maximum transmission path in routing diameter, and the Uncrossed transmission path of a plurality of node is selected by rule,
And step c is turned to, if not, turning to step b-3.
Preset iteration termination condition in the step b-7 is to reach preset execution numberOr do not have continuously
There is the algebraically for more thering is solution to occur to reach preset number.
The step c, is made of step in detail below：
Path transmission quality P in the step ciIt is by whole link quality Pi '=min (Pi 1,Pi 2,Pi 3,...,
Pi n) normalization be calculated, Pi jFor ant group algorithm pheromones value react the i-th paths jth -1 jump jth hop node between
Quality, wherein i ∈ (1,2,3), j ∈ (1,2,3..., n), wherein m be transmission path total quantity, n be wherein certain biography
The total quantity of node on defeated path.
The step f, is made of step in detail below：
The coded data piece quantity distributed on the i-th paths in the step f is Ri=(N+R) Pi。
Claims (3)
1. a kind of electric power wide area protection communication network transmission fault fault-tolerance approach, it is characterised in that：Include the following steps：
Step a：Set source node S, destination node D and the N number of centromere in the electric power wide area protection communication network topology
Point, N>=1：The source node S is Regional Control Center 1, and the destination node D is Regional Control Center 2；The Centroid
For the node in the electric power WAN communication network in addition to the source node S, destination node D；
Step b：N items or more are found between source node S and destination node D in the electric power wide area protection communication network topology
The Uncrossed transmission path Path of nodei, i=1,2,3,4 ... n, n>3；
Step c：Calculate the transmission quality P of each transmission pathi, i=1,2,3,4 ... n, n>3；
Step d：By each transmission path according to transmission quality PiIt is ranked up；
Step e：The information packet transmitted in the electric power wide area protection communication network is placed in source node S, and by a*M bytes
Data packet resolve into size be a bytes M data slice, the M data slice is encoded：
Step f：According to each path transmission quality PiDistribute the quantity of the data slice after the source node S coding, path transmission
Quality PiThe data slice that higher path allocation arrives is more；
Step g：N number of coded data piece that destination node D is received, M-R≤N≤M recombinate former data packet, and R is to allow to lose
Most data slice numbers；
The step b, is made of step in detail below：
Step b-1：Parameter initialization：Setting ant number is K, and the pheromones intensity on side (i, j) is τij, 1≤i, j≤N, section
The inspiration degree that point i is transferred to node j is ηij, 1≤i, j≤N, information heuristic greedy method is α, expected heuristic value β, Lbest
And LworstThe path length of respectively optimal worst ant experience, maximum iteration areAnt is by path (i, j)
When the delay undergone be Tij, 1≤i, j≤N, the maximum link availability on path (i, j) is Eij, 1≤i, j≤N, information
Plain volatilization parameter be ρ, 0<ρ<1, the constant parameter ε that algorithm is introduced, 0<ε<1；
Step b-2：Each ant is placed in the source node S；
Step b-3：It is followed successively by each ant selection path：It comprises the steps of；
Step b-3-1：Current ant is set as the 1st ant, i.e. k=1；
Step b-3-2：Path is selected for current ant：It is made of step by step following：
Step b-3-2-1：Calculate the state transition probability that t moment ant k is transferred to node j by node i
Wherein, allowedkIndicate that ant k allows the node set of selection, τ in next stepij(t) it indicates on t moment path (i, j)
Pheromones track intensity, ηij(t) indicate that t moment ant is transferred to the expected degree of node j from node i；
T in above formulaijBy ant the delay that node j is undergone, E are transferred to from node iij(t) it is the chain on t moment path (i, j)
Road availability；
τij(t+n)=ρ Δs τij(t)+Δτij(t,t+n) (3)
τ in above formulaij(t+n) indicate that information content of the t+n moment on path (i, j), ρ are pheromones volatilization factor, Δ τij(t) table
Show the pheromones increment on path (i, j), Δ τ in this cycleij(t, t+n) indicates t moment and between the t+n moment by path
Pheromones increment on (i, j)；
Step b-3-3：Update local rule：
τ(r,s)←(1-ρ)·τ(r,s)+ρ·Δτ(r,s) (4)
1- ρ are pheromones residual factor in formula, and τ (r, s) is measured the pheromones track between node r and node s, and Δ τ (r, s) is
Pheromones increment between node r and node s；
Step b-3-4：Update current ant, k ← k+1；
Step b-3-5：Judge whether current ant is last ant, if so, step b-4 is turned to, if not, turning to b-
3-2；
Step b-4：Choose optimal and worst ant；
Step b-5：Global update rule is executed to optimal ant：
τ(r,s)←(1-α)·τ(r,s)+α·Δτ(r,s) (5)
Step b-6：Global update rule is executed to worst ant：
Step b-7：Judge whether to reach preset iteration termination condition, if so, output information element value updates table, according to network
Practical connection status between topological interior joint selects road successively under the conditions of the intermediate node for meeting selection path is Uncrossed
Each chain road pheromones are worth maximum transmission path in diameter, select the Uncrossed transmission path of a plurality of node by rule, and turn
To step c, if not, turning to step b-3；
The coded data piece quantity distributed on the i-th paths in the step f is Ri=(N+R) Pi。
2. according to the electric power wide area protection communication network transmission fault fault-tolerance approach described in claim 1, it is characterised in that：It is described
Preset iteration termination condition in step b-7 is to reach preset execution numberOr it is continuously solved without more excellent
Existing number of iterations reaches preset number.
3. electric power wide area protection communication network transmission fault fault-tolerance approach according to claim 1, it is characterised in that：The step
Rapid c is made of step in detail below：
Path transmission quality P in the step ciIt is by whole link quality Pi'=min (Pi 1,Pi 2,Pi 3,K,Pi n) return
One change is calculated, Pi jThe jump of jth -1 for reacting the i-th paths for the pheromones value of ant group algorithm and the matter between jth hop node
Amount, wherein i ∈ (1,2,3K, m), j ∈ (1,2,3K, n), wherein m are the total quantity of transmission path, and n is wherein certain transmission road
The total quantity of node on diameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510441940.9A CN105072028B (en) | 2015-07-25 | 2015-07-25 | A kind of electric power wide area protection communication network transmission fault fault-tolerance approach |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510441940.9A CN105072028B (en) | 2015-07-25 | 2015-07-25 | A kind of electric power wide area protection communication network transmission fault fault-tolerance approach |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105072028A CN105072028A (en) | 2015-11-18 |
| CN105072028B true CN105072028B (en) | 2018-08-24 |
Family
ID=54501314
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510441940.9A Expired - Fee Related CN105072028B (en) | 2015-07-25 | 2015-07-25 | A kind of electric power wide area protection communication network transmission fault fault-tolerance approach |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105072028B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105515974B (en) * | 2015-12-08 | 2019-02-12 | 河南许继仪表有限公司 | A kind of power line communication network relay selection method |
| CN109831229B (en) * | 2019-02-28 | 2021-07-06 | 中国电力科学研究院有限公司 | Method and system for recovering service in electric power communication network based on reinforcement learning |
| CN111447142B (en) * | 2020-04-08 | 2021-09-28 | 东北大学 | Parallel multi-path transmission method based on Overlay network and coding technology |
| CN115118579A (en) * | 2022-05-31 | 2022-09-27 | 国网河北省电力有限公司沧州供电分公司 | Equipment data processing method of electric power marketing system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854695A (en) * | 2010-06-12 | 2010-10-06 | 苏州联科盛世科技有限公司 | Method for determining routing of wireless sensor network based on energy and delay ant colony optimization |
| CN102325052A (en) * | 2011-09-21 | 2012-01-18 | 北京邮电大学 | Optical network multi-fault tolerant method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2403381A (en) * | 2003-06-25 | 2004-12-29 | Hewlett Packard Development Co | Fault tolerant network, reliant on the determination of an automorphism of the network |
-
2015
- 2015-07-25 CN CN201510441940.9A patent/CN105072028B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854695A (en) * | 2010-06-12 | 2010-10-06 | 苏州联科盛世科技有限公司 | Method for determining routing of wireless sensor network based on energy and delay ant colony optimization |
| CN102325052A (en) * | 2011-09-21 | 2012-01-18 | 北京邮电大学 | Optical network multi-fault tolerant method |
Non-Patent Citations (2)
| Title |
|---|
| 改进蚁群算法求解两地间时间最优路径;崔丽群 等;《计算机仿真》;20120630;第29卷(第6期);第2-3节、图2 * |
| 满足广域保护通信可靠性和延时要求的路由选择方法;熊小伏 等;《电力系统自动化》;20110210;第35卷(第3期);第1.2节、第2-3节、表1 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105072028A (en) | 2015-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105072028B (en) | A kind of electric power wide area protection communication network transmission fault fault-tolerance approach | |
| CN101888333A (en) | Be used in the Forwarding plane of network element, keeping the method and apparatus of Port State Table | |
| CN102474454A (en) | Inter-node link aggregation system and method | |
| CN106911436B (en) | A kind of implementation method of parallel double-network redundant | |
| CN105791288B (en) | Crucial virtual link means of defence based on parallel duplex diameter | |
| CN109391614A (en) | It is a kind of based on depending on network transfer monitoring data method and apparatus | |
| CN102447530A (en) | Data frame aggregation method with fault-tolerant function | |
| CN105915467A (en) | Data center network flow balancing method and device oriented to software definition | |
| CN103873304A (en) | Power distribution communication network structure | |
| CN104823413A (en) | Switch device, VLAN setting management method and program | |
| CN104301214A (en) | Routing method of overlay network | |
| CN107241745B (en) | Construct the methods, devices and systems of network | |
| CN104335536A (en) | Packet transfer system, control device, packet transfer method and program | |
| CN103178976A (en) | Method for multicast tree establishment and fault restoration | |
| CN103152422B (en) | Under the many host environments of multithread, file recursive subdivision transmits and the method reconfigured | |
| CN101304181B (en) | Double-network control method for transformer substation case mechanism based on facing all-purpose object | |
| CN112887207A (en) | Service route distribution method and device for power IP-optical communication network | |
| CN104935614A (en) | Data transmission method and device thereof | |
| CN104113434A (en) | Data center network redundancy control device by adopting multi-chassis cluster system | |
| CN108632066B (en) | Method and device for constructing video multicast virtual network | |
| CN113408921B (en) | Cascading failure risk assessment method based on network dependency relationship | |
| CN105376178B (en) | A kind of method and apparatus of data transmission | |
| CN105024927A (en) | Method and system for calculating routing convergence ability | |
| CN102057633A (en) | Method and apparatus for handling a switch using a preferred destination list | |
| Ji et al. | Comprehensive vulnerability assessment and optimisation method of power communication network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180824 Termination date: 20200725 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |