Quantum computing in root cause analysis of 5g and subsequent generations of communication networks
US-2022224590-A1 · Jul 14, 2022 · US
US12074757B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12074757-B2 |
| Application number | US-202217820050-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 16, 2022 |
| Priority date | Jan 28, 2021 |
| Publication date | Aug 27, 2024 |
| Grant date | Aug 27, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Techniques for connectivity issue remediation are provided. A first link trace message is transmitted from a source end point to a destination end point. A first topology graph for a network is generated based on the first link trace message, and a presence of a connectivity issue in the network is detected. A second link trace message is transmitted from the source end point to the destination end point. A second topology graph for the network is automatically generated based on second link trace message, and a component in the network that caused the connectivity issue is identified based on comparing the first and second topology graphs.
Opening claim text (preview).
We claim: 1. A method, comprising: transmitting, from a source end point to a destination end point, a first link trace message at a first point in time; generating a first topology graph for a network based on the first link trace message, wherein the first topology graph is associated with a first timestamp based on the first point in time; detecting a presence of a connectivity issue in the network; transmitting, from the source end point to the destination end point, a second link trace message at a second point in time; automatically generating a second topology graph for the network based on the second link trace message, wherein the second topology graph is associated with a second timestamp based on the second point in time; and automatically identifying a component in the network that caused the connectivity issue based on comparing the first and second topology graphs to identify one or more differences between the first and second topology graphs. 2. The method of claim 1 , wherein the connectivity issue corresponds to a loop in the network and the identified component corresponds to an identified edge, the method further comprising: generating an alert indicating that the identified edge caused the loop; and automatically remediating the loop by removing the identified edge. 3. The method of claim 1 , wherein detecting presence of the connectivity issue comprises: transmitting, from the source end point, a connectivity packet to evaluate connectivity in the network; and receiving, at the source end point, the connectivity packet. 4. The method of claim 1 , the method further comprising: transmitting, from the source end point, a connectivity packet to evaluate connectivity in the network; upon determining, based on the connectivity packet, that connectivity to the destination end point is not available, transmitting a third link trace message; generating a third topology graph for the network based on the third link trace message; and identifying a problematic node in the network based on comparing the second topology graph and the third topology graph. 5. The method of claim 1 , wherein transmitting the second link trace message was automatically triggered upon detection of the connectivity issue. 6. The method of claim 1 , wherein the transmitting the first link trace message was automatically triggered upon detecting a routing change in the network. 7. The method of claim 1 , wherein the transmitting the first link trace message was automatically triggered upon detecting a change in a state of an interface in the network. 8. One or more non-transitory computer-readable storage media collectively containing computer program code that, when executed by operation of one or more computer processors, performs an operation comprising: transmitting, from a source end point to a destination end point, a first link trace message at a first point in time; generating a first topology graph for a network based on the first link trace message, wherein the first topology graph is associated with a first timestamp based on the first point in time; detecting a presence of a connectivity issue in the network; transmitting, from the source end point to the destination end point, a second link trace message at a second point in time; automatically generating a second topology graph for the network based on the second link trace message, wherein the second topology graph is associated with a second timestamp based on the second point in time; and automatically identifying a component in the network that caused the connectivity issue based on comparing the first and second topology graphs to identify one or more differences between the first and second topology graphs. 9. The non-transitory computer-readable storage media of claim 8 , wherein the connectivity issue corresponds to a loop in the network and the identified component corresponds to an identified edge, the operation further comprising: generating an alert indicating that the identified edge caused the loop; and automatically remediating the loop by removing the identified edge. 10. The non-transitory computer-readable storage media of claim 8 , wherein detecting presence of the connectivity issue comprises: transmitting, from the source end point, a connectivity packet to evaluate connectivity in the network; and receiving, at the source end point, the connectivity packet. 11. The non-transitory computer-readable storage media of claim 8 , the operation further comprising: transmitting, from the source end point, a connectivity packet to evaluate connectivity in the network; upon determining, based on the connectivity packet, that connectivity to the destination end point is not available, transmitting a third link trace message; generating a third topology graph for the network based on the third link trace message; and identifying a problematic node in the network based on comparing the second topology graph and the third topology graph. 12. The non-transitory computer-readable storage media of claim 8 , wherein transmitting the second link trace message was automatically triggered upon detection of the connectivity issue. 13. The non-transitory computer-readable storage media of claim 8 , wherein the transmitting the first link trace message was automatically triggered upon detecting a routing change in the network. 14. The non-transitory computer-readable storage media of claim 8 , wherein the transmitting the first link trace message was automatically triggered upon detecting a change in a state of an interface in the network. 15. A system comprising: one or more computer processors; and one or more memories collectively containing one or more programs which when executed by the one or more computer processors performs an operation, the operation comprising: transmitting, from a source end point to a destination end point, a first link trace message at a first point in time; generating a first topology graph for a network based on the first link trace message, wherein the first topology graph is associated with a first timestamp based on the first point in time; detecting a presence of a connectivity issue in the network; transmitting, from the source end point to the destination end point, a second link trace message at a second point in time; automatically generating a second topology graph for the network based on the second link trace message, wherein the second topology graph is associated with a second timestamp based on the second point in time; and automatically identifying a component in the network that caused the connectivity issue based on comparing the first and second topology graphs to identify one or more differences between the first and second topology graphs. 16. The system of claim 15 , wherein the connectivity issue corresponds to a loop in the network and the identified component corresponds to an identified edge, the operation further comprising: generating an alert indicating that the identified edge caused the loop; and automatically remediating the loop by removing the identified edge. 17. The system of claim 15 , wherein detecting presence of the connectivity issue comprises: transmitting, from the source end point, a connectivity packet to evaluate connectivity in the network; and receiving, at the source end point, the connectivity packet. 18. The system of claim 15 , the operation further comprising: transmitting, from the source end point, a connectivity packet to evaluate connectivity in the network;
Discovery or management of network topologies · CPC title
by checking connectivity · CPC title
by isolating or reconfiguring faulty entities · CPC title
Localisation of faults · CPC title
Active monitoring, e.g. heartbeat, ping or trace-route · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.