CN111970586B - Rapid optical network path routing calculation method and device under constraint condition and computer medium - Google Patents
Rapid optical network path routing calculation method and device under constraint condition and computer medium Download PDFInfo
- Publication number
- CN111970586B CN111970586B CN202010810138.3A CN202010810138A CN111970586B CN 111970586 B CN111970586 B CN 111970586B CN 202010810138 A CN202010810138 A CN 202010810138A CN 111970586 B CN111970586 B CN 111970586B
- Authority
- CN
- China
- Prior art keywords
- path
- key
- directed graph
- key node
- available
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
- H04Q2011/0037—Operation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0079—Operation or maintenance aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a fast optical network path routing calculation method, a device and a computer medium under constraint conditions, wherein the method comprises the following 5 parts: (1) identifying corresponding key nodes according to corresponding constraint conditions; (2) establishing and maintaining an available key node set according to the use condition of the key nodes; (3) when the available key node set is empty, the unavailable path can be quickly judged; (4) splitting the network by taking the key node as a boundary; (5) and (4) independently calculating paths of each split network, and then connecting each segment of path to obtain a complete available path. The method and the device can establish and maintain the available key node set by identifying the key nodes, and can quickly judge that no available path exists when all the key nodes of the optical transmission network are occupied. In addition, the invention divides the network, calculates the path of the divided small network independently, and then connects each path to obtain the complete available path, thereby improving the efficiency of path calculation.
Description
Technical Field
The invention relates to a routing method in the technical field of communication, in particular to a quick optical network path routing calculation method, a quick optical network path routing calculation device and a computer medium under constraint conditions.
Background
In a dynamic optical transmission network, an optical transmission path must be dynamically changed as required, so an efficient path calculation method is required to quickly find an available path from a source port to a sink port.
In the path calculation method, when calculating an available path, in addition to considering the node connection relationship, a specific constraint condition needs to be considered. In an optical network, constraints include signal wavelength, signal modulation scheme, signal bandwidth, device processing capability, whether a device is available, etc.
The constraints are dynamically changing, and different constraints may cause the path computation method to find different available paths, or to find no available paths.
At present, an Dijkstra algorithm is generally adopted for optical network path calculation under a constraint condition, and has the following problems:
(1) the Dijkstra algorithm is sent from the source port, the whole network is searched, and the judgment of whether no available path exists from the source port to the sink port can not be given until the algorithm calculation is finished. In a specific scenario, when there is no available path from the source port to the sink port, the dijkstra algorithm cannot give a decision quickly.
(2) The dijkstra algorithm traverses all reachable nodes of the network from the source port when calculating the path. As network nodes increase, the amount of computation increases exponentially.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: in view of the above existing problems, a method, an apparatus, and a computer medium for fast optical network path finding calculation under constraint conditions are provided, which can improve the path calculation efficiency, and can quickly draw a conclusion of an unavailable path when no available path exists.
The technical scheme adopted by the invention is as follows:
a fast optical network path routing calculation method under constraint conditions comprises the following steps:
s1, reading the database, obtaining the connection relation of the optical network nodes, and generating a directed graph G corresponding to the connection relation of the optical network nodes 0 ；
S2, determining available key nodes according to the constraint conditions, and generating an available key node set S;
s3, taking the key node as the boundary, the directed graph G 0 Splitting into two directed graphs G 1 And G 2 (ii) a Therein, a directed graph G 1 The direction of each link in the graph is relative to the directed graph G 0 All inverted, directed graph G 2 Direction of each link in the directed graph G 0 The same;
s4, appointing a source port and a sink port, and preparing to calculate an available path from the source port to the sink port;
s5, judging whether the key node set S is empty:
when the key node set S is empty, indicating that no available path exists, and finishing the calculation;
when the key node set S is non-empty, executing S6;
s6, selecting a key node from the key node set S, and matching the directed graph G 1 Finding a path R from the key node to the source port using Dijkstra's algorithm 1 (ii) a To directed graph G 2 Finding a path R from the key node to a sink port using Dijkstra's algorithm 2 ；
S7, connecting the path R 1 The direction is reversed to obtain a path R 1- Then the path R 1- And path R 2 Connecting, then obtaining the available path R from source port to sink port 3 ；
S8, removing the key nodes selected in the step S6 from the key node set S;
s9, if it is necessary to continue to find other available paths from the source port to the sink port, returning to step S4; otherwise, the calculation is finished.
Further, the directed graph G 0 、G 1 And G 2 Are represented by adjacency matrices.
Further, the directed graph G 1 Contains all key nodes and in directed graph G 0 A node in the network can reach the key node; directed graph G 2 Contains all key nodes and in directed graph G 0 The node reachable from the key node.
Further, when the calculated available path is not used any more, the key node for calculating the available path is released, and the key node is added into the key node set S again.
The invention also provides a fast optical network path routing calculation device under the constraint condition, which comprises:
a memory for storing a computer program;
and the processor is used for realizing the steps of the rapid optical network path routing calculation method under the constraint condition when executing the computer program.
The invention also provides a computer medium, on which a computer program is stored, which, when being executed by a processor, implements the steps of the fast optical network path routing computation method under the constraint conditions described above.
In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:
1. by identifying the key nodes and establishing and maintaining the available key node set, when all the key nodes of the optical transmission network are occupied, the judgment that no available path exists can be quickly given.
2. The network is split, the path is independently calculated for the split small network, and then all the paths are connected to obtain a complete available path, so that the path calculation efficiency is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
Fig. 1 is a schematic diagram of a modern optical transmission network structure.
FIG. 2 is a directed graph G of an optical network topology 0 Examples are given.
Fig. 3 is a flow chart of the fast optical network path routing calculation method under the constraint condition of the present invention.
FIG. 4 is a directed graph G 0 Split directed graph G 1 And G 2 Examples are given.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the detailed description and specific examples, while indicating the preferred embodiment of the invention, are intended for purposes of illustration only and are not intended to limit the scope of the invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 1, a modern optical transmission network mainly comprises an optical cross device, a network management device, a database, and a Path Computation Element (PCE).
The optical cross-connect device generally has a plurality of input ports and a plurality of output ports, and under the control of the network management device, the optical cross-connect device can change the mapping relationship between the input ports and the output ports, thereby dynamically changing the optical signal transmission path. The optical cross devices are interconnected through optical fibers, and information such as interconnection relation of the optical cross devices and various physical parameters of the optical cross devices is recorded in a database and used as a basis for path calculation. The path calculation unit calculates a path meeting the requirement according to the database record information, and the network management equipment controls the optical cross equipment to change the mapping relation of the input and output ports, so that the correct routing of the optical signals is realized.
When calculating an available path, the PCE needs to obtain a connection relationship of the optical cross device from the database, and the connection relationship of the optical cross device may be abstracted as a directed graph. Taking fig. 2 as an example, an optical network topology structure with 18 optical cross devices is abstracted into a directed graph G 0 ，G 0 Node A, B, C, D is the source port in the network and node P, Q, R is the sink port in the network, and the PCE needs to find a path from the source port to the sink port in the path computation.
In an actual optical transmission network, when a PCE calculates an available path, in addition to consideration of a connection relationship between nodes, other constraints need to be considered. The constraint condition may be physical parameters of the signal and the node, such as signal wavelength, signal modulation mode, signal bandwidth, node processing capability, node capacity, and the like; other user-defined constraints are also possible, such as signal priority, etc. Under certain constraints, an available optical transmission path must pass through a specific class of nodes in the optical transmission network.
For example, it is required that an optical signal of a specific signal modulation scheme (which may be other constraint conditions) must pass through a certain signal demodulation device node. Taking FIG. 2 as an example, node J, K is G 0 The device node with the capability of modulating the signal by the specific signal, an available path must pass through the node J or the node K (or the device node corresponding to other constraint conditions). Defining a node which an available path must pass through as G 0 The key node in (1). In an optical transmission network, key nodes are often expensive, the available number is limited, and the nodes become bottlenecks in path calculation.
The following describes in detail a fast optical network path routing calculation method under a constraint condition, which is provided by the present invention, taking the optical network topology directed graph of fig. 2 as an example, and the process is shown in fig. 3:
(1) reading the database, obtaining the connection relation of the optical network nodes, and generating a directed graph G corresponding to the connection relation of the optical network nodes 0 As shown in FIG. 2, the directed graph G 0 Using an adjacency matrix A 0 Represents;
(2) determining available key nodes according to constraints, i.e. in directed graph G 0 The middle key nodes are a signal demodulation device node J and a node K, and an available key node set S is generated as { J, K };
(3) using key node as boundary, making directed graph G 0 Splitting into two directed graphs G 1 And G 2 (ii) a Therein, a directed graph G 1 The direction of each link in the graph is relative to the directed graph G 0 All are reversed; directed graph G 2 Direction of each link in the directed graph G 0 The same; as shown in fig. 4, directed graph G 1 Contains all key nodes J, K, anddirected graph G 0 A node in the network can reach the key node; directed graph G 2 Contains all key nodes J, K, and is in directed graph G 0 The node reachable from the key node.
Directed graph G 1 Using an adjacency matrix A 1 Represents;
directed graph G 2 Using an adjacency matrix A 2 Represents;
(4) appointing a source port and a sink port, and preparing to calculate an available path from the source port to the sink port;
(5) judging whether the key node set S is empty:
when the key node set S is empty, indicating that no available path exists, and finishing the calculation;
when the key node set S is not empty, executing the step (6);
(6) randomly selecting a key node from the key node set S, and matching the directed graph G 1 Finding a path R from the key node to the source port using Dijkstra's algorithm 1 (ii) a To directed graph G 2 Finding a path R from the key node to a sink port using Dijkstra's algorithm 2 ；
(7) Will route R 1 The direction is reversed to obtain a path R 1- Then the path R 1- And path R 2 Connecting, then obtaining the available path R from source port to sink port 3 ；
(8) Removing the key nodes selected in the step (6) from the key node set S;
(9) if it is necessary to continue to find other available paths from the source port to the sink port, returning to step S4; otherwise, the calculation is finished.
Steps (4) to (8) are described by way of example:
designating a source port as a node B and a sink port as a node Q;
the available set of key nodes S ═ { J, K };
selecting a key node J from the key node set S and finding out a path R 1 Finding a path R → F → B 2 J → M → Q;
R 1 obtaining a path R by reversing the direction 1- B → F → J, route R 1- And a path R 2 Connect, finally obtain the available path R from the source port B to the sink port Q 3 B → F → J → M → Q;
and removing the node J from the key node set S, wherein the value of the available key node set S is S ═ K, and the calculation is finished.
Further, when the calculated available path is not used any more, releasing the key node for calculating the available path, and rejoining the key node into the key node set S. By way of example, when the available path B → F → J → M → Q use is over, the key node J is released and added to the available set of key nodes S again, the value of S being { J, K }.
The invention also provides a rapid optical network path routing calculation device under the constraint condition, which comprises:
a memory for storing a computer program;
and the processor is used for realizing the steps of the rapid optical network path routing calculation method under the constraint condition when executing the computer program.
The invention also provides a computer medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the fast optical network path routing computation method under the constraint condition.
The rapid optical network path routing calculation unit and the computer medium under the constraint condition have the corresponding effects of the rapid optical network path routing calculation method under the constraint condition. The technical scheme refers to the part of the fast optical network path routing calculation method under the constraint condition, and is not described herein again.
In addition, it should be noted that:
the invention describes the path-finding calculation method with the background of the optical transmission network, but the path-finding calculation method is not only suitable for the optical transmission network, but also suitable for other communication networks.
The invention takes the node of the signal demodulation device as an example to define the key node, but the key node can have different physical meanings under networks with different characteristics.
The present invention takes dijkstra algorithm as an example to calculate the paths from the key nodes to the source port and the sink port, but we can also use other common algorithms, such as depth-first traversal (DFS) and breadth-first traversal (BFS), instead of dijkstra algorithm, and the method of the present invention is also effective.
Directed graph G of an exemplary optical network topology of the present invention 0 The path length of the links between the nodes is 1, but when the weights of the links are not equal, the method of the invention is also effective.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (6)
1. A fast optical network path routing calculation method under constraint conditions is characterized by comprising the following steps:
s1, reading the database, obtaining the connection relation of the optical network nodes, and generating a directed graph G corresponding to the connection relation of the optical network nodes 0 ；
S2, determining available key nodes according to the constraint conditions, and generating an available key node set S;
s3, taking the key node as the boundary, the directed graph G 0 Splitting into two directed graphs G 1 And G 2 (ii) a Therein, a directed graph G 1 The direction of each link in the graph is relative to the directed graph G 0 All inverted, directed graph G 2 Direction of each link in the directed graph G 0 The same; directed graph G 1 It contains all the key nodes and the key nodes,and in directed graph G 0 A node in the network can reach the key node; directed graph G 2 Including all key nodes, and in directed graph G 0 Nodes reachable from the key node;
s4, appointing a source port and a sink port, and preparing to calculate an available path from the source port to the sink port;
s5, judging whether the key node set S is empty:
when the key node set S is empty, indicating that no available path exists, and finishing the calculation;
when the key node set S is non-empty, executing S6;
s6, selecting a key node from the key node set S, and matching the directed graph G 1 Finding a path R from the key node to the source port using Dijkstra's algorithm 1 (ii) a To directed graph G 2 Finding a path R from the key node to a sink port using Dijkstra's algorithm 2 ；
S7, connecting the path R 1 The direction is reversed to obtain a path R 1- Then the path R 1- And path R 2 Connecting, then obtaining the available path R from source port to sink port 3 ；
S8, removing the key nodes selected in the step S6 from the key node set S;
s9, if it is necessary to continue to find other available paths from the source port to the sink port, returning to step S4; otherwise, the calculation is finished.
2. The constrained fast optical network path routing computation method of claim 1, wherein the directed graph G is 0 、G 1 And G 2 Are represented by adjacency matrices.
3. The constrained fast optical network path routing computation method of claim 1, wherein the directed graph G is 1 Contains all key nodes and in directed graph G 0 A node in the network can reach the key node; directed graph G 2 Contains all key nodes and in directed graph G 0 The node reachable from the key node.
4. The method according to claim 1, wherein when the calculated available path is no longer used, releasing a key node for calculating the available path, and rejoining the key node in the set S of key nodes.
5. A fast optical network path routing computation apparatus under constraint conditions, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the fast optical network path routing computation method under the constraint conditions according to any one of claims 1 to 4 when executing the computer program.
6. A computer medium, characterized in that the computer medium has stored thereon a computer program which, when being executed by a processor, implements the steps of the fast optical network path routing computation method under constraint conditions according to any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010810138.3A CN111970586B (en) | 2020-08-13 | 2020-08-13 | Rapid optical network path routing calculation method and device under constraint condition and computer medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010810138.3A CN111970586B (en) | 2020-08-13 | 2020-08-13 | Rapid optical network path routing calculation method and device under constraint condition and computer medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111970586A CN111970586A (en) | 2020-11-20 |
| CN111970586B true CN111970586B (en) | 2022-08-02 |
Family
ID=73366025
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010810138.3A Active CN111970586B (en) | 2020-08-13 | 2020-08-13 | Rapid optical network path routing calculation method and device under constraint condition and computer medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111970586B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116911226B (en) * | 2023-08-01 | 2024-03-08 | 上海合见工业软件集团有限公司 | Super node extraction method and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101902406A (en) * | 2010-08-12 | 2010-12-01 | 中兴通讯股份有限公司 | Method and device for calculating path |
| CN102202000A (en) * | 2011-06-14 | 2011-09-28 | 重庆邮电大学 | Routing selection method based on node property in social transportation in opportunistic network |
| CN107017618A (en) * | 2017-03-15 | 2017-08-04 | 中国电力科学研究院 | A kind of active power distribution network division of the power supply area method and device |
| CN108108855A (en) * | 2018-01-11 | 2018-06-01 | 南京航空航天大学 | A kind of pipeline paths planning method |
| CN110011913A (en) * | 2019-03-20 | 2019-07-12 | 烽火通信科技股份有限公司 | A kind of path calculation method and system |
| CN110489598A (en) * | 2019-07-05 | 2019-11-22 | 中国联合网络通信集团有限公司 | A kind of user's group dividing method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6847614B2 (en) * | 1998-04-20 | 2005-01-25 | Broadcom Corporation | Apparatus and method for unilateral topology discovery in network management |
-
2020
- 2020-08-13 CN CN202010810138.3A patent/CN111970586B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101902406A (en) * | 2010-08-12 | 2010-12-01 | 中兴通讯股份有限公司 | Method and device for calculating path |
| CN102202000A (en) * | 2011-06-14 | 2011-09-28 | 重庆邮电大学 | Routing selection method based on node property in social transportation in opportunistic network |
| CN107017618A (en) * | 2017-03-15 | 2017-08-04 | 中国电力科学研究院 | A kind of active power distribution network division of the power supply area method and device |
| CN108108855A (en) * | 2018-01-11 | 2018-06-01 | 南京航空航天大学 | A kind of pipeline paths planning method |
| CN110011913A (en) * | 2019-03-20 | 2019-07-12 | 烽火通信科技股份有限公司 | A kind of path calculation method and system |
| CN110489598A (en) * | 2019-07-05 | 2019-11-22 | 中国联合网络通信集团有限公司 | A kind of user's group dividing method and device |
Non-Patent Citations (3)
| Title |
|---|
| T.M. Rao ; Sandeep Mitra ; James Zollweg.Route allocation for multiple snowplows using genetic algorithms.《2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC)》.2012,全文. * |
| 余绪金 ; 许俊."一种基于有向图的高速公路多义性路径贝叶斯识别方法".《公路交通科技》.2018,全文. * |
| 秦进 ; 谭宇超 ; 张威 ; 申纯燕 ; 赵成.基于时空网络的城际高速铁路列车开行方案优化方法.《铁道学报》.2020,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111970586A (en) | 2020-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100544008B1 (en) | Costs in data networks | |
| Orda | Routing with end-to-end QoS guarantees in broadband networks | |
| US7076537B2 (en) | Designing interconnect fabrics | |
| US6385201B1 (en) | Topology aggregation using parameter obtained by internodal negotiation | |
| US7561534B2 (en) | Methods of network routing having improved resistance to faults affecting groups of links subject to common risks | |
| CA1335836C (en) | Adaptive routing system | |
| US6370119B1 (en) | Computing the widest shortest path in high-speed networks | |
| US7907596B2 (en) | Valley-free shortest path method | |
| JPH0241053A (en) | Method of selecting route in data communication network | |
| US20020191545A1 (en) | Methods and apparatus for selecting multiple paths taking into account shared risk | |
| US8745265B2 (en) | Interconnection fabric connection | |
| CN111770019A (en) | Q-learning optical network-on-chip self-adaptive route planning method based on Dijkstra algorithm | |
| US5999517A (en) | Summarization of routing information in a hierarchical network | |
| Georgiadis et al. | Lexicographically optimal balanced networks | |
| CN113992259B (en) | Method for constructing time slot resource expansion graph | |
| CN111970586B (en) | Rapid optical network path routing calculation method and device under constraint condition and computer medium | |
| EP1135000A1 (en) | Link aggregation | |
| JP2017500816A (en) | Traffic engineering for large data center networks | |
| CN109429117A (en) | Route selection method and equipment | |
| US6731608B2 (en) | Complex node representations in PNNI systems | |
| CN100518382C (en) | Shortest path searching method and device under multi-restraint conditions in automatic switching optical network | |
| KR20070115893A (en) | Method for iterative routing with the aid of a path-dependent routing metric | |
| JP6637911B2 (en) | Network design apparatus, network design method, and network design processing program | |
| JP3801951B2 (en) | Route selection method | |
| CN117135110B (en) | Self-adaptive routing method, device, system, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |