US 12,237,993 B2
Method of optimizing a routing in a communications network
Fritz Schinkel, Munich (DE); Christian Münch, Munich (DE); Sebastian Engel, Munich (DE); Marc Geitz, Hagen (DE); Oliver Holschke, Berlin (DE); and Timmy Schüller, Münster (DE)
Assigned to Fujitsu Technology Solutions GmbH, Munich (DE); and Deutsche Telekom AG, Bonn (DE)
Appl. No. 18/288,635
Filed by Fujitsu Technology Solutions GmbH, Munich (DE); and Deutsche Telekom AG, Bonn (DE)
PCT Filed Sep. 15, 2022, PCT No. PCT/EP2022/075644
§ 371(c)(1), (2) Date Oct. 27, 2023,
PCT Pub. No. WO2023/041643, PCT Pub. Date Mar. 23, 2023.
Claims priority of application No. 102021004920.9 (DE), filed on Sep. 20, 2021; and application No. 21204993 (EP), filed on Oct. 27, 2021.
Prior Publication US 2024/0214302 A1, Jun. 27, 2024
Int. Cl. H04L 45/125 (2022.01); H04L 45/12 (2022.01); H04L 47/125 (2022.01); H04W 40/02 (2009.01)
CPC H04L 45/125 (2013.01) [H04L 45/123 (2013.01); H04L 45/124 (2013.01); H04L 47/125 (2013.01); H04W 40/02 (2013.01)] 18 Claims
OG exemplary drawing
 
1. A computer-implemented method of optimizing a routing of data traffic in a communications network with a plurality of communication nodes connectable over edges of communication paths for a routing of the data traffic, wherein the method comprises:
capturing a set of traffic demands, each traffic demand specifying a transfer of a determined data volume from an origin node to a destination node among the plurality of communication nodes,
specifying a set of potential short communication paths among possible communication paths between the respective origin nodes and the respective destination nodes specified in the set of traffic demands, wherein edges within the set of potential short communication paths are assigned a respective usage capacity limit,
specifying a set of potential segment nodes among the plurality of communication nodes, wherein each of the potential segment nodes defines as intermediate node a potential short communication path as member of the set of potential short communication paths between an origin node and a destination node;
calculating for the set of traffic demands, fractional capacity usages of the edges within the set of potential short communication paths, the fractional capacity usages being calculated based on the respective usage capacity limit,
formulating the calculated fractional capacity usages as terms of a quadratic stress function,
formulating in the quadratic stress function, segment node terms that connect the calculated fractional capacity usages of the edges of a respective potential short communication path with those segment nodes within the set of potential segment nodes that lead to the respective potential short communication path, and
determining by using a quantum concept processor, an optimized routing by selecting for each traffic demand of the set of traffic demands one short communication path from the set of potential short communication paths, such that the quadratic stress function is minimized, and
calculating the segment node terms, by using the quantum concept processor, to choose segment nodes within the set of potential segment nodes such that the quadratic stress function is minimized for the determination of the optimized routing.