US 12,284,085 B2
Systems and methods for modeling and optimizing a telecommunications network
Daniel Wilson, Annapolis, MD (US)
Assigned to CenturyLink Intellectual Property LLC, Denver, CO (US)
Filed by CenturyLink Intellectual Property LLC, Broomfield, CO (US)
Filed on Feb. 14, 2024, as Appl. No. 18/441,646.
Application 18/441,646 is a continuation of application No. 18/087,468, filed on Dec. 22, 2022, granted, now 11,909,625.
Application 18/087,468 is a continuation of application No. 16/998,217, filed on Aug. 20, 2020, granted, now 11,552,877, issued on Jan. 10, 2023.
Claims priority of provisional application 62/889,818, filed on Aug. 21, 2019.
Prior Publication US 2024/0187333 A1, Jun. 6, 2024
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 41/14 (2022.01); H04L 41/12 (2022.01); H04L 45/00 (2022.01); H04L 45/12 (2022.01); H04L 45/28 (2022.01); H04L 45/50 (2022.01)
CPC H04L 41/145 (2013.01) [H04L 41/12 (2013.01); H04L 45/12 (2013.01); H04L 45/22 (2013.01); H04L 45/28 (2013.01); H04L 45/50 (2013.01)] 18 Claims
OG exemplary drawing
 
1. A method for modeling a telecommunications network, the method comprising:
generating, by a computing device and based on network data, an initial network model comprising nodes representing components of a network and edges representing connections between components of the network;
applying a transformation to the initial network model to combine nodes and edges of the initial network model and reduce a number of nodes and edges of the initial network model;
generating, based on the transformed network model, a shortest path network model comprising edges corresponding to a shortest path determination between a plurality of nodes of the transformed network model; and
simulating, by the computing device and based on the shortest path network model, a failure scenario of the network, wherein the simulation comprises altering a characteristic of an edge of the shortest path network model based on a routing scheme of the network,
wherein the routing scheme is an auto-routing Label-Switched Path (LSP) routing scheme and wherein generating the shortest path network model comprises:
generating a graph of auto-route LSP paths of the network and corresponding communication links of the network; and
associating a first penalty value to the auto-route LSP paths of the graph and a second penalty value to the corresponding communication links of the graph.