WO2020007373A1 - 一种基于网管的寻路方法及系统 - Google Patents

一种基于网管的寻路方法及系统 Download PDF

Info

Publication number
WO2020007373A1
WO2020007373A1 PCT/CN2019/096111 CN2019096111W WO2020007373A1 WO 2020007373 A1 WO2020007373 A1 WO 2020007373A1 CN 2019096111 W CN2019096111 W CN 2019096111W WO 2020007373 A1 WO2020007373 A1 WO 2020007373A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
node
deviation
paths
alternative
Prior art date
Application number
PCT/CN2019/096111
Other languages
English (en)
French (fr)
Inventor
刘显维
Original Assignee
烽火通信科技股份有限公司
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 烽火通信科技股份有限公司 filed Critical 烽火通信科技股份有限公司
Publication of WO2020007373A1 publication Critical patent/WO2020007373A1/zh

Links

Images

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

Definitions

  • the present invention relates to the technical field of communication transmission, and in particular to a method and system for path finding based on network management.
  • the path sought is different according to the needs of different users.
  • the shortest path or the third shortest path is required, that is, multiple shortest paths must be known, and
  • a line is interrupted, you need to find an alternative solution;
  • the object of the present invention is to provide a path finding method and system based on the network management. Based on the shortest path, it traverses multiple nodes to obtain multiple different paths from the start point to the end point. And select the appropriate number of paths according to the needs to meet a variety of pathfinding needs.
  • a network management-based path finding method includes the following steps:
  • the shortest path is selected as the first deviation path P [1];
  • the required path Ri of the i-th node in the first deviation path P [1] is the starting point and the first of the first deviation path P [1] on the first deviation path P [1].
  • step S2 the process of calculating the remaining path Si of the i-th node on P [1] is as follows: the path from the i-th node to the end point of P [1] is bypassed to obtain the fiber path Is the shortest path Si of the i-th node on P [1].
  • the fiber routing path is a path between the i-th node and the i + 1-th node on P [1].
  • the ingress of the i-th node on P [1] is greater than 1.
  • a network management-based pathfinding system includes:
  • a first deviation path obtaining unit configured to select a path with the shortest path according to the start point and the end point as the first deviation path P [1];
  • a first alternative path calculation unit configured to calculate an alternative path of the first deviation path P [1]: calculating a necessary path Ri and a remaining path Si of an i-th node on P [1], where i is a positive integer, And 1 ⁇ i ⁇ P [1] 's length -1, add Ri and Si to get the candidate path of the i-th node on P [1];
  • the second alternative path calculation unit is configured to select the shortest path among the alternative paths of all nodes on P [1], and record it as the second deviation path P [2]. Calculation method, calculating the alternative path of P [2];
  • a path selection unit is configured to select a preset number of paths from candidate paths of all nodes on P [1] and P [2].
  • the required path Ri of the i-th node in the first deviation path P [1] is the starting point and the first of the first deviation path P [1] on the first deviation path P [1].
  • the process of calculating the remaining path Si of the i-th node on P [1] by the first alternative path calculation unit is: winding the path from the i-th node to the end point of P [1] The shortest path obtained by the fiber routing path is taken as the remaining path Si of the i-th node on P [1].
  • the fiber routing path is a path between the i-th node and the i + 1-th node on P [1].
  • the ingress of the i-th node on P [1] is greater than 1.
  • the present invention takes the shortest path as a reference, and traverses a plurality of deviation points to obtain a plurality of different paths from a start point to an end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • the fiber routing path is excluded.
  • the path searching is performed, a path represented by the fiber routing path is no longer included in the path finding calculation, so as to obtain a path different from the deviation path P [1].
  • the present invention collects pre-selected paths whose number matches the preset path number in each candidate path Bi, which can ensure that the path selection results are different, and provide accurate data basis for subsequent screening work.
  • FIG. 1 is a step diagram of a network management-based path finding method in Embodiment 1 of the present invention.
  • Embodiment 1 of the present invention provides a network management-based path finding method.
  • the method includes the following steps:
  • the shortest path is selected as the first deviation path P [1];
  • a start point and an end point of a path are first established according to a need, and a path with a shortest path is selected through an existing common path planning method or path finding method, and the path is taken as the first deviation path P [1] , As an initial benchmark for subsequent steps, to provide a basis for processing in subsequent steps;
  • the node in the first deviation path P [1] is selected as the deviation point, and on the deviation path, the required path Ri and the remaining path Si of the i-th node on P [1] are calculated, and Ri and Si are combined to obtain
  • step S2 select the shortest path among the alternative paths of all nodes on P [1], record it as the second deviation path P [2], and calculate the alternative path of P [2] according to step S2, so as to obtain more backup.
  • the invention takes the shortest path as a reference, and traverses multiple nodes to obtain multiple different paths from the start point to the end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • the selected node that is, the departure point may be a node whose degree of entry from the first node in the first deviation path P [1] of the current deviation path is greater than 1;
  • the degree of entry is one of the important concepts in graph theory algorithms, and usually refers to the sum of the number of times a point in a directed graph is used as the end point of a graph edge.
  • i is a positive integer and the length -1 is 1 ⁇ i ⁇ P [1].
  • Embodiment 2 of the present invention provides a network management-based path finding method.
  • the method includes the following steps:
  • the shortest path is selected as the first deviation path P [1];
  • the invention takes the shortest path as a reference, and traverses multiple nodes to obtain multiple different paths from the start point to the end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • the required path Ri of the i-th node in the first deviation path P [1] is the starting point of the first deviation path P [1] and the i-th node on the first deviation path P [1].
  • the required path Ri of the i-th node in the second deviation path P [2] is between the starting point of the second deviation path P [2] on the second deviation path P [2] and the i-th node route of;
  • the path between the starting point and the deviation point is planned according to the path of the deviation path of the first deviation path P [1] or the second deviation path P [2].
  • the path is then selected to obtain paths with different path lengths when subsequent deviation points are calculated.
  • step S3 the shortest path among the candidate paths of all nodes on P [1] is selected as the second deviation path P [2], and the candidate path of P [2] is calculated according to step S2.
  • the operation of calculating the alternative path of P [2] according to step S2 is as follows:
  • An embodiment of the present invention provides a network management-based path finding method.
  • the method includes the following steps:
  • the shortest path is selected as the first deviation path P [1];
  • the invention takes the shortest path as a reference, and traverses multiple nodes to obtain multiple different paths from the start point to the end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • step S2 the process of calculating the remaining path Si of the i-th node on P [1] is as follows: the shortest path obtained by bypassing the fiber routing path in the path from the i-th node to the end of P [1] Path as the remaining path Si of the i-th node on P [1];
  • the fiber routing path is excluded, and a path represented by the fiber routing path is no longer included in the pathfinding calculation when performing the pathfinding in order to obtain a different path.
  • An embodiment of the present invention provides a network management-based path finding method.
  • the method includes the following steps:
  • the shortest path is selected as the first deviation path P [1];
  • the invention takes the shortest path as a reference, and traverses multiple nodes to obtain multiple different paths from the start point to the end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • step S2 the process of calculating the remaining path Si of the i-th node on P [1] is as follows: the shortest path obtained by bypassing the fiber routing path in the path from the i-th node to the end of P [1] Path as the remaining path Si of the i-th node on P [1];
  • the fiber routing path is a path between the i-th node and the i + 1-th node on P [1];
  • the remaining path Si is used as the shortest path between the deviation point and the end point after removing the fiber discharge path, so that after calculating each deviation point, multiple alternative paths Bi are obtained, so as to finally obtain the preparation for each deviation point.
  • Select the path Bi and then collect the number of preselected paths that match the preset number of paths in each candidate path Bi. This can ensure that the path selection results are different and provide accurate data basis for subsequent screening work. .
  • An embodiment of the present invention provides a network management-based pathfinding system, and the system includes:
  • a first deviation path obtaining unit configured to select a path with the shortest path according to the start point and the end point as the first deviation path P [1];
  • a first alternative path calculation unit configured to calculate an alternative path of the first deviation path P [1]: calculating a necessary path Ri and a remaining path Si of an i-th node on P [1], where i is a positive integer, And 1 ⁇ i ⁇ P [1] 's length -1, add Ri and Si to get the candidate path of the i-th node on P [1];
  • the second alternative path calculation unit is configured to select the shortest path among the alternative paths of all nodes on P [1], and record it as the second deviation path P [2]. Calculation method, calculating the alternative path of P [2];
  • a path selection unit is configured to select a preset number of paths from candidate paths of all nodes on P [1] and P [2].
  • a start point and an end point of a path are first established according to a need, and a path with a shortest path is selected through an existing common path planning method or path finding method, and the path is taken as the first deviation path P [1] , As an initial benchmark for subsequent steps, to provide a basis for processing in subsequent steps;
  • the node in the first deviation path P [1] is selected as the deviation point, and on the deviation path, the required path Ri and the remaining path Si of the i-th node on P [1] are calculated, and Ri and Si are combined to obtain
  • step S2 select the shortest path among the alternative paths of all nodes on P [1], record it as the second deviation path P [2], and calculate the alternative path of P [2] according to step S2, so as to obtain more backup.
  • the invention takes the shortest path as a reference, and traverses multiple nodes to obtain multiple different paths from the start point to the end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • the selected node that is, the departure point may be a node whose degree of entry from the first node in the first deviation path P [1] of the current deviation path is greater than 1;
  • the degree of entry is one of the important concepts in graph theory algorithms, and usually refers to the sum of the number of times a point in a directed graph is used as the end point of a graph edge.
  • i is a positive integer and the length -1 is 1 ⁇ i ⁇ P [1].
  • step S3 the shortest path among the candidate paths of all nodes on P [1] is selected as the second deviation path P [2], and the candidate path of P [2] is calculated according to step S2.
  • the operation of calculating the alternative path of P [2] according to step S2 is as follows:
  • An embodiment of the present invention provides a network management-based pathfinding system, and the system includes:
  • a first deviation path obtaining unit configured to select a path with the shortest path according to the start point and the end point as the first deviation path P [1];
  • a first alternative path calculation unit configured to calculate an alternative path of the first deviation path P [1]: calculating a necessary path Ri and a remaining path Si of an i-th node on P [1], where i is a positive integer, And 1 ⁇ i ⁇ P [1] 's length -1, add Ri and Si to get the candidate path of the i-th node on P [1];
  • the second alternative path calculation unit is configured to select the shortest path among the alternative paths of all nodes on P [1], and record it as the second deviation path P [2]. Calculation method, calculating the alternative path of P [2];
  • a path selection unit is configured to select a preset number of paths from candidate paths of all nodes on P [1] and P [2].
  • the invention takes the shortest path as a reference, and traverses multiple nodes to obtain multiple different paths from the start point to the end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • the required path Ri of the i-th node in the first deviation path P [1] is the starting point of the first deviation path P [1] and the i-th node on the first deviation path P [1].
  • the path between the starting point and the deviation point is planned according to the path of the deviation path of the first deviation path P [1] or the second deviation path P [2].
  • the path is then selected to obtain paths with different path lengths when subsequent deviation points are calculated.
  • An embodiment of the present invention provides a network management-based pathfinding system, and the system includes:
  • a first deviation path obtaining unit configured to select a path with the shortest path according to the start point and the end point as the first deviation path P [1];
  • a first alternative path calculation unit configured to calculate an alternative path of the first deviation path P [1]: calculating a necessary path Ri and a remaining path Si of an i-th node on P [1], where i is a positive integer, And 1 ⁇ i ⁇ P [1] 's length -1, add Ri and Si to get the candidate path of the i-th node on P [1];
  • the second alternative path calculation unit is configured to select the shortest path among the alternative paths of all nodes on P [1], and record it as the second deviation path P [2]. Calculation method, calculating the alternative path of P [2];
  • a path selection unit is configured to select a preset number of paths from candidate paths of all nodes on P [1] and P [2].
  • the invention takes the shortest path as a reference, and traverses multiple nodes to obtain multiple different paths from the start point to the end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • step S2 the process of calculating the remaining path Si of the i-th node on P [1] is as follows: the shortest path obtained by bypassing the fiber routing path in the path from the i-th node to the end point of P [1] Path as the remaining path Si of the i-th node on P [1];
  • the fiber routing path is excluded, and a path represented by the fiber routing path is no longer included in the pathfinding calculation when performing the pathfinding in order to obtain a different path.
  • An embodiment of the present invention provides a network management-based pathfinding system, and the system includes:
  • a first deviation path obtaining unit configured to select a path with the shortest path according to the start point and the end point as the first deviation path P [1];
  • a first alternative path calculation unit configured to calculate an alternative path of the first deviation path P [1]: calculating a necessary path Ri and a remaining path Si of an i-th node on P [1], where i is a positive integer, And 1 ⁇ i ⁇ P [1] 's length -1, add Ri and Si to get the candidate path of the i-th node on P [1];
  • the second alternative path calculation unit is configured to select the shortest path among the alternative paths of all nodes on P [1], and record it as the second deviation path P [2]. Calculation method, calculating the alternative path of P [2];
  • a path selection unit is configured to select a preset number of paths from candidate paths of all nodes on P [1] and P [2].
  • the present invention takes the shortest path as a reference, and traverses multiple nodes to obtain multiple different paths from the start point to the end point, and selects an appropriate number of paths according to requirements to meet various pathfinding needs.
  • step S2 the process of calculating the remaining path Si of the i-th node on P [1] is as follows: the shortest path obtained by bypassing the fiber routing path in the path from the i-th node to the end point of P [1] Path as the remaining path Si of the i-th node on P [1];
  • the fiber routing path is a path between the i-th node and the i + 1-th node on P [1];
  • the remaining path Si is used as the shortest path between the deviation point and the end point after removing the fiber discharge path, so that after calculating each deviation point, multiple alternative paths Bi are obtained, so as to finally obtain the preparation for each deviation point.
  • Select the path Bi and then collect the number of preselected paths that match the preset number of paths in each of the candidate paths Bi. This can ensure that the path selection results are different and provide accurate data basis for subsequent screening work. .
  • the present invention is not limited to the above-mentioned preferred embodiments.
  • anyone can obtain other various forms of products under the inspiration of the present invention, but regardless of any changes in its shape or structure, all of them have the same or similar Similar technical solutions are within the scope of protection.

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

本发明公开了一种基于网管的寻路方法及系统，涉及通信传输技术领域，该方法包括以下步骤：S1、根据起点及终点，选取最短的路径记作第一偏离路径P[1]；S2、计算P[1]的备选路径：选取第一偏离路径P[1]中节点作为偏离点，计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；S3、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照S2计算P[2]的备选路径；S4、从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。本发明以最短路径为基准，遍历多个节点，获取起点到终点间多个不同的路径，根据需求选择合适数量的路径。

Description

一种基于网管的寻路方法及系统 技术领域
本发明涉及通信传输技术领域，具体涉及一种基于网管的寻路方法及系统。
背景技术
随着电信业务的快速发展，传输网的规模不断扩大，网络拓扑图也越来越复杂，因此对于网管快速寻路的要求也就越来越高，以满足于用户所需最佳路径；
在实际应用中，根据不同用户的需求，所寻路径也有所不同，比如，有时候需要除了需要知道最短路径外，还需要次最短路或第三最短路，即要知道多条最短路，并排出其长度增加的顺序，或者在通信网络中，有时候某条线路中断，则需要找一个替代的方案；
因此需要寻找几条最短路以备不时之需，但现有的寻路方式多为寻找一条最短的路径，无法适应多样的用户需求。
发明内容
针对现有技术中存在的缺陷，本发明的目的在于提供一种基于网管的寻路方法及系统，以最短路径为基准，通过遍历多个节点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
为达到以上目的，本发明采取的技术方案是：
一种基于网管的寻路方法，所述方法包括以下步骤：
S1、根据起点以及终点，选取最短的路径记作第一偏离路径P[1]；
S2、计算第一偏离路径P[1]的备选路径：计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
S3、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径；
S4、从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
在上述技术方案的基础上，所述第一偏离路径P[1]中第i个节点的必经路径Ri为第一偏离路径P[1]上第一偏离路径P[1]的起点与第i个节点之间的路径。
在上述技术方案的基础上，步骤S2中，计算P[1]上第i个节点的剩余路径Si的过程为：将第i个节点到P[1]终点的路径中绕过排纤路径得到的最短路径，作为P[1]上第i个节点的剩余路径Si。
在上述技术方案的基础上，所述排纤路径为P[1]上第i个节点与第i+1个节点之间的路径。
在上述技术方案的基础上，所述P[1]上第i个节点的入度大于1。
一种基于网管的寻路系统，所述系统包括：
第一偏离路径获取单元，其用于根据起点以及终点，选取路径最短的路径记作第一偏离路径P[1]；
第一备选路径计算单元，其用于计算第一偏离路径P[1]的备选路径：计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
第二备选路径计算单元，其用于：选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照第一备选路径计算单 元的计算方式，计算P[2]的备选路径；
路径选择单元，其用于：从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
在上述技术方案的基础上，所述第一偏离路径P[1]中第i个节点的必经路径Ri为第一偏离路径P[1]上第一偏离路径P[1]的起点与第i个节点之间的路径。
在上述技术方案的基础上，所述第一备选路径计算单元计算P[1]上第i个节点的剩余路径Si的过程为：将第i个节点到P[1]终点的路径中绕过排纤路径得到的最短路径，作为P[1]上第i个节点的剩余路径Si。
在上述技术方案的基础上，所述排纤路径为P[1]上第i个节点与第i+1个节点之间的路径。
在上述技术方案的基础上，所述P[1]上第i个节点的入度大于1。
与现有技术相比，本发明的优点在于：
(1)本发明以最短路径为基准，通过遍历多个偏离点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
(2)本发明对排纤路径进行排除，在进行寻路时，不再将排纤路径所代表的一段路径列入寻路计算中，以便获取与偏离路径P[1]不同的路径。
(3)本发明在各备选路径Bi中收集数量与预设路径数匹配的预选路径，能过保证路径选择结果的不同，为后续筛选工作提供准确的数据依据。
附图说明
图1为本发明实施例1中基于网管的寻路方法的步骤图。
具体实施方式
以下结合附图对本发明的实施例作进一步详细说明。
实施例1
参见图1所示，本发明实施例1提供一种基于网管的寻路方法，该方法包括以下步骤：
S1、根据起点以及终点，选取最短的路径记作第一偏离路径P[1]；
S2、计算第一偏离路径P[1]的备选路径：选取第一偏离路径P[1]中节点作为偏离点，计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
S3、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径；
S4、从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径；
本发明实施例中，首先根据需要制定路径的起点以及终点，通过现有的常用路径规划方法或路径寻找方法，选取路径最短的路径，并将该路径作为偏离路径第一偏离路径P[1]，作为后续步骤的初始基准，为后续步骤提供处理的依据；
其次再选取第一偏离路径P[1]中节点作为偏离点，寻求在偏移路径上，计算P[1]上第i个节点的必经路径Ri以及剩余路径Si，将Ri以及Si结合获得各偏离点的备选路径Bi，Bi的计算公式为Bi＝Ri+Si；
进而再选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径，从而获得更多的备选路径，最终在从从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明以最短路径为基准，通过遍历多个节点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
需要说明的是，必要时，选取的节点，即偏离点可以是当前偏离路径第一偏离路径P[1]中从第一个节点开始的入度大于1的节点；
其中，入度是图论算法中重要的概念之一，通常指有向图中某点作为图中边的终点的次数之和。
需要说明的是，i为正整数，且1≤i≤P[1]的长度-1。
本发明实施例中，举出一种实行本方法来完成寻路的伪代码：
Figure PCTCN2019096111-appb-000001
Figure PCTCN2019096111-appb-000002
Figure PCTCN2019096111-appb-000003
实施例2
本发明实施例2提供一种基于网管的寻路方法，该方法包括以下步骤：
S1、根据起点以及终点，选取最短的路径记作第一偏离路径P[1]；
S2、计算第一偏离路径P[1]的备选路径：选取第一偏离路径P[1]中节点作为偏离点，计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
S3、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径；
S4、从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明以最短路径为基准，通过遍历多个节点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
本发明实施例中，所述第一偏离路径P[1]中第i个节点的必经路径Ri为第一偏离路径P[1]上第一偏离路径P[1]的起点与第i个节点之间的路径；
同样的，所述第二偏离路径P[2]中第i个节点的必经路径Ri为第二偏离路径P[2]上第二偏离路径P[2]的起点与第i个节点之间的路径；
以节点即偏离点为准，将起点与偏离点之间的路径按照偏离路径 第一偏离路径P[1]或第二偏离路径P[2]的路径进行规划，而偏离点到终点之间的路径，再进行选择，从而在后续对各偏离点进行计算时获取不同路径长度的路径。
需要说明的是，步骤S3中、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径，其中按照步骤S2计算P[2]的备选路径的操作如下：
计算第二偏离路径P[2]的备选路径：选取第二偏离路径P[2]中节点作为偏离点，计算第二偏离路径P[2]上第n个节点的必经路径Rn及剩余路径Sn，n为正整数，且1≤n≤P[2]的长度-1，将Rn与Sn相加，得到P[2]上第n个节点的备选路径。
实施例3
本发明实施例提供一种基于网管的寻路方法，该方法包括以下步骤：
S1、根据起点以及终点，选取最短的路径记作第一偏离路径P[1]；
S2、计算第一偏离路径P[1]的备选路径：选取第一偏离路径P[1]中节点作为偏离点，计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
S3、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径；
S4、从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明以最短路径为基准，通过遍历多个节点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
本发明实施例中，步骤S2中，计算P[1]上第i个节点的剩余路 径Si的过程为：将第i个节点到P[1]终点的路径中绕过排纤路径得到的最短路径，作为P[1]上第i个节点的剩余路径Si；
从而对排纤路径进行排除，在进行寻路时，不再将排纤路径所代表的一段路径列入寻路计算中，以便获取与不同的路径。
实施例4
本发明实施例提供一种基于网管的寻路方法，该方法包括以下步骤：
S1、根据起点以及终点，选取最短的路径记作第一偏离路径P[1]；
S2、计算第一偏离路径P[1]的备选路径：选取第一偏离路径P[1]中节点作为偏离点，计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
S3、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径；
S4、从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明以最短路径为基准，通过遍历多个节点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
本发明实施例中，步骤S2中，计算P[1]上第i个节点的剩余路径Si的过程为：将第i个节点到P[1]终点的路径中绕过排纤路径得到的最短路径，作为P[1]上第i个节点的剩余路径Si；
而所述排纤路径为P[1]上第i个节点与第i+1个节点之间的路径；
剩余路径Si作为在去除排纤路径后，在偏离点以及终点之间寻找的最短路径，以便在对每个偏离点进行计算后，获得多个备选路径Bi，从而最终获得各偏离点的备选路径Bi，进而再在各备选路径Bi 中在各备选路径Bi中收集数量与预设路径数匹配的预选路径，能过保证路径选择结果的不同，为后续筛选工作提供准确的数据依据。
实施例5
本发明实施例提供一种基于网管的寻路系统，该系统包括：
第一偏离路径获取单元，其用于根据起点以及终点，选取路径最短的路径记作第一偏离路径P[1]；
第一备选路径计算单元，其用于计算第一偏离路径P[1]的备选路径：计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
第二备选路径计算单元，其用于：选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照第一备选路径计算单元的计算方式，计算P[2]的备选路径；
路径选择单元，其用于：从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明实施例中，首先根据需要制定路径的起点以及终点，通过现有的常用路径规划方法或路径寻找方法，选取路径最短的路径，并将该路径作为偏离路径第一偏离路径P[1]，作为后续步骤的初始基准，为后续步骤提供处理的依据；
其次再选取第一偏离路径P[1]中节点作为偏离点，寻求在偏移路径上，计算P[1]上第i个节点的必经路径Ri以及剩余路径Si，将Ri以及Si结合获得各偏离点的备选路径Bi，Bi的计算公式为Bi＝Ri+Si；
进而再选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径，从而获得更多的 备选路径，最终在从从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明以最短路径为基准，通过遍历多个节点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
需要说明的是，必要时，选取的节点，即偏离点可以是当前偏离路径第一偏离路径P[1]中从第一个节点开始的入度大于1的节点；
其中，入度是图论算法中重要的概念之一，通常指有向图中某点作为图中边的终点的次数之和。
需要说明的是，i为正整数，且1≤i≤P[1]的长度-1。
需要说明的是，步骤S3中、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径，其中按照步骤S2计算P[2]的备选路径的操作如下：
计算第二偏离路径P[2]的备选路径：选取第二偏离路径P[2]中节点作为偏离点，计算第二偏离路径P[2]上第n个节点的必经路径Rn及剩余路径Sn，n为正整数，且1≤n≤P[2]的长度-1，将Rn与Sn相加，得到P[2]上第n个节点的备选路径。
实施例6
本发明实施例提供一种基于网管的寻路系统，该系统包括：
第一偏离路径获取单元，其用于根据起点以及终点，选取路径最短的路径记作第一偏离路径P[1]；
第一备选路径计算单元，其用于计算第一偏离路径P[1]的备选路径：计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
第二备选路径计算单元，其用于：选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照第一备选路径计算单元的计算方式，计算P[2]的备选路径；
路径选择单元，其用于：从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明以最短路径为基准，通过遍历多个节点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
本发明实施例中，所述第一偏离路径P[1]中第i个节点的必经路径Ri为第一偏离路径P[1]上第一偏离路径P[1]的起点与第i个节点之间的路径；
以节点即偏离点为准，将起点与偏离点之间的路径按照偏离路径第一偏离路径P[1]或第二偏离路径P[2]的路径进行规划，而偏离点到终点之间的路径，再进行选择，从而在后续对各偏离点进行计算时获取不同路径长度的路径。
实施例7
本发明实施例提供一种基于网管的寻路系统，该系统包括：
第一偏离路径获取单元，其用于根据起点以及终点，选取路径最短的路径记作第一偏离路径P[1]；
第一备选路径计算单元，其用于计算第一偏离路径P[1]的备选路径：计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
第二备选路径计算单元，其用于：选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照第一备选路径计算单 元的计算方式，计算P[2]的备选路径；
路径选择单元，其用于：从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明以最短路径为基准，通过遍历多个节点，从而获取起点到终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
本发明实施例中，步骤S2中，计算P[1]上第i个节点的剩余路径Si的过程为：将第i个节点到P[1]终点的路径中绕过排纤路径得到的最短路径，作为P[1]上第i个节点的剩余路径Si；
从而对排纤路径进行排除，在进行寻路时，不再将排纤路径所代表的一段路径列入寻路计算中，以便获取与不同的路径。
实施例8
本发明实施例提供一种基于网管的寻路系统，该系统包括：
第一偏离路径获取单元，其用于根据起点以及终点，选取路径最短的路径记作第一偏离路径P[1]；
第一备选路径计算单元，其用于计算第一偏离路径P[1]的备选路径：计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
第二备选路径计算单元，其用于：选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照第一备选路径计算单元的计算方式，计算P[2]的备选路径；
路径选择单元，其用于：从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
本发明以最短路径为基准，通过遍历多个节点，从而获取起点到 终点间多个不同的路径，并根据需求选择合适数量的路径，满足多样的寻路需求。
本发明实施例中，步骤S2中，计算P[1]上第i个节点的剩余路径Si的过程为：将第i个节点到P[1]终点的路径中绕过排纤路径得到的最短路径，作为P[1]上第i个节点的剩余路径Si；
而所述排纤路径为P[1]上第i个节点与第i+1个节点之间的路径；
剩余路径Si作为在去除排纤路径后，在偏离点以及终点之间寻找的最短路径，以便在对每个偏离点进行计算后，获得多个备选路径Bi，从而最终获得各偏离点的备选路径Bi，进而再在各备选路径Bi中在各备选路径Bi中收集数量与预设路径数匹配的预选路径，能过保证路径选择结果的不同，为后续筛选工作提供准确的数据依据。
本发明不仅局限于上述最佳实施方式，任何人在本发明的启示下都可得出其他各种形式的产品，但不论在其形状或结构上作任何变化，凡是具有与本发明相同或相近似的技术方案，均在其保护范围之内。

Claims (10)

  1. 一种基于网管的寻路方法，其特征在于，包括以下步骤：
    S1、根据起点以及终点，选取最短的路径记作第一偏离路径P[1]；
    S2、计算第一偏离路径P[1]的备选路径：计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数，且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
    S3、选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照步骤S2计算P[2]的备选路径；
    S4、从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
  2. 如权利要求1所述的基于网管的寻路方法，其特征在于：所述第一偏离路径P[1]中第i个节点的必经路径Ri为第一偏离路径P[1]上第一偏离路径P[1]的起点与第i个节点之间的路径。
  3. 如权利要求1所述的基于网管的寻路方法，其特征在于，步骤S2中，计算P[1]上第i个节点的剩余路径Si的过程为：将第i个节点到P[1]终点的路径中绕过排纤路径得到的最短路径，作为P[1]上第i个节点的剩余路径Si。
  4. 如权利要求3所述的基于网管的寻路方法，其特征在于：所述排纤路径为P[1]上第i个节点与第i+1个节点之间的路径。
  5. 如权利要求1所述的基于网管的寻路方法，其特征在于：所述P[1]上第i个节点的入度大于1。
  6. 一种基于网管的寻路系统，其特征在于，所述系统包括：
    第一偏离路径获取单元，其用于根据起点以及终点，选取路径最短的路径记作第一偏离路径P[1]；
    第一备选路径计算单元，其用于计算第一偏离路径P[1]的备选路径：计算P[1]上第i个节点的必经路径Ri及剩余路径Si，i为正整数， 且1≤i≤P[1]的长度-1，将Ri与Si相加，得到P[1]上第i个节点的备选路径；
    第二备选路径计算单元，其用于：选出P[1]上所有节点的备选路径中最短的路径，记作第二偏离路径P[2]，按照第一备选路径计算单元的计算方式，计算P[2]的备选路径；
    路径选择单元，其用于：从P[1]、P[2]上所有节点的备选路径中选择预设数量的路径。
  7. 如权利要求6所述的基于网管的寻路系统，其特征在于：所述第一偏离路径P[1]中第i个节点的必经路径Ri为第一偏离路径P[1]上第一偏离路径P[1]的起点与第i个节点之间的路径。
  8. 如权利要求6所述的基于网管的寻路系统，其特征在于：所述第一备选路径计算单元计算P[1]上第i个节点的剩余路径Si的过程为：将第i个节点到P[1]终点的路径中绕过排纤路径得到的最短路径，作为P[1]上第i个节点的剩余路径Si。
  9. 如权利要求8所述的基于网管的寻路系统，其特征在于：所述排纤路径为P[1]上第i个节点与第i+1个节点之间的路径。
  10. 如权利要求6所述的基于网管的寻路系统，其特征在于：所述P[1]上第i个节点的入度大于1。
PCT/CN2019/096111 2018-07-05 2019-07-16 一种基于网管的寻路方法及系统 WO2020007373A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810732963.9A CN108932565A (zh) 2018-07-05 2018-07-05 一种基于网管的寻路方法及系统
CN201810732963.9 2018-07-05

Publications (1)

Publication Number Publication Date
WO2020007373A1 true WO2020007373A1 (zh) 2020-01-09

Family

ID=64447395

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/096111 WO2020007373A1 (zh) 2018-07-05 2019-07-16 一种基于网管的寻路方法及系统

Country Status (2)

Country Link
CN (1) CN108932565A (zh)
WO (1) WO2020007373A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108932565A (zh) * 2018-07-05 2018-12-04 烽火通信科技股份有限公司 一种基于网管的寻路方法及系统
CN111060127B (zh) * 2019-12-31 2021-10-26 深圳一清创新科技有限公司 车辆起点定位方法、装置、计算机设备和存储介质
CN111813883B (zh) * 2020-06-23 2024-05-28 上海阿尔卡特网络支援系统有限公司 最短路径查询方法及查询系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101072241A (zh) * 2006-05-11 2007-11-14 华为技术有限公司 提高最短路径桥可靠性的方法及装置
CN101753425A (zh) * 2008-12-01 2010-06-23 北京航空航天大学 在多约束下求取网络中多条最短简单路径的启发式方法
US20120127875A1 (en) * 2009-08-06 2012-05-24 Zte Corporation Method and device for calculating k-shortest paths
CN107959633A (zh) * 2017-11-18 2018-04-24 浙江工商大学 一种工业实时网络中基于价格机制的多路径负载均衡方法
CN108932565A (zh) * 2018-07-05 2018-12-04 烽火通信科技股份有限公司 一种基于网管的寻路方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101072241A (zh) * 2006-05-11 2007-11-14 华为技术有限公司 提高最短路径桥可靠性的方法及装置
CN101753425A (zh) * 2008-12-01 2010-06-23 北京航空航天大学 在多约束下求取网络中多条最短简单路径的启发式方法
US20120127875A1 (en) * 2009-08-06 2012-05-24 Zte Corporation Method and device for calculating k-shortest paths
CN107959633A (zh) * 2017-11-18 2018-04-24 浙江工商大学 一种工业实时网络中基于价格机制的多路径负载均衡方法
CN108932565A (zh) * 2018-07-05 2018-12-04 烽火通信科技股份有限公司 一种基于网管的寻路方法及系统

Also Published As

Publication number Publication date
CN108932565A (zh) 2018-12-04

Similar Documents

Publication Publication Date Title
WO2020007373A1 (zh) 一种基于网管的寻路方法及系统
US7072304B2 (en) Network path selection based on bandwidth
US7561534B2 (en) Methods of network routing having improved resistance to faults affecting groups of links subject to common risks
US8437259B1 (en) Method for estimating telecommunication network traffic using link weight changes
EP2713556A1 (en) Mapping a network topology request to a physical network
US20090046587A1 (en) Fast computation of alterative packet routes
US20140098709A1 (en) Path calculating method, program and calculating apparatus
US9742665B2 (en) Communication network control system, control method thereof, and non-transitory computer readable medium of control program
CN106202114A (zh) 路径导航方法和装置
CN108270677A (zh) 一种快速路由收敛方法及装置
CN104093182B (zh) 一种多层无线网络中基于场强获得多条可靠通信路径的方法
US20130010643A1 (en) Method and apparatus for loop path search in mesh network
EP2538622B1 (en) Network delay estimation apparatus and network delay estimation method
Rahman et al. Learning to predict transitions within the homelessness system from network trajectories
JP5506538B2 (ja) 経路計算方法及び装置及びプログラム
Ping et al. Network latency prediction using high accuracy prediction tree
Gavalas et al. New techniques for incremental data fusion in distributed sensor networks
JP2014175820A (ja) ネットワーク設計装置およびネットワーク設計プログラム
CN105610618B (zh) 一种面向双通道故障的电力通信网规划方法
CN111181830B (zh) 一种基于网管L3vpn业务的TX增量计算方法及系统
WO2017016197A1 (zh) 路由目标处理方法及装置
CN110166362B (zh) 一种基于节点筛选的服务功能图低时延映射方法
US7929426B2 (en) Apparatus and method for designing ring covers
WO2018181031A1 (ja) 光パス設計装置および光パス設計方法
Klymash et al. The matrix method of network structures' topologies optimization

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19830156

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19830156

Country of ref document: EP

Kind code of ref document: A1