# US 11,909,625 B2 · Systems and methods for modeling and optimizing a telecommunications network > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,909,625 B2 - Document ID: US11909625B2 - Status: Granted - Kind: B2 - Application number: 18/087,468 - Filed: 2022-12-22 - Published: 2023-05-04 - Granted: 2024-02-20 - Earliest claimed: 2019-08-21 - Assignees: CenturyLink Intellectual Property LLC - Applicants: CenturyLink Intellectual Property LLC - Inventors: Daniel Wilson - Web page: https://patentgrep.com/patent/US11909625B2 ## CPC - H04L 41/145: {involving simulating, designing, planning or modelling of a network} - H04L 41/0654: using network fault recovery (ring fault isolation or reconfiguration in loop networks without recovery actions by a network management system H04L12/437) - H04L 41/12: Discovery or management of network topologies - H04L 45/12: Shortest path evaluation - H04L 45/22: {Alternate routing} - H04L 45/28: using route fault recovery - H04L 45/50: using label swapping, e.g. multi-protocol label switch [MPLS] - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract Aspects of the present disclosure include systems, methods, computing devices, computer-implemented methods, and the like for modeling and/or simulating performance of a telecommunications network during one or more failure scenarios that reduces computational time and/or power over previous simulation techniques. Modeling and simulating the network may include generating an initial network model from network data information and applying one or more transformations to the initial network model to reduce the size of the model. Following transformation, simulation methods may be applied to the generated network model based on routing characteristics of the components of the network. To reduce the computations utilized to simulate such components and/or routing decisions in the network, one or more simulation algorithms may be applied to the transformed network model to reduce the number of routing decisions simulated. ## Claims ### Claim 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 Equal Cost Multi-Path (ECMP) routing scheme and wherein generating the shortest path network model comprises transposing the transformed network model to reverse a dependency between the plurality of nodes of the transformed network model. ### Claim 2 (depends on 1) The method of claim 1, wherein simulating the failure scenario further comprises: obtaining, in response to the altering of the characteristic of the edge of the shortest path network model, simulated performance characteristics of a node of the shortest path network model, the node corresponding to a particular component of the network. ### Claim 3 (depends on 2) The method of claim 2 further comprising: altering, based on the simulated performance characteristics of the node of the shortest path network model, a configuration of the particular component of the network configuration. ### Claim 4 (depends on 2) The method of claim 2 further comprising: applying the simulated performance characteristics of the node of the shortest path network model to a network model obtained by reversing the application of the transformation to the initial network model. ### Claim 5 (depends on 1) The method of claim 1, wherein the transformation comprises a dynamic pseudo-node generation transformation to combine nodes of the initial network model with corresponding configurations. ### Claim 6 (depends on 1) The method of claim 1, wherein simulating the failure scenario of the network further comprises applying a simulated traffic load on the reverse dependency of the transposed network model. ### Claim 7 (depends on 1) The method of claim 1, 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. ### Claim 8 (depends on 1) The method of claim 1, wherein the routing scheme is a Constrained Shortest Path First (CSPF) LSP routing scheme and wherein generating the shortest path network model comprises: associating an LSP path of the network to a corresponding communication link of the network to generate an affinity graph of the network; applying a traffic demand on the affinity graph; and determining a bandwidth allocation for each of the corresponding communication links of the network based on the affinity graph. ### Claim 9 A computing device comprising: a processing device; and a non-transitory computer-readable medium encoded with instructions, when executed by the processing device, cause the processing device to perform the operations of: generating, based on network data obtained from a database, 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 similar 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; simulating, based on the shortest path network model, a failure scenario of the network, the simulation comprising altering a characteristic of an edge of the shortest path network model based on a routing scheme of a communication link of the network corresponding to the edge; and obtaining, based on the simulated failure scenario, an operating characteristic of the network, wherein the routing scheme is an Equal Cost Multi-Path (ECMP) routing scheme and wherein generating the shortest path network model comprises transposing the transformed network model to reverse a dependency between the plurality of nodes of the transformed network model. ### Claim 10 (depends on 9) The computing device of claim 9, wherein the operating characteristic of the network is associated with a node of the shortest path network model, the node corresponding to a particular component of the network. ### Claim 11 (depends on 10) The computing device of claim 10, wherein the instructions further cause the processing device to perform the operation of: generating, based on the obtained operating characteristic of the node of the shortest path network model, a configuration instruction for altering a configuration of the particular component of the network configuration. ### Claim 12 (depends on 11) The computing device of claim 11, wherein simulating the failure scenario of the network further comprises applying a simulated traffic load on the reverse dependency of the transposed network model. ### Claim 13 (depends on 9) The computing device of claim 9, wherein the routing scheme is an auto-routing Label-Switched Path (LSP) routing scheme and wherein the instructions further cause the processing device to perform the operations of: 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, less than the first penalty value, to the corresponding communication links of the graph. ### Claim 14 (depends on 9) The computing device of claim 9, wherein the routing scheme is a Constrained Shortest Path First (CSPF) LSP routing scheme and wherein the instructions further cause the processing device to perform the operations of: associating an LSP path of the network to a corresponding communication link of the network to generate an affinity graph of the network; applying a traffic demand on the affinity graph; and determining a bandwidth allocation for each of the corresponding communication links of the network based on the affinity graph. ### Claim 15 A non-transitory computer readable media comprising computer executable instructions to perform a computer-implemented method of modeling a telecommunications network comprising: generating, based on network data obtained from a database, 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 similar 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, 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 Equal Cost Multi-Path (ECMP) routing scheme and wherein generating the shortest path network model comprises transposing the transformed network model to reverse a dependency between the plurality of nodes of the transformed network model. ### Claim 16 (depends on 15) The non-transitory computer readable media of claim 15, wherein the computer-implemented method further comprises: obtaining, in response to the altering of the characteristic of the edge of the shortest path network model, simulated performance characteristics of a node of the shortest path network model, the node corresponding to a particular component of the network. ### Claim 17 (depends on 16) The non-transitory computer readable media of claim 16, wherein the computer-implemented method further comprises: generating, based on the obtained performance characteristic of the node of the shortest path network model, a configuration instruction for altering a configuration of the particular component of the network configuration. ### Claim 18 (depends on 16) The non-transitory computer readable media of claim 16, wherein the computer-implemented method further comprises: applying the simulated performance characteristics of the node of the shortest path network model to a network model obtained by reversing the application of the transformation to the initial network model.