WO2017193539A1 - 基于深度优先算法的otn网元内部路径筛选方法及系统 - Google Patents

基于深度优先算法的otn网元内部路径筛选方法及系统 Download PDF

Info

Publication number
WO2017193539A1
WO2017193539A1 PCT/CN2016/102803 CN2016102803W WO2017193539A1 WO 2017193539 A1 WO2017193539 A1 WO 2017193539A1 CN 2016102803 W CN2016102803 W CN 2016102803W WO 2017193539 A1 WO2017193539 A1 WO 2017193539A1
Authority
WO
WIPO (PCT)
Prior art keywords
port
path
list
subunit
unit
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.)
Ceased
Application number
PCT/CN2016/102803
Other languages
English (en)
French (fr)
Inventor
李澍
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fiberhome Telecommunication Technologies Co Ltd
Original Assignee
Fiberhome Telecommunication Technologies Co Ltd
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 Fiberhome Telecommunication Technologies Co Ltd filed Critical Fiberhome Telecommunication Technologies Co Ltd
Publication of WO2017193539A1 publication Critical patent/WO2017193539A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • 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

Definitions

  • the present invention relates to the technical field of OTN (Optical Transport Network) network element management, and in particular to a OTN network element internal path screening method and system based on a depth-first algorithm.
  • OTN Optical Transport Network
  • an available optical path needs to be found inside the OTN network element.
  • the ports have the inbound and outbound directions.
  • the fiber is connected to the port of the single disk, and the different single disks are connected.
  • Look for available optical paths that is, find the single-disk ports and fibers through which the light passes from the ingress port of one single disc to the egress port of another single disc.
  • the existing optical path searching method (path screening method) in the existing network element uses a path algorithm of single source and single sink, that is, searching for a path from a single source port to a single sink port.
  • the existing path screening method has the following disadvantages:
  • the purpose of the present invention is to overcome the deficiencies of the foregoing background, and provide a method and system for screening internal path of an OTN network element based on a depth-first algorithm, which can be in an OTN network element.
  • the department finds all available paths and selects the optimal path from it.
  • the algorithm is efficient and easy to expand, which can improve the efficiency of OTN network element management.
  • the present invention provides an internal path screening method for an OTN network element based on a depth-first algorithm, including the following steps: Step S1: determining a constraint list and an end condition list of the path, and proceeding to step S2; Step S2: determining The source port of the path proceeds to step S3; step S3: obtaining all the paths starting from the source port and satisfying the constraint condition and the end condition by using the depth-first algorithm, and proceeding to step S4; step S4: calculating S3 The obtained dissipation value of each path; the optimal path is selected according to the dissipation value, and the end is completed.
  • the constraint condition refers to the constraint relationship between the ingress port and the egress port of the single disk;
  • the termination condition refers to a condition that needs to be satisfied as the sink port.
  • step S2 when the source port of the path is determined in step S2, if the selected source port is the inbound port, it is directly determined as the source port of the path; if the selected source port is the outbound direction The port needs to find the fiber peer port along the fiber to which it is connected, and determine the peer port as the source port of the path.
  • step S3 specifically includes the following operations: Step S301: Establish an unvisited port list and an accessed port list, where the unvisited port list records all ports in the initial state, the accessed port When the list is in the initial state, the record is empty; the source port is set to the current port, and the process goes to step S302; step S302: it is determined whether the current port meets the end condition, and if so, the process goes to step S303; if not, the process goes to step S304; : the port in the accessed port list and the current port form a path, go to S306; Step S304: remove the current port from the unaccessed port list, and insert into the accessed port list, and proceed to step S305; Step S305 : Get all the cross ports of the current port on a single disk, and insert the ports that meet the constraints into the ports one by one.
  • step S306 determine whether there is an unobtained port in the unaccessed port list, and if yes, go to step S307; if no, end; step S307: order from unvisited port list Take a port, find the peer port of the fiber connected to the port, set the peer port as the current port, and return to step S302.
  • step S4 specifically includes the following operations: Step S401: sequentially number all the paths in step S3, and establish a mapping table of ⁇ dissipation value, path number list>, the ⁇ dissipation value
  • the mapping table of the path number list> is recorded as empty in the initial state, and the process proceeds to step S402; in step S402, a path is sequentially taken from the all paths according to the number, and the dissipation value of the path is set to 0.
  • step S403 Step S403: traverse each port in the taken path in sequence. During the traversal process, if the current port is on the same single disk as the next port, the load value of the single disk is added to the path dissipation.
  • Step S404 Insert the path number according to the dissipation value.
  • step S405 in the mapping table of ⁇ dissipation value, path number list>;
  • step S405 determine whether there is an untaken path among all the paths obtained in step S3, and if yes, return to step S402; otherwise, go to step S406;
  • Step S406 from ⁇ dissipation value, path number list> mapping table, taking the path of least dissipation value numbered list, as the optimal path list, end.
  • the present invention further provides an internal path screening system for an OTN network element based on a depth-first algorithm, which includes the path condition determining unit, the source port determining unit, the entire path screening unit, and the optimal path screening unit.
  • the unit is configured to: determine a constraint list and an end condition list of the path;
  • the source port determining unit is configured to: determine a source port of the path;
  • the all path screening unit is configured to: obtain a determined source port by using a depth-first algorithm All paths that are initial and satisfy the constraint condition and the end condition;
  • the optimal path screening unit is configured to: calculate each of the obtained path screening units The dissipation value of the strip path; the optimal path is selected according to the dissipative value.
  • the constraint condition determined by the path condition determining unit refers to a constraint relationship between an ingress port and an egress port of the single disk; and the end condition determined by the path condition determining unit refers to being required as a sink port. The conditions that are met.
  • the source port determining unit determines the source port of the path, if the selected source port is the inbound port, it is directly determined as the source port of the path; if the selected source port is The outbound port needs to find the fiber peer port along the fiber it is connected to, and determine the peer port as the source port of the path.
  • the all path screening unit includes an initial configuration subunit, an end condition judging subunit, a path component subunit, a port screening subunit, and an unvisited port judging subunit;
  • the initial configuration subunit is configured to: establish an unvisited port list and all the accessed port lists, where the unvisited port list records all ports in an initial state, and the accessed port list is recorded as empty in an initial state; Setting the source port as the current port, and sending a first determination signal to the end condition determination subunit;
  • the end condition determining subunit is configured to: after receiving the first determining signal, determine whether the current port satisfies an end condition, and if yes, send a path component signal to the path component subunit; if not, send a port screening signal to the port filtering subunit ;
  • the path component sub-unit is configured to: after receiving the path component signal, form a path between the port in the accessed port list and the current port, and send a second determination signal to the un-access port determining sub-unit;
  • the port filtering subunit is configured to: after receiving the port filtering signal, remove the current port from the unvisited port list, and insert it into the accessed port list; obtain all the cross ports of the current port on the single disk, Inserting the port that satisfies the constraint into the un-accessed port list, and sending a second determination signal to the un-accessed port determining sub-unit;
  • the un-accessed port determining sub-unit is configured to: after receiving the second determining signal, determine whether there is an unfetched port in the un-accessed port list, and if so, sequentially take a port from the un-accessed port list, and find the port Connect the peer port of the fiber to the current port, and send the first judgment signal to the end condition judgment subunit; otherwise, the operation ends.
  • the optimal path screening unit includes a mapping table establishing subunit, a path reading subunit, a port traversing subunit, a mapping table updating subunit, an untaken path judging subunit, and an optimal path selection.
  • the mapping table establishing subunit is configured to sequentially number all the paths obtained by all the path screening units, and establish a mapping table of the “dissipation value, path number list>, and the mapping of the “dissipation value, path number list”
  • the table is recorded as empty in the initial state, and the read signal is sent to the path reading subunit;
  • the path reading subunit is configured to: after receiving the read signal, sequentially take a path from the all paths according to the number, set the dissipation value of the path to 0, and send the traversal signal to the port traversal subunit. ;
  • the port traversal sub-unit is configured to: after receiving the traversal signal, sequentially traverse each port in the taken path, and if the current port is on the same single disk as the next port, the load value of the single disk is obtained during the traversal process. Adding to the dissipated value of the path; if the current port is not on the same single disk as the next port, adding the load value of the two-port fiber to the dissipated value of the path; sending an update to the mapping table update subunit signal;
  • the mapping table update subunit is configured to: after receiving the update signal, insert the path number into the mapping table of the ⁇ dissipation value, path number list> according to the dissipation value; and send the untaken path determination subunit Path judgment signal;
  • the untaken path judging subunit is configured to: after receiving the unfetched path judging signal, determine whether there is an unfetched path in the all paths, and if yes, send a read signal to the path reading subunit; otherwise, The optimal path selection subunit sends the selection signal;
  • the optimal path selection sub-unit is configured to: after receiving the selection signal, take a path number list with the smallest dissipation value from the mapping table of the “dissipation value, path number list” as the optimal path list.
  • the invention designs a plurality of optimal path screening methods for single source and multiple sinks.
  • the method is based on a depth-first algorithm, and can obtain all paths starting from a source port and satisfying both the constraint condition and the end condition, and calculating according to the method.
  • the dissipation value of each path is selected from which the optimal path is selected.
  • the present invention does not need to call the path algorithm of single source and single sink multiple times when searching for the internal path of the OTN network element, thereby improving algorithm efficiency and network element management efficiency; screening can be performed in all paths to ensure acquisition.
  • the optimal path; and the constraints and end conditions are abstracted, which is easy to extend the algorithm.
  • FIG. 1 is a flowchart of a method for screening an internal path of an OTN network element based on a depth-first algorithm according to an embodiment of the present invention
  • step S3 is a specific flowchart of step S3 in the embodiment of the present invention.
  • FIG. 3 is a specific flowchart of step S4 in the embodiment of the present invention.
  • FIG. 4 is a structural block diagram of an internal path screening system for an OTN network element based on a depth-first algorithm according to an embodiment of the present invention.
  • an embodiment of the present invention provides a method for screening an internal path of an OTN network element based on a depth-first algorithm, including the following steps:
  • Step S1 Determine the constraint list and the end condition list of the path, and proceed to step S2.
  • the port can be defined as an ingress port or an egress port; In the end, the port can be defined as the source port (the starting port of the path) or the sink port (the ending port of the path).
  • the constraint condition refers to the constraint relationship between the ingress port and the egress port of the single disk, that is, the optical path enters the single disk from the ingress port, and can only leave the single disk from the designated egress port.
  • the end condition refers to a condition that needs to be satisfied as a sink port, that is, a condition of an end point of one path.
  • the specific conditions are as shown in Table 2:
  • Step S2 Determine the source port of the path, and proceed to step S3. Since the source port may be in the inbound direction or the outbound direction, the start port (source port) of the depth first algorithm must be in the inbound direction. Therefore, when the source port of the path is determined, if the selected source port is the inbound direction. Port, directly determine it as the source port of the path; if the selected source port is The outbound port needs to find the fiber peer port along the fiber it is connected to, and determine the peer port as the source port of the path.
  • Step S3 Through the depth-first algorithm, all the paths starting from the source port and satisfying the constraint condition and the end condition are obtained (that is, one or more sink ports that are found from the source port and satisfy the end condition, and the path that passes through If the constraint is satisfied, the process proceeds to step S4.
  • Step S4 Calculate the dissipation value of each path obtained in S3; select the optimal path according to the dissipation value, and end.
  • step S3 specifically includes the following operations:
  • Step S301 Establish an unvisited port list and all the accessed port lists, wherein the unvisited port list records all the ports in the initial state, the visited port list is recorded as empty in the initial state; setting the source port as the current port Port, go to step S302;
  • Step S302 determining whether the current port meets the end condition, and if so, proceeds to step S303; if not, proceeds to step S304;
  • Step S303 The port in the accessed port list and the current port form a path, and then go to S306;
  • Step S304 The current port is removed from the un-accessed port list, and inserted into the accessed port list, and proceeds to step S305;
  • Step S305 Obtain all the cross-portable ports of the current port on the single disc, insert the ports that meet the constraint into the un-accessed port list, and proceed to step S306;
  • Step S306 determining whether there is an unobtained port in the unaccessed port list, and if yes, proceeding to step S307; if not, ending.
  • Step S307 Take a port in the un-accessed port list, find the peer port of the fiber connected to the port, set the peer port as the current port, and return to step S302.
  • step S4 specifically includes the following operations:
  • Step S401 sequentially number all the paths obtained in step S3, and establish ⁇ Dissipation value, path number list> mapping table, the ⁇ dissipation value, path number list> mapping table is empty in the initial state, proceeds to step S402;
  • Step S402 According to the number, sequentially take a path from all the paths obtained in step S3, and set the dissipation value of the path to 0, and proceed to step S403;
  • Step S403 traverse each port in the taken path in sequence. During the traversal process, if the current port is on the same single disk as the next port, the load value of the single disk is added to the dissipation value of the path; If the port is not on the same single disk as the next port, add the load value of the two-port fiber to the dissipation value of the path, and go to S404. It can be understood that multiple optical paths can be carried on a single disk. As the optical path increases, the load value also increases; and the optical fiber can only carry one optical path. Therefore, when the optical path passes through the optical fiber, its load value is 1, otherwise it is 0.
  • Step S404 According to the dissipation value, insert the path number into the mapping table of ⁇ dissipation value, path number list>, and proceed to step S405;
  • Step S405 determining whether there is an untaken path in all the paths obtained in step S3, and if so, returning to step S402; otherwise, proceeding to step S406;
  • Step S406 From the mapping table of ⁇ dissipation value, path number list>, the path number list with the smallest dissipation value is taken as the optimal path list, and the process ends.
  • an embodiment of the present invention further provides an internal path screening system for an OTN network element based on a depth-first algorithm, including a path condition determining unit, a source port determining unit, a total path screening unit, and an optimal path. Filter unit.
  • the path condition determining unit is configured to: determine a constraint list and an end condition list of the path;
  • the source port determining unit is configured to: determine a source port of the path.
  • the source port determining unit determines the source port of the path, if the selected source port is the inbound port, it is directly determined as the source port of the path; if the selected source port is the outbound port, the edge port is required to be The fiber connected to the fiber, find the fiber peer port, and determine the peer port as the source port of the path;
  • the entire path screening unit is configured to: obtain, by using a depth-first algorithm, all paths that are determined by the source port and that satisfy the constraint condition and the end condition;
  • the optimal path screening unit is configured to: calculate a dissipation value of each path obtained by the all path screening unit; and select an optimal path according to the dissipation value.
  • the all path screening unit includes an initial configuration subunit, an end condition judging subunit, a path component subunit, a port screening subunit, and an unvisited port judging subunit;
  • the initial configuration subunit is configured to: establish an unvisited port list and all the accessed port lists, wherein the unvisited port list records all ports in an initial state, and the accessed port list is recorded as empty in an initial state;
  • the port is set as the current port, and the first judgment signal is sent to the end condition determining subunit;
  • the end condition determining subunit is configured to: after receiving the first determining signal, determine whether the current port satisfies the end condition, and if yes, send a path composition signal to the path component subunit; if not, send a port screening signal to the port screening subunit;
  • the path component sub-unit is configured to: after receiving the path composition signal, form a path between the port in the accessed port list and the current port, and send a second determination signal to the un-access port judgment sub-unit;
  • the port filtering sub-unit is configured to: after receiving the port filtering signal, remove the current port from the un-accessed port list and insert it into the accessed port list; obtaining all the cross-ports of the current port on the single disk will satisfy The constrained port is sequentially inserted into the unvisited port list, and the second judging signal is sent to the unvisited port judging subunit;
  • the un-accessed port judging sub-unit is configured to: after receiving the second judging signal, determine whether there is an unfetched port in the un-accessed port list, and if so, sequentially take the un-accessed port list A port finds the peer port of the fiber connected to the port, sets the peer port as the current port, and sends a first judgment signal to the end condition judgment subunit; otherwise, the operation ends.
  • the optimal path screening unit includes a mapping table establishing subunit, a path reading subunit, a port traversal subunit, a mapping table updating subunit, an untaken path judging subunit, and an optimal Path selection subunit;
  • the mapping table establishing sub-unit is configured to sequentially number all the paths obtained by all the path screening units, and establish a mapping table of ⁇ dissipation value, path number list>, and the mapping table of the ⁇ dissipation value, path number list> is In the initial state, the record is empty, and a read signal is sent to the path read subunit;
  • the path reading subunit is configured to: after receiving the read signal, sequentially take a path from the all paths according to the number, set the dissipation value of the path to 0, and send the traversal signal to the port traversal subunit;
  • the port traversal sub-unit is configured to: after receiving the traversal signal, sequentially traverse each port in the taken path, and during the traversal process, if the current port is on the same single disk as the next port, the load value of the single disk is added. The value of the path is dissipated; if the current port is not on the same single disk as the next port, the load value of the two-port fiber is added to the dissipation value of the path; and the update signal is sent to the mapping table update sub-unit;
  • the mapping table update subunit is configured to: after receiving the update signal, insert the path number into the mapping table of the ⁇ dissipation value, path number list> according to the dissipation value; and send the untaken path judgment to the unfetched path judgment subunit signal;
  • the unfetched path judging subunit is configured to: after receiving the unfetched path judging signal, determine whether there is an unfetched path in the all paths, and if so, send a read signal to the path reading subunit; otherwise, optimally
  • the path selection subunit sends the selection signal;
  • the optimal path selection sub-unit is configured to: after receiving the selection signal, take the path number list with the smallest dissipation value from the mapping table of the “dissipation value, path number list” as the optimal A list of paths.

Landscapes

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

Abstract

本发明公开了一种基于深度优先算法的OTN网元内部路径筛选方法及系统，涉及OTN网元的管理技术领域。该路径筛选方法包括以下步骤：确定路径的约束条件列表和结束条件列表；确定路径的源端口；通过深度优先算法，得到以源端口为起始的且满足约束条件和结束条件的全部路径；计算每条路径的耗散值，根据耗散值选择出最优路径。本发明能在OTN网元内部找到全部可用的路径，并从中筛选出最优的路径，算法效率高且易于扩展，提高了OTN网元管理的效率。

Description

基于深度优先算法的OTN网元内部路径筛选方法及系统 技术领域
本发明涉及OTN(Optical Transport Network，光传送网)网元的管理技术领域，具体来讲是一种基于深度优先算法的OTN网元内部路径筛选方法及系统。
背景技术
目前，在OTN网元的管理过程中，需要在OTN网元内部找到可用光路。OTN网元内部有多块单盘，单盘上有一系列的端口，端口有入方向和出方向之分。光纤接入到单盘的端口上，将不同的单盘连接起来。寻找可用光路，即找到光从某一单盘的入端口到另一单盘的出端口所经过的单盘端口和光纤。
现有的网元内部可用光路的寻找方法(路径筛选方法)，采用的多是单源单宿的路径算法，即从单个源端口寻找一条路径到单个宿端口。但在使用过程中发现，现有的路径筛选方法存在以下不足：
(1)仅使用单源单宿的路径算法，对于多宿的情况需要调用多次算法，实现效率低；
(2)单源单宿的路径算法不能保证找到的路径是最优路径；
(3)单源单宿的路径算法缺乏可扩展性，增加新的约束条件十分困难，不适用于多变的使用环境。
发明内容
本发明的目的是为了克服上述背景技术的不足，提供一种基于深度优先算法的OTN网元内部路径筛选方法及系统，能在OTN网元内 部找到全部可用的路径，并从中筛选出最优路径，算法效率高且易于扩展，能提高OTN网元管理的效率。
为达到以上目的，本发明提供一种基于深度优先算法的OTN网元内部路径筛选方法，包括以下步骤：步骤S1：确定路径的约束条件列表和结束条件列表，转入步骤S2；步骤S2：确定路径的源端口，转入步骤S3；步骤S3：通过深度优先算法，得到以所述源端口为起始的且满足约束条件和结束条件的全部路径，转入步骤S4；步骤S4：计算S3中得到的每条路径的耗散值；根据耗散值选择出最优路径，结束。
在上述技术方案的基础上，步骤S1中，约束条件是指单盘的入端口和出端口之间的约束关系；结束条件是指作为宿端口需要满足的条件。
在上述技术方案的基础上，步骤S2中所述确定路径的源端口时，若选择的源端口为入方向的端口，则直接将其确定为路径的源端口；若选择的源端口为出方向的端口，则需要沿其所连接的光纤，找到光纤对端端口，将该对端端口确定为路径的源端口。
在上述技术方案的基础上，步骤S3具体包括以下操作：步骤S301：建立未访问端口列表和已访问端口列表，所述未访问端口列表在初始状态时记录有所有的端口，所述已访问端口列表在初始状态时记录为空；将源端口设置为当前端口，转入步骤S302；步骤S302：判断当前端口是否满足结束条件，若是，转入步骤S303；若否，转入步骤S304；步骤S303：将已访问端口列表中的端口和当前端口组成一条路径，转S306；步骤S304：将当前端口从未访问端口列表中移除，并插入到已访问端口列表中，转入步骤S305；步骤S305：获取当前端口在单盘上所有的可交叉端口，将满足约束条件的端口依次插入到 未访问端口列表中，转入步骤S306；步骤S306：判断未访问端口列表中是否有未取到的端口，若是，转入步骤S307；若否，结束；步骤S307：从未访问端口列表中顺序取一个端口，找到此端口所连光纤的对端端口，设置此对端端口为当前端口，返回步骤S302。
在上述技术方案的基础上，步骤S4具体包括以下操作：步骤S401：对步骤S3中所述全部路径进行依次编号，并建立<耗散值，路径编号列表>的映射表，该<耗散值，路径编号列表>的映射表在初始状态时记录为空，转入步骤S402；步骤S402：按照编号，从所述全部路径中顺序取一条路径，并将该路径的耗散值设置为0，转入步骤S403；步骤S403：依次遍历所取路径中的每个端口，遍历过程中，若当前端口与下一端口在同一单盘上，则将单盘的负载值加到该路径的耗散值上；若当前端口与下一端口不在同一单盘上，则将两端口件光纤的负载值加到该路径的耗散值上，转S404；步骤S404：根据耗散值，将路径编号插入到<耗散值，路径编号列表>的映射表中，转入步骤S405；步骤S405：判断步骤S3中得到的全部路径中是否有未取到的路径，若是，返回步骤S402；否则，转入步骤S406；步骤S406：从<耗散值，路径编号列表>的映射表中，取耗散值最小的路径编号列表，作为最优的路径列表，结束。
本发明还提供一种实现上述方法的基于深度优先算法的OTN网元内部路径筛选系统，包括路径条件确定单元、源端口确定单元、全部路径筛选单元和最优路径筛选单元；所述路径条件确定单元用于：确定路径的约束条件列表和结束条件列表；所述源端口确定单元用于：确定路径的源端口；所述全部路径筛选单元用于：通过深度优先算法，得到以确定的源端口为起始且满足约束条件和结束条件的全部路径；所述最优路径筛选单元用于：计算出所述全部路径筛选单元得到的每 条路径的耗散值；根据耗散值选择出最优路径。
在上述技术方案的基础上，所述路径条件确定单元确定的约束条件是指单盘的入端口和出端口之间的约束关系；所述路径条件确定单元确定的结束条件是指作为宿端口需要满足的条件。
在上述技术方案的基础上，所述源端口确定单元在确定路径的源端口时，若选择的源端口为入方向的端口，则直接将其确定为路径的源端口；若选择的源端口为出方向的端口，则需要沿其所连接的光纤，找到光纤对端端口，将该对端端口确定为路径的源端口。
在上述技术方案的基础上，所述全部路径筛选单元包括初始配置子单元、结束条件判断子单元、路径组成子单元、端口筛选子单元和未访问端口判断子单元；
所述初始配置子单元用于：建立未访问端口列表和已访问端口列表，所述未访问端口列表在初始状态时记录有所有的端口，所述已访问端口列表在初始状态时记录为空；将源端口设置为当前端口，向结束条件判断子单元发送第一判断信号；
所述结束条件判断子单元用于：收到第一判断信号后，判断当前端口是否满足结束条件，若是，向路径组成子单元发送路径组成信号；若否，向端口筛选子单元发送端口筛选信号；
所述路径组成子单元用于：收到路径组成信号后，将已访问端口列表中的端口和当前端口组成一条路径，向未访问端口判断子单元发送第二判断信号；
所述端口筛选子单元用于：收到端口筛选信号后，将当前端口从未访问端口列表中移除，并插入到已访问端口列表中；获取当前端口在单盘上所有的可交叉端口，将满足约束条件的端口依次插入到未访问端口列表中，向未访问端口判断子单元发送第二判断信号；
所述未访问端口判断子单元用于：收到第二判断信号后，判断未访问端口列表中是否有未取到的端口，若是，从未访问端口列表中顺序取一个端口，找到此端口所连光纤的对端端口，设置此对端端口为当前端口，向结束条件判断子单元发送第一判断信号；否则结束操作。
在上述技术方案的基础上，所述最优路径筛选单元包括映射表建立子单元、路径读取子单元、端口遍历子单元、映射表更新子单元、未取路径判断子单元和最优路径选取子单元；
所述映射表建立子单元用于：对全部路径筛选单元得到的全部路径进行依次编号，并建立<耗散值，路径编号列表>的映射表，该<耗散值，路径编号列表>的映射表在初始状态时记录为空，向路径读取子单元发送读取信号；
所述路径读取子单元用于：收到读取信号后，按照编号从所述全部路径中顺序取一条路径，将该路径的耗散值设置为0，并向端口遍历子单元发送遍历信号；
所述端口遍历子单元用于：收到遍历信号后，依次遍历所取路径中的每个端口，遍历过程中，若当前端口与下一端口在同一单盘上，则将单盘的负载值加到该路径的耗散值上；若当前端口与下一端口不在同一单盘上，则将两端口件光纤的负载值加到该路径的耗散值上；向映射表更新子单元发送更新信号；
所述映射表更新子单元用于：收到更新信号后，根据耗散值，将路径编号插入到<耗散值，路径编号列表>的映射表中；向未取路径判断子单元发送未取路径判断信号；
所述未取路径判断子单元用于：收到未取路径判断信号后，判断所述全部路径中是否有未取到的路径，若是，向路径读取子单元发送读取信号；否则，向最优路径选取子单元发送选取信号；
所述最优路径选取子单元用于：收到选取信号后，从<耗散值，路径编号列表>的映射表中，取耗散值最小的路径编号列表，作为最优的路径列表。
本发明的有益效果在于：
本发明设计了一种单源多宿的多条最优路径筛选方法，该方法基于深度优先算法，能得到以源端口为起始且同时满足约束条件和结束条件的全部路径，并根据计算出的每条路径的耗散值，从中选择出最优路径。与现有技术相比，本发明在寻找OTN网元内部路径时无需多次调用单源单宿的路径算法，提高了算法效率和网元管理效率；能在全部路径中进行筛选，保证获取到最优路径；且抽象出了约束条件和结束条件，易于算法的扩展。
附图说明
图1为本发明实施例中基于深度优先算法的OTN网元内部路径筛选方法的流程图；
图2为本发明实施例中步骤S3的具体流程图；
图3为本发明实施例中步骤S4的具体流程图；
图4为本发明实施例中基于深度优先算法的OTN网元内部路径筛选系统的结构框图。
具体实施方式
下面结合附图及具体实施例对本发明作进一步的详细描述。
参见图1所示，本发明实施例提供一种基于深度优先算法的OTN网元内部路径筛选方法，包括以下步骤：
步骤S1：确定路径的约束条件列表和结束条件列表，转入步骤S2。
可以理解的是，对于单盘上的端口来说，若以入方向(即单盘上光路进入的方向)、出方向来划分，端口可定义为入端口或出端口；若以一条路径的首、末来划分，端口又可定义为源端口(路径的起始端口)或宿端口(路径的结束端口)。在此基础上，步骤S1中，约束条件是指单盘的入端口和出端口之间的约束关系，即光路从入端口进入单盘，只能从指定的出端口离开单盘。在应用到OTN网元内部路径的时候，其具体约束关系如表1所示：
表1、OTN网元内部路径的约束条件
Figure PCTCN2016102803-appb-000001
另外，步骤S1中，结束条件是指作为宿端口需要满足的条件，即一条路径的终结点的条件。在应用到OTN网元内部路径的时候，其具体条件如表2所示：
表2、OTN网元内部路径的结束条件
Figure PCTCN2016102803-appb-000002
步骤S2：确定路径的源端口，转入步骤S3。由于源端口可能是入方向，也可能是出方向，而深度优先算法的起始端口(源端口)必须要求是入方向的，因此在确定路径的源端口时，若选择的源端口为入方向的端口，则直接将其确定为路径的源端口；若选择的源端口为 出方向的端口，则需要沿其所连接的光纤，找到光纤对端端口，将该对端端口确定为路径的源端口。
步骤S3：通过深度优先算法，得到以所述源端口为起始的且满足约束条件和结束条件的全部路径(即从源端口寻找到满足结束条件的一个或多个宿端口，且经过的路径满足约束条件)，转入步骤S4。
步骤S4：计算S3中得到的每条路径的耗散值；根据耗散值选择出最优路径，结束。
参见图2所示，实际操作时，步骤S3具体包括以下操作：
步骤S301：建立未访问端口列表和已访问端口列表，所述未访问端口列表在初始状态时记录有所有的端口，所述已访问端口列表在初始状态时记录为空；将源端口设置为当前端口，转入步骤S302；
步骤S302：判断当前端口是否满足结束条件，若是，转入步骤S303；若否，转入步骤S304；
步骤S303：将已访问端口列表中的端口和当前端口组成一条路径，转S306；
步骤S304：将当前端口从未访问端口列表中移除，并插入到已访问端口列表中，转入步骤S305；
步骤S305：获取当前端口在单盘上所有的可交叉端口，将满足约束条件的端口依次插入到未访问端口列表中，转入步骤S306；
步骤S306：判断未访问端口列表中是否有未取到的端口，若是，转入步骤S307；若否，结束。
步骤S307：从未访问端口列表中顺序取一个端口，找到此端口所连光纤的对端端口，设置此对端端口为当前端口，返回步骤S302。
进一步地，参见图3所示，步骤S4具体包括以下操作：
步骤S401：对步骤S3中得到的全部路径进行依次编号，并建立 <耗散值，路径编号列表>的映射表，该<耗散值，路径编号列表>的映射表在初始状态时记录为空，转入步骤S402；
步骤S402：按照编号，从步骤S3得到的全部路径中顺序取一条路径，并将该路径的耗散值设置为0，转入步骤S403；
步骤S403：依次遍历所取路径中的每个端口，遍历过程中，若当前端口与下一端口在同一单盘上，则将单盘的负载值加到该路径的耗散值上；若当前端口与下一端口不在同一单盘上，则将两端口件光纤的负载值加到该路径的耗散值上，转S404；可以理解的是，单盘上可以承载多条光路，因此，随着光路的增多，其负载值也随之增加；而光纤仅可以承载一条光路，因此，当光路经过此光纤，其负载值就是1，否则就是0。
步骤S404：根据耗散值，将路径编号插入到<耗散值，路径编号列表>的映射表中，转入步骤S405；
步骤S405：判断步骤S3中得到的全部路径中是否有未取到的路径，若是，返回步骤S402；否则，转入步骤S406；
步骤S406：从<耗散值，路径编号列表>的映射表中，取耗散值最小的路径编号列表，作为最优的路径列表，结束。
参见图4所示，本发明实施例还提供一种实现上述方法的基于深度优先算法的OTN网元内部路径筛选系统，包括路径条件确定单元、源端口确定单元、全部路径筛选单元和最优路径筛选单元。
其中，路径条件确定单元用于：确定路径的约束条件列表和结束条件列表；
源端口确定单元用于：确定路径的源端口。所述源端口确定单元在确定路径的源端口时，若选择的源端口为入方向的端口，则直接将其确定为路径的源端口；若选择的源端口为出方向的端口，则需要沿 其所连接的光纤，找到光纤对端端口，将该对端端口确定为路径的源端口；
全部路径筛选单元用于：通过深度优先算法，得到以确定的源端口为起始且满足约束条件和结束条件的全部路径；
最优路径筛选单元用于：计算出所述全部路径筛选单元得到的每条路径的耗散值；根据耗散值选择出最优路径。
进一步地，参见图4所示，所述全部路径筛选单元包括初始配置子单元、结束条件判断子单元、路径组成子单元、端口筛选子单元和未访问端口判断子单元；
初始配置子单元用于：建立未访问端口列表和已访问端口列表，所述未访问端口列表在初始状态时记录有所有的端口，所述已访问端口列表在初始状态时记录为空；将源端口设置为当前端口，向结束条件判断子单元发送第一判断信号；
结束条件判断子单元用于：收到第一判断信号后，判断当前端口是否满足结束条件，若是，向路径组成子单元发送路径组成信号；若否，向端口筛选子单元发送端口筛选信号；
路径组成子单元用于：收到路径组成信号后，将已访问端口列表中的端口和当前端口组成一条路径，向未访问端口判断子单元发送第二判断信号；
端口筛选子单元用于：收到端口筛选信号后，将当前端口从未访问端口列表中移除，并插入到已访问端口列表中；获取当前端口在单盘上所有的可交叉端口，将满足约束条件的端口依次插入到未访问端口列表中，向未访问端口判断子单元发送第二判断信号；
未访问端口判断子单元用于：收到第二判断信号后，判断未访问端口列表中是否有未取到的端口，若是，从未访问端口列表中顺序取 一个端口，找到此端口所连光纤的对端端口，设置此对端端口为当前端口，向结束条件判断子单元发送第一判断信号；否则，结束操作。
更进一步地，参见图4所示，所述最优路径筛选单元包括映射表建立子单元、路径读取子单元、端口遍历子单元、映射表更新子单元、未取路径判断子单元和最优路径选取子单元；
映射表建立子单元用于：对全部路径筛选单元得到的全部路径进行依次编号，并建立<耗散值，路径编号列表>的映射表，该<耗散值，路径编号列表>的映射表在初始状态时记录为空，向路径读取子单元发送读取信号；
路径读取子单元用于：收到读取信号后，按照编号从所述全部路径中顺序取一条路径，将该路径的耗散值设置为0，并向端口遍历子单元发送遍历信号；
端口遍历子单元用于：收到遍历信号后，依次遍历所取路径中的每个端口，遍历过程中，若当前端口与下一端口在同一单盘上，则将单盘的负载值加到该路径的耗散值上；若当前端口与下一端口不在同一单盘上，则将两端口件光纤的负载值加到该路径的耗散值上；向映射表更新子单元发送更新信号；
映射表更新子单元用于：收到更新信号后，根据耗散值，将路径编号插入到<耗散值，路径编号列表>的映射表中；向未取路径判断子单元发送未取路径判断信号；
未取路径判断子单元用于：收到未取路径判断信号后，判断所述全部路径中是否有未取到的路径，若是，向路径读取子单元发送读取信号；否则，向最优路径选取子单元发送选取信号；
最优路径选取子单元用于：收到选取信号后，从<耗散值，路径编号列表>的映射表中，取耗散值最小的路径编号列表，作为最优的 路径列表。
本发明不局限于上述实施方式，对于本技术领域的普通技术人员来说，在不脱离本发明原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也视为本发明的保护范围之内。本说明书中未作详细描述的内容属于本领域专业技术人员公知的现有技术。

Claims (10)

  1. 一种基于深度优先算法的OTN网元内部路径筛选方法，其特征在于，包括以下步骤：
    步骤S1：确定路径的约束条件列表和结束条件列表，转入步骤S2；
    步骤S2：确定路径的源端口，转入步骤S3；
    步骤S3：通过深度优先算法，得到以所述源端口为起始的且满足约束条件和结束条件的全部路径，转入步骤S4；
    步骤S4：计算S3中得到的每条路径的耗散值；根据耗散值选择出最优路径，结束。
  2. 如权利要求1所述的基于深度优先算法的OTN网元内部路径筛选方法，其特征在于：步骤S1中，约束条件是指单盘的入端口和出端口之间的约束关系；结束条件是指作为宿端口需要满足的条件。
  3. 如权利要求1所述的基于深度优先算法的OTN网元内部路径筛选方法，其特征在于：步骤S2中所述确定路径的源端口时，若选择的源端口为入方向的端口，则直接将其确定为路径的源端口；若选择的源端口为出方向的端口，则需要沿其所连接的光纤，找到光纤对端端口，将该对端端口确定为路径的源端口。
  4. 如权利要求1所述的基于深度优先算法的OTN网元内部路径筛选方法，其特征在于，步骤S3具体包括以下操作：
    步骤S301：建立未访问端口列表和已访问端口列表，所述未访问端口列表在初始状态时记录有所有的端口，所述已访问端口列表在初始状态时记录为空；将源端口设置为当前端口，转入步骤S302；
    步骤S302：判断当前端口是否满足结束条件，若是，转入步骤S303；若否，转入步骤S304；
    步骤S303：将已访问端口列表中的端口和当前端口组成一条路径，转S306；
    步骤S304：将当前端口从未访问端口列表中移除，并插入到已访问端口列表中，转入步骤S305；
    步骤S305：获取当前端口在单盘上所有的可交叉端口，将满足约束条件的端口依次插入到未访问端口列表中，转入步骤S306；
    步骤S306：判断未访问端口列表中是否有未取到的端口，若是，转入步骤S307；若否，结束；
    步骤S307：从未访问端口列表中顺序取一个端口，找到此端口所连光纤的对端端口，设置此对端端口为当前端口，返回步骤S302。
  5. 如权利要求1所述的基于深度优先算法的OTN网元内部路径筛选方法，其特征在于，步骤S4具体包括以下操作：
    步骤S401：对步骤S3中所述全部路径进行依次编号，并建立<耗散值，路径编号列表>的映射表，该<耗散值，路径编号列表>的映射表在初始状态时记录为空，转入步骤S402；
    步骤S402：按照编号，从所述全部路径中顺序取一条路径，并将该路径的耗散值设置为0，转入步骤S403；
    步骤S403：依次遍历所取路径中的每个端口，遍历过程中，若当前端口与下一端口在同一单盘上，则将单盘的负载值加到该路径的耗散值上；若当前端口与下一端口不在同一单盘上，则将两端口件光纤的负载值加到该路径的耗散值上，转S404；
    步骤S404：根据耗散值，将路径编号插入到<耗散值，路径编号列表>的映射表中，转入步骤S405；
    步骤S405：判断步骤S3中得到的全部路径中是否有未取到的路径，若是，返回步骤S402；否则，转入步骤S406；
    步骤S406：从<耗散值，路径编号列表>的映射表中，取耗散值最小的路径编号列表，作为最优的路径列表，结束。
  6. 一种实现权利要求1所述方法的基于深度优先算法的OTN网元内部路径筛选系统，其特征在于：该系统包括路径条件确定单元、源端口确定单元、全部路径筛选单元和最优路径筛选单元；
    所述路径条件确定单元用于：确定路径的约束条件列表和结束条件列表；
    所述源端口确定单元用于：确定路径的源端口；
    所述全部路径筛选单元用于：通过深度优先算法，得到以确定的源端口为起始且满足约束条件和结束条件的全部路径；
    所述最优路径筛选单元用于：计算出所述全部路径筛选单元得到的每条路径的耗散值；根据耗散值选择出最优路径。
  7. 如权利要求6所述的基于深度优先算法的OTN网元内部路径筛选系统，其特征在于：所述路径条件确定单元确定的约束条件是指单盘的入端口和出端口之间的约束关系；所述路径条件确定单元确定的结束条件是指作为宿端口需要满足的条件。
  8. 如权利要求6所述的基于深度优先算法的OTN网元内部路径筛选系统，其特征在于：所述源端口确定单元在确定路径的源端口时，若选择的源端口为入方向的端口，则直接将其确定为路径的源端口；若选择的源端口为出方向的端口，则需要沿其所连接的光纤，找到光纤对端端口，将该对端端口确定为路径的源端口。
  9. 如权利要求6所述的基于深度优先算法的OTN网元内部路径筛选系统，其特征在于：所述全部路径筛选单元包括初始配置子单元、结束条件判断子单元、路径组成子单元、端口筛选子单元和未访问端口判断子单元；
    所述初始配置子单元用于：建立未访问端口列表和已访问端口列表，所述未访问端口列表在初始状态时记录有所有的端口，所述已访问端口列表在初始状态时记录为空；将源端口设置为当前端口，向结束条件判断子单元发送第一判断信号；
    所述结束条件判断子单元用于：收到第一判断信号后，判断当前端口是否满足结束条件，若是，向路径组成子单元发送路径组成信号；若否，向端口筛选子单元发送端口筛选信号；
    所述路径组成子单元用于：收到路径组成信号后，将已访问端口列表中的端口和当前端口组成一条路径，向未访问端口判断子单元发送第二判断信号；
    所述端口筛选子单元用于：收到端口筛选信号后，将当前端口从未访问端口列表中移除，并插入到已访问端口列表中；获取当前端口在单盘上所有的可交叉端口，将满足约束条件的端口依次插入到未访问端口列表中，向未访问端口判断子单元发送第二判断信号；
    所述未访问端口判断子单元用于：收到第二判断信号后，判断未访问端口列表中是否有未取到的端口，若是，从未访问端口列表中顺序取一个端口，找到此端口所连光纤的对端端口，设置此对端端口为当前端口，向结束条件判断子单元发送第一判断信号；否则结束操作。
  10. 如权利要求6所述的基于深度优先算法的OTN网元内部路径筛选系统，其特征在于：所述最优路径筛选单元包括映射表建立子单元、路径读取子单元、端口遍历子单元、映射表更新子单元、未取路径判断子单元和最优路径选取子单元；
    所述映射表建立子单元用于：对全部路径筛选单元得到的全部路径进行依次编号，并建立<耗散值，路径编号列表>的映射表，该<耗散值，路径编号列表>的映射表在初始状态时记录为空，向路径读取 子单元发送读取信号；
    所述路径读取子单元用于：收到读取信号后，按照编号从所述全部路径中顺序取一条路径，将该路径的耗散值设置为0，并向端口遍历子单元发送遍历信号；
    所述端口遍历子单元用于：收到遍历信号后，依次遍历所取路径中的每个端口，遍历过程中，若当前端口与下一端口在同一单盘上，则将单盘的负载值加到该路径的耗散值上；若当前端口与下一端口不在同一单盘上，则将两端口件光纤的负载值加到该路径的耗散值上；向映射表更新子单元发送更新信号；
    所述映射表更新子单元用于：收到更新信号后，根据耗散值，将路径编号插入到<耗散值，路径编号列表>的映射表中；向未取路径判断子单元发送未取路径判断信号；
    所述未取路径判断子单元用于：收到未取路径判断信号后，判断所述全部路径中是否有未取到的路径，若是，向路径读取子单元发送读取信号；否则，向最优路径选取子单元发送选取信号；
    所述最优路径选取子单元用于：收到选取信号后，从<耗散值，路径编号列表>的映射表中，取耗散值最小的路径编号列表，作为最优的路径列表。
PCT/CN2016/102803 2016-05-09 2016-10-21 基于深度优先算法的otn网元内部路径筛选方法及系统 Ceased WO2017193539A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610300032.2A CN105978809B (zh) 2016-05-09 2016-05-09 基于深度优先算法的otn网元内部路径筛选方法及系统
CN201610300032.2 2016-05-09

Publications (1)

Publication Number Publication Date
WO2017193539A1 true WO2017193539A1 (zh) 2017-11-16

Family

ID=56992188

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/102803 Ceased WO2017193539A1 (zh) 2016-05-09 2016-10-21 基于深度优先算法的otn网元内部路径筛选方法及系统

Country Status (2)

Country Link
CN (1) CN105978809B (zh)
WO (1) WO2017193539A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113075479A (zh) * 2021-03-26 2021-07-06 中国人民解放军海军航空大学航空作战勤务学院 用于低频信号连接的路径搜索算法

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105978809B (zh) * 2016-05-09 2019-01-15 烽火通信科技股份有限公司 基于深度优先算法的otn网元内部路径筛选方法及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101946468A (zh) * 2008-02-15 2011-01-12 英特尔公司 多个通信接口之间的约束动态路径选择
US20110038254A1 (en) * 2009-08-11 2011-02-17 Fujitsu Limited Apparatus and method for finding a pair of disjoint paths in a communication network
CN105515993A (zh) * 2015-11-26 2016-04-20 西安空间无线电技术研究所 一种光电混合交换内部路径映射方法
CN105978809A (zh) * 2016-05-09 2016-09-28 烽火通信科技股份有限公司 基于深度优先算法的otn网元内部路径筛选方法及系统

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100346608C (zh) * 2003-11-06 2007-10-31 华为技术有限公司 一种路径搜索方法
CN101145962B (zh) * 2007-07-24 2010-09-29 中兴通讯股份有限公司 一种波分设备的路径计算方法
CN101321134B (zh) * 2008-07-21 2012-05-23 西安电子科技大学 动态网络条件下的服务质量路由选择方法
CN101989886B (zh) * 2009-07-31 2014-12-03 华为技术有限公司 站点间波分资源统计方法和装置
JP5515085B2 (ja) * 2011-02-10 2014-06-11 株式会社日立製作所 最適経路検索システム及び最適経路検索方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101946468A (zh) * 2008-02-15 2011-01-12 英特尔公司 多个通信接口之间的约束动态路径选择
US20110038254A1 (en) * 2009-08-11 2011-02-17 Fujitsu Limited Apparatus and method for finding a pair of disjoint paths in a communication network
CN105515993A (zh) * 2015-11-26 2016-04-20 西安空间无线电技术研究所 一种光电混合交换内部路径映射方法
CN105978809A (zh) * 2016-05-09 2016-09-28 烽火通信科技股份有限公司 基于深度优先算法的otn网元内部路径筛选方法及系统

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113075479A (zh) * 2021-03-26 2021-07-06 中国人民解放军海军航空大学航空作战勤务学院 用于低频信号连接的路径搜索算法
CN113075479B (zh) * 2021-03-26 2022-11-25 中国人民解放军海军航空大学航空作战勤务学院 用于低频信号连接的路径搜索算法

Also Published As

Publication number Publication date
CN105978809A (zh) 2016-09-28
CN105978809B (zh) 2019-01-15

Similar Documents

Publication Publication Date Title
US9979624B1 (en) Large flow detection for network visibility monitoring
CN108833271B (zh) 一种电网广域控制业务通信路径选择方法及服务器
WO2021052169A1 (zh) 分布式数据的均衡处理方法、装置、计算终端和存储介质
JP2011205582A5 (ja) ネットワーク管理システム、ネットワーク管理方法、ネットワーク管理装置およびネットワーク間接続装置。
US11233849B2 (en) Message transmission methods and apparatuses
US20200389388A1 (en) Packet forwarding
TWI426383B (zh) 雲端計算網路的系統可靠度之估計方法
WO2015139533A1 (zh) 一种网管对混合组网业务的反算方法
WO2017193539A1 (zh) 基于深度优先算法的otn网元内部路径筛选方法及系统
GB2458204A (en) Selecting attributes of resources of a system with the highest degree of reliability where conflict exists between plural attributes as to the same resources
CN102638404A (zh) 一种基于业务区分的光网络保护资源分配方法
WO2015124015A1 (zh) 一种数据包转发方法及设备
CN114039920B (zh) 基于IP over Quasi-CWDM网络的负载均衡流量疏导方法及系统
CN120128528A (zh) 基于图数据库的割接事件分层判冲方法和装置
CN106685521B (zh) 一种用于光通信网的资源余量预警的方法及装置
CN114301806A (zh) 一种虚网连通性检测方法、装置、设备和存储介质
CN106034266A (zh) 光路由的生成方法及装置
CN112714903B (zh) 使用客户端提供的决策元数据的基于可缩放小区的包处理服务
CN105050128B (zh) 利用信号强度的桥梁健康监测传感网的节点次序自动推导方法
CN108366024A (zh) 报文转发方法及装置
CN109286570B (zh) 一种邻接表项的查找方法及装置
CN101145884B (zh) 一种波分复用业务冲突判断方法
WO2016202097A1 (zh) 获取用户侧端口保证带宽的方法和网络监测系统
CN108011730A (zh) 一种网管系统中环网资源自动变更的方法及装置
CN115914233B (zh) 端口转发流管理方法、装置、电子设备及存储介质

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 16901494

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 16901494

Country of ref document: EP

Kind code of ref document: A1