# US 2019/0320329 A1 · System and Method for Analyzing Network Performance Data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0320329 A1
- Document ID: US20190320329A1
- Status: Published application
- Kind: A1
- Application number: 16/474,130
- Filed: 2017-01-26
- Published: 2019-10-17
- Earliest claimed: 2017-01-26
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Applicants: Telefonaktiebolaget LM Ericsson (publ)
- Inventors: István Gódor; Nóra Fenyvesi; Zsófia Kallus; József Stéger
- Web page: https://patentgrep.com/patent/US20190320329A1

## CPC

- H04L 41/147: for predicting network behaviour
- H04L 41/22: comprising specially adapted graphical user interfaces [GUI]
- H04L 41/5012: {determining service availability, e.g. which services are available at a certain point in time}
- H04L 43/0876: Network utilisation, e.g. volume of load or congestion level
- H04W 16/18: Network planning tools
- H04W 16/22: Traffic simulation tools or models
- H04W 24/08: Testing, {supervising or monitoring} using real traffic
- G06N 20/00: Machine learning
- H04L 41/149: for prediction of maintenance
- H04L 41/16: using machine learning or artificial intelligence
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computer system and computer-automated method for analyzing performance data in a telecommunications network. In A data set is provided that contains a log of a first time sequence of network events which are classified into event types. A second time sequence is generated from the first time sequence by aggregating the events into event groups, and at least a third time sequence is generated by aggregating the event groups into event super-groups. A multi-level time sequence event hierarchy of at least three levels is thus created. The multiple time sequence levels are rendered into a visualization in which the different event types are visually distinct from each other. The visualization reveals to a domain expert patterns of behavior in the data set which can be used to detect current network problems and to predict future network loading, for example in a network operations center.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A computer-automated method for analyzing network performance data, the method comprising:
receiving a data set containing a log of a first time sequence of network events in which each network event is associated with at least one network location and has been classified into one of a plurality of event types;
creating a second time sequence from the first time sequence by aggregating the events into event groups, wherein each event group is defined as a plurality of events which are in a specific sequence of event types, each event group being classified into one of a plurality of event group types;
creating a third time sequence from the second time sequence by aggregating the event groups into event super-groups, wherein each event super-group is defined as a plurality of event groups which are in a specific sequence of event group types, each event super-group being classified into one of a plurality of event super-group types; and
rendering into a visualization at least one of the time sequences such that in the visualization each of the types is visually distinct from other types in the same time sequence.

### Claim 22 (depends on 21)

The method of claim 21, wherein the visualization includes a map representation in relation to the network locations and according to at least one of the second time sequence and the third time sequence.

### Claim 23 (depends on 21)

The method of claim 21, further comprising:
recognizing a pattern in the data set by matching the current event groups and/or super-groups to a first time period of at least one stored data set in which the same event groups and/or super-groups are present; and
predicting future network loading based on warping the first time period of the at least one stored data set onto the current data set and using the warped second time period of the at least one stored data set as the prediction.

### Claim 24 (depends on 23)

The method of claim 23, wherein the visualization includes a map representation of the predicted future network loading.

### Claim 25 (depends on 22)

The method of claim 22, wherein the map representation encodes time with color and/or shading in a single image frame, and such that separate image frames relate to specific times or periods of time which can be displayed in time order.

### Claim 26 (depends on 22)

The method of claim 22, further comprising modifying the map representation to filter in and out based on event types, event group types, and/or event super-group types in response to input from user actuatable controls.

### Claim 27 (depends on 21)

The method of claim 21, further comprising modifying the visualization of the first time sequences, the second time sequence, and/or the third time sequence to filter in and out based on event types, event group types, and/or event super-group types in response to input from user actuatable controls.

### Claim 28 (depends on 26)

The method of claim 26, further comprising:
predicting future network loading based on applying the input from the user actuatable controls to filter out at least some of the events contained in the data set; and
saving a modified version of the data set with the events which have been filtered out from the visualization being removed.

### Claim 29 (depends on 23)

The method of claim 23, further comprising:
comparing the predicted future network loading to network capacity to predict any capacity shortfalls; and
provisioning additional network capacity to address any such capacity shortfalls before they are predicted to occur.

### Claim 30 (depends on 21)

The method of claim 21, wherein the location is a geographical location and/or an association with a network entity in a network diagram.

### Claim 31 (depends on 21)

The method of claim 21, wherein the event group types are predefined.

### Claim 32 (depends on 21)

The method of claim 21, wherein the event group types are defined as part of creating the second time sequence from the first time sequence and according to the first time sequence.

### Claim 33 (depends on 21)

The method of claim 21, wherein the event super-group types are predefined.

### Claim 34 (depends on 21)

The method of claim 21, wherein the event super-group types are defined as part of creating the third time sequence from the second time sequence and according to the second time sequence.

### Claim 35 (depends on 21)

The method of claim 21, wherein in each time series each type is ascribed a different visual characteristic for the visualization.

### Claim 36 (depends on 21)

The method of claim 21:
wherein each event is ascribed a value of a quality parameter; and
wherein the visualization represents a range of the quality parameter values by a range of values of a visualization parameter.

### Claim 37 (depends on 21)

The method of claim 21, further comprising creating at least one higher order time sequence from the time sequence of the previous highest order by aggregating the groups of the previous highest order, referred to as sub-ordinate groups, into supra-ordinate groups, wherein each supra-ordinate group is defined as a plurality of sub-ordinate groups which are in a specific sequence of sub-ordinate group types, each supra-ordinate group being classified into one of a plurality of event supra-ordinate group types.

### Claim 38

A non-transitory computer readable recording medium storing a computer program product for controlling a computing device for automated analyzing of network performance data, the computer program product comprising software instructions which, when run on processing circuitry of the computing device, causes the computing device to:
receive a data set containing a log of a first time sequence of network events in which each network event is associated with at least one network location and has been classified into one of a plurality of event types;
create a second time sequence from the first time sequence by aggregating the events into event groups, wherein each event group is defined as a plurality of events which are in a specific sequence of event types, each event group being classified into one of a plurality of event group types;
create a third time sequence from the second time sequence by aggregating the event groups into event super-groups, wherein each event super-group is defined as a plurality of event groups which are in a specific sequence of event group types, each event super-group being classified into one of a plurality of event super-group types; and
render into a visualization at least one of the time sequences such that in the visualization each of the types is visually distinct from other types in the same time sequence.

### Claim 39

A computer system for analyzing network performance data, the system comprising:
a data input operable to receive a data set containing a log of a first time sequence of network events in which each network event is associated with at least one network location and has been classified into one of a plurality of event types;
memory operable to store the data set;
processing circuitry operable to analyze the data set by:
creating a second time sequence from the first time sequence by aggregating the events into event groups, wherein each event group is defined as a plurality of events which are in a specific sequence of event types, each event group being classified into one of a plurality of event group types;
creating a third time sequence from the second time sequence by aggregating the event groups into event super-groups, wherein each event super-group is defined as a plurality of event groups which are in a specific sequence of event group types, each event super-group being classified into one of a plurality of event super-group types; and
rendering into a visualization at least one of the time sequences such that in the visualization each of the types is visually distinct from other types in the same time sequence; and
an output operable to output the visualization to a display.
