CN104901886B - Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization - Google Patents

Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization Download PDF

Info

Publication number
CN104901886B
CN104901886B CN201510223246.XA CN201510223246A CN104901886B CN 104901886 B CN104901886 B CN 104901886B CN 201510223246 A CN201510223246 A CN 201510223246A CN 104901886 B CN104901886 B CN 104901886B
Authority
CN
China
Prior art keywords
channel
circuitous
delay
alternative
algorithm
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.)
Active
Application number
CN201510223246.XA
Other languages
Chinese (zh)
Other versions
CN104901886A (en
Inventor
黄悦华
李振兴
张腾飞
李振华
翁汉琍
袁兆强
黄景光
徐艳春
宋劢
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
WUHAN TONGKE ELECTRIC POWER TECHNOLOGY Co.,Ltd.
Original Assignee
China Three Gorges University CTGU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Three Gorges University CTGU filed Critical China Three Gorges University CTGU
Priority to CN201510223246.XA priority Critical patent/CN104901886B/en
Publication of CN104901886A publication Critical patent/CN104901886A/en
Application granted granted Critical
Publication of CN104901886B publication Critical patent/CN104901886B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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
    • 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/02—Topology update or discovery
    • 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/12—Shortest path evaluation
    • 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/12—Shortest path evaluation
    • H04L45/121—Shortest path evaluation by minimising delays

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A kind of consideration time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization; using the most short and flow equalization of time delay in powerline network as optimal objective; the various factors of the composition of analysis channel delay and influence channel delay comprehensively; three factors of channel utilization of the channel width inverse of comprehensive selection influence transmission delay, the channel length for influenceing propagation delay time and influence queuing delay weight the weight index of alternatively preferred channels, and by the weight index for selecting optimal routining passage in improved dijkstra's algorithm.Weigh index total weight of build path under available pre- circuitous path table again with time delay, and it is used as improvement dijkstra's algorithm Optimization goal so that total weight is minimum, perform and improve dijkstra's algorithm, the reconstruct selection that optimal path time delay selected by realization is most short and each link flow is more balanced.Remaining intact one routining passage of network rapid build is based on when this method focuses on communication of power system fiber break to ensure that wan communication business is normally carried out.

Description

Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization
Technical field
The invention belongs to relay protection field in power system, is a kind of wide area protection for considering time delay and flow equalization Communicate circuitous channel restructing algorithm.
Background technology
In Electrical Power Communication Line running, engineering staff is frequently necessary to overhaul and transform fibre circuit, this When must just stop transport circuit to be operated.Sometimes fibre circuit also can because of accident accidental interruption.In these cases, I Still it is expected to interrupt the communication of power system business that originally carried on fibre circuit include wide area protection communication service can not between Disconnected operation, realize that power system continues normal work.Perfect network one optimal routining passage of structure in advance using residue For transmitting the real time business that need to be shifted, it is lasting, efficient including wide area protection communication service that communication of power system business can be achieved Operation.
A kind of existing optimal routining channel algorithm of structure is to use two parameters of channel delay and bandwidth availability ratio Optimal routining passage is selected in ant group algorithm, but only considered network it is normal when each channel time delay, do not consider need The data traffic of transfer adds the influence to caused by alternative channel communication time delay after alternative channel, and its selected optimal path may be Becoming blocking after addition transfer data, (Liu is precious, Yin Xianggen, Li Zhenxing, waits wide area protection routinings of the based on ant group algorithm to lead to Road reconfiguration technique research [R] Shandong Province of China Jinan：China Institute of Electrical Engineering Technology's electric power system control and protection Professional Committee, 2012.98-103).Another algorithm is based on most short channel length and selects optimal routining passage, but channel length is A part of factor of communication delay is influenceed, only considers that channel length is not enough to the delay character (Bao Xiao for intactly reflecting channel Relay protection channel reconstruction technology [J] Wuhan University of Technology journals of the intelligent based on round about manner, 2010,23 (4)：578- 582).Also viewpoint proposes to be based on the optimal routining passage of safe Sexual behavior mode, but wide area protection has sternly to communication delay The requirement of lattice, this scheme can not meet requirement (relay guarantors of Gao Huisheng, Wang Hui the virtue based on security of wide area protection rapidity Protect optical fiber circuitous channel Path selection [J] electric power system protection and controls, 2014,42 (14)：25-31).
The content of the invention
Time delay is most short and the routining passage of flow equalization is target to select by the present invention.Choosing influences transmission delay Channel width it is reciprocal, influence the channel length of propagation delay time, influence the channel utilization three sum of queuing delay as power Weight index, for selecting optimal routining passage in improved dijkstra's algorithm.When calculating channel utilization, consider to turn Move data and flow into influence of the alternative channel to data queue time delay in alternative channel, budget adds transfer digital backup and selects channel Channel utilization.When selecting optimal path, consider that transfer data may make alternative channel become to block after flowing into alternative channel, The channel blocked after transfer data traffic and inflow shifting flows can not be accommodated by screening and rejecting in advance.The present invention considers to influence letter The factor of road time delay is more comprehensive, and having pre-estimated shifting flows may be to the influence of alternative channel, when making selected optimal path Prolong most short, and still nonclogging channel after inflow transfer data can be selected, reaching makes on selected each channel flow more Balanced purpose.
The technical scheme that the present invention takes is：
Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization, comprise the following steps：
Step 1：The pre- circuitous path table established based on communication network current topological structure between two interruption nodes；
Step 2：The various factors of combined influence channel delay, selection influence transmission delay tfChannel width inverse 1/ B, propagation delay time t is influenceedsChannel length d, influence queuing delay tpChannel utilization u, as reconstruct optimal path influence The factor；
Step 3：After considering that transfer data flow into alternative channel, to data queue time delay t in alternative channelpCaused by shadow Ring, according to queuing delay tpWith channel utilization u exponent function relations, budget includes the channel of the alternative channel of transfer data traffic Utilization rate u；
Step 4：Normalized is done to the channel width inverse and channel length of all channels in pre- circuitous path table, The channel utilization three of the inverse bandwidth of normalized, channel length and budget is weighted into obtain weight index；
Step 5：Check that can all alternative channels accommodate transfer data traffic Tt, shifting flows can not be accommodated by rejecting Alternative channel, consider transfer data traffic TtAfter flowing into alternative channel, alternative channel delay may be made excessive, block, pick Except the alternative channel blocked after addition shifting flows, available pre- circuitous path table is ultimately formed；
Step 6：The total weight in path under available pre- circuitous path table is minimum as improvement dijkstra's algorithm optimizing mesh Mark.Using weight index as the condition for improving dijkstra's algorithm selection optimal path, selected with improved dijkstra's algorithm Select out optimal routining passage.
In step 1, to interrupt channel one end as starting point, the other end is terminal, according to communication network current topological structure sieve Arrange all circuitous paths by origin-to-destination.
In step 2, transmission delay tf=l/B, l are data frame length, and B is channel width；Propagation delay time ts=d/v, d are Channel length, v are spread speed of the electromagnetic wave on channel；Queuing delay tp=au(a>1), u is channel utilization.
In step 3, channel utilization u=Tmax/ B, TmaxChannel maximum stream flow is selected to add transfer digital backup, B is phase Answer the bandwidth of alternative channel.
In step 4, normalized channel width is reciprocal For i-th channel width Value after normalized reciprocal, (1/B)maxFor channel width inverse maximum in communication network, (1/B)minTo believe in communication network Road inverse bandwidth minimum value.Normalized channel length For i-th channel length normalized Value afterwards, dmaxFor channel length maximum, d in communication networkminFor channel length minimum value in communication network.Select optimal path Weight indexΦiFor the weighted value of i channels in communication network, ω1For normalized letter Road inverse bandwidthCoefficient, ω2For normalized channel lengthCoefficient, ω3For channel utilization μiCoefficient. ω1, ω2And ω3For relative value, under different targets, ω1, ω2And ω3Relative size can change.
In step 5, T is judgedit+Ti0>BiWhether set up, be then to reject i-th channel, otherwise i.e. i-th channel can accommodate Shifting flows, it is that can use alternative channel to retain the channel.TitTo flow into the shifting flows of i-th channel, Ti0For i-th channel Original maximum data flow, BiFor the bandwidth of i-th channel.Then, weight is calculated For the channel for judging to block.Because channel utilization μ, which is reflection transfer data, makes the main of alternative channel delay increase Factor, so recommending to take ω1=1, ω2=1, ω3=5.The maximum Φ of weighted value is filtered out, channel corresponding to the value is to flow into The channel that may be blocked after data is shifted, rejects comprising the path for blocking channel, ultimately forms available in pre- circuitous path table Pre- circuitous path table.
In step 6, using weight index Φ as the condition for improving dijkstra's algorithm selection optimal path.Now, again CalculateBecause channel length d and channel utilization μ are the masters for reflecting channel entirety time delay Factor is wanted, so now recommending to take ω1=1, ω2=2, ω3=2.When performing improvement dijkstra's algorithm, select and source point s Adjacent and minimum weighted value point i；Φ (i)+q (i, j) is calculated by intermediate point of i, Φ (i) is between node i and source point s on channel Weights, q (i, j) be i to j channels on weighted value.Compare Φ (i)+q (i, j) and Φ (j), if Φ (i)+q (i, j) is less than Φ (j), then it is Φ (i)+q (i, j) to update Φ (j), is not otherwise updated；By weighted value is minimum between starting point in now set B Point j is added in set A, if having multiple points identical with starting point weights and being minimum, can arbitrarily select some addition set A In；2 points more than repeating, until detecting that terminal e is included into set A.
The present invention is that a kind of consideration time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization, and advantage exists In：
1), the present invention is delayed when considering circuitous channel, and combining influences the channel width inverse of transmission delay, influences to pass The channel length of defeated time delay, three parameters of channel utilization for influenceing queuing delay, and using these three parameter sums as wide area The weight index of protection communication circuitous channel reconstruct.Consider that the influence factor of time delay is more comprehensive, make selected optimal circuitous channel Time delay is minimum.
2), the present invention considers to interrupt on channel in advance when calculating the channel utilization for influenceing alternative channel queue time delay After the data traffic that need to be shifted flows into alternative channel, the influence to data queue time delay in alternative channel.Number is shifted using adding According to the channel utilization of the alternative channel of total data flow budget of rear alternative channel, and use it for circuitous channel restructing algorithm In so that the channel utilization of each channel is restricted on selected optimal circuitous channel, is avoided when being lined up on separate channel Prolong the situation of abruptly increase, realize the flow equalization of optimal circuitous channel.
3), the present invention is when selecting circuitous path, it is contemplated that carrying capacity of the alternative channel to transfer data traffic.For Shifting flows can not be accommodated and flow into the possible alternative channel rejected in advance blocked after shifting flows, reduce and improve Dijkstra The execution step number of algorithm, accelerate the execution speed of whole circuitous channel restructuring procedure.
4), the present invention is improved using three channel width inverse, channel length, channel utilization parameter weighting structures The routing weight index of dijkstra's algorithm, based on can use, path weight value under pre- circuitous path table is minimum as improvement Dijkstra Algorithm Optimization goal.The algorithm principle is succinct, and search direction is clear and definite, and it is most short can rapidly and accurately to select time delay under flow equalization Circuitous channel.
Brief description of the drawings
Fig. 1 is IEEE14 node system simplified model figures in embodiment；
Fig. 2 be embodiment in IEEE14 node system parameter matrixs, including IEEE14 node system channel lengths matrix J, IEEE14 node channel original maximum stream flows matrix L, IEEE14 node channel bandwidth matrices D.
Embodiment
Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization, step is as follows：
Step 1：To interrupt channel one end as starting point, the other end is terminal, counts communication network current topological structure, sieve Row are by all circuitous paths of origin-to-destination, the pre- circuitous path table formed between two interruption nodes；
Step 2：The various factors of combined influence channel delay, selection influence transmission delay tfChannel width inverse 1/ B, propagation delay time t is influenceedsChannel length d, influence queuing delay tpChannel utilization u, as reconstruct optimal path influence The factor.Channel width, channel length, the channel original maximum stream flow in pre- circuitous path table between all nodes are extracted in specific implementation Respectively constitute channel width matrix D, channel length matrix J, channel original maximum stream flow matrix L.It is reciprocal to channel width Matrix Calculating, Channel width inverse matrix is obtained, channel original maximum stream flow matrix is used for the channel usage for calculating all channels in pre- circuitous path table Rate；
Step 3：After considering that transfer data flow into alternative channel, to data queue time delay t in alternative channelpCaused by shadow Ring, according to queuing delay tpWith channel utilization u exponent function relations, budget includes the channel of the alternative channel of transfer data traffic Utilization rate u, the change of queuing delay is reflected with channel utilization u.According to u=Tmax/ B calculates all letters in pre- circuitous path table The channel utilization in road, form channel utilization matrix U；
Step 4：Normalized is done to the inverse bandwidth matrix based on pre- circuitous path table and channel length matrix, according to According toTo the processing of channel width inverse matrix normalization, foundationChannel is grown Matrix normalization processing is spent, selects the weight index of optimal pathΦiFor communication network The weighted value of middle i channels, ω1It is reciprocal for normalized channel widthCoefficient, ω2For normalized channel length's Coefficient, ω3For channel utilization μiCoefficient.ω1, ω2And ω3For relative value, under different targets, ω1, ω2And ω3's Relative size can change.
Step 5：Consider that can all alternative channels accommodate transfer data traffic T in pre- circuitous path tablet, rejecting can not Accommodate the alternative channel of shifting flows.Specific practice is：Judge Tit+Ti0>BiWhether set up, be then to reject i-th channel；Otherwise I.e. i-th channel can accommodate shifting flows, and it is that can use alternative channel to retain the channel.TitTo flow into the transfer stream of i-th channel Amount, Ti0For the original maximum data flow of i-th channel, BiFor the bandwidth of i-th channel；
Step 6：Consider transfer data traffic TtAfter flowing into alternative channel, alternative channel delay may be made excessive, occurred stifled Plug, the alternative channel for adding after shifting flows and blocking is rejected, ultimately forms available pre- circuitous path table.Calculate weightBecause channel utilization μ is the master that reflection transfer data make alternative channel delay increase Factor is wanted, so recommending to take ω1=1, ω2=1, ω3=5.The maximum Φ of weighted value is filtered out, channel corresponding to the value is stream Enter to shift the channel most blocked after data, rejected in pre- circuitous path table comprising the path for most blocking channel, ultimately forming can Pre- circuitous path table.
Step 7：The total weight in path under available pre- circuitous path table is minimum as improvement dijkstra's algorithm optimizing mesh Mark.Using weight index as the condition for improving dijkstra's algorithm selection optimal path, selected with improved dijkstra's algorithm Select out optimal routining passage.Now, recalculateBecause channel length d and letter Road utilization rate μ is the principal element for reflecting channel entirety time delay, so taking ω1=1, ω2=2, ω3=2.Perform improvement Dijkstra's algorithm.Select point i adjacent with source point s and minimum weighted value；Φ (i)+q (i, j) is calculated by intermediate point of i, Weights of the Φ (i) between node i and source point s on channel, q (i, j) are the weighted value of i to j channels.Compare Φ (i)+q (i, j) with Φ (j), if Φ (i)+q (i, j) is less than Φ (j), then it is Φ (i)+q (i, j) to update Φ (j), is not otherwise updated.To now B collection The minimum point j of weighted value is added in set A between starting point in conjunction, if having multiple points identical with starting point weights and being minimum, It can arbitrarily select a little to add in set A；2 points more than repeating, untill detecting that terminal e is included in set A.
Embodiment：
As shown in figure 1, in IEEE14 node systems, 5 and 6 two nodes merge into one because in same transformer station Individual node, numbering 5.4th, 7,8 and 9 four nodes merge into a node, numbering 4 in same transformer station.Wherein No. 5 Node is because connecting circuitry number at most and being located at CS central, therefore using No. 5 nodes as Centroid, remaining node is edge Node, and send information to No. 5 nodes.Example assumes that the channel communication between node 2 and node 5 interrupts, and asks node 2 and section Optimal circuitous path between point 5.
Entered according to the consideration time delay proposed by the present invention circuitous channel restructing algorithm that communicates with the wide area protection of flow equalization Row example calculates analysis, comprises the following steps that：
Step 1：To interrupt channel one end as starting point, the other end is terminal, is enumerated according to communication network current topological structure By all circuitous paths of origin-to-destination, the pre- circuitous path table established between two interruption nodes；
Step 2：Initial Channel Assignment bandwidth matrices D, channel length matrix J and channel original maximum stream flow matrix L, such as Fig. 2 institutes Show.Now, because channel interruption between node 2 and 5, the data whole zero setting between three matrix interior joints 2 and 5.
Step 3：According to u=Tmax/ B budgets add the maximum channel profit that channel is likely to be breached each alternatively after transfer data With rate, channel utilization matrix U is formed.
Step 4：Channel width Matrix Calculating is fallen, according toTo channel width matrix normalization Processing, according toChannel length matrix normalization is handled, selects the weight index of optimal pathΦiFor the weighted value of i channels in communication network, ω1Fallen for normalized channel width NumberCoefficient, ω2For normalized channel lengthCoefficient, ω3For channel utilization μiCoefficient.ω1, ω2With ω3For relative value, under different targets, ω1, ω2And ω3Relative size can change.
Step 5：The channel of transfer data traffic can be accommodated by filtering out.There is the stream to node 5 by node 2 on channel (2,5) 36.74Mbit/s is measured, this flow is the data traffic that need to be shifted.Flow 36.74Mbit/s is added every in traffic matrix Individual nonzero term, then judges 36.74+Ti0>BiWhether set up, be then to reject i-th channel；Otherwise it is that i-th channel can accommodate Shifting flows, it is that can use alternative channel to retain the channel.Through judging to find that the channel that node 7 is arrived between node 5 flows into shifting flows The maximum stream flow being likely to be breached afterwards is 56.78Mbit/s, the channel width 50Mbit/s arrived more than node 7 between node 5.Therefore, Channel (7,5) can not undertake shifting flows, and this channel is rejected from alternative channel.Reject channel length matrix, channel strip The data of relevant channel (7,5) in wide matrix and channel original maximum stream flow matrix, form available alternative channel data matrix.
Step 6：Calculate weightFor the channel for judging to block.Because letter Road utilization rate μ is the principal element that reflection transfer data make alternative channel delay increase, so recommending to take ω1=1, ω2=1, ω3=5.The maximum Φ of weighted value is filtered out, is computed finding that the weighted value Φ of channel (8,5) is maximum, is 7.374.That is channel (8,5) are to flow into the channel that shifts and may be blocked after data, the path for including blocking channel are rejected in pre- circuitous path table, most End form is into available pre- circuitous path table.
Step 7：Using weight index Φ as the condition for improving dijkstra's algorithm selection optimal path.Now, count again CalculateBecause channel length d and channel utilization μ be reflect channel entirety time delay it is main because Element, so now recommending to take ω1=1, ω2=2, ω3=2.Perform and improve dijkstra's algorithm, select optimal circuitous channel.
Table 1 between node (2,5) during channel interruption perform set forth herein wide area protection communicate circuitous channel restructing algorithm Whole alternative paths of extraction and corresponding weights.
Whole alternative path and its weights during table 1 (2,5) channel interruption
Table 2 list channel (7,5) flow into shifting flows after channel total flow and respective bandwidth contrast.Can by table 2 Know, the channel total flow after channel (7,5) inflow shifting flows is likely larger than its respective bandwidth, and this channel can not accommodate transfer Flow.Because the influence that transfer data are transmitted for alternative channel original data traffic is considered first, it was found that can not accommodate and turn The channel (7,5) of data traffic is moved, two paths (as shown in table 1) of channel (7,5) are included in rejected in advance alternative path, Reduce the step number for performing and improving dijkstra's algorithm, accelerate the execution speed of whole selection optimal path algorithm.
Table 2 (7,5) flows into channel total flow and respective bandwidth after shifting flows
Table 3 is that channel utilization contrasts before and after transfer data are flowed on optimal path.Need on the channel (2,5) that shifts Data traffic is 36.74Mbit/s.This flow number is more than original data traffic on remaining channel.When transfer data traffic When being flowed on a certain channel, channel utilization increase is inevitable, and queuing delay also has a certain degree of increase.From table 3 It can be seen that although each channel upper signal channel utilization rate in selected path increases, still in allowed limits.Calculating channel During utilization rate, since it is considered that data shift the influence to alternative channel data flow channel utilization so that calculated Channel utilization more conforms to actual conditions, and channel utilization restricted effect of this algorithm to optimal path, makes institute Select flow on each channel of optimal path more balanced.
The channel utilization u that each channel is added before and after transfer data on the optimal path of table 3
Described above is presently preferred embodiments of the present invention, but the present invention should not be limited to the embodiment and accompanying drawing institute Disclosure.So every do not depart from the lower equivalent or modification completed of spirit disclosed in this invention, guarantor of the present invention is both fallen within The scope of shield.

Claims (6)

  1. The circuitous channel restructing algorithm 1. consideration time delay communicates with the wide area protection of flow equalization, it is characterised in that including following Step：
    Step 1：The pre- circuitous path table established based on communication network current topological structure between two interruption nodes；
    Step 2：The various factors of combined influence channel delay, selection influence transmission delay tfChannel width inverse 1/B, influence Propagation delay time tsChannel length d, influence queuing delay tpChannel utilization u, as reconstruct the influence of optimal circuitous path because Son；
    Step 3：After considering that transfer data flow into alternative channel, to data queue time delay t in alternative channelpCaused by influence, root According to queuing delay tpWith channel utilization u exponent function relations, budget includes the channel usage of the alternative channel of transfer data traffic Rate；
    Step 4：Normalized is done to the channel width inverse and channel length of all channels in pre- circuitous path table, will be returned The one channel utilization three for changing the inverse bandwidth handled, channel length and budget weights to obtain weight index；
    Step 5：Check that can all alternative channels accommodate transfer data traffic Tt, reject the alternative letter that can not accommodate shifting flows Road, consider transfer data traffic TtAfter flowing into alternative channel, alternative channel delay may be made excessive, blocked, rejected and add The alternative channel that may be blocked after shifting flows, ultimately forms available pre- circuitous path table；
    Step 6：The total weight in path under available pre- circuitous path table is minimum as improvement dijkstra's algorithm Optimization goal, Using weight index as the condition for improving dijkstra's algorithm selection optimal path, selected with improved dijkstra's algorithm Optimal routining passage.
  2. The circuitous channel restructing algorithm 2. consideration time delay according to claim 1 communicates with the wide area protection of flow equalization, Characterized in that, in step 1, to interrupt channel one end as starting point, the other end is terminal, according to communication network present topology knot Structure enumerates all circuitous paths by origin-to-destination, the pre- circuitous path table formed between two interruption nodes.
  3. The circuitous channel restructing algorithm 3. consideration time delay according to claim 1 communicates with the wide area protection of flow equalization, Characterized in that, in step 2, transmission delay tf=1/B, 1 is data frame length, and B is channel width；Propagation delay time ts=d/v, D is channel length, and v is spread speed of the electromagnetic wave on channel；Queuing delay tp=au(a ＞ 1), u is channel utilization.
  4. The circuitous channel restructing algorithm 4. consideration time delay according to claim 1 communicates with the wide area protection of flow equalization, It is characterized in that：In step 3, channel utilization u=Tmax/ B, TmaxChannel maximum stream flow, B are selected to add transfer digital backup For the bandwidth of corresponding alternative channel.
  5. The circuitous channel restructing algorithm 5. consideration time delay according to claim 1 communicates with the wide area protection of flow equalization, It is characterized in that：In step 4, normalized channel width is reciprocal For i-th letter Value after road inverse bandwidth normalized, (1/B)maxFor channel width inverse maximum in communication network, (1/B)minFor communication Channel width inverse minimum value in net, normalized channel length For i-th channel length normalizing Value after change processing, dmaxFor channel length maximum, d in communication networkminFor channel length minimum value in communication network；Select optimal The weight index in pathΦiFor the weighted value of i channels in communication network, ω1To return One channel width changed is reciprocalCoefficient, ω2For normalized channel lengthCoefficient, ω3For channel utilization μi's Coefficient；ω1, ω2And ω3For relative value, under different targets, ω1, ω2And ω3Relative size can change.
  6. The circuitous channel restructing algorithm 6. consideration time delay according to claim 1 communicates with the wide area protection of flow equalization, It is characterized in that：In step 5, T is judgedit+Ti0＞ BiWhether set up, be then to reject i-th channel, otherwise i.e. i-th letter Road can accommodate shifting flows, and it is that can use alternative channel, T to retain the channelitTo flow into the shifting flows of i-th channel, Ti0 For the original maximum data flow of i-th channel, BiFor the bandwidth of i-th channel；Then, weight is calculatedFor the channel for judging to block, whereinAfter respectively normalizing Channel width and channel length, μiFor the channel utilization of i-th channel；Because channel utilization μ is reflection transfer data Make the principal element of alternative channel delay increase, so recommending to take ω1=1, ω2=1, ω3=5；Filter out weighted value maximum Φ, channel corresponding to the value are to flow into the channel that shifts and may be blocked after data, are rejected in pre- circuitous path table comprising blocking The path of channel, ultimately form available pre- circuitous path table.
CN201510223246.XA 2015-05-05 2015-05-05 Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization Active CN104901886B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510223246.XA CN104901886B (en) 2015-05-05 2015-05-05 Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510223246.XA CN104901886B (en) 2015-05-05 2015-05-05 Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization

Publications (2)

Publication Number Publication Date
CN104901886A CN104901886A (en) 2015-09-09
CN104901886B true CN104901886B (en) 2018-03-06

Family

ID=54034286

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510223246.XA Active CN104901886B (en) 2015-05-05 2015-05-05 Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization

Country Status (1)

Country Link
CN (1) CN104901886B (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105407049B (en) * 2015-10-26 2018-07-03 西安电子科技大学 Delay-tolerant network max-flow method for routing based on time aggregation figure
CN105847440B (en) * 2016-05-27 2018-12-14 三峡大学 Circuitous path reconstructing method is shunted under a kind of heavy duty when wide area protection communication disruption
CN106953798A (en) * 2017-05-25 2017-07-14 深圳市伊特利网络科技有限公司 Link selecting method and system based on access point
CN107800624B (en) * 2017-10-10 2020-07-28 三峡大学 Regional protection key information optimal roundabout path selection method
CN108667523B (en) * 2018-03-06 2021-02-26 苏州大学 Optical fiber nonlinear equalization method based on data-aided KNN algorithm
CN110784349B (en) * 2019-10-24 2023-04-18 深圳供电局有限公司 Automatic generation method and device for power communication equipment and network cutover scheme
CN112925242B (en) * 2021-01-25 2022-05-31 洛阳智能农业装备研究院有限公司 Unmanned operation agricultural machinery intelligence networking terminal system
CN113708999B (en) * 2021-08-30 2022-11-29 国家电网有限公司 Communication network time delay monitoring system and method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101494590A (en) * 2008-01-23 2009-07-29 中兴通讯股份有限公司 Optimum path selection method of communication network based on load balance
CN103052129A (en) * 2013-01-09 2013-04-17 北京邮电大学 Energy-saving route setup and power distribution method in wireless multi-hop relay network
CN103248571A (en) * 2013-05-16 2013-08-14 湖北邮电规划设计有限公司 Computing method of optimal second route

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101494590A (en) * 2008-01-23 2009-07-29 中兴通讯股份有限公司 Optimum path selection method of communication network based on load balance
CN103052129A (en) * 2013-01-09 2013-04-17 北京邮电大学 Energy-saving route setup and power distribution method in wireless multi-hop relay network
CN103248571A (en) * 2013-05-16 2013-08-14 湖北邮电规划设计有限公司 Computing method of optimal second route

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于安全性的继电保护光纤迂回 通道路径选择;高会生等;《电力系统保护与控制》;20140716;第42卷(第14期);全文 *
基于蚁群算法的广域保护迂回通信通道重构技术研究;刘宝等;《2012中国智能电网学术研讨会论文集》;20121231;全文 *

Also Published As

Publication number Publication date
CN104901886A (en) 2015-09-09

Similar Documents

Publication Publication Date Title
CN104901886B (en) Consider that time delay communicates circuitous channel restructing algorithm with the wide area protection of flow equalization
CN106789190B (en) Vulnerability assessment and route optimization method for power communication network
CA2089789C (en) Method and apparatus for optimum path selection in packet transmission networks
CN107371178B (en) high-load cell optimization method and device
CN105553869B (en) A kind of risk balance method and system of power telecom network
CN106453085A (en) Business importance-based risk-balancing routing assignment method and system
CN105553843B (en) A kind of relay protection of transmission line control service channel method for configuring route and device
CN106936645B (en) The optimization method of tree network topology structure based on queueing theory
CN109802864A (en) Chip design and verification method, device and chip tester
CN105703973B (en) A kind of power communication fiber optic network reliability consideration method based on composite measure
CN102546406A (en) Network-on-chip routing centralized control system and device and adaptive routing control method
CN107800624A (en) A kind of optimal circuitous path selection new method of regional protection key message
CN110188473A (en) A kind of electric power backbone communications pitch point importance recognition methods
CN108337179A (en) Link flow control method and device
CN107689918A (en) A kind of automatic search method in power telecom network service channel path
CN114615184B (en) Dual route planning method, device and system for power service
CN108259387A (en) A kind of exchange system and its routing algorithm built by interchanger
CN105472484A (en) Wave channel balancing route wavelength allocation method of power backbone optical transport network
CN107368966A (en) A kind of appraisal procedure of electric power networks fragility
CN109327401A (en) A kind of traffic scheduling method and system of SDN network
CN102970163A (en) Method and system for upgrading nodes in power communication backbone network
CN114158102A (en) Feeder automation real-time control oriented wireless heterogeneous communication network switching method
CN101350732B (en) Method and apparatus for analysis processing and testing network resource utilization situation of transmission network
CN106161276A (en) A kind of method and apparatus adjusting network traffics
CN109039826B (en) Collecting method, device and electronic equipment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Huang Yuehua

Inventor after: Li Zhenxing

Inventor after: Zhang Tengfei

Inventor after: Li Zhenhua

Inventor after: Weng Hanli

Inventor after: Yuan Zhaoqiang

Inventor after: Huang Jingguang

Inventor after: Xu Yanchun

Inventor after: Song Mai

Inventor before: Li Zhenxing

Inventor before: Zhang Tengfei

Inventor before: Li Zhenhua

Inventor before: Xu Yanchun

Inventor before: Yuan Zhaoqiang

Inventor before: Song Mai

GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20210203

Address after: No.10, 3 / F, building A-3, zone II (phase 6), wudayuan National Geospatial Information Industry base, Donghu New Technology Development Zone, Wuhan City, Hubei Province, 430000

Patentee after: WUHAN TONGKE ELECTRIC POWER TECHNOLOGY Co.,Ltd.

Address before: 443002 No. 8, University Road, Yichang, Hubei

Patentee before: CHINA THREE GORGES University