CN107404437B - The determining method of path and device of a kind of message - Google Patents
The determining method of path and device of a kind of message Download PDFInfo
- Publication number
- CN107404437B CN107404437B CN201710612150.1A CN201710612150A CN107404437B CN 107404437 B CN107404437 B CN 107404437B CN 201710612150 A CN201710612150 A CN 201710612150A CN 107404437 B CN107404437 B CN 107404437B
- Authority
- CN
- China
- Prior art keywords
- node
- stack
- matrix
- mrow
- adjacency matrix
- 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
Links
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/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/74—Address processing for routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses the determining method of path and device of a kind of message.Wherein, method is included previously according to the terminal device and interchanger in the communication network of intelligent substation, and structure describes the hard adjacency matrix of physical couplings and the soft adjacency matrix of description respective switch internal logic connection relation between each node；The abutment points of set out node and destination node are searched in hard adjacency matrix, according to multiple abutment points and tandem node, structure traversal moves towards constraint matrix, and moves towards constraint matrix using traversal and change soft adjacency matrix；Since node, the hard adjacency matrix of alternate search and the soft adjacency matrix more corrected one's mistakes until reaching destination node, according to the dynamic generation of auxiliary stack and the screening process in release description path, and record searching route.The technical solution that the application provides accelerates search speed, improves the accuracy rate of search, so as to improve the accuracy rate and efficiency that packet route determines, and complexity is low, it is easy to accomplish, it is applied widely.
Description
Technical field
It is true more particularly to a kind of path of message the present embodiments relate to intelligent substation communication network technique field
Determine method and device.
Background technology
With the fast development of the communication technology, intelligent substation comes into being.Intelligent substation includes intelligent high-voltage equipment
With substation's integration information platform two parts, the smart machine that use is advanced, reliable, integrated and environmentally friendly, with whole station message digit
Change, communications platform networking, information sharing are standardized as basic demand, are automatically performed information gathering, measurement, control, protection, meter
The basic functions such as amount and detection, meanwhile, possess power grid is supported to automatically control in real time, intelligence is adjusted, on-line analysis decision-making and collaboration
The substation of the Premium Features such as interaction.
It is general that plan is isolated as message using the virtual LAN being easily achieved in the communication network of intelligent substation
Slightly, in the modes of many division VLAN, network members are divided with switch port, configuration process is the most simple and reliable.
It realizes the configuration that becomes more meticulous of intelligent substation communication network virtual LAN, first has to determine that each message passes through switch port
Situation, i.e. port flow distribution situation.
When determining packet route, the device port in intelligent substation communication network is generally abstracted into node, equipment
Between hardwire and switch port between logical connection be abstracted into line, network model is abstracted into connection graph model, then really
Determining the transmission path situation of message can be equivalent to solve in connected graph between 2 points the problem of path.In the prior art, often adopt
With graph traversal algorithm, as shortest path is not between determining the Depth Priority Algorithm of inter-two-point path, solving any two points
Luo Yide algorithms etc..
But since same switch port is between any two there may be virtual link relation, whether judge point-to-point transmission
There are the algorithms in path, such as Depth Priority Algorithm, it may appear that path continuously across three of same interchanger or three with
The situation of upper port node, the situation of this and message one-in-and-one-out switch port in practice are not inconsistent, and ask for point-to-point transmission shortest path
Although the algorithm in footpath can solve the problem above-mentioned, ring network topology structure is not suitable for.
The content of the invention
The purpose of the embodiment of the present invention is to provide the determining method of path and device of message, improves intelligent substation communication net
The accuracy rate that packet route determines in network.
In order to solve the above technical problems, the embodiment of the present invention provides following technical scheme：
On the one hand the embodiment of the present invention provides a kind of determining method of path of message, applied to intelligent substation, including：
Previously according between the terminal device in the communication network of intelligent substation and interchanger, interchanger is with exchanging generator terminal
Physical couplings between mouthful, build the hard adjacency matrix between each node in the communication network；According to the interchanger
Internal virtual link relation, builds the soft adjacency matrix between each node in the communication network；
Search is set out the abutment points of node and destination node in the hard adjacency matrix, according to multiple abutment points and
Tandem node in the communication network, structure traversal moves towards constraint matrix, and moves towards constraint matrix change according to the traversal
The soft adjacency matrix；
Since described node, hard adjacency matrix described in alternate search and the soft adjacency matrix more corrected one's mistakes, until arriving
Up to the destination node, according to the dynamic generation of auxiliary stack and the screening process in release description path, and searching route is recorded.
Optionally, further include：
After the stack top node for detecting the auxiliary stack is the destination node, according to the search of the auxiliary record stack
Node is set out described in coordinates measurement to the message transmissions path of the destination node.
Optionally, it is described according to the traversal to move towards constraint matrix and change the soft adjacency matrix to include：
Each element in the soft adjacency matrix and the traversal move towards corresponding element in constraint matrix carry out with
It calculates, the new matrix of generation is as the soft adjacency matrix after change.
Optionally, the tandem node in multiple abutment points and the communication network, structure traversal trend
Constraint matrix includes：
Multiple abutment points form adjacent point set K, and the tandem node forms tandem node set Q, the traversal
Moving towards each element in constraint matrix J is：
Optionally, the dynamic generation according to auxiliary stack and the screening process in release description path, and record search road
Footpath includes：
The node being accessed is pressed into according to access time in the auxiliary stack successively, in alternate search, search is worked as
The abutment points of the stack top node of preceding auxiliary stack, the stack top node to be pressed into the auxiliary stack as next accessed point；
When existing element repetition in the node and stack of press-in stack top or during without node stacking, the stack is discharged；
When the stack top node is the destination node, the auxiliary stack element is traveled through, the node that sets out described in record arrives
The searching route of the destination node discharges the auxiliary stack.
Optionally, described search currently aids in the abutment points of the stack top node of stack, to be pressed as next accessed point
Entering the stack top node of the auxiliary stack includes：
When the stack top node of the auxiliary stack there are multiple abutment points, the auxiliary stack of the corresponding number of generation is replicated, and by institute
State the stack top of the corresponding auxiliary stack of each abutment points press-in of stack top node.
On the other hand the embodiment of the present invention provides a kind of path determining device of message, applied to intelligent substation, bag
It includes：
Double adjacency matrix build module, for the terminal device in the communication network previously according to intelligent substation with exchanging
Physical couplings between machine, between interchanger and switch port are built hard between each node in the communication network
Adjacency matrix；According to the virtual link relation inside the interchanger, the soft neighbour between each node in the communication network is built
Connect matrix；
Traversal moves towards constraint generation module, for searching for the neighbour of set out node and destination node in the hard adjacency matrix
Contact, according to the tandem node in multiple abutment points and the communication network, structure, which travels through, moves towards constraint matrix, and according to
The traversal moves towards constraint matrix and changes the soft adjacency matrix；
Route searching logging modle, for since described node, hard adjacency matrix and change described in alternate search
The soft adjacency matrix crossed, until the destination node is reached, according to the dynamic generation of auxiliary stack and the screening in release description path
Process, and record searching route.
Optionally, further include：
Packet route generation module, for when detect it is described auxiliary stack stack top node be the destination node after, root
Node is set out to the message transmissions path of the destination node according to described in the searching route generation of the auxiliary record stack.
Optionally, the traversal moves towards constraint generation module as each element in the soft adjacency matrix and the traversal
It moves towards corresponding element in constraint matrix to carry out and calculate, the mould of the new matrix of generation as the soft adjacency matrix after changing
Block.
Optionally, the route searching logging modle includes：
Kinematics generation module, for the node being accessed being pressed into successively according to access time in the auxiliary stack,
In alternate search, the abutment points of the stack top node of current auxiliary stack are searched for, it is described auxiliary to be pressed into as next accessed point
Help the stack top node of stack；
Releasing unit for having when element repeats or during without node stacking when being pressed into the node and stack of stack top, is released
Put the stack；When the stack top node is the destination node, the auxiliary stack element is traveled through, the node that sets out described in record is to institute
The searching route of destination node is stated, discharges the auxiliary stack.
An embodiment of the present invention provides a kind of determining method of path of message, previously according to the communication network of intelligent substation
In terminal device and interchanger, structure describes the hard adjacency matrix of physical couplings and each friendship of description between each node
The soft adjacency matrix for internal logic connection relation of changing planes；The adjoining of set out node and destination node is searched in hard adjacency matrix
Point, according to multiple abutment points and tandem node, structure traversal moves towards constraint matrix, and it is soft using traversal to move towards constraint matrix change
Adjacency matrix；Since node, the hard adjacency matrix of alternate search and the soft adjacency matrix more corrected one's mistakes, until reaching purpose section
Point according to the dynamic generation of auxiliary stack and the screening process in release description path, and records searching route.
The technical solution that the application provides is the advantage is that in message search process, and each terminal device of alternate search is with handing over
The matrix of ports physical connection relation structure between changing planes, between interchanger and interchanger, the void between interchanger internal port
Intend the matrix of connection relation structure, also constrain the trend traveled through using abutment points and the tandem node of the node that sets out, destination node,
Search speed is accelerated, improves the accuracy rate of search, so as to improve the accuracy rate and efficiency that packet route determines, and it is complicated
It spends low, it is easy to accomplish, it is applied widely.
In addition, the embodiment of the present invention provides corresponding realization device also directed to the determining method of path of message, further
So that the method has more practicability, described device has the advantages that corresponding.
Description of the drawings
It, below will be to embodiment or existing for the clearer technical solution for illustrating the embodiment of the present invention or the prior art
Attached drawing is briefly described needed in technology description, it should be apparent that, the accompanying drawings in the following description is only this hair
Some bright embodiments, for those of ordinary skill in the art, without creative efforts, can be with root
Other attached drawings are obtained according to these attached drawings.
Fig. 1 is a kind of flow diagram of the determining method of path of message provided in an embodiment of the present invention；
Fig. 2 is the communication network connection diagram of an illustrative example provided in an embodiment of the present invention；
Fig. 3 is the flow diagram of the determining method of path of another message provided in an embodiment of the present invention；
A kind of Fig. 4 corresponding auxiliary stack dynamic change signals under scene for illustrative example provided in an embodiment of the present invention
Figure；
Fig. 5 is another communication network connection diagram of illustrative example provided in an embodiment of the present invention；
Fig. 6 corresponding auxiliary stack dynamic changes under another scene for illustrative example provided in an embodiment of the present invention
Principle schematic；
Fig. 7 is a kind of specific embodiment structure chart of the path determining device of message provided in an embodiment of the present invention；
Fig. 8 is another specific embodiment structure chart of the path determining device of message provided in an embodiment of the present invention.
Specific embodiment
In order to which those skilled in the art is made to more fully understand the present invention program, with reference to the accompanying drawings and detailed description
The present invention is described in further detail.Obviously, described embodiment be only part of the embodiment of the present invention rather than
Whole embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creative work premise
Lower all other embodiments obtained, belong to the scope of protection of the invention.
Term " first ", " second ", " the 3rd " " in the description and claims of this application and above-mentioned attached drawing
Four " etc. be for distinguishing different objects rather than for describing specific order.In addition term " comprising " and " having " and
Their any deformations, it is intended that cover non-exclusive include.Such as contain the process of series of steps or unit, method,
The step of system, product or equipment are not limited to list or unit, but the step of may include not list or unit.
After the technical solution of the embodiment of the present invention is described, the various nonrestrictive realities of detailed description below the application
Apply mode.
Referring first to Fig. 1, Fig. 1 is that a kind of flow of determining method of path of message provided in an embodiment of the present invention is illustrated
Figure, the embodiment of the present invention may include herein below：
S101：Previously according between the terminal device and interchanger in the communication network of intelligent substation, interchanger and friendship
The physical couplings changed planes between port, build the hard adjacency matrix between each node in the communication network；According to described
Virtual link relation inside interchanger builds the soft adjacency matrix between each node in the communication network.
For fixed intelligent substation, communication network architecture is constant to stablize in a short time, that is to say, that
The terminal device and the number of interchanger included in communication network is constant.Terminal device, the port abstraction of interchanger are node, that
The physical couplings of communication network interior joint include the connection relation of terminal device and switch port, respective switch it
Between connection relation；So the logic connecting relation of communication network interior joint is the virtual link relation inside interchanger.
As an example it is assumed that including 8 terminal devices in star communication network, 3 interchangers, First interchanger has
4 ports, second interchanger have 5 ports, and the 3rd interchanger has 3 ports, 8 terminal devices and 12 are held
Mouth is abstracted as node, and specific communication network connection diagram is seen shown in Fig. 2, and solid line is physical couplings, and dotted line is
Logic connecting relation, node 1-8 are the node that terminal device is abstracted, and node 9-13 is corresponding for second interchanger, 5 ports
Node, 14-16 are the corresponding node in 3 ports of the 3rd interchanger, and node 17-20 corresponds to for 4 ports of First interchanger
Node.
Hard adjacency matrix is used to describe the port between terminal device and interchanger between interchanger and interchanger
Physical couplings, soft adjacency matrix is used to describe the connection relation inside interchanger between each port.A kind of specific
Embodiment in, when there is connection relation (physical couplings or logic connecting relation) between node, the corresponding element of matrix
For 1, conversely, being then 0.By taking star communication network shown in Fig. 2 as an example, which shares 20 nodes, then description section
The matrix of connection relation between point is 20*20 matrixes, and the row and column of matrix represents corresponding node, and the first row to the 20th row represents
For 1st node to the 20th node, first row to the 20th, which arranges, represents the 1st node to the 20th node, such as the first row first
Connection relation of a element between first node and first node, second element of the first row are first node and the
Connection relation between two nodes, connection of second element of row first between second node and first node are closed
System, hard adjacency matrix can be：
Soft adjacency matrix can be：
S102：The abutment points of set out node and destination node are searched in the hard adjacency matrix, according to multiple neighbours
Tandem node in contact and the communication network, structure traversal moves towards constraint matrix, and moves towards constraint square according to the traversal
Battle array changes the soft adjacency matrix.
Obtain the information of set out node and destination node, the i.e. transmitting terminal (set out node) of message and destination (purpose section
Point), for example, 7 corresponding terminal device of node is the node that sets out, 3 corresponding terminal device of node is purpose node.
Search in hard adjacency matrix is set out the abutment points of node, i.e., the node being connected with the node that sets out, such as in Fig. 2
The abutment points of node 7 when being searched in hard adjacency matrix, can first find the 7th row, that is, represent the 7th node, member is looked in the row
Element is 1 that row, which is abutment points, i.e., 19.When there are multiple abutment points, each abutment points is found.
Physical connection interface of the tandem node between interchanger and interchanger, for example, it is shown in Fig. 2, and First exchanges
The connecting pin of machine node 17,13 corresponding with the connectivity port of second interchanger, the 3rd interchanger and second interchanger
The corresponding node 11,14 of mouth.
It is the search that extra node is shielded to be limited in search process that traversal, which moves towards constraint matrix, is retained effective
After node, such as definite abutment points, abutment points are can be directly to, without searching for other nodes, and then are determined, are conducive to carry
Rise search speed.For example, the node 7 that sets out arrives destination node 3, if being not provided with traversal moves towards matrix, when search,
Will necessarily search node 20, node 17 and node 18, replicate generation three auxiliary stacks, by auxiliary stack release rule,
Path comprising node 20 and 18 is rejected, and moved towards using traversal after constraint matrix constrained, just directly definite next step
Destination node is node 17, is compared, this obviously increases workloads, can expend the more time.
Under a kind of specific embodiment, the building course that traversal moves towards constraint matrix can be：
Multiple abutment points form adjacent point set K, and tandem node forms tandem node set Q, and the traversal moves towards constraint
Each element is in matrix J：
By taking communication network shown in Fig. 2 as an example, the node that sets out is 7, destination node 3,5, then adjacent point set can be K
={ 19,12,15 }, tandem node set can be Q={ 11,13,14,17 }, and traversal moves towards constraint matrix J (dimension is number of nodes)
In comprising all elements in two set, show on matrix to be that row and column is all adjacent point set and tandem node set
In element when, then in J matrixes the element be 1, for example, the 19th behavior node 19, the 11st of the row the, 12,13,14,
The node number 11 of the corresponding node of 15,17 row, 12,13,14,15,17, also it is adjacent point set and the member in tandem node set
Element, therefore in the 19th row of matrix J, the element of the 11st, 12,13,14,15,17 row is all 1, other are 0, and traversal moves towards constraint square
Battle array J can be：
Constraint matrix is moved towards using traversal to modify to soft adjacency matrix, when scanning for, only needs alternate search hard
Adjacency matrix and the soft adjacency matrix changed.The modification of soft adjacency matrix can be：
Each element in soft adjacency matrix moves towards corresponding element in constraint matrix with traversal and carries out and calculate, generation
New matrix as change after soft adjacency matrix.For example, still traveled through away by taking communication network shown in Fig. 2 as an example
Element into constraint matrix J and soft adjacency matrix is carried out and calculated, and is：
New matrix with calculating generation is amended soft adjacency matrix.
S103：Since described node, hard adjacency matrix described in alternate search and the soft adjacency matrix more corrected one's mistakes, directly
To the destination node is reached, according to the dynamic generation of auxiliary stack and the screening process in release description path, and search road is recorded
Footpath.
It describes to set out node to the process in the screening path of destination node using stack dynamic generation is aided in release, and remembers
Record sets out node to the searching route of destination node, has when being pressed into the node and stack of stack top when element repeats or does not save
During point stacking, the stack is directly discharged；When stack top element is purpose node, the auxiliary stack element is traveled through, the node that sets out is recorded and arrives
The searching route of destination node, and other memory spaces (non-auxiliary stack) are stored in, discharge the auxiliary stack.When all auxiliary stacks
It is all released, the stack number for aiding in stack is 0, and search terminates, concretely：
Aid in stack that the node being accessed is pressed into according to access time successively in auxiliary stack, what is first accessed first puts into, after
It is put into after accessing, the node positioned at auxiliary stack stack top is the node of current accessed.
In alternate search, the abutment points of the stack top node of current auxiliary stack are searched for, using as next accessed point quilt
It is pressed into the stack top node of the auxiliary stack；When the stack top node of stack is aided in there are multiple abutment points, the corresponding number of generation is replicated
Stack is aided in, and each abutment points press-in of the stack top node is corresponded to the stack top of auxiliary stack.
When existing element repetition in the node and stack of press-in stack top or during without node stacking, the stack is discharged；
When the stack top node is the destination node, the auxiliary stack element is traveled through, the node that sets out described in record arrives
The searching route of the destination node discharges the auxiliary stack.
In technical solution provided in an embodiment of the present invention, in message search process, each terminal device of alternate search with
The matrix of ports physical connection relation structure between interchanger, between interchanger and interchanger, between interchanger internal port
The matrix of virtual link relation structure also utilizes the node that sets out, the abutment points of destination node and walking for tandem node constraint traversal
To, search speed is accelerated, improves the accuracy rate of search, so as to improve the accuracy rate and efficiency that packet route determines, and
Complexity is low, it is easy to accomplish, it is applied widely.
Under a kind of specific embodiment, based on above-described embodiment, referring to Fig. 3, may also include：
S104：After the stack top node for detecting the auxiliary stack is the destination node, according to the auxiliary record stack
Searching route generation described in set out node to the message transmissions path of the destination node.
Detect that stack top node for purpose node, then travels through the stack and stored messages transmission path, it is auxiliary finally to discharge this
Help stack.After all auxiliary stacks are all released, the number of stack is 0, shows that search terminates.It, will be every when comprising mulitpath
One paths record, and generate the message transmissions path of set out node and destination node, are then stored.It can be further anti-
Feed active user's (location information of memory space or routing information of generation), and user also can be directly to memory space and be looked into
It askes, the application does not do this any restriction.
For the principle and thought of those skilled in the art more clearly the application, by taking specific example as an example, illustrate
The technical solution of the application：
By taking communication network shown in Fig. 2 as an example, the node that sets out is 7, and destination node is 3 and 5, then determines node 7 to section
The message transmissions path of point 3, when arriving the message transmissions path of node 5 with node 7, the dynamic change of the auxiliary stack in search process
Process is as shown in figure 4, from soil as it can be seen that the message transmissions path of node 7 to node 3 is：
7-19-17-13-12-3；
The message transmissions path of node 7 to node 5 is：
7-19-17-13-11-14-15-5。
In another example by taking the communication network shown in Fig. 5 as an example, acquisition sets out node as 6, and destination node is 2 path, Fig. 6
For search process auxiliary stack dynamic changing process, from Fig. 6, it can be deduced that, node 6 arrive node 2 message transmissions path
For：
6-20-17-13-10-2；And
6-20-18-16-14-11-10-2。
The embodiment of the present invention provides corresponding realization device also directed to the determining method of path of message, further such that institute
Method is stated with more practicability.The path determining device of message provided in an embodiment of the present invention is introduced below, is hereafter retouched
The path determining device for the message stated can correspond reference with the determining method of path of above-described message.
Referring to Fig. 7, Fig. 7 is the path determining device of message provided in an embodiment of the present invention under a kind of specific embodiment
Structure chart, which may include：
Double adjacency matrix build modules 701, for the terminal device in the communication network previously according to intelligent substation with
Physical couplings between interchanger, between interchanger and switch port are built in the communication network between each node
Hard adjacency matrix；According to the virtual link relation inside the interchanger, build in the communication network between each node
Soft adjacency matrix.
Traversal moves towards constraint generation module 702, for searching for set out node and destination node in the hard adjacency matrix
Abutment points, according to the tandem node in multiple abutment points and the communication network, structure traversal moves towards constraint matrix, and
Constraint matrix is moved towards according to the traversal and changes the soft adjacency matrix.
Route searching logging modle 703, for since described node, hard adjacency matrix described in alternate search and more
The soft adjacency matrix corrected one's mistakes, until the destination node is reached, according to the dynamic generation of auxiliary stack and the sieve in release description path
Process is selected, and records searching route.
In some specific embodiments of the embodiment of the present invention, the traversal, which moves towards constraint generation module 702, to be institute
The each element stated in soft adjacency matrix moves towards corresponding element progress in constraint matrix with the traversal and calculates, generation
Module of the new matrix as the soft adjacency matrix after change.
In other embodiment, the route searching logging modle 703 may also include：
Kinematics generation module, for the node being accessed being pressed into successively according to access time in the auxiliary stack,
In alternate search, the abutment points of the stack top node of current auxiliary stack are searched for, it is described auxiliary to be pressed into as next accessed point
Help the stack top node of stack；
Releasing unit for having when element repeats or during without node stacking when being pressed into the node and stack of stack top, is released
Put the stack；When the stack top node is the destination node, the auxiliary stack element is traveled through, the node that sets out described in record is to institute
The searching route of destination node is stated, discharges the auxiliary stack.
In some embodiments, the kinematics generation module is when the stack top node of the auxiliary stack has multiple neighbours
During contact, the auxiliary stack of the corresponding number of generation is replicated, and each abutment points press-in of the stack top node is corresponded to the stack of auxiliary stack
The unit on top.
Optionally, in some embodiments of the present embodiment, referring to Fig. 8, described device can also for example include：
Packet route generation module 704, for when detect it is described auxiliary stack stack top node be the destination node after,
Node is set out to the message transmissions path of the destination node according to the searching route generation of the auxiliary record stack.
The function of each function module of the path determining device of message described in the embodiment of the present invention can be real according to the above method
The method specific implementation in example is applied, specific implementation process is referred to the associated description of above method embodiment, herein no longer
It repeats.
From the foregoing, it will be observed that the embodiment of the present invention is in message search process, between each terminal device of alternate search and interchanger,
The matrix of ports physical connection relation structure between interchanger and interchanger, the virtual link relation between interchanger internal port
The matrix of structure also using the node that sets out, the trend of the abutment points and tandem node constraint traversal of destination node, accelerates search
Speed improves the accuracy rate of search, and so as to improve the accuracy rate and efficiency that packet route determines, and complexity is low, is easy to
It realizes, it is applied widely.
Each embodiment is described by the way of progressive in this specification, the highlights of each of the examples are with it is other
The difference of embodiment, just to refer each other for same or similar part between each embodiment.For dress disclosed in embodiment
For putting, since it is corresponded to the methods disclosed in the examples, so description is fairly simple, related part is referring to method part
Explanation.
Professional further appreciates that, with reference to each exemplary unit of the embodiments described herein description
And algorithm steps, can be realized with the combination of electronic hardware, computer software or the two, in order to clearly demonstrate hardware and
The interchangeability of software generally describes each exemplary composition and step according to function in the above description.These
Function is performed actually with hardware or software mode, specific application and design constraint depending on technical solution.Specialty
Technical staff can realize described function to each specific application using distinct methods, but this realization should not
Think beyond the scope of this invention.
It can directly be held with reference to the step of method or algorithm that the embodiments described herein describes with hardware, processor
The combination of capable software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
The determining method of path and device of a kind of message provided by the present invention are described in detail above.Herein
In apply specific case the principle of the present invention and embodiment be set forth, the explanation of above example is only intended to sides
Assistant solves the method and its core concept of the present invention.It should be pointed out that for those skilled in the art, not
Depart from the principle of the invention on the premise of, can also to the present invention some improvement and modification can also be carried out, these improvement and modification are also fallen into
In the protection domain of the claims in the present invention.
Claims (7)
1. a kind of determining method of path of message, applied to intelligent substation, which is characterized in that including：
Previously according between the terminal device and interchanger in the communication network of intelligent substation, interchanger and switch port it
Between physical couplings, build the hard adjacency matrix between each node in the communication network；Inside the interchanger
Virtual link relation, build the soft adjacency matrix between each node in the communication network；
Search is set out the abutment points of node and destination node in the hard adjacency matrix, according to multiple abutment points and described
Tandem node in communication network, structure traversal move towards constraint matrix, and according to the traversal moves towards constraint matrix change
Soft adjacency matrix；
Since described node, hard adjacency matrix described in alternate search and the soft adjacency matrix more corrected one's mistakes, until reaching institute
Destination node is stated, according to the dynamic generation of auxiliary stack and the screening process in release description path, and records searching route；
The tandem node in multiple abutment points and the communication network, structure traversal move towards constraint matrix bag
It includes：
Multiple abutment points form adjacent point set K, and the tandem node forms tandem node set Q, the traversal trend
Each element is in constraint matrix J：
<mrow>
<msub>
<mi>J</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&Element;</mo>
<mi>K</mi>
<mo>&cup;</mo>
<mi>Q</mi>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>0</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&NotElement;</mo>
<mi>K</mi>
<mo>&cup;</mo>
<mi>Q</mi>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>;</mo>
</mrow>
Wherein, the traversal moves towards constraint matrix J (dimension is number of nodes) and shows on matrix to be that row and column is all adjacent point set
When closing with element in tandem node set, then it is 1 to move towards the element in constraint matrix J matrixes in the traversal；
It is described according to the traversal to move towards constraint matrix and change the soft adjacency matrix to include：
Each element in the soft adjacency matrix moves towards corresponding element in constraint matrix with the traversal and carries out and calculate,
The new matrix of generation is as the soft adjacency matrix after change.
2. the determining method of path of message according to claim 1, which is characterized in that further include：
After the stack top node for detecting the auxiliary stack is the destination node, according to the searching route of the auxiliary record stack
Node is set out described in generation to the message transmissions path of the destination node.
3. the determining method of path of the message according to 1 or 2 any one of claim, which is characterized in that described according to auxiliary
The dynamic generation of stack and the screening process in release description path are helped, and records searching route to include：
The node being accessed is pressed into according to access time in the auxiliary stack successively, in alternate search, search is current auxiliary
The abutment points of the stack top node of stack are helped, the stack top node to be pressed into the auxiliary stack as next accessed point；
When existing element repetition in the node and stack of press-in stack top or during without node stacking, the stack is discharged；
When the stack top node is the destination node, the auxiliary stack element is traveled through, node is set out described in record described in
The searching route of destination node discharges the auxiliary stack.
4. the determining method of path of message according to claim 3, which is characterized in that described search currently aids in the stack of stack
The abutment points of top node, the stack top node to be pressed into the auxiliary stack as next accessed point include：
When the stack top node of the auxiliary stack there are multiple abutment points, the auxiliary stack of the corresponding number of generation is replicated, and by the stack
The stack top of the corresponding auxiliary stack of each abutment points press-in of top node.
5. a kind of path determining device of message, applied to intelligent substation, which is characterized in that including：
Double adjacency matrix build modules, for the terminal device in the communication network previously according to intelligent substation and interchanger it
Between, the physical couplings between interchanger and switch port, build the hard adjoining between each node in the communication network
Matrix；According to the virtual link relation inside the interchanger, the soft adjacent square between each node in the communication network is built
Battle array；
Traversal moves towards constraint generation module, for searching for the adjoining of set out node and destination node in the hard adjacency matrix
Point, according to the tandem node in multiple abutment points and the communication network, structure traversal moves towards constraint matrix, and according to institute
It states traversal and moves towards the constraint matrix change soft adjacency matrix；It is described according in multiple abutment points and the communication network
Tandem node, structure traversal, which moves towards constraint matrix, to be included：
Multiple abutment points form adjacent point set K, and the tandem node forms tandem node set Q, the traversal trend
Each element is in constraint matrix J：
<mrow>
<msub>
<mi>J</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
<mo>=</mo>
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mn>1</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&Element;</mo>
<mi>K</mi>
<mo>&cup;</mo>
<mi>Q</mi>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mn>0</mn>
<mo>,</mo>
</mrow>
</mtd>
<mtd>
<mrow>
<mi>i</mi>
<mo>,</mo>
<mi>j</mi>
<mo>&NotElement;</mo>
<mi>K</mi>
<mo>&cup;</mo>
<mi>Q</mi>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
<mo>;</mo>
</mrow>
Wherein, the traversal moves towards constraint matrix J (dimension is number of nodes) and shows on matrix to be that row and column is all adjacent point set
When closing with element in tandem node set, then it is 1 to move towards the element in constraint matrix J matrixes in the traversal；
Route searching logging modle for since described node, hard adjacency matrix described in alternate search and is more corrected one's mistakes
Up to reaching the destination node, the screening process in path is described according to the dynamic generation of auxiliary stack with release for soft adjacency matrix,
And record searching route；
Wherein, the traversal moves towards constraint generation module and travels through trend about with described for each element in the soft adjacency matrix
Corresponding element is carried out and calculated in beam matrix, the module of the new matrix of generation as the soft adjacency matrix after changing.
6. the path determining device of message according to claim 5, which is characterized in that further include：
Packet route generation module, for when detect it is described auxiliary stack stack top node be the destination node after, according to institute
It states and sets out node to the message transmissions path of the destination node described in the searching route generation of auxiliary record stack.
7. the path determining device of message according to claim 6, which is characterized in that the route searching logging modle bag
It includes：
Kinematics generation module, for being pressed into the node being accessed successively according to access time in the auxiliary stack, alternately
In search, the abutment points of the stack top node of current auxiliary stack are searched for, to be pressed into the auxiliary stack as next accessed point
Stack top node；
Releasing unit, for having when element repeats or during without node stacking when being pressed into the node and stack of stack top, release should
Stack；When the stack top node is the destination node, the auxiliary stack element is traveled through, the node that sets out described in record is to the mesh
Node searching route, discharge the auxiliary stack.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710612150.1A CN107404437B (en) | 2017-07-25 | 2017-07-25 | The determining method of path and device of a kind of message |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710612150.1A CN107404437B (en) | 2017-07-25 | 2017-07-25 | The determining method of path and device of a kind of message |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107404437A CN107404437A (en) | 2017-11-28 |
| CN107404437B true CN107404437B (en) | 2018-05-18 |
Family
ID=60402127
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710612150.1A Active CN107404437B (en) | 2017-07-25 | 2017-07-25 | The determining method of path and device of a kind of message |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107404437B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110319845B (en) | 2018-03-30 | 2024-01-09 | 日本电气株式会社 | Method, device and system for determining reachable path between two points |
| CN111552288B (en) * | 2020-04-28 | 2021-03-16 | 西南交通大学 | Mobile robot path smoothing method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103647717A (en) * | 2013-11-26 | 2014-03-19 | 华南理工大学 | Message accurate recognition-based substation communication network deterministic path switching method |
| CN104202188A (en) * | 2014-09-01 | 2014-12-10 | 北京航空航天大学 | Method for carrying out AFDX network path optimization by genetic algorithm |
| CN106533777A (en) * | 2016-11-29 | 2017-03-22 | 广东工业大学 | Intelligent transformer station information flow path determination method based on matrix ranks and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104601473B (en) * | 2014-12-29 | 2018-01-05 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | A kind of route generating method and system of the multi-goal path of belt restraining |
-
2017
- 2017-07-25 CN CN201710612150.1A patent/CN107404437B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103647717A (en) * | 2013-11-26 | 2014-03-19 | 华南理工大学 | Message accurate recognition-based substation communication network deterministic path switching method |
| CN104202188A (en) * | 2014-09-01 | 2014-12-10 | 北京航空航天大学 | Method for carrying out AFDX network path optimization by genetic algorithm |
| CN106533777A (en) * | 2016-11-29 | 2017-03-22 | 广东工业大学 | Intelligent transformer station information flow path determination method based on matrix ranks and system |
Non-Patent Citations (2)
| Title |
|---|
| 智能变电站通信网络虚拟局域网建模与优化配置方法;邹俊雄 等;《电力自动化设备》;20150831;第35卷(第8期);第137-142页 * |
| 智能电网信息流的建模和静态计算方法研究;何瑞文 等;《中国电机工程学报》;20160320;第36卷(第6期);第1527-1535页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107404437A (en) | 2017-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pierre et al. | Topological design of computer communication networks using simulated annealing | |
| CN101702655B (en) | Layout method and system of network topological diagram | |
| CN105469143B (en) | Network-on-chip method for mapping resource based on neural network dynamic feature | |
| CN112181867B (en) | On-chip network memory controller layout method based on multi-target genetic algorithm | |
| CN106936645B (en) | The optimization method of tree network topology structure based on queueing theory | |
| CN105915407A (en) | Flow generator virtualization realization system and flow generator virtualization realization method based on SDN | |
| CN107453928B (en) | A kind of power communication network node different degree evaluation method and device | |
| CN104156534B (en) | The objectification power network topology analysis method generated for black-start scheme | |
| CN108053037A (en) | A kind of power distribution network based on two net fusions repairs policy development method and device | |
| CN107104824A (en) | A kind of network topology determines method and apparatus | |
| CN105915304A (en) | System-level simulation demonstration verification method facing satellite mobile communication | |
| CN107517157A (en) | A kind of determining method of path, device and system | |
| CN107404437B (en) | The determining method of path and device of a kind of message | |
| CN109905280A (en) | A kind of emulation mode and system towards mobile satellite network | |
| CN108964964A (en) | A kind of network topology display methods and device | |
| CN102938918B (en) | Method, device and system for managing wireless sensor network (WSN) | |
| Kshemkalyani et al. | Efficient dispersion of mobile robots on dynamic graphs | |
| CN108429679A (en) | Extended pattern interference networks and its routing algorithm | |
| CN101330411A (en) | Method and system for simulating large-scale network topological | |
| CN107566098B (en) | The generation method and generation system of software defined network application cycle tests | |
| CN105871621A (en) | Probe deployment method based on improved greedy strategy | |
| CN106982162A (en) | Methods, devices and systems for forwarding service stream | |
| CN106936731A (en) | The method and apparatus of the message forwarding in software defined network SDN | |
| CN104852849B (en) | A kind of OSPF configuration methods and relevant apparatus | |
| CN105704067B (en) | Switch |
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 |