Method for finding routing path between two facility points of optical fiber resource

Abstract

The invention discloses a path finding method for a routing path between two facility points of an optical fiber resource, and relates to the technical field of routing. Comprising the steps of 1, obtaining optical fiber resource facility parameters in a city, 2, marking a reference point in an optical path routing path, connecting every two adjacent nodes in the routing path into a line, and recording a laying value of the line formed by the two adjacent nodes as 1, and 3, initializing an optical path, traversing and calculating laying values of all the nodes in the optical path and the reference point, step 4, performing optical path jump fiber data query: determining a query range, querying an optical path from a routing starting point node, and putting all the found nodes into a Point set, step 5, putting connection information of all the nodes in the Point set into a Line set, and performing optical path jump fiber data query; and step 6, all reachable paths passing from the route starting point node to the route end point node are connected in series according to the sequence of the route starting point node, the route end point node, the Point set and the Line set.

Description

Technical Field

[0001] The present invention discloses a method for finding a routing path between two facility points of optical fiber resources, which relates to the technical field of routing. Background Art

[0002] Optical cable optical fiber resources are the core of telecommunication network resource management. Calculating the routing path of an optical path based on the two facility points at both ends of the optical path is the core function of the optical path design service. There are multiple intermediate points between two points and their connecting points, and each intermediate point is also connected to multiple points, making it very cumbersome to calculate the routing path of the entire optical path. The current method is to find the terminal for point-to-point verification of the routing connection to find the routing path. This method consumes a large amount of resources of the database and CPU, has a low response rate, and is affected by the operation method and cost of on-site personnel, which is not conducive to rapid path finding. Summary of the Invention

[0003] Aiming at the problems of the prior art, the present invention provides a method for finding a routing path between two facility points of optical fiber resources. By setting the path laying range of the query node and performing the query, the consumption of resources by the connection function is greatly reduced, the connection query time of the path points is greatly shortened, and the performance is significantly improved.

[0004] The specific solution proposed by the present invention is as follows:

[0005] The present invention provides a method for finding a routing path between two facility points of optical fiber resources, including:

[0006] Step 1: Obtain the optical fiber resource facility parameters in the city. The facility parameters include the routing start node, the routing end node, the passing nodes, the single query laying amount, and the maximum laying value.

[0007] Step 2: Mark the reference points in the optical path routing path. Each adjacent two nodes in the routing path are connected into a line, and the laying value of the line formed by adjacent two nodes is recorded as 1.

[0008] Step 3: Initialize the optical path, traverse and calculate the laying values of all nodes and the reference points in the optical path. The number of the shortest connecting lines from each point to the reference point is recorded as the laying value of the node, and the laying value of the node farthest from the reference point is recorded as the maximum laying value.

[0009] Step 4: Perform optical path fiber jump data query: Determine the query range, start from the routing start node, query the optical path, and put all the found nodes into the Point set.

[0010] Step 5: Put the connection information of all nodes in the Point set into the Line set.

[0011] Step 6: Concatenate all reachable paths from the routing start node to the routing end node in sequence according to the routing start node, routing end node, Point set, and Line set.

[0012] Further, in step 2 of the method for finding a routing path between two facility points of optical fiber resources, a node with more connections in the optical path is selected as the reference point according to service requirements.

[0013] Further, in step 4 of the method for finding a routing path between two facility points of optical fiber resources, determining the query range includes:

[0014] Obtain the laying value of the routing start node, denoted as An, the single query laying amount is denoted as X, and the maximum laying value is denoted as M. If the laying value An of the routing start node > X, the query range is: An - X to An + X, and An + X is not greater than M; if An ≤ X, the query range is: X - An to X + An, and An + X is not greater than M.

[0015] Further, in step 4 of the method for finding a routing path between two facility points of optical fiber resources, first determine whether all nodes in the Point set include the routing end node. If so, return information indicating that there is a reachable path within X hops between the routing start node and the routing end node; if not, return information indicating that there is no reachable path within X hops between the routing start node and the routing end node.

[0016] The present invention also provides a device for finding a routing path between two facility points of optical fiber resources, including a collection module, a marking module, an initialization module, a query module, and a routing path finding module.

[0017] The collection module obtains the parameters of optical fiber resource facilities in the city. The facility parameters include the routing start node, routing end node, passing nodes, single query laying amount, and maximum laying value.

[0018] The marking module marks the reference point in the optical path routing path. Each adjacent two nodes in the routing path are connected into a line, and the laying value of the line connected by adjacent two nodes is denoted as 1.

[0019] The initialization module initializes the optical path, traverses and calculates the laying values of all nodes and the reference point in the optical path. The number of the shortest connections from each point to the reference point is denoted as the laying value of the node, and the laying value of the node farthest from the reference point is denoted as the maximum laying value.

[0020] The query module performs optical path fiber jump data query: determines the query range, starts from the routing start node, queries the optical path, and puts all the found nodes into the Point set.

[0021] Put the connection information of all nodes in the Point set into the Line set.

[0022] The pathfinding module concatenates all reachable paths from the routing start node to the routing end node in sequence according to the routing start node, routing end node, Point set, and Line set.

[0023] Furthermore, the marking module of the pathfinding device for the routing path between two facility points of the optical fiber resource selects the node with more connections in the optical path as the reference point according to service requirements.

[0024] Furthermore, the query module of the pathfinding device for the routing path between two facility points of the optical fiber resource determines the query range, including:

[0025] Obtain the laying value of the routing start node and denote it as An, the single query laying quantity as X, and the maximum laying value as M. If the laying value An of the routing start node > X, the query range is: An - X to An + X, and An + X is not greater than M; if An ≤ X, the query range is: X - An to X + An, and An + X is not greater than M.

[0026] Furthermore, the query module of the pathfinding device for the routing path between two facility points of the optical fiber resource first determines whether all nodes in the Point set contain the routing end node. If it contains, it returns information indicating that there is a reachable path within X hops between the routing start node and the routing end node; if it does not contain, it returns information indicating that there is no reachable path within X hops between the routing start node and the routing end node.

[0027] The beneficial effects of the present invention are:

[0028] It solves problems such as low efficiency of optical path routing integrity data verification, complex associated services, and large resource consumption in the optical path scheduling of the resource capability center, can meet the fast calculation of the optical path routing, is convenient to execute, and performs full - volume operations, solving the problem of low - efficiency routing verification of tens of millions of optical paths. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or in the prior art, the following will briefly introduce the drawings required for use in the description of the embodiments or the prior art. Obviously, the following drawings are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0030] Figure 1 It is a schematic diagram showing the calculation rule of the laying value based on the reference point.

[0031] Figure 2 It is a schematic diagram showing the routing start node A and the laying range. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0032] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments, so that those skilled in the art can better understand the present invention and be able to implement it, but the embodiments cited do not limit the present invention.

[0033] Embodiment 1

[0034] The present invention provides a path finding method for the routing path between two fiber optic resource facilities, including:

[0035] Step 1: Obtain the fiber optic resource facility parameters in the city. The facility parameters include the routing start node A, the routing end node Z, the passing nodes, the single query laying amount X, and the maximum laying value M.

[0036] Step 2: Select the node with more connections in the optical path as the reference point according to the service requirements in the optical path routing path, mark the reference point, connect each adjacent two nodes in the routing path into a line, and record the laying value of the line connected by each adjacent two nodes as 1. For example Figure 2 the red ones are the reference points in the figure, and the red numbers represent the laying values.

[0037] Step 3: Initialize the optical path, traverse and calculate the laying values of all nodes in the optical path and the reference point. Among them, the number of the shortest connections from each point to the reference point is recorded as the laying value of the node, and the laying value of the node farthest from the reference point is recorded as the maximum laying value.

[0038] Step 4: Conduct optical path fiber jump data query: Determine the query range, start from the routing start node, and query the optical path. When determining the query range, it may specifically include:

[0039] Obtain the laying value of the routing start node and record it as An, the single query laying amount as X, and the maximum laying value as M. If the laying value An of the routing start node > X, the query range is: An - X to An + X, and An + X is not greater than M; if An ≤ X, the query range is: X - An to X + An, and An + X is not greater than M. For example Figure 2 in the figure, the light green node is the routing start node, the single query laying amount is 2, then An = 3 > X = 2, M = 6, and the query range is: 1 to 5, and An + X = 5 is less than 6.

[0040] Put all the found nodes into the Point set. First, judge whether all the nodes in the Point set contain the routing end node. If so, return the information indicating that there is an accessible path between the routing start node A and the routing end node Z within X jumps; if not, return the information indicating that there is no accessible path between the routing start node A and the routing end node Z within X jumps.

[0041] Step 5: Put the connection information of all nodes in the Point set, that is, the optical cable segments between all the facility nodes passed through, into the Line set.

[0042] Step 6: Concatenate all reachable paths from the routing start node A to the routing end node Z in sequence according to the routing start node A, the routing end node Z, the Point set, and the Line set.

[0043] Embodiment 2

[0044] The present invention also provides a path finding device for the routing path between two facility points of optical fiber resources, including an acquisition module, a marking module, an initialization module, a query module, and a path finding module.

[0045] The acquisition module obtains the optical fiber resource facility parameters in the city. The facility parameters include the routing start node, the routing end node, the passing nodes, the single query laying amount, and the maximum laying value.

[0046] The marking module marks the reference points in the optical path routing path. Each adjacent two nodes in the routing path are connected into a line, and the laying value of the line connected by the adjacent two nodes is recorded as 1.

[0047] The initialization module initializes the optical path, traverses and calculates the laying values of all nodes and the reference points in the optical path. Among them, the number of the shortest connections from each point to the reference point is recorded as the laying value of the node, and the laying value of the node farthest from the reference point is recorded as the maximum laying value.

[0048] The query module performs optical path fiber jump data query: determines the query range, starts from the routing start node, queries the optical path, and puts all the found nodes into the Point set.

[0049] Put the connection information of all nodes in the Point set into the Line set.

[0050] The path finding module concatenates all reachable paths from the routing start node to the routing end node in sequence according to the routing start node, the routing end node, the Point set, and the Line set.

[0051] For the information interaction and execution process between the above-mentioned modules in the device, since they are based on the same concept as the method embodiment of the present invention, the specific content can be referred to the description in the method embodiment of the present invention, and will not be elaborated here.

[0052] Similarly, the device of the present invention solves the problems of low efficiency in verifying the integrity data of the optical path routing, complex associated services, and large resource consumption in the optical path scheduling of the resource capacity center. It can meet the fast calculation of the optical path routing, is convenient to execute, and performs full-scale operations, solving the problem of low efficiency in verifying the routing of tens of millions of optical paths.

[0053] It should be noted that not all steps and modules in the above-mentioned processes and device structures are necessary, and some steps or modules can be ignored according to actual needs. The execution order of each step is not fixed and can be adjusted as needed. The system structures described in the above-mentioned embodiments can be physical structures or logical structures. That is, some modules may be implemented by the same physical entity, or some modules may be implemented by multiple physical entities separately, or some components in multiple independent devices may be jointly implemented.

[0054] The above-mentioned embodiments are only preferred embodiments given to fully illustrate the present invention, and the protection scope of the present invention is not limited thereto. Equivalent substitutions or transformations made by those skilled in the art on the basis of the present invention are all within the protection scope of the present invention. The protection scope of the present invention shall be subject to the claims.

Claims

1. A method for finding a routing path between two fiber optic resource facilities, characterized in that include: Step 1: Obtain the fiber optic resource facility parameters in the city, including the route starting node, route ending node, passing node, single query laying volume, and maximum laying value. Step 2: Mark the reference point in the optical path routing path, connect every two adjacent nodes in the routing path into a line, and the laying value of the line connecting two adjacent nodes is recorded as 1. Step 3: Initialize the light path, traverse and calculate the laying values ​​of all nodes and reference points in the light path, where the number of shortest lines from each point to the reference point is recorded as the laying value of the node, and the laying value of the node farthest from the reference point is recorded as the maximum laying value. Step 4: Query the optical path jumper data: Determine the query range, start from the routing starting point node, query the optical path, and put all the found nodes into the Point set. Step 5: Put the connection information of all nodes in the Point collection into the Line collection. Step 6: Concatenate all reachable paths from the route start node to the route end node in sequence according to the route start node, route end node, Point set, and Line set.

2. A method for finding a routing path between two fiber optic resource facilities according to claim 1, characterized in that In step 2, select the node with more connections in the optical path as the reference point according to business needs.

3. A method for finding a routing path between two fiber optic resource facilities according to claim 1, characterized in that In step 4, determine the query scope, including: The laying value of the starting point node of the route is recorded as An, the laying amount of a single query is recorded as X, and the maximum laying value is recorded as M. If the laying value of the starting point node of the route is An>X, the query range is: An-X to An+X, and An+X is not greater than M; if An≤X, the query range is: X-An to X+An, and An+X is not greater than M.

4. According to claim 1, a method for finding a routing path between two fiber optic resource facility points is characterized in that in step 4, it is first determined whether all nodes in the Point set include the routing end node. If included, information is returned, indicating that there is a reachable path from the routing start node to the routing end node within X hops; if not included, information is returned, indicating that there is no reachable path from the routing start node to the routing end node within X hops.

5. A routing device for a route path between two fiber optic resource facilities, characterized in that It includes acquisition module, marking module, initialization module, query module and pathfinding module. The acquisition module obtains the fiber optic resource facility parameters in the city, including the route starting node, route ending node, passing node, single query laying volume, and maximum laying value. The marking module marks the reference point in the optical path routing path. Every two adjacent nodes in the routing path are connected into a line, and the laying value of the line connecting two adjacent nodes is recorded as 1. The initialization module initializes the light path, traverses and calculates the laying values ​​of all nodes and reference points in the light path, where the number of shortest lines from each point to the reference point is recorded as the laying value of the node, and the laying value of the node farthest from the reference point is recorded as the maximum laying value. The query module performs optical path jumper data query: determine the query range, start from the routing starting point node, query the optical path, and put all the found nodes into the Point set. Put the connection information of all nodes in the Point collection into the Line collection. The pathfinding module sequentially connects all reachable paths from the route starting node to the route ending node according to the route starting node, route ending node, Point set, and Line set.

6. A routing device for a route path between two fiber optic resource facilities according to claim 5, characterized in that The marking module selects nodes with more connections in the optical path as reference points according to business needs.

7. A routing device for a route path between two fiber optic resource facilities according to claim 5, characterized in that The query module determines the query scope, including: The laying value of the starting point node of the route is recorded as An, the laying amount of a single query is recorded as X, and the maximum laying value is recorded as M. If the laying value of the starting point node of the route is An>X, the query range is: An-X to An+X, and An+X is not greater than M; if An≤X, the query range is: X-An to X+An, and An+X is not greater than M.

8. A routing device for a route path between two fiber optic resource facilities according to claim 5, characterized in that The query module first determines whether all nodes in the Point set include the routing endpoint node. If so, it returns information, indicating that there is a reachable path from the routing start node to the routing endpoint node within X hops; if not, it returns information, indicating that there is no reachable path from the routing start node to the routing endpoint node within X hops.

Images