WO2019153726A1 - 源端网元至宿端网元间的多层最短路由寻路方法及系统 - Google Patents

源端网元至宿端网元间的多层最短路由寻路方法及系统 Download PDF

Info

Publication number
WO2019153726A1
WO2019153726A1 PCT/CN2018/103181 CN2018103181W WO2019153726A1 WO 2019153726 A1 WO2019153726 A1 WO 2019153726A1 CN 2018103181 W CN2018103181 W CN 2018103181W WO 2019153726 A1 WO2019153726 A1 WO 2019153726A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
network element
current
shortest
layer
Prior art date
Application number
PCT/CN2018/103181
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 烽火通信科技股份有限公司
Priority to BR112020000918-0A priority Critical patent/BR112020000918A2/pt
Publication of WO2019153726A1 publication Critical patent/WO2019153726A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation

Definitions

  • the invention relates to the technical field of telecommunication transmission network management, and particularly relates to a method and system for finding a multi-layer shortest path between a source network element and a sink network element.
  • the shortest path from the source network element to the sink network element is required to forward the packet.
  • the shortest path from the source network element to the sink network element has multiple processes for processing different services.
  • the intermediate network element (the route between the network elements handling the same service is continuous), so the shortest path from the source network element to the sink network element is divided into multiple layers from the inside to the outside according to the service type (each level corresponds to 1 type of service).
  • Each layer of the path passes through all the network elements responsible for processing the services of the layer.
  • the network element to which the start and end points of each layer path belong are different.
  • the network element to which the start and end points of the outermost path belong is the source network element and the sink network element.
  • the start and end points of other layer paths are in the intermediate network. Yuan.
  • the OTN Optical Transport Network
  • the services under the OTN include OCH (Optical Channel), OMS (Optical Mutiplex Section), and OTS (Optical Transport Section).
  • the optical transmission segment that is, the shortest path from the source network element to the sink network element of the OTN includes a 3-layer path, an innermost OTS layer, an intermediate layer OMS layer, and an outermost OCH layer.
  • Each layer path includes the shortest path of the layer (the intra-network element routing of each network element and the inter-network element routing of the adjacent network element of the layer); the intra-network element routing includes the input port, the output port of the network element, and A series of optical fibers and ports that connect the input port to the output port.
  • the inter-network route includes a link between adjacent NEs and a port connected to the link (the output port and neighbor of one NE) The input port of the network element).
  • the method for finding the shortest path from the source network element to the sink network element of the telecommunication service is generally: first finding the shortest path of each layer under the telecommunication service, and then forming the source network according to the shortest path of each layer. The route from the source to the shortest path of the sink network element.
  • the existing method for finding the shortest path from the source network element to the sink network element of the telecommunication service has the following drawbacks:
  • the above method searches for the shortest path of each level according to different types of service types, so that the path finding method of the shortest path of each level is different.
  • new methods are needed. Increase the path finding method for the shortest path of this type of service level. Therefore, the above method can only be applied to the shortest path of the specified level.
  • the shortest path of the source network element to the sink network element is not complete enough.
  • the user needs to understand the nesting relationship between the path of each layer on the shortest path from the source source to the sink network element.
  • the above method separately finds the shortest path of each level.
  • the path of each layer is relatively independent, so that the nested relationship between the paths of the layers is not displayed on the shortest path from the source NE to the sink, and there are duplicate routes of the paths (such as network elements). 2 is the starting point of the middle layer and the outermost network element, then the repeated routes of the two network elements 2 are displayed on the shortest path. Therefore, the above method is difficult to meet the needs of users.
  • the technical problem solved by the present invention is to solve the shortest path of the source network element to the sink network element. Fully meet the needs of users and suitable for promotion.
  • the multi-layer shortest path between the source network element and the sink network element is a pathfinding method, and includes the following steps:
  • S1 determining an output port and an input port of each network element through which the outermost path passes, the source network element is the starting network element, and the sinking network element is the destination network element, and the process proceeds to S2;
  • S2 determining, according to each network element passing through the outermost path, the starting network element and the ending network element of each layer path, and going to S3;
  • the shortest path of the layer path is formed according to the starting network element and the ending network element of each layer path, and the input port and the output port of each network element through which the layer path passes.
  • S4 shortest path of each layer path formed in S3, nested to form a route of the shortest path from the remote network element to the sink network element.
  • the process of S1 includes:
  • S102 Using the shortest path algorithm, select one output port from all the output ports as the output port of the source network element; determine the network element connected to the output port of the source network element, and configure the current network element and the source network element Connect the port as the input port of the current network element, go to S103;
  • S103 Determine whether the current network element is a sink network element, and if yes, go to S104, otherwise, after the intermediate network element is used as the starting network element, go to S101;
  • S104 Determine an output port corresponding to the sink network element input port.
  • the starting port of the layer path exists in the starting network element of each layer path in S2, and the end point port of the layer path exists in the ending network element of each layer path.
  • the process of S3 includes:
  • S302 Determine a network intra-network route of each network element that the current path passes, and the intra-network element route includes a network element input port, a network element output port, and an optical fiber required for connecting the network element input port and the output port; determining the current path
  • the inter-network element routing of the adjacent network element, the inter-network element routing includes the connection port of the adjacent network element, and the link between the connection ports, and the process proceeds to S303;
  • S304 Determine a route within the connected network element of the outer path adjacent to the current path, where the route in the connected network element includes the intra-network element route of the starting point network element of the outer path adjacent to the current path, and the adjacent outer path of the current path
  • the intra-network element routing of the destination network element determining the route between the connected network elements of the outer path adjacent to the current path, and the route connecting the network elements includes the starting network element of the current path, and the starting network of the outer path adjacent to the current path
  • S305 The intra-network element route of each network element that passes through the current path, the inter-network element route of the neighboring network element on the current path, the connected network element inner path of the outer path adjacent to the current path, and the current path neighboring.
  • the shortest path of the current path is formed according to the intra-network element routing of each network element that passes through the current path and the inter-network element routing of the neighboring network element on the current path.
  • the multi-layer shortest path between the source network element and the sink network element provided by the present invention is provided by the path finding system, including the path network element path finding module, the path start and end network element determining module and the path shortest path by the splicing module;
  • the path network element path finding module is configured to: determine an output port and an input port of each network element through which the outermost path passes, the source network element is a start network element, and the sink end network element is an end network element, and the path starting and ending network
  • the determining unit sends a start and stop network element determining signal
  • the path start and end network element determining module is configured to: after receiving the path start and end network element determining signal, determine the starting network element and the ending network element of each layer path according to each network element passing through the outermost path, and the shortest path to the path is spliced by the splicing module The shortest path of the transmission path is the splicing signal;
  • the shortest path of the path is used by the splicing module: after the shortest path of the received path is formed by the splicing signal, the layer is formed according to the starting network element and the ending network element of each layer path, and the input port and output port of each network element through which the layer path passes.
  • the shortest path of the path is.
  • the system further includes a shortest path nesting module, which is configured to: short-circuit the path to be the shortest path of each layer path formed by the splicing module, and nest to form the remote network element to the sink network element.
  • the route of the shortest path is configured to: short-circuit the path to be the shortest path of each layer path formed by the splicing module, and nest to form the remote network element to the sink network element. The route of the shortest path.
  • the workflow of the path network element path finding module includes:
  • Path network element path finding module 01 find all output ports corresponding to the initial network element input port, and enter the process path network element path finding module 02;
  • the path network element path finding module 02 uses the shortest path algorithm, selects one output port from all the output ports as the output port of the source network element; determines the network element connected to the output port of the source network element, and the current network The port connected to the source network element as the input port of the current network element enters the process path network element path finding module 03;
  • the path network element path finding module 03 determines whether the current network element is a sink network element, and if yes, enters the process path network element path finding module 04, otherwise, after the intermediate network element is used as the starting network element, enters the process path network element pathfinding Module 01;
  • Path network element path finding module 04 Determine an output port corresponding to the sink network element input port.
  • the starting port of the layer path exists in the starting network element of each layer path in the path starting and ending network determining module, and the end point port of the layer path exists in the ending network element of each layer path.
  • the path of the shortest path by the splicing module includes:
  • the path shortest path is spliced by the splicing module 01: the innermost path is taken as the current path, and the shortest path into the process path is spliced by the splicing module 02;
  • the shortest path is determined by the splicing module 02: determining the intra-network routing of each network element through which the current path passes, and the intra-network element routing includes the network element input port, the network element output port, and the fiber required for connecting the network element input port and the output port. Determining the inter-network element routing of the adjacent network element on the current path, the inter-network element routing includes the connection port of the adjacent network element, and the link between the connection ports, and the shortest path to the process path is spliced by the splicing module 03;
  • the shortest path is determined by the splicing module 03: whether the current path is the outermost path, and if so, the shortest path to the process path is spliced by the splicing module 06, otherwise the shortest path to the process path is spliced by the splicing module 04;
  • the shortest path is determined by the splicing module 04: determining the route within the connected network element of the outer path adjacent to the current path, and the route within the connected network element includes the intra-network element route of the starting point network element of the outer path adjacent to the current path, and the current path phase The intra-network element routing of the end network element of the neighboring outer path; determining the inter-network element routing of the outer path adjacent to the current path, and the inter-network element routing includes the starting network element of the current path, adjacent to the current path The inter-network element route between the network elements at the beginning of the layer path; the inter-network element path also includes the end network element of the current path, and the inter-network element route between the end network elements of the outer path adjacent to the current path, enters The shortest path of the process path is spliced by module 05;
  • the path shortest path is spliced by the splicing module 05: the intra-network element routing of each network element passing through the current path, the inter-network element routing of the adjacent network element on the current path, and the connecting network element inner routing of the outer path adjacent to the current path, And the route between the connected network elements of the outer path adjacent to the current path, forming the shortest path of the current path, after the outer path adjacent to the current path is re-established as the current path, the shortest path to the process path is spliced by the splicing module 03;
  • the path shortest path is formed by the splicing module 06: the intra-network element routing of each network element passing through the current path, and the inter-network element routing of the adjacent network element on the current path, forming the shortest path of the current path.
  • the present invention unifies the shortest path of each hierarchical path by the pathfinding method, thereby significantly improving the versatility and facilitating the expansion; further, the present invention minimizes the shortest path of each hierarchical path when searching for paths.
  • the shortest path of one level is failed by path finding, the shortest path of all levels will be failed by path finding. Therefore, when the shortest path of one level of the present invention is routed, only two cases of simultaneous success and simultaneous failure will occur. Therefore, the occurrence of the shortest path from the source network element to the sink network element in the prior art is not complete.
  • the S4 of the present invention can minimize the shortest path of all layer paths, and form a route of the shortest path from the remote network element to the sink network element, not only showing the path between the layers. Nested relationships, and there are no duplicate routes in the existing routing paths in the nested routing structure, which fully meet the user requirements and are suitable for promotion.
  • Figure 1 is a schematic diagram of a path hierarchy of an OTN
  • FIG. 2 is a flowchart of a method for finding a path for a multi-layer shortest path between a source network element and a sink network element according to an embodiment of the present invention
  • FIG. 3 is a specific flowchart of S1 according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a nested routing structure of an OTN according to an embodiment of the present invention.
  • the multi-layer shortest path between the source network element and the sink network element is used by the path finding method.
  • searching for the shortest path from the source network element to the sink network element of the OTN the following information is first obtained:
  • the layering type of OTN is:
  • the innermost OCH layer path, the starting point of the layer path is the network element of the OCH port of the multiplex disk, and the end point is the network element of the OCH port of the demultiplexing disk;
  • the OMS layer path of the middle layer is the network element of the OMS port of the multiplex disk, and the end point is the network element of the OMS port where the multiplex disk exists;
  • the outermost OTS layer path, the starting point of the layer path is the network element (source network element) where the input port of the optical disk is placed, and the end point is the network element (sink-end network element) where the output port of the optical disk is present.
  • the multi-layer shortest path between the source network element and the sink network element in the embodiment of the present invention is a path finding method, including the following steps:
  • each network element passing through the outermost path includes a source network.
  • Element network element 1
  • sink network element network element 7
  • some intermediate network elements network elements 2 to 6
  • S101 Use a depth-first algorithm to find all output ports corresponding to the start network element input port, and go to S102.
  • S102 using a shortest path algorithm (Dijkstra algorithm in this embodiment, Dijkstra algorithm, proposed by Dutch computer scientist Dixter), selecting one output port from all output ports as the source network element
  • the output port is determined by the network element (network element 2) connected to the output port of the source network element.
  • the port connecting the current network element and the source network element is used as the input port of the current network element, and the process proceeds to S103.
  • S103 Determine whether the current network element is a sink network element, and if yes, go to S104; otherwise, if the intermediate network element is used as the starting network element, go to S101 to continue searching for the next network element.
  • S104 Determine, by using a depth-first algorithm, an output port (sink port) corresponding to an input port of the sink network element (network element 7), where the output port is an end point inside the sink network element, and S1 ends, and goes to S2.
  • the starting network element and the ending network element of each layer path are determined, and the starting port of the layer path exists in the starting network element of each layer path, and each The endpoint port of the layer path exists in the destination network element of the layer path.
  • the starting point of the outermost path OH layer
  • the ending point is located in the network element 7
  • the starting point of the intermediate layer path OMS layer
  • the ending point is located in the network element 6 .
  • the starting point of the innermost path (OTS layer) is located in the network element 3, and the end point is located in the network element 5, and goes to S3.
  • S302 Determine a route within the network element of each network element that the current path passes by using a depth-first algorithm, where the intra-network element includes a network element input port, a network element output port, and a fiber required for connecting the network element input port and the output port. And port.
  • the shortest path algorithm is used to determine the inter-network element routing of the neighboring network elements on the current path.
  • the inter-network element routing includes the connecting port of the neighboring network element and the link between the connecting port and the corresponding port. See FIG.
  • each network element through which the layer path passes is the network element 3 to the network element 5, and the network element 3 and the network element 4 are taken as an example, and the network element between the network element 3 and the network element 4 is routed.
  • the output port of the network element 3, the input port of the network element 4, and the link between the output port of the network element 3 and the input port of the network element 4 are forwarded to S303.
  • S303 Determine whether the current path is the outermost path, if yes, go to S306, otherwise go to S304.
  • S304 Determine, by using a depth-first algorithm, a route within the connected network element of the outer path adjacent to the current path, where the route in the connected network element includes the intra-network element route of the originating network element of the outer path adjacent to the current path, and the current path phase The intra-network element route of the destination NE of the neighboring outer path.
  • the shortest path algorithm is used to determine the route between the connected network elements of the outer path adjacent to the current path, and the route between the connected network elements includes the starting network element of the current path, and the starting network element of the outer path adjacent to the current path
  • the starting network element of the layer is the network element 3
  • the destination network element is the network element 5
  • the adjacent outer path of the OTS layer is the OMS layer
  • the starting network element of the layer is NE 2
  • the destination network element is the network element 6, and the process goes to S305.
  • S305 The intra-network element route of each network element that passes through the current path, the inter-network element route of the neighboring network element on the current path, the connected network element inner path of the outer path adjacent to the current path, and the current path neighboring.
  • the route between the connected network elements of the outer path is spliced to form the shortest path of the current path.
  • the shortest path of each layer path formed in S3 is nested to form a route of the shortest path from the remote network element to the sink network element.
  • the OMS layer path uses the OTS layer path as a routing item, and the OMS layer path uses the OTS layer path as a routing item.
  • the multi-layer shortest path between the source network element and the sink network element in the embodiment of the present invention is a path finding system, including a path network element path finding module, a path start and end network element determining module, a path shortest path by a splicing module, and a shortest path nesting. Module.
  • the path network element path finding module is configured to: determine an output port and an input port of each network element through which the outermost path passes, the source network element is a start network element, and the sink end network element is an end network element, and the path starting and ending network
  • the meta-determination module sends a start and end network element determination signal.
  • the workflow of the path network element path finding module includes:
  • Path network element path finding module 01 find all output ports corresponding to the initial network element input port, and enter the process path network element path finding module 02;
  • the path network element path finding module 02 uses the shortest path algorithm, selects one output port from all the output ports as the output port of the source network element; determines the network element connected to the output port of the source network element, and the current network The port connected to the source network element as the input port of the current network element enters the process path network element path finding module 03;
  • the path network element path finding module 03 determines whether the current network element is a sink network element, and if yes, enters the process path network element path finding module 04, otherwise, after the intermediate network element is used as the starting network element, enters the process path network element pathfinding Module 01;
  • Path network element path finding module 04 Determine an output port corresponding to the sink network element input port.
  • the path start and end network element determining module is configured to: after receiving the path start and end network element determining signal, determine the starting network element and the ending network element of each layer path according to each network element passing through the outermost path, and the shortest path to the path is spliced by the splicing module
  • the shortest path of the sending path is the splicing signal; the starting point port of the layer path exists in the starting network element of each layer path in the path starting and ending network determining module, and the end point port of the layer path exists in the ending network element of each layer path.
  • the shortest path of the path is used by the splicing module: after the shortest path of the received path is formed by the splicing signal, the layer is formed according to the starting network element and the ending network element of each layer path, and the input port and output port of each network element through which the layer path passes.
  • the shortest path of the path is.
  • the shortest path of the path by the splicing module includes:
  • the path shortest path is spliced by the splicing module 01: the innermost path is taken as the current path, and the shortest path into the process path is spliced by the splicing module 02;
  • the shortest path is determined by the splicing module 02: determining the intra-network routing of each network element through which the current path passes, and the intra-network element routing includes the network element input port, the network element output port, and the fiber required for connecting the network element input port and the output port. Determining the inter-network element routing of the adjacent network element on the current path, the inter-network element routing includes the connection port of the adjacent network element, and the link between the connection ports, and the shortest path to the process path is spliced by the splicing module 03;
  • the shortest path is determined by the splicing module 03: whether the current path is the outermost path, and if so, the shortest path to the process path is spliced by the splicing module 06, otherwise the shortest path to the process path is spliced by the splicing module 04;
  • the shortest path is determined by the splicing module 04: determining the route within the connected network element of the outer path adjacent to the current path, and the route within the connected network element includes the intra-network element route of the starting point network element of the outer path adjacent to the current path, and the current path phase The intra-network element routing of the end network element of the neighboring outer path; determining the inter-network element routing of the outer path adjacent to the current path, and the inter-network element routing includes the starting network element of the current path, adjacent to the current path The inter-network element route between the network elements at the beginning of the layer path; the inter-network element path also includes the end network element of the current path, and the inter-network element route between the end network elements of the outer path adjacent to the current path, enters The shortest path of the process path is spliced by module 05;
  • the path shortest path is spliced by the splicing module 05: the intra-network element routing of each network element passing through the current path, the inter-network element routing of the adjacent network element on the current path, and the connecting network element inner routing of the outer path adjacent to the current path, And the route between the connected network elements of the outer path adjacent to the current path, forming the shortest path of the current path, after the outer path adjacent to the current path is re-established as the current path, the shortest path to the process path is spliced by the splicing module 03;
  • the path shortest path is formed by the splicing module 06: the intra-network element routing of each network element passing through the current path, and the inter-network element routing of the adjacent network element on the current path, forming the shortest path of the current path.
  • the shortest path nesting module is used to: short the path to the shortest path of each layer path formed by the splicing module, and nest the route forming the shortest path from the remote network element to the sink network element.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明公开了一种源端网元和宿端网元间的多层最短路由寻路方法及系统，涉及电信传输网管理技术领域。该方法的步骤包括：S1：确定最外层路径经过的每个网元的输出端口和输入端口，源端网元为起始网元，宿端网元为终点网元；S2：根据最外层路径经过的每个网元，确定每层路径的起点网元和终点网元；S3：根据每层路径的起点网元和终点网元、以及该层路径经过的每个网元的输入端口和输出端口，形成该层路径的最短路由。本发明能够统一每个层次路径的最短路由的寻路方法，进而能够保证源端网元至宿端网元的最短路径的完整，充分的满足了用户需求，适于推广。

Description

源端网元至宿端网元间的多层最短路由寻路方法及系统 技术领域
本发明涉及电信传输网管理技术领域，具体涉及一种源端网元和宿端网元间的多层最短路由寻路方法及系统。
背景技术
在管理电信业务的过程中，需要寻找源端网元至宿端网元的最短路径来转发报文，由于源端网元至宿端网元的最短路径上，会存在多个负责处理不同业务的中间网元(处理相同业务的网元之间的路由连续)，因此源端网元至宿端网元的最短路径会按照业务类型，从内至外分为多层路径(每个层次对应1种业务类型)，每层路径会经过负责处理该层业务的所有网元。每层路径的起点和终点所属的网元都不相同，最外层路径的起点和终点所属的网元即是源端网元和宿端网元，其他层路径的起点和终点都在中间网元上。
参见图1所示，电信业务以OTN(OpticalTransportNetwork，光传送网)为例，OTN下的业务包括OCH(Optical Channel，光通道)、OMS(Optical Mutiplex Section，光复用段)和OTS(Optical Transport Section，光传输段)，即OTN的源端网元至宿端网元的最短路径包括3层路径，最内层的OTS层、中间层的OMS层、以及最外层的OCH层。
每层路径均包括该层次的最短路由(每个网元的网元内路由、以及该层次相邻网元的网元间路由)；网元内路由包括网元的输入端口、输出端口、以及网元内部连接输入端口至输出端口的一系列光纤和端 口；网元间路由包括连接相邻网元之间的链路、以及该链路连接的端口(1个网元的输出端口和相邻网元的输入端口)。
现有的寻找电信业务的源端网元至宿端网元的最短路径的方法一般为：先寻找该电信业务下的每个层次的最短路由，再根据每个层次的最短路由形成源端网元至宿端网元的最短路径的路由。但是，现有的寻找电信业务的源端网元至宿端网元的最短路径的方法存在以下缺陷：
上述方法在寻找每个层次的最短路径时，根据不同层次的业务类型分别寻找各个层次的最短路由，进而使得每个层次的最短路径的寻路方法不同，当出现不同类型的业务时，需要新增该类型业务层次的最短路由的寻路方法。因此，上述方法只能适用于指定层次的最短路径，不仅通用性较差，难以扩展，而且任意层次的最短路径寻路失败，都会导致源端网元至宿端网元的最短路径不够完整。
与此同时，随着业务层次的增多，用户需要在最终源端网元至宿端网元的最短路径上，了解各层路径之间的嵌套关系；而上述方法分别寻找各个层次的最短路径，会导致各层路径相对独立，进而使得最终源端网元至宿端网元的最短路径上无法显示各层路径之间的嵌套关系，而且会存在各层次路径的重复路由(例如网元2既是中间层的起点，又是最外层的网元，则最短路径上会显示两个网元2的重复路由)因此，上述方法难以满足用户的需求。
发明内容
针对现有技术中存在的缺陷，本发明解决的技术问题为：如何统一每个层次路径的最短路由的寻路方法，本发明能够保证源端网元至宿端网元的最短路径的完整，充分的满足了用户需求，适于推广。
为达到以上目的，本发明提供的源端网元和宿端网元间的多层最 短路由寻路方法，包括以下步骤：
S1：确定最外层路径经过的每个网元的输出端口和输入端口，源端网元为起始网元，宿端网元为终点网元，转到S2；
S2：根据最外层路径经过的每个网元，确定每层路径的起点网元和终点网元，转到S3；
S3：根据每层路径的起点网元和终点网元、以及该层路径经过的每个网元的输入端口和输出端口，形成该层路径的最短路由。
在上述技术方案的基础上，S3之后还包括以下步骤：S4：将S3中形成的每层路径的最短路由，嵌套形成远端网元至宿端网元的最短路径的路由。
在上述技术方案的基础上，S1的流程包括：
S101：寻找与起始网元输入端口对应的所有输出端口，转到S102；
S102：使用最短路径算法，从所有输出端口中选择1个输出端口，作为源端网元的输出端口；确定与源端网元的输出端口连接的网元，将当前网元与源端网元连接的端口，作为当前网元的输入端口，转到S103；
S103：判断当前网元是否为宿端网元，若是，转到S104，否则将中间网元作为起始网元后，转到S101；
S104：确定与宿端网元输入端口对应的输出端口。
在上述技术方案的基础上，S2中所述每层路径的起点网元中存在该层路径的起点端口，每层路径的终点网元中存在该层路径的终点端口。
在上述技术方案的基础上，S3的流程包括：
S301：将最内层路径作为当前路径，转到S302；
S302：确定当前路径经过的每个网元的网元内路由，网元内路由包括网元输入端口、网元输出端口、以及网元输入端口和输出端口连接所需的光纤；确定当前路径上相邻网元的网元间路由，网元间路由包括相邻网元的连接端口、以及连接端口之间的链路，转到S303；
S303：判断当前路径是否为最外层路径，若是，转到S306，否则转到S304；
S304：确定当前路径相邻的外层路径的连接网元内路由，连接网元内路由包括当前路径相邻的外层路径起点网元的网元内路由、以及当前路径相邻外层路径的终点网元的网元内路由；确定当前路径相邻的外层路径的连接网元间路由，连接网元间路由包括当前路径的起点网元，与当前路径相邻的外层路径的起点网元之间的网元间路由；连接网元间路还包括当前路径的终点网元，与当前路径相邻的外层路径的终点网元之间的网元间路由，转到S305；
S305：根据当前路径经过的每个网元的网元内路由、当前路径上相邻网元的网元间路由、当前路径相邻的外层路径的连接网元内路由、以及当前路径相邻的外层路径的连接网元间路由，形成当前路径的最短路由，将当前路径相邻的外层路径重新作为当前路径后，转到S303；
S306：根据当前路径经过的每个网元的网元内路由、以及当前路径上相邻网元的网元间路由，形成当前路径的最短路由。
本发明提供的源端网元和宿端网元间的多层最短路由寻路系统，包括路径网元寻路模块、路径起止网元确定模块和路径最短路由拼接模块；
路径网元寻路模块用于：确定最外层路径经过的每个网元的输出端口和输入端口，源端网元为起始网元，宿端网元为终点网元，向路 径起止网元确定模块发送路径起止网元确定信号；
路径起止网元确定模块用于：收到路径起止网元确定信号后，根据最外层路径经过的每个网元，确定每层路径的起点网元和终点网元，向路径最短路由拼接模块发送路径最短路由拼接信号；
路径最短路由拼接模块用于：收到路径最短路由拼接信号后，根据每层路径的起点网元和终点网元、以及该层路径经过的每个网元的输入端口和输出端口，形成该层路径的最短路由。
在上述技术方案的基础上，该系统还包括最短路径嵌套模块，其用于：将路径最短路由拼接模块形成的每层路径的最短路由，嵌套形成远端网元至宿端网元的最短路径的路由。
在上述技术方案的基础上，所述路径网元寻路模块的工作流程包括：
路径网元寻路模块01：寻找与起始网元输入端口对应的所有输出端口，进入流程路径网元寻路模块02；
路径网元寻路模块02：使用最短路径算法，从所有输出端口中选择1个输出端口，作为源端网元的输出端口；确定与源端网元的输出端口连接的网元，将当前网元与源端网元连接的端口，作为当前网元的输入端口，进入流程路径网元寻路模块03；
路径网元寻路模块03：判断当前网元是否为宿端网元，若是，进入流程路径网元寻路模块04，否则将中间网元作为起始网元后，进入流程路径网元寻路模块01；
路径网元寻路模块04：确定与宿端网元输入端口对应的输出端口。
在上述技术方案的基础上，所述路径起止网元确定模块中的每层路径的起点网元中存在该层路径的起点端口，每层路径的终点网元中 存在该层路径的终点端口。
在上述技术方案的基础上，所述路径最短路由拼接模块的流程包括：
路径最短路由拼接模块01：将最内层路径作为当前路径，进入流程路径最短路由拼接模块02；
路径最短路由拼接模块02：确定当前路径经过的每个网元的网元内路由，网元内路由包括网元输入端口、网元输出端口、以及网元输入端口和输出端口连接所需的光纤；确定当前路径上相邻网元的网元间路由，网元间路由包括相邻网元的连接端口、以及连接端口之间的链路，进入流程路径最短路由拼接模块03；
路径最短路由拼接模块03：判断当前路径是否为最外层路径，若是，进入流程路径最短路由拼接模块06，否则进入流程路径最短路由拼接模块04；
路径最短路由拼接模块04：确定当前路径相邻的外层路径的连接网元内路由，连接网元内路由包括当前路径相邻的外层路径起点网元的网元内路由、以及当前路径相邻外层路径的终点网元的网元内路由；确定当前路径相邻的外层路径的连接网元间路由，连接网元间路由包括当前路径的起点网元，与当前路径相邻的外层路径的起点网元之间的网元间路由；连接网元间路还包括当前路径的终点网元，与当前路径相邻的外层路径的终点网元之间的网元间路由，进入流程路径最短路由拼接模块05；
路径最短路由拼接模块05：根据当前路径经过的每个网元的网元内路由、当前路径上相邻网元的网元间路由、当前路径相邻的外层路径的连接网元内路由、以及当前路径相邻的外层路径的连接网元间路由，形成当前路径的最短路由，将当前路径相邻的外层路径重新作 为当前路径后，进入流程路径最短路由拼接模块03；
路径最短路由拼接模块06：根据当前路径经过的每个网元的网元内路由、以及当前路径上相邻网元的网元间路由，形成当前路径的最短路由。
与现有技术相比，本发明的优点在于：
参见本发明S1至S3可知，本发明统一了每个层次路径的最短路由寻路方法，进而显著提高了通用性，便于扩展；进一步，本发明将每个层次路径的最短路由在寻路时相互关联，若1个层次的最短路由寻路失败，则会导致所有层次的最短路由寻路失败，因此本发明的1个层次的最短路由寻路时，只会出现同时成功和同时失败2种情形，进而避免了出现现有技术中源端网元至宿端网元的最短路径不够完整的情况发生。
在此基础上，参见本发明S4可知，本发明能够将所有层路径的最短路由，嵌套形成远端网元至宿端网元的最短路径的路由，不仅显示了显示各层路径之间的嵌套关系，而且嵌套的路由结构中不会出现现有技术中存在各层次路径的重复路由，充分的满足了用户需求，适于推广。
附图说明
图1为OTN的路径层次示意图；
图2为本发明实施例中的源端网元和宿端网元间的多层最短路由寻路方法的流程图；
图3为本发明实施例中S1的具体流程图；
图4为本发明实施例中S3的具体流程图；
图5为本发明实施例中OTN的嵌套型路由结构示意图。
具体实施方式
以下结合附图及实施例对本发明作进一步详细说明。
本发明实施例中的源端网元和宿端网元间的多层最短路由寻路方法，应用在寻找OTN的源端网元至宿端网元的最短路径上时，首先获取以下信息：
1、源端网元、宿端网元、源端网元至宿端网元的最短路径的分层类型；
2、每层路径的内外关系；
3、每层路径的起点端口和终点端口。
参见图1所示，OTN的分层类型为：
最内层的OCH层路径，该层路径的起点为存在合波盘的OCH端口的网元，终点为存在分波盘的OCH端口的网元；
中间层的OMS层路径，该层路径的起点为存在合波盘的OMS端口的网元，终点为存在分波盘的OMS端口的网元；
最外层的OTS层路径，该层路径的起点为存在光放盘的输入端口的网元(源端网元)，终点为存在光放盘的输出端口的网元(宿端网元)。
在此基础上，本发明实施例中的源端网元和宿端网元间的多层最短路由寻路方法，包括以下步骤：
S1：参见图2所示，确定最外层路径经过的每个网元的输出端口和输入端口；参见图1所示，最外层路径(OCH层)经过的每个网元包括源端网元(网元1)、宿端网元(网元7)、以及源端网元至宿端网元之间的若干中间网元(网元2至6)；源端网元为起始网元，源端网元的源端口即为输入端口，宿端网元为终点网元，转到S2。
参见图1和图3所示，S1的具体流程为：
S101：使用深度优先算法，寻找与起始网元输入端口对应的所有输出端口，转到S102。
S102：使用最短路径算法(本实施例中为Dijkstra算法，迪杰斯特拉算法，由荷兰计算机科学家狄克斯特提出)，从所有输出端口中选择1个输出端口，作为源端网元的输出端口；确定与源端网元的输出端口连接的网元(网元2)，将当前网元与源端网元连接的端口，作为当前网元的输入端口，转到S103。
S103：判断当前网元是否为宿端网元，若是，转到S104，否则将中间网元作为起始网元后，转到S101继续寻找下一个网元。
S104：使用深度优先算法，确定与宿端网元(网元7)输入端口对应的输出端口(宿端口)，该输出端口即为宿端网元内部的终点，S1结束，转到S2。
S2：参见图2所示，根据最外层路径经过的每个网元，确定每层路径的起点网元和终点网元，每层路径的起点网元中存在该层路径的起点端口，每层路径的终点网元中存在该层路径的终点端口。参见图1所示，最外层路径(OCH层)的起点位于网元1内，终点位于网元7内，中间层路径(OMS层)的起点位于网元2内，终点位于网元6内，最内层路径(OTS层)的起点位于网元3内，终点位于网元5内，转到S3。
S3：参见图2所示，根据每层路径的起点网元、终点网元、以及该层路径经过的每个网元的输入端口和输出端口，形成该层路径的最短路由，转到S4。
参见图4所示，S3的具体流程为：
S301：将最内层路径作为当前路径，转到S302。
S302：使用深度优先算法，确定当前路径经过的每个网元的网元 内路由，网元内路由包括网元输入端口、网元输出端口、以及网元输入端口和输出端口连接所需的光纤和端口。使用最短路径算法，确定当前路径上相邻网元的网元间路由，网元间路由包括相邻网元的连接端口、以及连接端口之间的链路和对应的端口；参见图5所示，当前路径为OTS层时，该层路径经过的每个网元为网元3至网元5，以网元3和网元4为例，以网元3和网元4的网元间路由包括网元3的输出端口、网元4的输入端口、以及网元3的输出端口和网元4的输入端口之间的链路和中间端口，转到S303。
S303：判断当前路径是否为最外层路径，若是，转到S306，否则转到S304。
S304：使用深度优先算法，确定当前路径相邻的外层路径的连接网元内路由，连接网元内路由包括当前路径相邻的外层路径起点网元的网元内路由、以及当前路径相邻外层路径的终点网元的网元内路由。使用最短路径算法，确定当前路径相邻的外层路径的连接网元间路由，连接网元间路由包括当前路径的起点网元，与当前路径相邻的外层路径的起点网元之间的网元间路由，以及当前路径的终点网元，与当前路径相邻的外层路径的终点网元之间的网元间路由。参见图5所示，当前路径为OTS层时，该层起点网元为网元3，终点网元为网元5，OTS层的相邻的外层路径为OMS层，该层起点网元为网元2，终点网元为网元6，转到S305。
S305：根据当前路径经过的每个网元的网元内路由、当前路径上相邻网元的网元间路由、当前路径相邻的外层路径的连接网元内路由、以及当前路径相邻的外层路径的连接网元间路由，拼接形成当前路径的最短路由，将当前路径相邻的外层路径重新作为当前路径后，转到S303继续寻找最短路由。
S306：根据当前路径经过的每个网元的网元内路由、以及当前路径上相邻网元的网元间路由，拼接形成当前路径的最短路由，S3结束，转到S4。
S4：参见图2所示，将S3中形成的每层路径的最短路由，嵌套形成远端网元至宿端网元的最短路径的路由。参见图5所示，本实施例嵌套形成得到三个层次嵌套的路由结构，OCH层路径将OMS层路径作为一个路由项，OMS层路径将OTS层路径作为一个路由项。
本发明实施例中的源端网元和宿端网元间的多层最短路由寻路系统，包括路径网元寻路模块、路径起止网元确定模块、路径最短路由拼接模块和最短路径嵌套模块。
路径网元寻路模块用于：确定最外层路径经过的每个网元的输出端口和输入端口，源端网元为起始网元，宿端网元为终点网元，向路径起止网元确定模块发送路径起止网元确定信号。
路径网元寻路模块的工作流程包括：
路径网元寻路模块01：寻找与起始网元输入端口对应的所有输出端口，进入流程路径网元寻路模块02；
路径网元寻路模块02：使用最短路径算法，从所有输出端口中选择1个输出端口，作为源端网元的输出端口；确定与源端网元的输出端口连接的网元，将当前网元与源端网元连接的端口，作为当前网元的输入端口，进入流程路径网元寻路模块03；
路径网元寻路模块03：判断当前网元是否为宿端网元，若是，进入流程路径网元寻路模块04，否则将中间网元作为起始网元后，进入流程路径网元寻路模块01；
路径网元寻路模块04：确定与宿端网元输入端口对应的输出端口。
路径起止网元确定模块用于：收到路径起止网元确定信号后，根据最外层路径经过的每个网元，确定每层路径的起点网元和终点网元，向路径最短路由拼接模块发送路径最短路由拼接信号；路径起止网元确定模块中的每层路径的起点网元中存在该层路径的起点端口，每层路径的终点网元中存在该层路径的终点端口。
路径最短路由拼接模块用于：收到路径最短路由拼接信号后，根据每层路径的起点网元和终点网元、以及该层路径经过的每个网元的输入端口和输出端口，形成该层路径的最短路由。
路径最短路由拼接模块的流程包括：
路径最短路由拼接模块01：将最内层路径作为当前路径，进入流程路径最短路由拼接模块02；
路径最短路由拼接模块02：确定当前路径经过的每个网元的网元内路由，网元内路由包括网元输入端口、网元输出端口、以及网元输入端口和输出端口连接所需的光纤；确定当前路径上相邻网元的网元间路由，网元间路由包括相邻网元的连接端口、以及连接端口之间的链路，进入流程路径最短路由拼接模块03；
路径最短路由拼接模块03：判断当前路径是否为最外层路径，若是，进入流程路径最短路由拼接模块06，否则进入流程路径最短路由拼接模块04；
路径最短路由拼接模块04：确定当前路径相邻的外层路径的连接网元内路由，连接网元内路由包括当前路径相邻的外层路径起点网元的网元内路由、以及当前路径相邻外层路径的终点网元的网元内路由；确定当前路径相邻的外层路径的连接网元间路由，连接网元间路由包括当前路径的起点网元，与当前路径相邻的外层路径的起点网元之间的网元间路由；连接网元间路还包括当前路径的终点网元，与当 前路径相邻的外层路径的终点网元之间的网元间路由，进入流程路径最短路由拼接模块05；
路径最短路由拼接模块05：根据当前路径经过的每个网元的网元内路由、当前路径上相邻网元的网元间路由、当前路径相邻的外层路径的连接网元内路由、以及当前路径相邻的外层路径的连接网元间路由，形成当前路径的最短路由，将当前路径相邻的外层路径重新作为当前路径后，进入流程路径最短路由拼接模块03；
路径最短路由拼接模块06：根据当前路径经过的每个网元的网元内路由、以及当前路径上相邻网元的网元间路由，形成当前路径的最短路由。
最短路径嵌套模块用于：将路径最短路由拼接模块形成的每层路径的最短路由，嵌套形成远端网元至宿端网元的最短路径的路由。
需要说明的是：本发明实施例提供的系统在进行模块间通信时，仅以上述各功能模块的划分进行举例说明，实际应用中，可以根据需要而将上述功能分配由不同的功能模块完成，即将系统的内部结构划分成不同的功能模块，以完成以上描述的全部或者部分功能。
进一步，本发明不局限于上述实施方式，对于本技术领域的普通技术人员来说，在不脱离本发明原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也视为本发明的保护范围之内。本说明书中未作详细描述的内容属于本领域专业技术人员公知的现有技术。

Claims (10)

  1. 一种源端网元和宿端网元间的多层最短路由寻路方法，其特征在于，该方法包括以下步骤：
    S1：确定最外层路径经过的每个网元的输出端口和输入端口，源端网元为起始网元，宿端网元为终点网元，转到S2；
    S2：根据最外层路径经过的每个网元，确定每层路径的起点网元和终点网元，转到S3；
    S3：根据每层路径的起点网元和终点网元、以及该层路径经过的每个网元的输入端口和输出端口，形成该层路径的最短路由。
  2. 如权利要求1所述的源端网元和宿端网元间的多层最短路由寻路方法，其特征在于，S3之后还包括以下步骤：S4：将S3中形成的每层路径的最短路由，嵌套形成远端网元至宿端网元的最短路径的路由。
  3. 如权利要求1或2所述的源端网元和宿端网元间的多层最短路由寻路方法，其特征在于，S1的流程包括：
    S101：寻找与起始网元输入端口对应的所有输出端口，转到S102；
    S102：使用最短路径算法，从所有输出端口中选择1个输出端口，作为源端网元的输出端口；确定与源端网元的输出端口连接的网元，将当前网元与源端网元连接的端口，作为当前网元的输入端口，转到S103；
    S103：判断当前网元是否为宿端网元，若是，转到S104，否则将中间网元作为起始网元后，转到S101；
    S104：确定与宿端网元输入端口对应的输出端口。
  4. 如权利要求1或2所述的源端网元和宿端网元间的多层最短路由寻路方法，其特征在于，S2中所述每层路径的起点网元中存在 该层路径的起点端口，每层路径的终点网元中存在该层路径的终点端口。
  5. 如权利要求1或2所述的源端网元和宿端网元间的多层最短路由寻路方法，其特征在于，S3的流程包括：
    S301：将最内层路径作为当前路径，转到S302；
    S302：确定当前路径经过的每个网元的网元内路由，网元内路由包括网元输入端口、网元输出端口、以及网元输入端口和输出端口连接所需的光纤；确定当前路径上相邻网元的网元间路由，网元间路由包括相邻网元的连接端口、以及连接端口之间的链路，转到S303；
    S303：判断当前路径是否为最外层路径，若是，转到S306，否则转到S304；
    S304：确定当前路径相邻的外层路径的连接网元内路由，连接网元内路由包括当前路径相邻的外层路径起点网元的网元内路由、以及当前路径相邻外层路径的终点网元的网元内路由；确定当前路径相邻的外层路径的连接网元间路由，连接网元间路由包括当前路径的起点网元，与当前路径相邻的外层路径的起点网元之间的网元间路由；连接网元间路还包括当前路径的终点网元，与当前路径相邻的外层路径的终点网元之间的网元间路由，转到S305；
    S305：根据当前路径经过的每个网元的网元内路由、当前路径上相邻网元的网元间路由、当前路径相邻的外层路径的连接网元内路由、以及当前路径相邻的外层路径的连接网元间路由，形成当前路径的最短路由，将当前路径相邻的外层路径重新作为当前路径后，转到S303；
    S306：根据当前路径经过的每个网元的网元内路由、以及当前路径上相邻网元的网元间路由，形成当前路径的最短路由。
  6. 一种源端网元和宿端网元间的多层最短路由寻路系统，其特 征在于：该系统包括路径网元寻路模块、路径起止网元确定模块和路径最短路由拼接模块；
    路径网元寻路模块用于：确定最外层路径经过的每个网元的输出端口和输入端口，源端网元为起始网元，宿端网元为终点网元，向路径起止网元确定模块发送路径起止网元确定信号；
    路径起止网元确定模块用于：收到路径起止网元确定信号后，根据最外层路径经过的每个网元，确定每层路径的起点网元和终点网元，向路径最短路由拼接模块发送路径最短路由拼接信号；
    路径最短路由拼接模块用于：收到路径最短路由拼接信号后，根据每层路径的起点网元和终点网元、以及该层路径经过的每个网元的输入端口和输出端口，形成该层路径的最短路由。
  7. 如权利要求6所述的源端网元和宿端网元间的多层最短路由寻路系统，其特征在于：该系统还包括最短路径嵌套模块，其用于：将路径最短路由拼接模块形成的每层路径的最短路由，嵌套形成远端网元至宿端网元的最短路径的路由。
  8. 如权利要求6或7所述的源端网元和宿端网元间的多层最短路由寻路系统，其特征在于：所述路径网元寻路模块的工作流程包括：
    路径网元寻路模块01：寻找与起始网元输入端口对应的所有输出端口，进入流程路径网元寻路模块02；
    路径网元寻路模块02：使用最短路径算法，从所有输出端口中选择1个输出端口，作为源端网元的输出端口；确定与源端网元的输出端口连接的网元，将当前网元与源端网元连接的端口，作为当前网元的输入端口，进入流程路径网元寻路模块03；
    路径网元寻路模块03：判断当前网元是否为宿端网元，若是，进入流程路径网元寻路模块04，否则将中间网元作为起始网元后， 进入流程路径网元寻路模块01；
    路径网元寻路模块04：确定与宿端网元输入端口对应的输出端口。
  9. 如权利要求6或7所述的源端网元和宿端网元间的多层最短路由寻路系统，其特征在于：所述路径起止网元确定模块中的每层路径的起点网元中存在该层路径的起点端口，每层路径的终点网元中存在该层路径的终点端口。
  10. 如权利要求6或7所述的源端网元和宿端网元间的多层最短路由寻路系统，其特征在于：所述路径最短路由拼接模块的流程包括：
    路径最短路由拼接模块01：将最内层路径作为当前路径，进入流程路径最短路由拼接模块02；
    路径最短路由拼接模块02：确定当前路径经过的每个网元的网元内路由，网元内路由包括网元输入端口、网元输出端口、以及网元输入端口和输出端口连接所需的光纤；确定当前路径上相邻网元的网元间路由，网元间路由包括相邻网元的连接端口、以及连接端口之间的链路，进入流程路径最短路由拼接模块03；
    路径最短路由拼接模块03：判断当前路径是否为最外层路径，若是，进入流程路径最短路由拼接模块06，否则进入流程路径最短路由拼接模块04；
    路径最短路由拼接模块04：确定当前路径相邻的外层路径的连接网元内路由，连接网元内路由包括当前路径相邻的外层路径起点网元的网元内路由、以及当前路径相邻外层路径的终点网元的网元内路由；确定当前路径相邻的外层路径的连接网元间路由，连接网元间路由包括当前路径的起点网元，与当前路径相邻的外层路径的起点网元之间的网元间路由；连接网元间路还包括当前路径的终点网元，与当 前路径相邻的外层路径的终点网元之间的网元间路由，进入流程路径最短路由拼接模块05；
    路径最短路由拼接模块05：根据当前路径经过的每个网元的网元内路由、当前路径上相邻网元的网元间路由、当前路径相邻的外层路径的连接网元内路由、以及当前路径相邻的外层路径的连接网元间路由，形成当前路径的最短路由，将当前路径相邻的外层路径重新作为当前路径后，进入流程路径最短路由拼接模块03；
    路径最短路由拼接模块06：根据当前路径经过的每个网元的网元内路由、以及当前路径上相邻网元的网元间路由，形成当前路径的最短路由。
PCT/CN2018/103181 2018-02-09 2018-08-30 源端网元至宿端网元间的多层最短路由寻路方法及系统 WO2019153726A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
BR112020000918-0A BR112020000918A2 (pt) 2018-02-09 2018-08-30 método e sistema de descoberta de caminho de rota mais curta multicamadas entre o elemento de rede final de origem e o elemento de rede final de destino.

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810133853.0 2018-02-09
CN201810133853.0A CN108429681B (zh) 2018-02-09 2018-02-09 源端网元至宿端网元间的多层最短路由寻路方法及系统

Publications (1)

Publication Number Publication Date
WO2019153726A1 true WO2019153726A1 (zh) 2019-08-15

Family

ID=63156682

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/103181 WO2019153726A1 (zh) 2018-02-09 2018-08-30 源端网元至宿端网元间的多层最短路由寻路方法及系统

Country Status (3)

Country Link
CN (1) CN108429681B (zh)
BR (1) BR112020000918A2 (zh)
WO (1) WO2019153726A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112492414A (zh) * 2020-11-18 2021-03-12 国家电网有限公司 一种光传送网光信号故障仿真的实现方法
CN114448863A (zh) * 2022-01-06 2022-05-06 武汉烽火技术服务有限公司 一种寻找跨域路径的计算方法和装置

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108429681B (zh) * 2018-02-09 2019-08-20 烽火通信科技股份有限公司 源端网元至宿端网元间的多层最短路由寻路方法及系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1972521A (zh) * 2005-11-25 2007-05-30 华为技术有限公司 一种构造端到端波分路径的方法
CN1983953A (zh) * 2005-12-12 2007-06-20 中兴通讯股份有限公司 传送网层网络管理系统中的路径搜索方法
CN101145962A (zh) * 2007-07-24 2008-03-19 中兴通讯股份有限公司 一种波分设备的路径计算方法
CN105072035A (zh) * 2015-08-27 2015-11-18 中国电信股份有限公司 一种光传送网原子路由的生成方法和系统
WO2016095605A1 (zh) * 2014-12-16 2016-06-23 中兴通讯股份有限公司 业务处理方法及装置
CN108429681A (zh) * 2018-02-09 2018-08-21 烽火通信科技股份有限公司 源端网元至宿端网元间的多层最短路由寻路方法及系统

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1972521A (zh) * 2005-11-25 2007-05-30 华为技术有限公司 一种构造端到端波分路径的方法
CN1983953A (zh) * 2005-12-12 2007-06-20 中兴通讯股份有限公司 传送网层网络管理系统中的路径搜索方法
CN101145962A (zh) * 2007-07-24 2008-03-19 中兴通讯股份有限公司 一种波分设备的路径计算方法
WO2016095605A1 (zh) * 2014-12-16 2016-06-23 中兴通讯股份有限公司 业务处理方法及装置
CN105072035A (zh) * 2015-08-27 2015-11-18 中国电信股份有限公司 一种光传送网原子路由的生成方法和系统
CN108429681A (zh) * 2018-02-09 2018-08-21 烽火通信科技股份有限公司 源端网元至宿端网元间的多层最短路由寻路方法及系统

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112492414A (zh) * 2020-11-18 2021-03-12 国家电网有限公司 一种光传送网光信号故障仿真的实现方法
CN112492414B (zh) * 2020-11-18 2023-04-07 国家电网有限公司 一种光传送网光信号故障仿真的实现方法
CN114448863A (zh) * 2022-01-06 2022-05-06 武汉烽火技术服务有限公司 一种寻找跨域路径的计算方法和装置
CN114448863B (zh) * 2022-01-06 2022-11-22 武汉烽火技术服务有限公司 一种寻找跨域路径的计算方法和装置

Also Published As

Publication number Publication date
CN108429681B (zh) 2019-08-20
BR112020000918A2 (pt) 2020-07-21
CN108429681A (zh) 2018-08-21

Similar Documents

Publication Publication Date Title
Kodian et al. Failure-independent path-protecting p-cycles: Efficient and simple fully preconnected optical-path protection
US7860392B2 (en) Optical network topology databases based on a set of connectivity constraints
US7925161B2 (en) Method and system for configuring a connection-oriented packet network over a wavelength division multiplexed optical network
US8244127B2 (en) Quality of service in an optical network
CN101227248B (zh) 业务路径建立方法
WO2019153726A1 (zh) 源端网元至宿端网元间的多层最短路由寻路方法及系统
JP5586597B2 (ja) デジタルおよび光エキスプレススルーノードを横断するリンクダイバーシティおよび負荷バランス
CN101227377B (zh) 一种实现跨域路径的共享风险链路组分离的方法
US20080056294A1 (en) Control scheme for standby channel route
CN100454837C (zh) 一种实现跨域路由分离的方法
US8515280B1 (en) Physically-diverse routing in heterogeneous optical networks
US7639607B2 (en) Signaling system for simultaneously and autonomously setting a spare path
EP1639757A1 (en) Optical network database and optical reroutable redundancy scheme
US20030223357A1 (en) Scalable path protection for meshed networks
US7218851B1 (en) Communication network design with wavelength converters
JP3845087B2 (ja) 光通信ネットワークの所定の接続についてスペクトル経路を決定する方法
US20040247317A1 (en) Method and apparatus for a network database in an optical network
JP4621228B2 (ja) マルチレイヤネットワークにおける経路探索方法及び装置及びプログラム
CN100488264C (zh) 一种获得保护路径信息的方法
CN100411373C (zh) 城域网数据业务网络管理方法
CN102026051A (zh) 基于分层虚拓扑的跨粒度层的生存性方法
JP2007274249A (ja) 光パス経路選択方法、及び光パス経路選択装置、並びに、プログラム
US9007892B2 (en) Apparatus and method to find partially disjoint routes for dual fiber-cuts
Jabbari et al. On constraints for path computation in multi-layer switched networks
CA2382323A1 (en) Protected routing in a communication network

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: 18905812

Country of ref document: EP

Kind code of ref document: A1

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112020000918

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 112020000918

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20200115

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18905812

Country of ref document: EP

Kind code of ref document: A1