IP Library Granted Patent US 12,652,213
Granted Patent B2
US 12,652,213 · App. 18/478,883 · Granted Jun 9, 2026

Systems and methods for error code analytics in telecommunications networks

Inventors: Quenie Sun (Westford, MA); Erdem Uysal (Westford, MA); Steve Loker (Westford, MA); Greg Mayo (Westford, MA)
Assignee: NetScout Systems, Inc.
H04L41/0631H04L1/0061
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,652,213
App. No.
18/478,883
Granted
Jun 9, 2026
Kind
B2
Abstract

A system and method for analyzing error codes includes detecting a failure condition on a network, identifying a subset of subscribers impacted by the failure condition, determining for each subscriber in the subset of subscribers a first set of error codes associated with the failure condition, creating a Bayesian network comprising one or more error codes from the first set of error codes of each the subset of subscribers, computing a Conditional Probability Distribution (CPD) for each of the one or more error codes of the Bayesian network, and determining a second set of error codes based on the CPD, the second set of error codes indicative of a cause of the failure condition.

Claims (77)

1 . A method comprising:

detecting, by one or more processors, a failure condition on a network;

identifying, by the one or more processors, a subset of subscribers impacted by the failure condition;

determining, by the one or more processors, for each subscriber in the subset of subscribers a first set of error codes associated with the failure condition;

creating, by the one or more processors, a Bayesian network comprising one or more error codes from the first set of error codes of each subscriber in the subset of subscribers;

accessing, by the one or more processors, a correlation matrix which indicates a plurality of correlations within a third set of error codes, wherein at least one error code of the first set of error codes is included in the third set of error codes, and wherein respective correlations of the plurality of correlations identify particular error codes within the third set of error codes that cause other particular error codes within the third set of error codes based on computed correlation coefficients;

wherein the plurality of correlations are determined based on computing, by the one or more processors, a correlation coefficient between each error code in the third set of error codes and remaining error codes in the third set of error codes, wherein the correlation matrix is created based on each correlation coefficient, the correlation matrix identifying which error codes in the third set of error codes are correlated, wherein the correlation matrix identifies error code-to-error code causation relationships, and wherein error codes having a correlation coefficient greater than a predetermined threshold are identified as correlated;

identifying, by the one or more processors, using the correlation matrix, a first correlation of the plurality of correlations that relates one or more error codes in the third set of error codes to the at least one error code of the first set of error codes;

determining, by the one or more processors, a second set of error codes from the third set of error codes based on the first correlation; and

resolving, by the one or more processors, at least one of the failure condition or the first set of error codes by addressing one or more error codes of the second set of error codes.

2 . The method of claim 1 , further comprising:

determining, by the one or more processors, the third set of error codes associated with the network; and

filtering, by the one or more processors, the Bayesian network based on the correlation matrix.

3 . The method of claim 2 , wherein the Bayesian network comprises a plurality of nodes, the plurality of nodes comprising a first node having a connection to a second node, the first node is associated with a first error code and the second node is associated with a second error code, and wherein filtering the Bayesian network comprises:

determining, by the one or more processors, from the correlation matrix that the first error code is not correlated to the second error code; and

deleting, by the one or more processors, the connection between the first node and the second node.

4 . The method of claim 1 , further comprising:

updating, by the one or more processors, the Bayesian network upon creation, wherein updating the Bayesian network comprises:

identifying, by the one or more processors, at least one node in the Bayesian network that is part of a loop in the Bayesian network; and

combining, by the one or more processors, each of the at least one node that is part of the loop into a single node.

5 . The method of claim 1 , further comprising:

generating, by the one or more processors, a message comprising the second set of error codes;

enriching, by the one or more processors, the message with error group information to obtain an enriched message; and

presenting, by the one or more processors, the enriched message to a user.

6 . The method of claim 1 , wherein the failure condition is a first failure condition that occurs in a first part of the network, wherein the second set of error codes are associated with a second failure condition in a second part of the network, and wherein the second set of error codes are related to, or cause, the first failure condition based on the subset of subscribers.

7 . A system, comprising:

one or more memories having computer-readable instructions stored thereon; and

one or more processors that execute the computer-readable instructions to:

detect a failure condition on a network;

identify a subset of subscribers impacted by the failure condition;

determine for each subscriber in the subset of subscribers a first set of error codes associated with the failure condition;

create a Bayesian network comprising one or more error codes from the first set of error codes of each subscriber in the subset of subscribers;

access a correlation matrix which indicates a plurality of correlations within a third set of error codes, wherein at least one error code of the first set of error codes is included in the third set of error codes, and wherein respective correlations of the plurality of correlations identify particular error codes within the third set of error codes that cause other particular error codes within the third set of error codes based on computed correlation coefficients;

wherein the plurality of correlations are determined based on computing a correlation coefficient between each error code in the third set of error codes and remaining error codes in the third set of error codes, wherein the correlation matrix is created based on each correlation coefficient, the correlation matrix identifying which error codes in the third set of error codes are correlated, wherein the correlation matrix identifies error code-to-error code causation relationships, and wherein error codes having a correlation coefficient greater than a predetermined threshold are identified as correlated;

identify, using the correlation matrix, a first correlation of the plurality of correlations that relates one or more error codes in the third set of error codes to the at least one error code of the first set of error codes;

determine a second set of error codes from the third set of error codes based on the first correlation; and

resolve at least one of the failure condition or the first set of error codes by addressing one or more error codes of the second set of error codes.

8 . The system of claim 7 , wherein the one or more processors further execute the computer-readable instructions to:

determine the third set of error codes associated with the network;

determine correlations within the third set of error codes by computing correlation coefficients between error codes within the third set of error codes; and

update the Bayesian network based on the correlations.

9 . The system of claim 8 , wherein the Bayesian network comprises a plurality of nodes, the plurality of nodes comprising a first node having a connection to a second node, the first node is associated with a first error code and the second node is associated with a second error code, and wherein to update the Bayesian network, the one or more processors further execute the computer-readable instructions to:

determine from the correlation matrix that the first error code is not correlated to the second error code; and

delete the connection between the first node and the second node.

10 . The system of claim 7 , wherein the one or more processors further execute the computer-readable instructions to:

update the Bayesian network upon creation, wherein updating the Bayesian network comprises:

identify at least one node in the Bayesian network that is part of a loop in the Bayesian network; and

combine each of the at least one node that is part of the loop into a single node.

11 . The system of claim 7 , wherein the one or more processors further execute the computer-readable instructions to:

generate a message comprising the second set of error codes;

enrich the message with error group information to obtain an enriched message; and

present the enriched message to a user.

12 . A non-transitory computer-readable media comprising computer-readable instructions stored thereon that, when executed by one or more processors, cause the one or more processors to:

detect a failure condition on a network;

identify a subset of subscribers impacted by the failure condition;

determine for each subscriber in the subset of subscribers a first set of error codes associated with the failure condition;

create a Bayesian network comprising one or more error codes from the first set of error codes of each subscriber in the subset of subscribers;

access a correlation matrix which indicates a plurality of correlations within a third set of error codes, wherein at least one error code of the first set of error codes is included in the third set of error codes, and wherein respective correlations of the plurality of correlations identify particular error codes within the third set of error codes that cause other particular error codes within the third set of error codes based on computed correlation coefficients;

wherein the plurality of correlations are determined based on computing a correlation coefficient between each error code in the third set of error codes and remaining error codes in the third set of error codes, wherein the correlation matrix is created based on each correlation coefficient, the correlation matrix identifying which error codes in the third set of error codes are correlated, wherein the correlation matrix identifies error code-to-error code causation relationships, and wherein error codes having a correlation coefficient greater than a predetermined threshold are identified as correlated;

identify, using the correlation matrix, a first correlation of the plurality of correlations that relates one or more error codes in the third set of error codes to the at least one error code of the first set of error codes;

determine a second set of error codes from the third set of error codes based on the first correlation; and

resolve at least one of the failure condition or the first set of error codes by addressing one or more error codes of the second set of error codes.

13 . The non-transitory computer-readable media of claim 12 , wherein the one or more processors further execute the computer-readable instructions to:

determine the third set of error codes associated with the network;

determine correlations within the third set of error codes by computing correlation coefficients between error codes within the third set of error codes; and

update the Bayesian network based on the correlations.

14 . The non-transitory computer-readable media of claim 13 , wherein the Bayesian network comprises a plurality of nodes, the plurality of nodes comprising a first node having a connection to a second node, the first node is associated with a first error code and the second node is associated with a second error code, and wherein to update the Bayesian network, the one or more processors further execute the computer-readable instructions to:

determine from the correlation matrix that the first error code is not correlated to the second error code; and

delete the connection between the first node and the second node.

15 . The non-transitory computer-readable media of claim 12 , wherein the one or more processors further execute the computer-readable instructions to:

update the Bayesian network upon creation, wherein updating the Bayesian network comprises:

identify at least one node in the Bayesian network that is part of a loop in the Bayesian network; and

combine each of the at least one node that is part of the loop into a single node.

16 . The non-transitory computer-readable media of claim 12 , wherein the one or more processors further execute the computer-readable instructions to:

generate a message comprising the second set of error codes;

enrich the message with error group information to obtain an enriched message; and

present the enriched message to a user.

Assignments (2)
SECURITY INTEREST Recorded Oct 22, 2024
From: NETSCOUT SYSTEMS, INC.; ARBOR NETWORKS LLC; NETSCOUT SYSTEMS TEXAS, LLC
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 069216/0007 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 17, 2023
From: SUN, QUENIE; UYSAL, ERDEM; LOKER, STEVE; MAYO, GREG
To: NETSCOUT SYSTEMS, INC.
Reel/Frame 065256/0411 →
Continuity (1)
Related Publication 20250112815A1 · Apr 3, 2025
References Cited (45)
US 8140358B1 · Ling · 2012 [cited by examiner]
US 9104611B1 · Bertz · 2015 [cited by examiner]
US 9183072B1 · Makuch · 2015 [cited by examiner]
US 10346737B1 · Benitez · 2019 [cited by examiner]
US 10402255B1 · Niyogi · 2019 [cited by examiner]
US 11237736B1 · Cai · 2022 [cited by examiner]
US 11281521B1 · Petkar · 2022 [cited by examiner]
US 11551486B1 · Everett · 2023 [cited by examiner]
US 20020019870A1 · Chirashnya · 2002 [cited by examiner]
US 20050015644A1 · Chu · 2005 [cited by examiner]
US 20060064291A1 · Pattipatti · 2006 [cited by examiner]
US 20110231703A1 · Pargellis · 2011 [cited by examiner]
US 20150019916A1 · Kane · 2015 [cited by examiner]
US 20150082130A1 · Dunne · 2015 [cited by examiner]
US 20160012237A1 · Eftekhari · 2016 [cited by examiner]
US 20160246686A1 · Sakata · 2016 [cited by examiner]
US 20160300036A1 · Ramazzotti · 2016 [cited by examiner]
US 20160342451A1 · Ly · 2016 [cited by examiner]
US 20170163353A1 · Chen · 2017 [cited by examiner]
US 20170286208A1 · Hives · 2017 [cited by examiner]
US 20170364819A1 · Yang · 2017 [cited by examiner]
US 20180309616A1 · Kollipara · 2018 [cited by examiner]
US 20190188070A1 · Das · 2019 [cited by examiner]
US 20200119971A1 · Healey · 2020 [cited by examiner]
US 20200351270A1 · Burton · 2020 [cited by examiner]
US 20210044679A1 · Caulfield · 2021 [cited by examiner]
US 20210103487A1 · Rosales · 2021 [cited by examiner]
US 20210117868A1 · Sriharsha · 2021 [cited by examiner]
US 20210135720A1 · Zhang · 2021 [cited by examiner]
US 20210359768A1 · Post · 2021 [cited by examiner]
US 20220070691A1 · Ahmed · 2022 [cited by examiner]
US 20220093279A1 · Marinescu · 2022 [cited by examiner]
US 20220138504A1 · Fathi Moghadam · 2022 [cited by examiner]
US 20220191647A1 · Zohoorian · 2022 [cited by examiner]
US 20220237456A1 · Belfiore · 2022 [cited by examiner]
US 20230054912A1 · Dixit J · 2023 [cited by examiner]
US 20230083876A1 · Okimoto · 2023 [cited by examiner]
US 20230171561A1 · Zohoorian · 2023 [cited by examiner]
US 20230308209A1 · Newman · 2023 [cited by examiner]
US 20230409251A1 · Wushour · 2023 [cited by examiner]
US 20240179048A1 · Mishra · 2024 [cited by examiner]
US 20240179080A1 · Kimura · 2024 [cited by examiner]
US 20240187159A1 · Petkar · 2024 [cited by examiner]
US 20240202023A1 · Nandakumaran · 2024 [cited by examiner]
US 20250070798A1 · Ji · 2025 [cited by examiner]