CN108932565A - A kind of method for searching and system based on network management - Google Patents
A kind of method for searching and system based on network management Download PDFInfo
- Publication number
- CN108932565A CN108932565A CN201810732963.9A CN201810732963A CN108932565A CN 108932565 A CN108932565 A CN 108932565A CN 201810732963 A CN201810732963 A CN 201810732963A CN 108932565 A CN108932565 A CN 108932565A
- Authority
- CN
- China
- Prior art keywords
- path
- node
- alternative
- deflection
- network management
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of method for searching and system based on network management, is related to communication transmission technology field, method includes the following steps: S1, according to starting point and terminal, choose shortest path and be denoted as the first deflection path P [1]；S2, the alternative path for calculating P [1]: first deflection path P [1] interior joint is chosen as deviation point, calculate the necessary path Ri and residual paths Si of i-th of node on P [1], i is positive integer, and the length -1 of 1≤i≤P [1], Ri is added with Si, obtains the alternative path of i-th of node on P [1]；S3, shortest path in the alternative path of all nodes is selected on P [1], is denoted as the second deflection path P [2], the alternative path of P [2] is calculated according to S2；S4, from P [1], P [2] in the alternative path of all nodes select preset quantity path.The present invention traverses multiple nodes on the basis of shortest path, obtains multiple and different paths between origin-to-destination, selects appropriate number of path according to demand.
Description
Technical field
The present invention relates to communication transmission technology fields, and in particular to a kind of method for searching and system based on network management.
Background technique
With the fast development of telecommunication service, the scale of transmission network constantly expands, and network topological diagram also becomes increasingly complex, because
The requirement of this pathfinding quick for network management is also just higher and higher, to be satisfied with optimal path needed for user；
In practical applications, according to the demand of different user, institute's pathfinding diameter is also different, such as, it is sometimes necessary to it removes
It needs to know outside shortest path, it is also necessary to which that is, it is to be understood that a plurality of shortest path, and its length is discharged in secondary shortest path or third shortest path
Increased sequence is spent, or in a communication network, sometimes certain line interruption, then needs to look for the scheme of a substitution；
Therefore need to find several shortest paths in case of need, but existing pathfinding mode is mostly that searching one is shortest
Path can not adapt to the user demand of multiplicity.
Summary of the invention
In view of the deficiencies in the prior art, the purpose of the present invention is to provide a kind of method for searching based on network management and
System, on the basis of shortest path, by traversing multiple nodes, thus path multiple and different between obtaining origin-to-destination, and
Appropriate number of path is selected according to demand, meets the pathfinding demand of multiplicity.
To achieve the above objectives, the technical solution adopted by the present invention is that:
A kind of method for searching based on network management, the described method comprises the following steps:
S1, according to starting point and terminal, choose shortest path and be denoted as the first deflection path P [1]；
S2, the alternative path for calculating the first deflection path P [1]: the necessary path Ri of i-th node and surplus is calculated on P [1]
Remaining path Si, i are positive integer, and the length -1 of 1≤i≤P [1], and Ri is added with Si, obtain on P [1] the standby of i-th of node
Routing diameter；
S3, shortest path in the alternative path of all nodes is selected on P [1], is denoted as the second deflection path P [2], according to
Step S2 calculates the alternative path of P [2]；
S4, from P [1], P [2] in the alternative path of all nodes select preset quantity path.
Based on the above technical solution, the necessary path Ri of i-th of node is in the first deflection path P [1]
Path on first deflection path P [1] between the starting point and i-th of node of the first deflection path P [1].
Based on the above technical solution, in step S2, the process of the residual paths Si of i-th of node on P [1] is calculated
Are as follows: the shortest path that will be obtained in the path of i-th of node to P [1] terminal around row's towpath diameter, as i-th of section on P [1]
The residual paths Si of point.
Based on the above technical solution, row's towpath diameter be P [1] between i-th of node and i+1 node
Path.
Based on the above technical solution, the in-degree of i-th of node is greater than 1 on the P [1].
A kind of Pathfinding system based on network management, the system comprises:
First deflection path acquiring unit is used for according to starting point and terminal, and the shortest path of path selection is denoted as
One deflection path P [1]；
First alternative path computing unit is used to calculate the alternative path of the first deflection path P [1]: calculating P [1]
The necessary path Ri and residual paths Si, i of i-th node are positive integer, and the length -1 of 1≤i≤P [1], by Ri and Si phase
Add, obtains the alternative path of i-th of node on P [1]；
Second alternative path computing unit, is used for: shortest path in the alternative path of all nodes is selected on P [1],
It is denoted as the second deflection path P [2], according to the calculation of the first alternative path computing unit, calculates the alternative path of P [2]；
Path selection unit is used for: from the road for selecting preset quantity on P [1], P [2] in the alternative path of all nodes
Diameter.
Based on the above technical solution, the necessary path Ri of i-th of node is in the first deflection path P [1]
Path on first deflection path P [1] between the starting point and i-th of node of the first deflection path P [1].
Based on the above technical solution, the first alternative path computing unit calculates on P [1] i-th of node
The process of residual paths Si are as follows: the shortest path that will be obtained in the path of i-th of node to P [1] terminal around row's towpath diameter is made
For the residual paths Si of i-th of node on P [1].
Based on the above technical solution, row's towpath diameter be P [1] between i-th of node and i+1 node
Path.
Based on the above technical solution, the in-degree of i-th of node is greater than 1 on the P [1].
Compared with the prior art, the advantages of the present invention are as follows:
(1) present invention is on the basis of shortest path, by traversing multiple deviation points, thus multiple between obtaining origin-to-destination
Different paths, and appropriate number of path is selected according to demand, meet the pathfinding demand of multiplicity.
(2) present invention excludes row's towpath diameter, when carrying out pathfinding, no longer by stretch representated by row's towpath diameter
Diameter is included in pathfinding calculating, to obtain the path different from deflection path P [1].
(3) present invention collects quantity and the matched pre-selection path of preset path number in each alternative path Bi, can cross guarantee
The difference of Path selection result provides accurate data foundation for subsequent screening operation.
Detailed description of the invention
The step of Fig. 1 is the method for searching in the embodiment of the present invention 1 based on network management is schemed.
Specific embodiment
The embodiment of the present invention is described in further detail below in conjunction with attached drawing.
Embodiment 1
Shown in Figure 1, the embodiment of the present invention 1 provides a kind of method for searching based on network management, and this method includes following step
It is rapid:
S1, according to starting point and terminal, choose shortest path and be denoted as the first deflection path P [1]；
S2, the alternative path for calculating the first deflection path P [1]: the first deflection path P [1] interior joint is chosen as deviation
Point, calculating the necessary path Ri of i-th node and residual paths Si, i on P [1] is positive integer, and the length-of 1≤i≤P [1]
1, Ri is added with Si, obtains the alternative path of i-th of node on P [1]；
S3, shortest path in the alternative path of all nodes is selected on P [1], is denoted as the second deflection path P [2], according to
Step S2 calculates the alternative path of P [2]；
S4, from P [1], P [2] in the alternative path of all nodes select preset quantity path；
In the embodiment of the present invention, formulates the starting point and terminal in path as needed first, pass through existing general routes
Planing method or path finding method, the shortest path of path selection, and using the path as the first deflection path of deflection path P
[1], as the initial baseline of subsequent step, for the subsequent step foundation that mentions that for processing；
And then the first deflection path P [1] interior joint is chosen as deviation point, seek on offset path, calculates P [1]
Ri and Si is combined the alternative path Bi for obtaining each deviation point by the necessary path Ri and residual paths Si of upper i-th of node,
The calculation formula of Bi is Bi=Ri+Si；
And then shortest path in the alternative path of all nodes is selected on P [1] again, it is denoted as the second deflection path P [2],
The alternative path of P [2] is calculated according to step S2, to obtain more alternative paths, is finally owned from from P [1], P [2]
The path of preset quantity is selected in the alternative path of node.
The present invention is on the basis of shortest path, by traversing multiple nodes, thus multiple and different between obtaining origin-to-destination
Path, and select appropriate number of path according to demand, meet the pathfinding demand of multiplicity.
It should be noted that when necessary, the node of selection, i.e. deviation point can be current the first deflection path of deflection path
In-degree in P [1] since first node is greater than 1 node；
Wherein, in-degree is one of concept important in graph-theoretical algorithm, is often referred to end of certain point as side in figure in digraph
The sum of the number of point.
It should be noted that i is positive integer, and the length -1 of 1≤i≤P [1].
In the embodiment of the present invention, a kind of implementation this method is enumerated to complete the pseudocode of pathfinding:
Embodiment 2
The embodiment of the present invention 2 provides a kind of method for searching based on network management, method includes the following steps:
S1, according to starting point and terminal, choose shortest path and be denoted as the first deflection path P [1]；
S2, the alternative path for calculating the first deflection path P [1]: the first deflection path P [1] interior joint is chosen as deviation
Point, calculating the necessary path Ri of i-th node and residual paths Si, i on P [1] is positive integer, and the length-of 1≤i≤P [1]
1, Ri is added with Si, obtains the alternative path of i-th of node on P [1]；
S3, shortest path in the alternative path of all nodes is selected on P [1], is denoted as the second deflection path P [2], according to
Step S2 calculates the alternative path of P [2]；
S4, from P [1], P [2] in the alternative path of all nodes select preset quantity path.
The present invention is on the basis of shortest path, by traversing multiple nodes, thus multiple and different between obtaining origin-to-destination
Path, and select appropriate number of path according to demand, meet the pathfinding demand of multiplicity.
In the embodiment of the present invention, the necessary path Ri of i-th of node is the first deviation in the first deflection path P [1]
Path in path P [1] between the starting point and i-th of node of the first deflection path P [1]；
Likewise, the necessary path Ri of i-th of node is the second deflection path P [2] in the second deflection path P [2]
Path between the starting point and i-th of node of upper second deflection path P [2]；
Node i.e. deviation point is subject to, by the path between starting point and deviation point according to the first deflection path of deflection path P
[1] or the path of the second deflection path P [2] is planned, and deviation point is to the path between terminal, then is selected, thus
It is subsequent each deviation point is calculated when obtain the paths of different path lengths.
It should be noted that in step S3, selecting on P [1] shortest path in the alternative path of all nodes, it is denoted as
Two deflection path P [2] calculate the alternative path of P [2] according to step S2, wherein calculating the alternative path of P [2] according to step S2
Operation it is as follows:
It calculates the alternative path of the second deflection path P [2]: choosing the second deflection path P [2] interior joint as deviation point,
The necessary path Rn and residual paths Sn, n for calculating on the second deflection path P [2] n-th of node are positive integer, and 1≤n≤P
Rn is added by length -1 [2] with Sn, obtains the alternative path of n-th of node on P [2].
Embodiment 3
The embodiment of the present invention provides a kind of method for searching based on network management, method includes the following steps:
S1, according to starting point and terminal, choose shortest path and be denoted as the first deflection path P [1]；
S2, the alternative path for calculating the first deflection path P [1]: the first deflection path P [1] interior joint is chosen as deviation
Point, calculating the necessary path Ri of i-th node and residual paths Si, i on P [1] is positive integer, and the length-of 1≤i≤P [1]
1, Ri is added with Si, obtains the alternative path of i-th of node on P [1]；
S3, shortest path in the alternative path of all nodes is selected on P [1], is denoted as the second deflection path P [2], according to
Step S2 calculates the alternative path of P [2]；
S4, from P [1], P [2] in the alternative path of all nodes select preset quantity path.
The present invention is on the basis of shortest path, by traversing multiple nodes, thus multiple and different between obtaining origin-to-destination
Path, and select appropriate number of path according to demand, meet the pathfinding demand of multiplicity.
In the embodiment of the present invention, in step S2, the process of the residual paths Si of i-th of node on P [1] is calculated are as follows: by i-th
The shortest path that a node is obtained into the path of P [1] terminal around row's towpath diameter, the residue as i-th of node on P [1]
Path Si；
To be excluded to row's towpath diameter, when carrying out pathfinding, no longer stretch diameter representated by row's towpath diameter is arranged
Enter in pathfinding calculating, to obtain and different paths.
Embodiment 4
The embodiment of the present invention provides a kind of method for searching based on network management, method includes the following steps:
S1, according to starting point and terminal, choose shortest path and be denoted as the first deflection path P [1]；
S2, the alternative path for calculating the first deflection path P [1]: the first deflection path P [1] interior joint is chosen as deviation
Point, calculating the necessary path Ri of i-th node and residual paths Si, i on P [1] is positive integer, and the length-of 1≤i≤P [1]
1, Ri is added with Si, obtains the alternative path of i-th of node on P [1]；
S3, shortest path in the alternative path of all nodes is selected on P [1], is denoted as the second deflection path P [2], according to
Step S2 calculates the alternative path of P [2]；
S4, from P [1], P [2] in the alternative path of all nodes select preset quantity path.
The present invention is on the basis of shortest path, by traversing multiple nodes, thus multiple and different between obtaining origin-to-destination
Path, and select appropriate number of path according to demand, meet the pathfinding demand of multiplicity.
In the embodiment of the present invention, in step S2, the process of the residual paths Si of i-th of node on P [1] is calculated are as follows: by i-th
The shortest path that a node is obtained into the path of P [1] terminal around row's towpath diameter, the residue as i-th of node on P [1]
Path Si；
And row's towpath diameter is the path on P [1] between i-th of node and i+1 node；
Residual paths Si is used as after towpath diameter is arranged in removal, the shortest path found between deviation point and terminal, with
Just after calculating each deviation point, multiple alternative path Bi are obtained, to finally obtain the alternative path of each deviation point
Bi, and then collect quantity and the matched pre-selection path of preset path number in each alternative path Bi in each alternative path Bi again,
The difference for guaranteeing Path selection result can be crossed, provides accurate data foundation for subsequent screening operation.
Embodiment 5
The embodiment of the present invention provides a kind of Pathfinding system based on network management, which includes:
First deflection path acquiring unit is used for according to starting point and terminal, and the shortest path of path selection is denoted as
One deflection path P [1]；
First alternative path computing unit is used to calculate the alternative path of the first deflection path P [1]: calculating P [1]
The necessary path Ri and residual paths Si, i of i-th node are positive integer, and the length -1 of 1≤i≤P [1], by Ri and Si phase
Add, obtains the alternative path of i-th of node on P [1]；
Second alternative path computing unit, is used for: shortest path in the alternative path of all nodes is selected on P [1],
It is denoted as the second deflection path P [2], according to the calculation of the first alternative path computing unit, calculates the alternative path of P [2]；
Path selection unit is used for: from the road for selecting preset quantity on P [1], P [2] in the alternative path of all nodes
Diameter.
In the embodiment of the present invention, formulates the starting point and terminal in path as needed first, pass through existing general routes
Planing method or path finding method, the shortest path of path selection, and using the path as the first deflection path of deflection path P
[1], as the initial baseline of subsequent step, for the subsequent step foundation that mentions that for processing；
And then the first deflection path P [1] interior joint is chosen as deviation point, seek on offset path, calculates P [1]
Ri and Si is combined the alternative path Bi for obtaining each deviation point by the necessary path Ri and residual paths Si of upper i-th of node,
The calculation formula of Bi is Bi=Ri+Si；
And then shortest path in the alternative path of all nodes is selected on P [1] again, it is denoted as the second deflection path P [2],
The alternative path of P [2] is calculated according to step S2, to obtain more alternative paths, is finally owned from from P [1], P [2]
The path of preset quantity is selected in the alternative path of node.
The present invention is on the basis of shortest path, by traversing multiple nodes, thus multiple and different between obtaining origin-to-destination
Path, and select appropriate number of path according to demand, meet the pathfinding demand of multiplicity.
It should be noted that when necessary, the node of selection, i.e. deviation point can be current the first deflection path of deflection path
In-degree in P [1] since first node is greater than 1 node；
Wherein, in-degree is one of concept important in graph-theoretical algorithm, is often referred to end of certain point as side in figure in digraph
The sum of the number of point.
It should be noted that i is positive integer, and the length -1 of 1≤i≤P [1].
It should be noted that in step S3, selecting on P [1] shortest path in the alternative path of all nodes, it is denoted as
Two deflection path P [2] calculate the alternative path of P [2] according to step S2, wherein calculating the alternative path of P [2] according to step S2
Operation it is as follows:
It calculates the alternative path of the second deflection path P [2]: choosing the second deflection path P [2] interior joint as deviation point,
The necessary path Rn and residual paths Sn, n for calculating on the second deflection path P [2] n-th of node are positive integer, and 1≤n≤P
Rn is added by length -1 [2] with Sn, obtains the alternative path of n-th of node on P [2].
Embodiment 6
The embodiment of the present invention provides a kind of Pathfinding system based on network management, which includes:
First deflection path acquiring unit is used for according to starting point and terminal, and the shortest path of path selection is denoted as
One deflection path P [1]；
First alternative path computing unit is used to calculate the alternative path of the first deflection path P [1]: calculating P [1]
The necessary path Ri and residual paths Si, i of i-th node are positive integer, and the length -1 of 1≤i≤P [1], by Ri and Si phase
Add, obtains the alternative path of i-th of node on P [1]；
Second alternative path computing unit, is used for: shortest path in the alternative path of all nodes is selected on P [1],
It is denoted as the second deflection path P [2], according to the calculation of the first alternative path computing unit, calculates the alternative path of P [2]；
Path selection unit is used for: from the road for selecting preset quantity on P [1], P [2] in the alternative path of all nodes
Diameter.
The present invention is on the basis of shortest path, by traversing multiple nodes, thus multiple and different between obtaining origin-to-destination
Path, and select appropriate number of path according to demand, meet the pathfinding demand of multiplicity.
In the embodiment of the present invention, the necessary path Ri of i-th of node is the first deviation in the first deflection path P [1]
Path in path P [1] between the starting point and i-th of node of the first deflection path P [1]；
Node i.e. deviation point is subject to, by the path between starting point and deviation point according to the first deflection path of deflection path P
[1] or the path of the second deflection path P [2] is planned, and deviation point is to the path between terminal, then is selected, thus
It is subsequent each deviation point is calculated when obtain the paths of different path lengths.
Embodiment 7
The embodiment of the present invention provides a kind of Pathfinding system based on network management, which includes:
First deflection path acquiring unit is used for according to starting point and terminal, and the shortest path of path selection is denoted as
One deflection path P [1]；
First alternative path computing unit is used to calculate the alternative path of the first deflection path P [1]: calculating P [1]
The necessary path Ri and residual paths Si, i of i-th node are positive integer, and the length -1 of 1≤i≤P [1], by Ri and Si phase
Add, obtains the alternative path of i-th of node on P [1]；
Second alternative path computing unit, is used for: shortest path in the alternative path of all nodes is selected on P [1],
It is denoted as the second deflection path P [2], according to the calculation of the first alternative path computing unit, calculates the alternative path of P [2]；
Path selection unit is used for: from the road for selecting preset quantity on P [1], P [2] in the alternative path of all nodes
Diameter.
The present invention is on the basis of shortest path, by traversing multiple nodes, thus multiple and different between obtaining origin-to-destination
Path, and select appropriate number of path according to demand, meet the pathfinding demand of multiplicity.
In the embodiment of the present invention, in step S2, the process of the residual paths Si of i-th of node on P [1] is calculated are as follows: by i-th
The shortest path that a node is obtained into the path of P [1] terminal around row's towpath diameter, the residue as i-th of node on P [1]
Path Si；
To be excluded to row's towpath diameter, when carrying out pathfinding, no longer stretch diameter representated by row's towpath diameter is arranged
Enter in pathfinding calculating, to obtain and different paths.
Embodiment 8
The embodiment of the present invention provides a kind of Pathfinding system based on network management, which includes:
First deflection path acquiring unit is used for according to starting point and terminal, and the shortest path of path selection is denoted as
One deflection path P [1]；
First alternative path computing unit is used to calculate the alternative path of the first deflection path P [1]: calculating P [1]
The necessary path Ri and residual paths Si, i of i-th node are positive integer, and the length -1 of 1≤i≤P [1], by Ri and Si phase
Add, obtains the alternative path of i-th of node on P [1]；
Second alternative path computing unit, is used for: shortest path in the alternative path of all nodes is selected on P [1],
It is denoted as the second deflection path P [2], according to the calculation of the first alternative path computing unit, calculates the alternative path of P [2]；
Path selection unit is used for: from the road for selecting preset quantity on P [1], P [2] in the alternative path of all nodes
Diameter.
The present invention is on the basis of shortest path, by traversing multiple nodes, thus multiple and different between obtaining origin-to-destination
Path, and select appropriate number of path according to demand, meet the pathfinding demand of multiplicity.
In the embodiment of the present invention, in step S2, the process of the residual paths Si of i-th of node on P [1] is calculated are as follows: by i-th
The shortest path that a node is obtained into the path of P [1] terminal around row's towpath diameter, the residue as i-th of node on P [1]
Path Si；
And row's towpath diameter is the path on P [1] between i-th of node and i+1 node；
Residual paths Si is used as after towpath diameter is arranged in removal, the shortest path found between deviation point and terminal, with
Just after calculating each deviation point, multiple alternative path Bi are obtained, to finally obtain the alternative path of each deviation point
Bi, and then collect quantity and the matched pre-selection path of preset path number in each alternative path Bi in each alternative path Bi again,
The difference for guaranteeing Path selection result can be crossed, provides accurate data foundation for subsequent screening operation.The present invention is not only limited to
Above-mentioned preferred forms, anyone can obtain other various forms of products under the inspiration of the present invention, however, at it
Make any variation in shape or structure, it is all that there is the identical or similar technical solution with the present invention, in its protection scope
Within.
Claims (10)
1. a kind of method for searching based on network management, which comprises the following steps:
S1, according to starting point and terminal, choose shortest path and be denoted as the first deflection path P [1]；
S2, the alternative path for calculating the first deflection path P [1]: the necessary path Ri of i-th node and remaining road on P [1] are calculated
Diameter Si, i are positive integer, and the length -1 of 1≤i≤P [1], and Ri is added with Si, obtains the alternative road of i-th of node on P [1]
Diameter；
S3, shortest path in the alternative path of all nodes is selected on P [1], the second deflection path P [2] is denoted as, according to step
S2 calculates the alternative path of P [2]；
S4, from P [1], P [2] in the alternative path of all nodes select preset quantity path.
2. as described in claim 1 based on the method for searching of network management, it is characterised in that: in the first deflection path P [1]
Between starting point and i-th of node of the necessary path Ri of i node for the first deflection path P [1] on the first deflection path P [1]
Path.
3. as described in claim 1 based on the method for searching of network management, which is characterized in that in step S2, calculate on P [1] i-th
The process of the residual paths Si of node are as follows: will be obtained in the path of i-th of node to P [1] terminal around row's towpath diameter most short
Path, the residual paths Si as i-th of node on P [1].
4. as claimed in claim 3 based on the method for searching of network management, it is characterised in that: row's towpath diameter is i-th on P [1]
Path between a node and i+1 node.
5. as described in claim 1 based on the method for searching of network management, it is characterised in that: i-th node enters on the P [1]
Degree is greater than 1.
6. a kind of Pathfinding system based on network management, which is characterized in that the system comprises:
First deflection path acquiring unit is used for according to starting point and terminal, and the shortest path of path selection is denoted as first partially
From path P [1]；
First alternative path computing unit is used to calculate the alternative path of the first deflection path P [1]: calculating on P [1] i-th
The necessary path Ri and residual paths Si, i of node are positive integer, and the length -1 of 1≤i≤P [1], and Ri is added with Si, is obtained
The alternative path of i-th of node on P [1]；
Second alternative path computing unit, is used for: selecting on P [1] shortest path in the alternative path of all nodes, is denoted as
Second deflection path P [2] calculates the alternative path of P [2] according to the calculation of the first alternative path computing unit；
Path selection unit is used for: from the path for selecting preset quantity on P [1], P [2] in the alternative path of all nodes.
7. as claimed in claim 6 based on the Pathfinding system of network management, it is characterised in that: in the first deflection path P [1]
Between starting point and i-th of node of the necessary path Ri of i node for the first deflection path P [1] on the first deflection path P [1]
Path.
8. as claimed in claim 6 based on the Pathfinding system of network management, it is characterised in that: the first alternative path computing unit
Calculate the process of the residual paths Si of i-th of node on P [1] are as follows: will be fine around row in the path of i-th of node to P [1] terminal
The shortest path that path obtains, the residual paths Si as i-th of node on P [1].
9. as claimed in claim 8 based on the Pathfinding system of network management, it is characterised in that: row's towpath diameter is i-th on P [1]
Path between a node and i+1 node.
10. as claimed in claim 6 based on the Pathfinding system of network management, it is characterised in that: i-th node enters on the P [1]
Degree is greater than 1.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810732963.9A CN108932565A (en) | 2018-07-05 | 2018-07-05 | A kind of method for searching and system based on network management |
| PCT/CN2019/096111 WO2020007373A1 (en) | 2018-07-05 | 2019-07-16 | Path finding method and system based on network management |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810732963.9A CN108932565A (en) | 2018-07-05 | 2018-07-05 | A kind of method for searching and system based on network management |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108932565A true CN108932565A (en) | 2018-12-04 |
Family
ID=64447395
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810732963.9A Pending CN108932565A (en) | 2018-07-05 | 2018-07-05 | A kind of method for searching and system based on network management |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108932565A (en) |
| WO (1) | WO2020007373A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020007373A1 (en) * | 2018-07-05 | 2020-01-09 | 烽火通信科技股份有限公司 | Path finding method and system based on network management |
| CN111060127A (en) * | 2019-12-31 | 2020-04-24 | 深圳一清创新科技有限公司 | Vehicle starting point positioning method and device, computer equipment and storage medium |
| CN111813883A (en) * | 2020-06-23 | 2020-10-23 | 上海阿尔卡特网络支援***有限公司 | Shortest path query method and query system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101072241A (en) * | 2006-05-11 | 2007-11-14 | 华为技术有限公司 | Method and device for improving shortest path bridge reliability |
| CN101753425A (en) * | 2008-12-01 | 2010-06-23 | 北京航空航天大学 | Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints |
| US20120127875A1 (en) * | 2009-08-06 | 2012-05-24 | Zte Corporation | Method and device for calculating k-shortest paths |
| CN107959633A (en) * | 2017-11-18 | 2018-04-24 | 浙江工商大学 | A kind of load balance method based on price mechanism in industry real-time network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108932565A (en) * | 2018-07-05 | 2018-12-04 | 烽火通信科技股份有限公司 | A kind of method for searching and system based on network management |
-
2018
- 2018-07-05 CN CN201810732963.9A patent/CN108932565A/en active Pending
-
2019
- 2019-07-16 WO PCT/CN2019/096111 patent/WO2020007373A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101072241A (en) * | 2006-05-11 | 2007-11-14 | 华为技术有限公司 | Method and device for improving shortest path bridge reliability |
| CN101753425A (en) * | 2008-12-01 | 2010-06-23 | 北京航空航天大学 | Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints |
| US20120127875A1 (en) * | 2009-08-06 | 2012-05-24 | Zte Corporation | Method and device for calculating k-shortest paths |
| CN107959633A (en) * | 2017-11-18 | 2018-04-24 | 浙江工商大学 | A kind of load balance method based on price mechanism in industry real-time network |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020007373A1 (en) * | 2018-07-05 | 2020-01-09 | 烽火通信科技股份有限公司 | Path finding method and system based on network management |
| CN111060127A (en) * | 2019-12-31 | 2020-04-24 | 深圳一清创新科技有限公司 | Vehicle starting point positioning method and device, computer equipment and storage medium |
| CN111813883A (en) * | 2020-06-23 | 2020-10-23 | 上海阿尔卡特网络支援***有限公司 | Shortest path query method and query system |
| CN111813883B (en) * | 2020-06-23 | 2024-05-28 | 上海阿尔卡特网络支援***有限公司 | Shortest path query method and query system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020007373A1 (en) | 2020-01-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108932565A (en) | A kind of method for searching and system based on network management | |
| CN100592712C (en) | Method for setting link attribute, method for calculating route and system employing them | |
| US7072304B2 (en) | Network path selection based on bandwidth | |
| WO2017045578A1 (en) | Topological graph optimal path algorithm with constraint conditions | |
| US20140140216A1 (en) | Network system and routing method | |
| CN103379032A (en) | Acquisition method and device for cross-domain end-to-end route and secondary route computation element | |
| CN108111411B (en) | Backbone network and dynamic path planning system and planning method thereof | |
| WO2015161872A1 (en) | Network tomography through selection of probing paths | |
| EP3425861A1 (en) | Improved routing in an heterogeneous iot network | |
| US9674083B2 (en) | Path calculation order deciding method, program and calculating apparatus | |
| CN110794263B (en) | Method for positioning fault section of power distribution network line with distributed power supply | |
| EP1986378B1 (en) | Quality-degraded portion estimating device, quality-degraded portion estimating method, and quality-degraded portion estimating program | |
| CN109889446A (en) | Isomery converged network minimal time delay determining method of path based on SDN | |
| CN105207905B (en) | Route selection method and device | |
| CN107453997B (en) | Double-cost-based routing optimization method | |
| US6999423B2 (en) | Link order replacement optimization | |
| Dzida et al. | Optimization of the shortest-path routing with equal-cost multi-path load balancing | |
| EP2538622B1 (en) | Network delay estimation apparatus and network delay estimation method | |
| Alabbad et al. | Localised credit based QoS routing | |
| US8649295B2 (en) | Course searching method and node device | |
| Liu et al. | Virtual-force-based geometric routing protocol in MANETs | |
| CN113794600B (en) | Method and device for searching transmission circuit route | |
| CN107453816B (en) | The networking optimization method and device of looped network | |
| Ghosh et al. | A probabilistic scheme for hierarchical qos routing | |
| JP2014175820A (en) | Network design apparatus and network design program |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181204 |