WO2021136542A1 - Path calculation method and system - Google Patents

Path calculation method and system Download PDF

Info

Publication number
WO2021136542A1
WO2021136542A1 PCT/CN2021/070050 CN2021070050W WO2021136542A1 WO 2021136542 A1 WO2021136542 A1 WO 2021136542A1 CN 2021070050 W CN2021070050 W CN 2021070050W WO 2021136542 A1 WO2021136542 A1 WO 2021136542A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
current working
service
working path
deviation
Prior art date
Application number
PCT/CN2021/070050
Other languages
French (fr)
Chinese (zh)
Inventor
马坤
何峰
Original Assignee
烽火通信科技股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 烽火通信科技股份有限公司 filed Critical 烽火通信科技股份有限公司
Publication of WO2021136542A1 publication Critical patent/WO2021136542A1/en

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
    • 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/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
    • 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/126—Shortest path evaluation minimising geographical or physical path length

Definitions

  • the present invention relates to the field of communication technology, in particular to a path calculation method and system.
  • service routing usually calculates the shortest path individually in order; however, in Dense-Wavelength Division Multiplexing (DWDM) networks, due to restrictions on the frequency spectrum and available channels, for multiple services Optimizing at the same time, it is often impossible to obtain the shortest overall transmission length.
  • DWDM Dense-Wavelength Division Multiplexing
  • the purpose of the present invention is to provide a path calculation method and system, which can shorten the total length of the current working path of the service as much as possible under the condition of limited resources, and improve the overall operation efficiency of the entire network.
  • the present invention provides a path calculation method, which includes:
  • the shortest path and the reassigned current working path all belong to the K short path.
  • R i represents the length of the current working path of the i-th service
  • R i0 represents the length of the shortest path of the i-th service, 1 ⁇ i ⁇ n.
  • the method further includes:
  • the present invention also provides a path calculation system, which includes:
  • a calculation module which is used to calculate the total length of the K short path of each service and the current working path of all services
  • the adjustment module is used to compare the degree of deviation between the current working path of each business and the shortest path. Starting from the business with the largest degree of deviation, the resources in the shortest path are released to replace the current working path, and are the business to which the released resources belong The current working path is re-allocated, so that the total length of the current working path after adjustment is reduced; among them, the shortest path and the re-allocated current working path all belong to the K short path.
  • R i represents the length of the current working path of the i-th service
  • R i0 represents the length of the shortest path of the i-th service, 1 ⁇ i ⁇ n.
  • the adjustment module is configured to release the resources occupied by the service with the least deviation on each link of the shortest path, and replace the current work with the path obtained after the resource is released path.
  • the adjustment module is further configured to stop adjusting the current working path when the deviation value between the total length of the current working path and the total length of the shortest path of all services is lower than a set threshold.
  • the calculation module is further configured to determine the current working path from the K short path.
  • the system further includes:
  • the obtaining module is used to obtain the current working path information of all services.
  • the path calculation method in the embodiment of the present invention includes: calculating the K Shortest Path (KSP) of each service and the total length of the current working path of all services; comparing the current working path of each service The degree of deviation from the shortest path, starting from the business with the greatest degree of deviation, the resources in the shortest path are released to replace the current working path, and the current working path is re-allocated for the business to which the released resources belong, so that the total current working path is adjusted The length is reduced; among them, the shortest path and the reassigned current working path all belong to the K short path.
  • the embodiment of the present invention shortens the total length of the current working path of the service as much as possible and improves the overall operation efficiency of the entire network.
  • Fig. 1 is a flowchart of a path calculation method according to an embodiment of the present invention
  • Fig. 2 is a schematic diagram of a network topology to which a path calculation method according to an embodiment of the present invention is applied;
  • Fig. 3 is a schematic diagram of a path calculation system according to an embodiment of the present invention.
  • an embodiment of the present invention provides a path calculation method, and the path calculation method includes:
  • S110 calculates the total length of the K short path of each service and the current working path of all services.
  • S120 compares the degree of deviation between the current working path of each business and the shortest path, starting with the business with the greatest degree of deviation, releasing the resources in the shortest path to replace the current working path, and reallocating the current working path for the business to which the released resource belongs , So that the total length of the current working path after adjustment is reduced; among them, the shortest path and the reassigned current working path all belong to the K short path.
  • the features of the embodiments of the present invention include: reducing the overall route length and improving resource utilization; performing adjustment based on the overall situation, partially solving the problem that the local optimum is not equal to the global optimum; and improving the overall operation efficiency of the entire network.
  • the embodiment of the present invention can solve the problem that the global route cannot be optimized due to resource constraints in a mesh network, and can greatly reduce the global route length.
  • the path calculation method of the embodiment of the present invention under the condition that the frequency spectrum and the available channel limitation are guaranteed to be satisfied first, the total length of the service working path is shortened as much as possible, and it is suitable for the national trunk network and the national trunk network with higher requirements for the total length of the working path.
  • International trunk network International trunk network.
  • the deviation degree P i is:
  • R i represents the length of the current working path of the i-th service
  • R i0 represents the length of the shortest path of the i-th service
  • 1 ⁇ i ⁇ n represents the total number of services in the entire network
  • n is a positive integer, Normally, n>1.
  • the resources occupied by the service with the smallest deviation degree are released, and the current working path is replaced with the path obtained after the resource is released.
  • the shortest path includes m links, and m is a positive integer. Generally, m ⁇ 1.
  • the path calculation method further includes:
  • the path calculation method further includes:
  • S100 obtains information about the current working path of all services.
  • step S110 the current working path is determined from the K short path.
  • the current working path can be determined from the K short path according to the existing path resource allocation algorithm.
  • the path calculation method in the embodiment of the present invention includes:
  • S201 calculates the K short path of each service, and calculates the deviation value between the K short path and the shortest path.
  • S202 calculates the path, wavelength and relay resource allocation of all services according to the path resource allocation algorithm, and marks the current working path p of each service, 0 ⁇ p ⁇ K-1, 0 means the shortest path, and the current working path p is A path in the K short path, R(c_ip) represents the length of the p-th short path of the service c_i, and records the total length of the current working path of all services.
  • S205 adjusts the path and resource of the service c_j with the largest deviation.
  • the length of the shortest path of service c_j is R(c_j0)
  • the shortest path passes through three links
  • the service set on each link is (c_j1, c_j2, c_j3), (c_j4, c_j5, c_j6, c_j7) and (c_j2, c_j5, c_j8).
  • S206 sorts the service sets on each link in descending order of deviation degree.
  • S207 deletes all the service paths and resources with the least deviation.
  • step S210 compares the total length of the current working path after adjustment with the total length of the current working path before adjustment, and if there is a decrease, it proceeds to step S211; otherwise, no adjustment is made and the process ends.
  • S211 makes adjustments, and puts the business with the greatest degree of deviation from this adjustment into the invariant set, and no adjustment is made in the next cycle.
  • the embodiment of the present invention is based on the K short path algorithm and uses the bubble algorithm idea to perform routing calculation and path length adjustment analysis.
  • the focus is on solving the problem of obtaining the shortest route of the entire network when the mesh degree of the network is high.
  • Node1 ⁇ Node2 is 200 kilometers (Km)
  • the length of Node1 ⁇ Node3 is 80Km
  • the length of Node1 ⁇ Node4 is 100Km
  • the length of Node2 ⁇ Node3 is 100Km
  • the length of Node3 ⁇ Node4 is 120Km, between any two nodes Both can be completed without relay; there are business A (Node1 ⁇ Node2) and business B (Node1 ⁇ Node3).
  • S310 calculates the K short path of the two services, and determines the current working path.
  • K 3 ⁇ passable paths (Node1 ⁇ Node2: length is 200Km, Node1 ⁇ Node3 ⁇ Node2: length is 180Km; Node1 ⁇ Node4 ⁇ Node3 ⁇ Node2: length is 320Km ), starting from the shortest path, select Node1 ⁇ Node3 ⁇ Node2 as the current working path of service A.
  • Node1 ⁇ Node2 ⁇ Node3 length is 300Km; Node1 ⁇ Node3: length is 80Km; Node1 ⁇ Node4 ⁇ Node3: length is 220Km), Node1 ⁇ Node3 is the shortest, but The resource is occupied by service A, so Node1 ⁇ Node4 ⁇ Node3 is selected as the current working path of service B.
  • S320 calculates the deviation value of the K short path of the above service relative to the shortest path:
  • Node1 ⁇ Node2 The deviation value is 20Km, 11%;
  • Node1 ⁇ Node4 ⁇ Node3 ⁇ Node2 The deviation value is 140Km, 78%.
  • Node1 ⁇ Node2 ⁇ Node3 The deviation value is 220Km, 2.75;
  • Node1 ⁇ Node3 reference value
  • Node1 ⁇ Node4 ⁇ Node3 (current working path): the deviation value is 220Km, 2.75.
  • S330 sorts the business according to the degree of deviation
  • the adjustment sequence is: first business B, then business A.
  • the shortest path of service B is Node1 ⁇ Node3, there is service A on the shortest path of service B, and the resources occupied by service A are released;
  • the total length of the current working path after adjustment is lower than the length of the current working path before the adjustment, the route of the adjusted service A and the service B is determined, and the current working path of the adjusted service B is added to the unchanged list.
  • an embodiment of the present invention also provides a path calculation system for implementing the path calculation method of the foregoing embodiment.
  • the path calculation system includes a calculation module and an adjustment module.
  • the calculation module is used to calculate the total length of the K short path of each service and the current working path of all services.
  • the adjustment module is used to compare the degree of deviation between the current working path of each business and the shortest path, starting from the business with the largest degree of deviation, releasing the resources in the shortest path to replace the current working path, and reallocating the business to which the released resources belong
  • the current working path reduces the total length of the current working path after adjustment; among them, the shortest path and the reassigned current working path all belong to the K short path.
  • the deviation degree P i is:
  • R i represents the length of the current working path of the i-th service
  • R i0 represents the length of the shortest path of the i-th service
  • 1 ⁇ i ⁇ n represents the total number of services in the entire network
  • n is a positive integer, Normally, n>1.
  • the adjustment module is used to release the resources occupied by the service with the least deviation on each link of the shortest path, and replace the current working path with the path obtained after the resource is released.
  • the shortest path includes m links, and m is a positive integer. Generally, m ⁇ 1.
  • the adjustment module is further configured to stop adjusting the current working path when the deviation value between the total length of the current working path and the total length of the shortest paths of all services is lower than a set threshold.
  • the calculation module is also used to determine the current working path from the K short path.
  • the path calculation system further includes an obtaining module, which is used to obtain information about the current working path of all services.

Abstract

The present invention relates to the technical field of communications. Disclosed are a path calculation method and system. The path calculation method comprises: calculating K short paths of each service and the total length of the current working paths of all services; and comparing the degree of deviation between the current working path of each service and a shortest path, releasing a resource in the shortest path from the service having a maximum degree of deviation to replace the current working path, and reallocating the current working path to the service to which the released resource belongs, so that the total length of the adjusted current working path is reduced, wherein the shortest path and the reallocated current working path both belong to the K short paths. In the present invention, in the case that resources are limited, the total length of the current working path of the service is shortened as much as possible, thereby improving the overall operation efficiency of the whole network.

Description

一种路径计算方法及***A path calculation method and system 技术领域Technical field
本发明涉及通信技术领域，具体是涉及一种路径计算方法及***。The present invention relates to the field of communication technology, in particular to a path calculation method and system.
背景技术Background technique
传统的路由计算领域，业务路由通常是按顺序单条进行最短路径计算；但在密集波分复用(Dense-Wavelength Division Multiplexing，DWDM)网络中，由于频谱、可用波道等限制，对于多条业务同时进行优化，往往无法获取总体最短的传输长度，单条业务在当时的资源情况下的最短，组合起来并不是最优的解，达不到全局最短路径的要求。In the traditional routing calculation field, service routing usually calculates the shortest path individually in order; however, in Dense-Wavelength Division Multiplexing (DWDM) networks, due to restrictions on the frequency spectrum and available channels, for multiple services Optimizing at the same time, it is often impossible to obtain the shortest overall transmission length. A single service is the shortest under the current resource situation, and the combination is not the optimal solution, and it does not meet the requirements of the global shortest path.
发明内容Summary of the invention
针对现有技术中存在的缺陷，本发明的目的在于提供一种路径计算方法及***，在资源受限的情况下，尽可能缩短业务的当前工作路径的总长度，提高全网整体运行效率。In view of the defects in the prior art, the purpose of the present invention is to provide a path calculation method and system, which can shorten the total length of the current working path of the service as much as possible under the condition of limited resources, and improve the overall operation efficiency of the entire network.
本发明提供一种路径计算方法，其包括：The present invention provides a path calculation method, which includes:
计算每个业务的K短路径和所有业务的当前工作路径的总长度；Calculate the total length of the K short path of each service and the current working path of all services;
比较每个业务的当前工作路径与最短路径的偏离程度，从偏离程度最大的业务开始，释放最短路径中的资源以替换当前工作路径，并为被释放的资源所属的业务重新分配当前工作路径，使得调整后当前工作路径的总长度减小；Compare the degree of deviation between the current working path of each business and the shortest path, start with the business with the greatest degree of deviation, release the resources in the shortest path to replace the current working path, and re-allocate the current working path for the business to which the released resources belong, Reduce the total length of the current working path after adjustment;
其中，最短路径以及重新分配的当前工作路径都属于K短路径。Among them, the shortest path and the reassigned current working path all belong to the K short path.
在上述技术方案的基础上，对于第i个业务，所述偏离程度P i为： On the basis of the above technical solution, for the i-th business, the deviation degree P i is:
Figure PCTCN2021070050-appb-000001
Figure PCTCN2021070050-appb-000001
其中，R i表示第i个业务的所述当前工作路径的长度，R i0表示第i个业务的所述最短路径的长度，1≤i≤n。 Wherein, R i represents the length of the current working path of the i-th service, R i0 represents the length of the shortest path of the i-th service, 1≤i≤n.
在上述技术方案的基础上，在所述最短路径的每条链路上，释放所述偏离程度最小的业务占用的资源，以释放资源后得到的路径替换所述当前工作路径。On the basis of the above technical solution, on each link of the shortest path, the resources occupied by the service with the smallest deviation degree are released, and the current working path is replaced with the path obtained after the resource is released.
在上述技术方案的基础上，所述方法还包括：On the basis of the above technical solution, the method further includes:
当所述当前工作路径的总长度与所有业务的所述最短路径的总长度的偏差值低于设定阈值时，停止调整所述当前工作路径。When the deviation value between the total length of the current working path and the total length of the shortest path of all services is lower than a set threshold, stop adjusting the current working path.
在上述技术方案的基础上，在计算每个业务的K短路径之前，获取所有业务的所述当前工作路径的信息；或者，从所述K短路径中确定所述当前工作路径。On the basis of the above technical solution, before calculating the K short path of each service, obtain the current working path information of all services; or determine the current working path from the K short path.
本发明还提供一种路径计算***，其包括：The present invention also provides a path calculation system, which includes:
计算模块，其用于计算每个业务的K短路径和所有业务的当前工作路径的总长度；A calculation module, which is used to calculate the total length of the K short path of each service and the current working path of all services;
调整模块，其用于比较每个业务的当前工作路径与最短路径的偏离程度，从偏离程度最大的业务开始，释放最短路径中的资源以替换当前工作路径，并为被释放的资源所属的业务重新分配当前工作路径，使得调整后当前工作路径的总长度减小；其中，最短路径以及重新分配的当前工作路径都属于K短路径。The adjustment module is used to compare the degree of deviation between the current working path of each business and the shortest path. Starting from the business with the largest degree of deviation, the resources in the shortest path are released to replace the current working path, and are the business to which the released resources belong The current working path is re-allocated, so that the total length of the current working path after adjustment is reduced; among them, the shortest path and the re-allocated current working path all belong to the K short path.
在上述技术方案的基础上，对于第i个业务，所述偏离程度P i为：
Figure PCTCN2021070050-appb-000002
On the basis of the above technical solution, for the i-th business, the deviation degree P i is:
Figure PCTCN2021070050-appb-000002
其中，R i表示第i个业务的所述当前工作路径的长度，R i0表示第 i个业务的所述最短路径的长度，1≤i≤n。 Wherein, R i represents the length of the current working path of the i-th service, R i0 represents the length of the shortest path of the i-th service, 1≤i≤n.
在上述技术方案的基础上，所述调整模块用于在所述最短路径的每条链路上，释放所述偏离程度最小的业务占用的资源，以释放资源后得到的路径替换所述当前工作路径。On the basis of the above technical solution, the adjustment module is configured to release the resources occupied by the service with the least deviation on each link of the shortest path, and replace the current work with the path obtained after the resource is released path.
在上述技术方案的基础上，所述调整模块还用于当所述当前工作路径的总长度与所有业务的所述最短路径的总长度的偏差值低于设定阈值时，停止调整所述当前工作路径；On the basis of the above technical solution, the adjustment module is further configured to stop adjusting the current working path when the deviation value between the total length of the current working path and the total length of the shortest path of all services is lower than a set threshold. Working path
所述计算模块还用于从所述K短路径中确定所述当前工作路径。The calculation module is further configured to determine the current working path from the K short path.
在上述技术方案的基础上，所述***还包括：On the basis of the above technical solution, the system further includes:
获取模块，其用于获取所有业务的所述当前工作路径的信息。The obtaining module is used to obtain the current working path information of all services.
与现有技术相比，本发明实施例路径计算方法包括：计算每个业务的K短路径(K Shortest Path，KSP)和所有业务的当前工作路径的总长度；比较每个业务的当前工作路径与最短路径的偏离程度，从偏离程度最大的业务开始，释放最短路径中的资源以替换当前工作路径，并为被释放的资源所属的业务重新分配当前工作路径，使得调整后当前工作路径的总长度减小；其中，最短路径以及重新分配的当前工作路径都属于K短路径。本发明实施例在资源受限的情况下，尽可能缩短业务的当前工作路径的总长度，提高全网整体运行效率。Compared with the prior art, the path calculation method in the embodiment of the present invention includes: calculating the K Shortest Path (KSP) of each service and the total length of the current working path of all services; comparing the current working path of each service The degree of deviation from the shortest path, starting from the business with the greatest degree of deviation, the resources in the shortest path are released to replace the current working path, and the current working path is re-allocated for the business to which the released resources belong, so that the total current working path is adjusted The length is reduced; among them, the shortest path and the reassigned current working path all belong to the K short path. In the case of limited resources, the embodiment of the present invention shortens the total length of the current working path of the service as much as possible and improves the overall operation efficiency of the entire network.
附图说明Description of the drawings
为了更清楚地说明本发明实施例中的技术方案，下面将对实施例描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本发明的一些实施例，对于本领域技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。In order to explain the technical solutions in the embodiments of the present invention more clearly, the following will briefly introduce the drawings needed in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.
图1是本发明实施例路径计算方法流程图；Fig. 1 is a flowchart of a path calculation method according to an embodiment of the present invention;
图2是应用本发明实施例路径计算方法的网络拓扑示意图；Fig. 2 is a schematic diagram of a network topology to which a path calculation method according to an embodiment of the present invention is applied;
图3是本发明实施例路径计算***示意图。Fig. 3 is a schematic diagram of a path calculation system according to an embodiment of the present invention.
具体实施方式Detailed ways
下面结合附图及具体实施例对本发明作进一步的详细描述。The present invention will be further described in detail below in conjunction with the drawings and specific embodiments.
参见图1所示，本发明实施例提供一种路径计算方法，路径计算方法包括：Referring to FIG. 1, an embodiment of the present invention provides a path calculation method, and the path calculation method includes:
S110计算每个业务的K短路径和所有业务的当前工作路径的总长度。S110 calculates the total length of the K short path of each service and the current working path of all services.
S120比较每个业务的当前工作路径与最短路径的偏离程度，从偏离程度最大的业务开始，释放最短路径中的资源以替换当前工作路径，并为被释放的资源所属的业务重新分配当前工作路径，使得调整后当前工作路径的总长度减小；其中，最短路径以及重新分配的当前工作路径都属于K短路径。S120 compares the degree of deviation between the current working path of each business and the shortest path, starting with the business with the greatest degree of deviation, releasing the resources in the shortest path to replace the current working path, and reallocating the current working path for the business to which the released resource belongs , So that the total length of the current working path after adjustment is reduced; among them, the shortest path and the reassigned current working path all belong to the K short path.
本发明实施例具有的特点包括：降低了全局的路由长度，提升了资源利用率；基于全局进行调整，部分解决了局部最优不等于全局最优的问题；提高了全网整体运行效率。The features of the embodiments of the present invention include: reducing the overall route length and improving resource utilization; performing adjustment based on the overall situation, partially solving the problem that the local optimum is not equal to the global optimum; and improving the overall operation efficiency of the entire network.
相比于传统的路由计算模式，本发明实施例可以解决网格(mesh)网络的由于资源受限原因导致全局路由无法最优问题，能够较大幅度地降低全局的路由长度。Compared with the traditional route calculation mode, the embodiment of the present invention can solve the problem that the global route cannot be optimized due to resource constraints in a mesh network, and can greatly reduce the global route length.
本发明实施例的路径计算方法，在优先保证满足频谱和可用波道受限的情况下，尽可能缩短业务工作路径的总长度，适用于对于工作路径的总长度要求较高的国家干线网络和国际干线网络。The path calculation method of the embodiment of the present invention, under the condition that the frequency spectrum and the available channel limitation are guaranteed to be satisfied first, the total length of the service working path is shortened as much as possible, and it is suitable for the national trunk network and the national trunk network with higher requirements for the total length of the working path. International trunk network.
作为一个可选的实施方式，对于第i个业务，偏离程度P i为：
Figure PCTCN2021070050-appb-000003
As an optional implementation manner, for the i-th business, the deviation degree P i is:
Figure PCTCN2021070050-appb-000003
其中，R i表示第i个业务的当前工作路径的长度，R i0表示第i个 业务的最短路径的长度，1≤i≤n，n为全网中业务的总数量，n为正整数，通常情况下，n>1。 Among them, R i represents the length of the current working path of the i-th service, R i0 represents the length of the shortest path of the i-th service, 1≤i≤n, n is the total number of services in the entire network, and n is a positive integer, Normally, n>1.
作为一个可选的实施方式，在最短路径的每条链路上，释放偏离程度最小的业务占用的资源，以释放资源后得到的路径替换当前工作路径。As an optional implementation manner, on each link of the shortest path, the resources occupied by the service with the smallest deviation degree are released, and the current working path is replaced with the path obtained after the resource is released.
具体的，最短路径包括m条链路，m为正整数，通常情况下，m≥1。Specifically, the shortest path includes m links, and m is a positive integer. Generally, m≥1.
作为一个可选的实施方式，路径计算方法还包括：As an optional implementation manner, the path calculation method further includes:
当当前工作路径的总长度与所有业务的最短路径的总长度的偏差值低于设定阈值时，停止调整当前工作路径。When the deviation between the total length of the current working path and the total length of the shortest path of all services is lower than the set threshold, stop adjusting the current working path.
作为一个可选的实施方式，在步骤S110之前，路径计算方法还包括：As an optional implementation manner, before step S110, the path calculation method further includes:
S100获取所有业务的当前工作路径的信息。S100 obtains information about the current working path of all services.
作为一个可选的实施方式，在步骤S110中，从K短路径中确定当前工作路径。As an optional implementation manner, in step S110, the current working path is determined from the K short path.
具体的，可以根据现有的路径资源分配算法从K短路径中确定当前工作路径。Specifically, the current working path can be determined from the K short path according to the existing path resource allocation algorithm.
在一个示例中，本发明实施例路径计算方法包括：In an example, the path calculation method in the embodiment of the present invention includes:
S201计算每个业务的K短路径，计算K短路径与最短路径的偏差值。S201 calculates the K short path of each service, and calculates the deviation value between the K short path and the shortest path.
对于第i个业务(c_i)，计算第k短路径与最短路径的偏离值P(c_ik)，即P(c_ik)＝R(c_ik)-R(c_i0)，其中，R(c_ik)为第k短路径的长度，R(c_i0)为最短路径的长度。For the i-th service (c_i), calculate the deviation value P(c_ik) between the k-th shortest path and the shortest path, that is, P(c_ik)=R(c_ik)-R(c_i0), where R(c_ik) is the k-th The length of the short path, R(c_i0) is the length of the shortest path.
S202根据路径资源分配算法计算出所有业务的路径、波长以及中继资源分配，并标记出每个业务的当前工作路径p，0≤p≤K-1，0 表示最短路径，当前工作路径p是K短路径中的一条路径，R(c_ip)表示业务c_i的第p短路径的长度，并记录所有业务的当前工作路径的总长度。S202 calculates the path, wavelength and relay resource allocation of all services according to the path resource allocation algorithm, and marks the current working path p of each service, 0≤p≤K-1, 0 means the shortest path, and the current working path p is A path in the K short path, R(c_ip) represents the length of the p-th short path of the service c_i, and records the total length of the current working path of all services.
S203计算业务c_i的当前偏离程度：P(c_ip)-P aver，其中，P(c_ip)为当前工作路径与最短路径的偏离值，即P(c_ip)＝R(c_ip)-R(c_i0)，P aver为所有业务的当前工作路径与最短路径的偏差值的平均值，
Figure PCTCN2021070050-appb-000004
S203 Calculate the current deviation degree of the service c_i: P(c_ip)-P aver , where P(c_ip) is the deviation value between the current working path and the shortest path, that is, P(c_ip)=R(c_ip)-R(c_i0), P aver is the average value of the deviation between the current working path of all businesses and the shortest path,
Figure PCTCN2021070050-appb-000004
S204对所有业务按当前偏离程度从大到小排序。In S204, all services are sorted according to the current deviation degree from large to small.
S205调整偏离程度最大的业务c_j的路径和资源。S205 adjusts the path and resource of the service c_j with the largest deviation.
例如：业务c_j的最短路径的长度为R(c_j0)，最短路径经过三条链路，每条链路上的业务集合分别为(c_j1,c_j2,c_j3)，(c_j4,c_j5,c_j6,c_j7)和(c_j2,c_j5,c_j8)。For example: the length of the shortest path of service c_j is R(c_j0), the shortest path passes through three links, and the service set on each link is (c_j1, c_j2, c_j3), (c_j4, c_j5, c_j6, c_j7) and (c_j2, c_j5, c_j8).
S206对每条链路上的业务集合按偏离程度从大到小排序。S206 sorts the service sets on each link in descending order of deviation degree.
S207删除所有的偏离程度最小的业务的路径和资源。S207 deletes all the service paths and resources with the least deviation.
S208当删除完所有的链路上偏离程度最小的业务，即能够释放出一条路径供偏离程度最大的业务使用。S208 When all the services with the smallest deviation on the link are deleted, a path can be released for use by the services with the largest deviation.
S209再依次计算所有链路上被释放路径和资源所属的业务的当前工作路径。In S209, the released paths on all links and the current working paths of the services to which the resources belong are sequentially calculated.
S210对比调整后的当前工作路径的总长度和调整前当前工作路径的总长度，如果有降低，即进入步骤S211；否则，不作调整，结束流程。S210 compares the total length of the current working path after adjustment with the total length of the current working path before adjustment, and if there is a decrease, it proceeds to step S211; otherwise, no adjustment is made and the process ends.
S211进行调整，并将本次调整的偏离程度最大的业务放入不变集合中，下次循环时不进行调整。S211 makes adjustments, and puts the business with the greatest degree of deviation from this adjustment into the invariant set, and no adjustment is made in the next cycle.
S212判断是否满足退出条件，若是，结束；若否，返回步骤S204。In S212, it is judged whether the exit condition is met, and if so, the end; if not, it returns to step S204.
退出条件包括两个：所有业务的当前工作路径的总长度与所有业 务的最短路径的总长度的偏差值低于设定阈值，或者，受到资源限制而无法继续调整。There are two exit conditions: the deviation between the total length of the current working path of all services and the total length of the shortest path of all services is lower than the set threshold, or the adjustment cannot be continued due to resource constraints.
本发明实施例基于K短路径算法，利用冒泡算法的思路进行路由计算以及路径长度调整分析，重点需要解决网络Mesh程度较高时，需要得到全网最短路由路径的问题。The embodiment of the present invention is based on the K short path algorithm and uses the bubble algorithm idea to perform routing calculation and path length adjustment analysis. The focus is on solving the problem of obtaining the shortest route of the entire network when the mesh degree of the network is high.
以下通过一个具体示例说明本发明实施例路径计算方法。The following uses a specific example to illustrate the path calculation method in the embodiment of the present invention.
参见图2所示的网络拓扑示意图，包括节点Node1、Node2、Node3、Node4和Node5，其中，Node1→Node2、Node1→Node3、Node1→Node4、Node2→Node3、Node3→Node4均只存在一个可用波道，Node1→Node2的长度为200公里(Km)、Node1→Node3的长度为80Km、Node1→Node4的长度为100Km、Node2→Node3的长度为100Km、Node3→Node4的长度为120Km，任意两节点之间均可以不做中继完成；存在业务A(Node1→Node2)和业务B(Node1→Node3)。Refer to the network topology diagram shown in Figure 2, including nodes Node1, Node2, Node3, Node4, and Node5, among which, Node1→Node2, Node1→Node3, Node1→Node4, Node2→Node3, Node3→Node4 all have only one available channel , The length of Node1→Node2 is 200 kilometers (Km), the length of Node1→Node3 is 80Km, the length of Node1→Node4 is 100Km, the length of Node2→Node3 is 100Km, the length of Node3→Node4 is 120Km, between any two nodes Both can be completed without relay; there are business A (Node1→Node2) and business B (Node1→Node3).
本发明实施例路径计算方法包括：The path calculation method in the embodiment of the present invention includes:
S310计算两条业务的K短路径，并确定当前工作路径。S310 calculates the K short path of the two services, and determines the current working path.
首先计算业务A的K短路径，例如K＝3，一共有三条可通路径(Node1→Node2：长度为200Km，Node1→Node3→Node2：长度为180Km；Node1→Node4→Node3→Node2：长度为320Km)，从最短路径出发选择Node1→Node3→Node2作为业务A的当前工作路径。First calculate the K short path of service A. For example, K=3, there are three passable paths (Node1→Node2: length is 200Km, Node1→Node3→Node2: length is 180Km; Node1→Node4→Node3→Node2: length is 320Km ), starting from the shortest path, select Node1→Node3→Node2 as the current working path of service A.
然后计算业务B的K短路径，一共三条可通路径(Node1→Node2→Node3：长度为300Km；Node1→Node3：长度为80Km；Node1→Node4→Node3：长度为220Km)，Node1→Node3最短，但资源被业务A占用，因此选择Node1→Node4→Node3作为业务B的当前工作路径。Then calculate the K short path of business B, a total of three passable paths (Node1→Node2→Node3: length is 300Km; Node1→Node3: length is 80Km; Node1→Node4→Node3: length is 220Km), Node1→Node3 is the shortest, but The resource is occupied by service A, so Node1→Node4→Node3 is selected as the current working path of service B.
业务A和业务B的当前工作路径的总长度为180+220＝400Km。The total length of the current working path of service A and service B is 180+220=400Km.
S320计算上述业务的K短路径相对于最短路径的偏差值：S320 calculates the deviation value of the K short path of the above service relative to the shortest path:
业务A：Business A:
Node1→Node2：偏差值为20Km，11％；Node1→Node2: The deviation value is 20Km, 11%;
Node1→Node3→Node2(当前工作路径)：基准值；Node1→Node3→Node2 (current working path): reference value;
Node1→Node4→Node3→Node2：偏差值为140Km，78％。Node1→Node4→Node3→Node2: The deviation value is 140Km, 78%.
业务B：Business B:
Node1→Node2→Node3：偏差值为220Km，2.75；Node1→Node2→Node3: The deviation value is 220Km, 2.75;
Node1→Node3：基准值；Node1→Node3: reference value;
Node1→Node4→Node3(当前工作路径)：偏差值为220Km，2.75。Node1→Node4→Node3 (current working path): the deviation value is 220Km, 2.75.
S330按偏离程度对业务排序S330 sorts the business according to the degree of deviation
按偏离程度排序后，调整顺序为：首先业务B，然后业务A。After sorting by the degree of deviation, the adjustment sequence is: first business B, then business A.
S340调整业务的当前工作路径S340 adjust the current working path of the business
业务B的最短路径为Node1→Node3，业务B的最短路径上存在业务A，释放业务A占据的资源；The shortest path of service B is Node1→Node3, there is service A on the shortest path of service B, and the resources occupied by service A are released;
得到业务B的调整后的路由：Node1→Node3；Get the adjusted route of service B: Node1→Node3;
从业务A的K短路径中得到调整后的路由：Node1→Node2。Obtain the adjusted route from the K short path of service A: Node1→Node2.
S350判断调整前、后当前工作路径的总长度S350 judges the total length of the current working path before and after adjustment
调整后所有业务的当前工作路径的总长度200Km+80Km＝280Km，调整前所有业务的当前工作路径的总长度180Km+220Km＝400Km。比较后，调整后当前工作路径的总长度低于调整前当前工作路径的长度，判定调整业务A和业务B的路由，将调整后业务B的当前工作路径加入到不变列表。The total length of the current working paths of all services after the adjustment is 200Km+80Km=280Km, and the total length of the current working paths of all services before the adjustment is 180Km+220Km=400Km. After the comparison, the total length of the current working path after adjustment is lower than the length of the current working path before the adjustment, the route of the adjusted service A and the service B is determined, and the current working path of the adjusted service B is added to the unchanged list.
S360判断业务A，业务A无法调整，流程终止。S360 judges business A, business A cannot be adjusted, and the process is terminated.
参见图3所示，本发明实施例还提供一种路径计算***，用于实 现前述实施例路径计算方法，路径计算***包括计算模块和调整模块。Referring to FIG. 3, an embodiment of the present invention also provides a path calculation system for implementing the path calculation method of the foregoing embodiment. The path calculation system includes a calculation module and an adjustment module.
计算模块用于计算每个业务的K短路径和所有业务的当前工作路径的总长度。The calculation module is used to calculate the total length of the K short path of each service and the current working path of all services.
调整模块用于比较每个业务的当前工作路径与最短路径的偏离程度，从偏离程度最大的业务开始，释放最短路径中的资源以替换当前工作路径，并为被释放的资源所属的业务重新分配当前工作路径，使得调整后当前工作路径的总长度减小；其中，最短路径以及重新分配的当前工作路径都属于K短路径。The adjustment module is used to compare the degree of deviation between the current working path of each business and the shortest path, starting from the business with the largest degree of deviation, releasing the resources in the shortest path to replace the current working path, and reallocating the business to which the released resources belong The current working path reduces the total length of the current working path after adjustment; among them, the shortest path and the reassigned current working path all belong to the K short path.
作为一个可选的实施方式，对于第i个业务，偏离程度P i为：
Figure PCTCN2021070050-appb-000005
As an optional implementation manner, for the i-th business, the deviation degree P i is:
Figure PCTCN2021070050-appb-000005
其中，R i表示第i个业务的当前工作路径的长度，R i0表示第i个业务的最短路径的长度，1≤i≤n，n为全网中业务的总数量，n为正整数，通常情况下，n>1。 Among them, R i represents the length of the current working path of the i-th service, R i0 represents the length of the shortest path of the i-th service, 1≤i≤n, n is the total number of services in the entire network, and n is a positive integer, Normally, n>1.
作为一个可选的实施方式，调整模块用于在最短路径的每条链路上，释放偏离程度最小的业务占用的资源，以释放资源后得到的路径替换当前工作路径。As an optional implementation manner, the adjustment module is used to release the resources occupied by the service with the least deviation on each link of the shortest path, and replace the current working path with the path obtained after the resource is released.
具体的，最短路径包括m条链路，m为正整数，通常情况下，m≥1。Specifically, the shortest path includes m links, and m is a positive integer. Generally, m≥1.
作为一个可选的实施方式，调整模块还用于当当前工作路径的总长度与所有业务的最短路径的总长度的偏差值低于设定阈值时，停止调整当前工作路径。As an optional implementation manner, the adjustment module is further configured to stop adjusting the current working path when the deviation value between the total length of the current working path and the total length of the shortest paths of all services is lower than a set threshold.
计算模块还用于从K短路径中确定当前工作路径。The calculation module is also used to determine the current working path from the K short path.
作为一个可选的实施方式，路径计算***还包括获取模块，获取模块用于获取所有业务的当前工作路径的信息。As an optional implementation manner, the path calculation system further includes an obtaining module, which is used to obtain information about the current working path of all services.
本发明不局限于上述实施方式，对于本技术领域的普通技术人员来说，在不脱离本发明原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也视为本发明的保护范围之内。本说明书中未作详细描述的内容属于本领域专业技术人员公知的现有技术。The present invention is not limited to the above-mentioned embodiments. For those of ordinary skill in the art, without departing from the principle of the present invention, several improvements and modifications can be made, and these improvements and modifications are also regarded as the protection of the present invention. Within range. The content not described in detail in this specification belongs to the prior art known to those skilled in the art.

Claims (10)

  1. 一种路径计算方法，其特征在于，其包括：A path calculation method, characterized in that it includes:
    计算每个业务的K短路径和所有业务的当前工作路径的总长度；Calculate the total length of the K short path of each service and the current working path of all services;
    比较每个业务的当前工作路径与最短路径的偏离程度，从偏离程度最大的业务开始，释放最短路径中的资源以替换当前工作路径，并为被释放的资源所属的业务重新分配当前工作路径，使得调整后当前工作路径的总长度减小；Compare the degree of deviation between the current working path of each business and the shortest path, start with the business with the greatest degree of deviation, release the resources in the shortest path to replace the current working path, and re-allocate the current working path for the business to which the released resources belong, Reduce the total length of the current working path after adjustment;
    其中，最短路径以及重新分配的当前工作路径都属于K短路径。Among them, the shortest path and the reassigned current working path all belong to the K short path.
  2. 如权利要求1所述的路径计算方法，其特征在于：The path calculation method according to claim 1, wherein:
    对于第i个业务，所述偏离程度P i为：
    Figure PCTCN2021070050-appb-100001
    For the i-th business, the deviation P i is:
    Figure PCTCN2021070050-appb-100001
    其中，R i表示第i个业务的所述当前工作路径的长度，R i0表示第i个业务的所述最短路径的长度，1≤i≤n。 Wherein, R i represents the length of the current working path of the i-th service, R i0 represents the length of the shortest path of the i-th service, 1≤i≤n.
  3. 如权利要求1所述的路径计算方法，其特征在于：The path calculation method according to claim 1, wherein:
    在所述最短路径的每条链路上，释放所述偏离程度最小的业务占用的资源，以释放资源后得到的路径替换所述当前工作路径。On each link of the shortest path, the resources occupied by the service with the smallest deviation degree are released, and the current working path is replaced with the path obtained after the resource is released.
  4. 如权利要求1所述的路径计算方法，其特征在于，所述方法还包括：The path calculation method according to claim 1, wherein the method further comprises:
    当所述当前工作路径的总长度与所有业务的所述最短路径的总长度的偏差值低于设定阈值时，停止调整所述当前工作路径。When the deviation value between the total length of the current working path and the total length of the shortest path of all services is lower than a set threshold, stop adjusting the current working path.
  5. 如权利要求1所述的路径计算方法，其特征在于：The path calculation method according to claim 1, wherein:
    在计算每个业务的K短路径之前，获取所有业务的所述当前工作路径的信息；或者，从所述K短路径中确定所述当前工作路径。Before calculating the K short path of each service, obtain the current working path information of all services; or, determine the current working path from the K short path.
  6. 一种路径计算***，其特征在于，其包括：A path calculation system is characterized in that it includes:
    计算模块，其用于计算每个业务的K短路径和所有业务的当前 工作路径的总长度；A calculation module, which is used to calculate the total length of the K short path of each service and the current working path of all services;
    调整模块，其用于比较每个业务的当前工作路径与最短路径的偏离程度，从偏离程度最大的业务开始，释放最短路径中的资源以替换当前工作路径，并为被释放的资源所属的业务重新分配当前工作路径，使得调整后当前工作路径的总长度减小；其中，最短路径以及重新分配的当前工作路径都属于K短路径。The adjustment module is used to compare the degree of deviation between the current working path of each business and the shortest path. Starting from the business with the largest degree of deviation, the resources in the shortest path are released to replace the current working path, and are the business to which the released resources belong The current working path is re-allocated, so that the total length of the current working path after adjustment is reduced; among them, the shortest path and the re-allocated current working path all belong to the K short path.
  7. 如权利要求6所述的路径计算***，其特征在于：The path calculation system according to claim 6, wherein:
    对于第i个业务，所述偏离程度P i为：
    Figure PCTCN2021070050-appb-100002
    For the i-th business, the deviation P i is:
    Figure PCTCN2021070050-appb-100002
    其中，R i表示第i个业务的所述当前工作路径的长度，R i0表示第i个业务的所述最短路径的长度，1≤i≤n。 Wherein, R i represents the length of the current working path of the i-th service, R i0 represents the length of the shortest path of the i-th service, 1≤i≤n.
  8. 如权利要求6所述的路径计算***，其特征在于：The path calculation system according to claim 6, wherein:
    所述调整模块用于在所述最短路径的每条链路上，释放所述偏离程度最小的业务占用的资源，以释放资源后得到的路径替换所述当前工作路径。The adjustment module is configured to release the resources occupied by the service with the least deviation on each link of the shortest path, and replace the current working path with the path obtained after the resource is released.
  9. 如权利要求6所述的路径计算***，其特征在于：The path calculation system according to claim 6, wherein:
    所述调整模块还用于当所述当前工作路径的总长度与所有业务的所述最短路径的总长度的偏差值低于设定阈值时，停止调整所述当前工作路径；The adjustment module is further configured to stop adjusting the current working path when the deviation value between the total length of the current working path and the total length of the shortest path of all services is lower than a set threshold;
    所述计算模块还用于从所述K短路径中确定所述当前工作路径。The calculation module is further configured to determine the current working path from the K short path.
  10. 如权利要求6所述的路径计算***，其特征在于，所述***还包括：The path calculation system according to claim 6, wherein the system further comprises:
    获取模块，其用于获取所有业务的所述当前工作路径的信息。The obtaining module is used to obtain the current working path information of all services.
PCT/CN2021/070050 2020-01-03 2021-01-01 Path calculation method and system WO2021136542A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010005344.7A CN111245720B (en) 2020-01-03 2020-01-03 Path calculation method and system
CN202010005344.7 2020-01-03

Publications (1)

Publication Number Publication Date
WO2021136542A1 true WO2021136542A1 (en) 2021-07-08

Family

ID=70870756

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/070050 WO2021136542A1 (en) 2020-01-03 2021-01-01 Path calculation method and system

Country Status (3)

Country Link
CN (1) CN111245720B (en)
EC (1) ECSP22051301A (en)
WO (1) WO2021136542A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111245720B (en) * 2020-01-03 2021-10-26 烽火通信科技股份有限公司 Path calculation method and system

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103650435A (en) * 2013-08-14 2014-03-19 华为技术有限公司 Routing traffic adjusting method, device and controller
US20170093705A1 (en) * 2015-09-27 2017-03-30 Infinera Corporation Systems and methods for latency based routing
WO2018204295A1 (en) * 2017-05-05 2018-11-08 Nokia Of America Corporation Weight setting using inverse optimization
CN109257287A (en) * 2017-07-13 2019-01-22 华为技术有限公司 A kind of shortest path determines method and controller
CN109598367A (en) * 2018-11-14 2019-04-09 阿里巴巴集团控股有限公司 Multipath processing method and processing device
CN111245720A (en) * 2020-01-03 2020-06-05 烽火通信科技股份有限公司 Path calculation method and system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2359168A1 (en) * 2000-10-25 2002-04-25 John Doucette Design of meta-mesh of chain sub-networks
CN101009636B (en) * 2006-01-26 2010-08-25 华为技术有限公司 Dynamic management method for the multicast service members of the automatic switching optical network
WO2015176835A1 (en) * 2014-05-23 2015-11-26 Telefonaktiebolaget L M Ericsson (Publ) Maintaining optimal media routing

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103650435A (en) * 2013-08-14 2014-03-19 华为技术有限公司 Routing traffic adjusting method, device and controller
US20170093705A1 (en) * 2015-09-27 2017-03-30 Infinera Corporation Systems and methods for latency based routing
WO2018204295A1 (en) * 2017-05-05 2018-11-08 Nokia Of America Corporation Weight setting using inverse optimization
CN109257287A (en) * 2017-07-13 2019-01-22 华为技术有限公司 A kind of shortest path determines method and controller
CN109598367A (en) * 2018-11-14 2019-04-09 阿里巴巴集团控股有限公司 Multipath processing method and processing device
CN111245720A (en) * 2020-01-03 2020-06-05 烽火通信科技股份有限公司 Path calculation method and system

Also Published As

Publication number Publication date
ECSP22051301A (en) 2022-07-29
CN111245720A (en) 2020-06-05
CN111245720B (en) 2021-10-26

Similar Documents

Publication Publication Date Title
US6925061B2 (en) Multi-constraint routing system and method
EP2058986B2 (en) A method for determining a routing path and a routing path determination unit
CN1798068B (en) Method and apparatus for providing a hop limited protection pathway in a network
CN105827528B (en) A kind of route selection method suitable for the flexible optical-fiber network of frequency spectrum
CN112118176B (en) Service reliability-oriented routing load optimization method for channel of integrated data network
CN107124376B (en) Spectrum allocation method based on segmented modulation in Elastic Optical Network (EON)
WO2017181804A1 (en) System and method for communication network service connectivity
CN106998295B (en) Optimized routing and spectrum allocation method and system based on special protection combined fault probability constraint
CN105472484A (en) Wave channel balancing route wavelength allocation method of power backbone optical transport network
WO2021136542A1 (en) Path calculation method and system
CN110913285B (en) Route distribution method and device
CN108833142A (en) A kind of network plan method of multi-core optical fiber planning business
CN113692058B (en) Satellite Optical Network Spectrum Allocation Method and System Based on Spectrum Resource Evaluation Set
Garrido et al. A RMLSA algorithm with modulation format conversion at intermediate nodes
CN104202262A (en) Method and device for spectrum allocation in spectral flexible optical network
CN109921857B (en) Planning method and device of transmission system
CN114745227B (en) Electric power business network slicing time delay calculation method and device based on FlexE and SPN technologies
CN108174446B (en) Network node link resource joint distribution method with minimized resource occupancy
Ye et al. Root mean square (RMS) factor for assessing spectral fragmentation in flexible grid optical networks
CN114785730B (en) Multipath generation method of application layer multipath relay transmission cloud service system
CN115277430B (en) Link fault probability quantification method and SDN controller deployment method
CN111131042B (en) Multi-mode routing method for underwater communication
US6577412B2 (en) System and method of determining end point candidates for an optical channel in a data network
Drummond et al. On-line dynamic traffic grooming algorithms for WDM mesh networks
Li et al. Spectrum Overlap based Routing and Resource Allocation (SO-RRA) in Elastic Optical Networks (EON)

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21736220

Country of ref document: EP

Kind code of ref document: A1