CN107404437A - 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 PDF

Info

Publication number
CN107404437A
CN107404437A CN201710612150.1A CN201710612150A CN107404437A CN 107404437 A CN107404437 A CN 107404437A CN 201710612150 A CN201710612150 A CN 201710612150A CN 107404437 A CN107404437 A CN 107404437A
Authority
CN
China
Prior art keywords
node
stack
matrix
adjacency matrix
path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201710612150.1A
Other languages
Chinese (zh)
Other versions
CN107404437B (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.)
Guangdong University of Technology
Original Assignee
Guangdong University of Technology
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 Guangdong University of Technology filed Critical Guangdong University of Technology
Priority to CN201710612150.1A priority Critical patent/CN107404437B/en
Publication of CN107404437A publication Critical patent/CN107404437A/en
Application granted granted Critical
Publication of CN107404437B publication Critical patent/CN107404437B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing

Abstract

The embodiment of the invention discloses a kind of determining method of path of message and device.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 between each node, and the soft adjacency matrix of description respective switch internal logic annexation;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, the screening process in path is described according to the dynamic generation of auxiliary stack with release, and record searching route.The technical scheme that the application provides accelerates search speed, improves the accuracy rate of search, and so as to improve the accuracy rate and efficiency of packet route determination, and complexity is low, it is easy to accomplish, it is applied widely.

Description

The determining method of path and device of a kind of message
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 arises at the historic moment.Intelligent substation includes intelligent high-voltage equipment With transformer station'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 function such as amount and detection, meanwhile, possess support power network to automatically control in real time, Intelligent adjustment, on-line analysis decision-making and collaboration The transformer station of the Premium Features such as interaction.
It is general that plan is isolated as message using the VLAN being easily achieved in the communication network of intelligent substation Slightly, in many division VLAN mode, network memberses are divided with switch ports themselves, its configuration process is the most simple and reliable. The configuration that becomes more meticulous of intelligent substation communication network virtual LAN is realized, first has to determine that each message passes through switch ports themselves Situation, i.e. port flow distribution situation.
It is determined that during packet route, the device port in intelligent substation communication network is typically abstracted into node, equipment Between hardwire connected with the logic between switch ports themselves and 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 because same switch ports themselves there may be virtual link relation between any two, whether judge point-to-point transmission The algorithm in path, such as Depth Priority Algorithm be present, 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 ports themselves in practice are not inconsistent, and ask for point-to-point transmission shortest path Although the algorithm in footpath can solve the problems, such as 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, the screening process in path is described with release according to the dynamic generation of auxiliary stack, and records searching route.
Optionally, in addition to:
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 element corresponding in constraint matrix carry out with Calculate, 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 describes the screening process in path with release, and records search road Footpath includes:
Accessed node is pressed into the auxiliary stack successively according to access time, 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 being pressed into that existing element repeats in the node and stack of 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 set out described in record arrives The searching route of the destination node, discharge the auxiliary stack.
Optionally, the abutment points of the stack top node of the current auxiliary stack of the search, 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 Include:
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 ports themselves, build 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 is moved towards to constrain 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 traversal 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 reaching the destination node, the screening in path is described according to the dynamic generation of auxiliary stack with release Process, and record searching route.
Optionally, in addition to:
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, it is each element and the traversal in the soft adjacency matrix that the traversal, which is moved towards to constrain generation module, Move 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 accessed node to be pressed into the auxiliary stack successively according to access time, 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 when being pressed into that existing element repeats in the node and stack of stack top, or during without node stacking, release Put the stack;When the stack top node is the destination node, the auxiliary stack element is traveled through, the node that set out described in record is to institute The searching route of destination node is stated, discharges the auxiliary stack.
The embodiments of the invention provide 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 between each node, and each friendship of description The soft adjacency matrix for internal logic annexation 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, the screening process in path is described according to the dynamic generation of auxiliary stack with release, and records searching route.
The technical scheme advantage that the application provides is, in message search procedure, each terminal device of alternate search is with handing over The matrix of ports physical annexation structure between changing planes, between interchanger and interchanger, the void between interchanger internal port Intend the matrix of annexation 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 of packet route determination, and it is complicated Spend 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 methods described has more practicality, described device has the advantages of corresponding.
Brief description of the drawings
, below will be to embodiment or existing for the clearer explanation embodiment of the present invention or the technical scheme of prior art The required accompanying drawing used is briefly described in technology description, it should be apparent that, drawings in the following description are only this hair Some bright embodiments, for those of ordinary skill in the art, on the premise of not paying creative work, can be with root Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is a kind of schematic flow sheet 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 schematic flow sheet of the determining method of path of another message provided in an embodiment of the present invention;
Fig. 4 is a kind of illustrative example provided in an embodiment of the present invention corresponding auxiliary stack dynamic change signal under scene Figure;
Fig. 5 is another communication network connection diagram of illustrative example provided in an embodiment of the present invention;
Fig. 6 is illustrative example provided in an embodiment of the present invention corresponding auxiliary stack dynamic change under another scene Principle schematic;
Fig. 7 is a kind of embodiment structure chart of the path determining device of message provided in an embodiment of the present invention;
Fig. 8 is another embodiment structure chart of the path determining device of message provided in an embodiment of the present invention.
Embodiment
In order that those skilled in the art 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 is only part of the embodiment of the present invention, rather than Whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art are not making creative work premise Lower obtained every other embodiment, belongs to the scope of protection of the invention.
Term " first ", " second ", " the 3rd " " in the description and claims of this application and above-mentioned accompanying 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 scheme of the embodiment of the present invention is described, the various non-limiting 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, build 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 annexation of terminal device and switch ports themselves, respective switch it Between annexation;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, and 8 terminal devices and 12 are held Mouth is abstracted as node, and specific communication network connection diagram see 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 to second interchanger, 5 ports Node, 14-16 are node corresponding to 3 ports of the 3rd interchanger, and node 17-20 is that 4 ports of First interchanger are corresponding 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 annexation inside interchanger between each port.A kind of specific Embodiment in, when there is annexation (physical couplings or logic connecting relation) between node, element corresponding to matrix For 1, conversely, being then 0.By taking the star communication network shown in Fig. 2 as an example, the communication network shares 20 nodes, then description section The matrix of annexation between point is 20*20 matrixes, the row and column of matrix represent corresponding to node, the first row to the 20th row represents 1st node represents the 1st node to the 20th node, such as the first row first to the 20th node, first row to the 20th row Annexation of the individual element between first node and first node, second element of the first row are first node and the Annexation 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 to constrain 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, terminal device corresponding to node 7 is the node that sets out, terminal device corresponding to node 3 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, the 7th row can be first found, that is, represent the 7th node, member is looked in the row Element is 1 that row, and the columns 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, such as shown in Fig. 2, First exchanges The connection end of machine node 17,13 corresponding with the connectivity port of second interchanger, the 3rd interchanger and second interchanger Node 11,14 corresponding to mouthful.
It is the search that unnecessary node is shielded to be limited in search procedure that traversal, which moves towards constraint matrix, is retained effective After node, such as determination abutment points, abutment points are can be directly to, without searching for other nodes, and then are determined, are advantageous 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 enters row constraint, just direct determination next step Destination node is node 17, is compared, and this obviously increases workload, 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 the 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 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 node corresponding to 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 row of matrix J the 19th, the element of the 11st, 12,13,14,15,17 row is all 1, and other are 0, and traversal is moved towards to constrain 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 element progress and calculating corresponding in constraint matrix, generation with traversal New matrix as change after soft adjacency matrix.For example, still traveled through away by taking the 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, the screening process in path is described with release according to the dynamic generation of auxiliary stack, and records search road Footpath.
Describe to set out node to the process in the screening path of destination node using stack dynamic generation is aided in release, and remember Record sets out node to the searching route of destination node, when being pressed into existing element repetition in the node and stack of stack top, 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 All it is released, the stack number for aiding in stack is 0, and search terminates, concretely:
Accessed node is pressed into auxiliary stack by auxiliary stack successively according to access time, and what is first accessed first puts into, after 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, to be used as next accessed point quilt It is pressed into the stack top node of the auxiliary stack;When aiding in the stack top node of stack 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 being pressed into that existing element repeats in the node and stack of 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 set out described in record arrives The searching route of the destination node, discharge the auxiliary stack.
In technical scheme provided in an embodiment of the present invention, in message search procedure, each terminal device of alternate search with The matrix of ports physical annexation structure between interchanger, between interchanger and interchanger, between interchanger internal port The matrix of virtual link relation structure, also constrain walking for traversal using abutment points and the tandem node of the node that sets out, destination node To, search speed is accelerated, improves the accuracy rate of search, so as to improve the accuracy rate and efficiency of packet route determination, 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.
It is purpose node to detect stack top 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., 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.Can be further anti- Feed active user's (positional information of memory space or routing information of generation), and user also can be directly to memory space and be looked into Ask, the application does not do any restriction to this.
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 scheme of the application:
By taking the 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 procedure As shown in figure 4, from soil, the message transmissions path of node 7 to node 3 is process:
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 procedure 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 State method and have more practicality.The path determining device of message provided in an embodiment of the present invention is introduced below, hereafter retouched The path determining device for the message stated can be mutually to should refer to 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 embodiment Structure chart, the device 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 ports themselves, build 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 is moved towards to constrain 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 reaching the destination node, the sieve in path is described according to the dynamic generation of auxiliary stack with release Process is selected, and records searching route.
In some embodiments of the embodiment of the present invention, the traversal, which is moved towards to constrain generation module 702, to be institute The each element stated in soft adjacency matrix moves towards element progress and calculating corresponding in constraint matrix with the traversal, 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 7031, for accessed node to be pressed into the auxiliary stack successively according to access time In, in alternate search, the abutment points of the stack top node of current auxiliary stack are searched for, to be pressed into institute as next accessed point State the stack top node of auxiliary stack;
Releasing unit 7032, for when being pressed into that existing element repeats in the node and stack of stack top, or there is no node stacking When, discharge the stack;When the stack top node is the destination node, the auxiliary stack element is traveled through, set out section described in record Point discharges the auxiliary stack to the searching route of the destination node.
In some embodiments, the kinematics generation module 7031 be when it is described auxiliary stack stack top node have it is more During individual abutment points, the auxiliary stack of the corresponding number of generation is replicated, and each abutment points press-in of the stack top node is corresponded into auxiliary stack Stack top unit.
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 functional 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, its specific implementation process is referred to the associated description of above method embodiment, herein no longer Repeat.
From the foregoing, it will be observed that the embodiment of the present invention is in message search procedure, between each terminal device of alternate search and interchanger, The matrix of ports physical annexation structure between interchanger and interchanger, the virtual link relation between interchanger internal port The matrix of structure, the trend traveled through also is constrained using abutment points and the tandem node of the node that sets out, destination node, accelerates search Speed, the accuracy rate of search is improved, so as to improve the accuracy rate and efficiency of packet route determination, and complexity is low, is easy to Realize, it is applied widely.
Each embodiment is described by the way of progressive in this specification, what each embodiment stressed be with it is other The difference of embodiment, between each embodiment same or similar part mutually referring to.For dress disclosed in embodiment For putting, because it is corresponded to the method disclosed in Example, so description is fairly simple, related part is referring to method part Explanation.
Professional further appreciates that, with reference to the unit of each example of the embodiments described herein description And algorithm steps, can be realized with electronic hardware, computer software or the combination of the two, in order to clearly demonstrate hardware and The interchangeability of software, the composition and step of each example are generally described according to function in the above description.These Function is performed with hardware or software mode actually, application-specific and design constraint depending on technical scheme.Specialty Technical staff can realize described function using distinct methods to each specific application, but this realization should not Think beyond the scope of this invention.
Directly it can be held with reference to the step of method or algorithm that the embodiments described herein describes with hardware, processor Capable software module, or the two combination are implemented.Software module can be placed in random access memory (RAM), internal 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 to the present invention principle and embodiment be set forth, the explanation of above example is only intended to help 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 On the premise of departing from the principle of the invention, some improvement and modification can also be carried out to the present invention, these are improved and modification is also fallen into In the protection domain of the claims in the present invention.

Claims (10)

  1. A kind of 1. determining method of path of message, applied to intelligent substation, it is characterised in that including:
    Previously according between the terminal device and interchanger in the communication network of intelligent substation, interchanger and switch ports themselves 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, describes the screening process in path with release according to the dynamic generation of auxiliary stack, and records searching route.
  2. 2. the determining method of path of message according to claim 1, it is characterised in that also 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. 3. the determining method of path of message according to claim 1, it is characterised in that described to be moved towards about according to the traversal Beam matrix, which changes the soft adjacency matrix, to be included:
    Each element in the soft adjacency matrix moves towards element progress and calculating corresponding in constraint matrix with the traversal, The new matrix of generation is as the soft adjacency matrix after change.
  4. 4. the determining method of path of the message according to claims 1 to 3 any one, it is characterised in that the basis is more Tandem node in the individual abutment points and the communication network, 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:
  5. 5. the determining method of path of the message according to claims 1 to 3 any one, it is characterised in that described according to auxiliary The dynamic generation and the screening process in release description path of stack are helped, and record searching route to include:
    Accessed node is pressed into the auxiliary stack successively according to access time, 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 being pressed into that existing element repeats in the node and stack of 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, discharge the auxiliary stack.
  6. 6. the determining method of path of message according to claim 5, it is characterised in that the stack of the current auxiliary stack of search 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.
  7. A kind of 7. path determining device of message, applied to intelligent substation, it is characterised 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 ports themselves, 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 is moved towards to constrain 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 State traversal and move towards the constraint matrix change soft adjacency matrix;
    Route searching logging modle, for since described node, hard adjacency matrix described in alternate search and more correct one's mistakes Soft adjacency matrix, until reaching the destination node, the screening process in path is described according to the dynamic generation of auxiliary stack with release, And record searching route.
  8. 8. the path determining device of message according to claim 7, it is characterised in that also include:
    Packet route generation module, for when detect it is described auxiliary stack stack top node be the destination node after, according to institute State and set out node to the message transmissions path of the destination node described in the searching route generation of auxiliary record stack.
  9. 9. the path determining device of message according to claim 8, it is characterised in that the traversal moves towards constraint generation mould Block is that each element in the soft adjacency matrix moves towards element progress and calculating corresponding in constraint matrix with the traversal, Module of the new matrix of generation as the soft adjacency matrix after change.
  10. 10. the path determining device of message according to claim 9, it is characterised in that the route searching logging modle Including:
    Kinematics generation module, for accessed node to be pressed into the auxiliary stack successively according to access time, 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 when being pressed into that existing element repeats in the node and stack of stack top, or during without node stacking, release should Stack;When the stack top node is the destination node, the auxiliary stack element is traveled through, the node that set out described in record is to the mesh Node searching route, discharge the auxiliary stack.
CN201710612150.1A 2017-07-25 2017-07-25 The determining method of path and device of a kind of message Active CN107404437B (en)

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 true CN107404437A (en) 2017-11-28
CN107404437B 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)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111552288A (en) * 2020-04-28 2020-08-18 西南交通大学 Mobile robot path smoothing method

Citations (4)

* Cited by examiner, † Cited by third party
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
CN104601473A (en) * 2014-12-29 2015-05-06 广东顺德中山大学卡内基梅隆大学国际联合研究院 Route generating method and system for multi-target path with restriction
CN106533777A (en) * 2016-11-29 2017-03-22 广东工业大学 Intelligent transformer station information flow path determination method based on matrix ranks and system

Patent Citations (4)

* Cited by examiner, † Cited by third party
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
CN104601473A (en) * 2014-12-29 2015-05-06 广东顺德中山大学卡内基梅隆大学国际联合研究院 Route generating method and system for multi-target path with restriction
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)

* Cited by examiner, † Cited by third party
Title
何瑞文 等: "智能电网信息流的建模和静态计算方法研究", 《中国电机工程学报》 *
邹俊雄 等: "智能变电站通信网络虚拟局域网建模与优化配置方法", 《电力自动化设备》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111552288A (en) * 2020-04-28 2020-08-18 西南交通大学 Mobile robot path smoothing method

Also Published As

Publication number Publication date
CN107404437B (en) 2018-05-18

Similar Documents

Publication Publication Date Title
CN105677648B (en) A kind of Combo discovering method and system based on label propagation algorithm
CN105469143B (en) Network-on-chip method for mapping resource based on neural network dynamic feature
CN103444149A (en) Network topology discovery
CN103500168B (en) A kind of overlap complex network community discovery method and system based on Topology Potential
CN105915407A (en) Flow generator virtualization realization system and flow generator virtualization realization method based on SDN
CN107101645A (en) A kind of paths planning method and path planning apparatus
CN103942345B (en) Method for automatically generating IED network graph
CN107404437B (en) The determining method of path and device of a kind of message
CN105871621A (en) Probe deployment method based on improved greedy strategy
CN104363612B (en) Piecemeal wireless sensor network restorative procedure based on mobile relay scheduling
CN105264833B (en) A kind of service path calculation method and device
CN105786618B (en) The method and apparatus of message are routed in accelerator network
CN107104824A (en) A kind of network topology determines method and apparatus
Flocchini et al. Mapping an unfriendly subway system
CN106101262A (en) A kind of Direct Connect Architecture computing cluster system based on Ethernet and construction method
CN105763457B (en) Multicast message processing method and the network equipment
CN105704067B (en) Switch
CN103298053B (en) Based on the nerve of a covering Relay system of selection of the largest connected degree of multi-source AS
CN106092109A (en) The road of the efficient pathfinding of a kind of electronic chart connects logically method and application
CN104852849B (en) A kind of OSPF configuration methods and relevant apparatus
CN102638368B (en) Network optimizing method and network optimizing device
CN105391590A (en) Method and system for automatically obtaining system routing table of NUMA
CN105956937A (en) Data center solving method for small interference stability analysis of electric power system
CN107294746A (en) A kind of method and apparatus of deployment business
CN110086819A (en) Attack source tracing method based on FRIT

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