# US 2020/0287806 A1 · Predicting application and network performance

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

- Number: US 2020/0287806 A1
- Document ID: US20200287806A1
- Status: Published application
- Kind: A1
- Application number: 16/884,449
- Filed: 2020-05-27
- Published: 2020-09-10
- Earliest claimed: 2017-03-23
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Ashutosh Kulshreshtha; Navindra Yadav; Khawar Deen; Jackson Pang; Supreeth Rao
- Web page: https://patentgrep.com/patent/US20200287806A1

## CPC

- H04L 43/04: Processing captured monitoring data, e.g. for logfile generation
- H04L 41/145: {involving simulating, designing, planning or modelling of a network}
- H04L 43/0852: Delays
- H04L 41/083: for increasing network speed
- H04L 41/147: for predicting network behaviour
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An application and network analytics platform can capture comprehensive telemetry from servers and network devices operating within a network. The platform can discover flows running through the network, applications generating the flows, servers hosting the applications, computing resources provisioned and consumed by the applications, and network topology, among other insights. The platform can generate various models relating one set of application and network performance metrics to another. For example, the platform can model application latency as a function of computing resources provisioned to and/or actually used by the application, its host's total resources, and/or the distance of its host relative to other elements of the network. The platform can change the model by moving, removing, or adding elements to predict how the change affects application and network performance. In some situations, the platform can automatically act on predictions to improve application and network performance.

## Claims

### Claim 1

A method comprising:
capturing telemetry from a plurality of servers and a plurality of network devices of a network;
analyzing the telemetry;
generating, based on the analyzed telemetry, one or more models associating a first amount of latency of an application with one or more amounts of computing resources of a server utilized to execute the application;
generating one or more updated models by applying one or more changes to the one or more models;
determining whether the one or more changes decreases a latency of the application from the first amount of latency; and
in response to determining the decrease, applying the one or more changes to the network.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
determining a plurality of nodes of an application dependency map for the network by concatenating server features and process features;
determining a plurality of edges of the application dependency map based on the telemetry including one or more flows between pairs of nodes of the plurality of nodes;
determining a first feature vector for a first node of the plurality of nodes; and
determining a cluster including the first node and a second node of the plurality of nodes based on a similarity metric between the first feature vector and a second feature vector of the second node satisfying a similarity threshold.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
determining a plurality of flowlets for at least one flow between the first node and the second node;
determining one or more server latencies and one or more network latencies within at least one flowlet of the plurality of flowlets;
generating a data point including the one or more server latencies and the one or more network latencies; and
updating a model of the one or more models using the data point.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
determining a least one of: an amount of CPU provisioned to execute the application, an amount of storage provisioned to execute the application, or an amount of disk provisioned to execute the application; and
determining at least one of: a total amount of CPU of the server, a total amount of storage of the server, or a total amount of disk of the server.

### Claim 5 (depends on 1)

The method of claim 1, wherein the one or more changes includes at least one of: altering a configuration of a node of the network, adding a new node to the network, removing an existing node of the network, or migrating a node of the network from a first location to a second location.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
determining that the application executes at a first schedule; and
determining a second schedule for the application that reduces an amount of latency of the application,
wherein the one or more changes includes changing a schedule of the application from the first schedule to the second schedule.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
determining, based on the telemetry, one or more distances of the server relative to one or more of the plurality of servers and the plurality of network devices.

### Claim 8

A system comprising:
a processor; and
a memory storing instructions, which when executed by the processor, causes the processor to:
capture telemetry from a plurality of servers and a plurality of network devices of a network;
analyze the telemetry;
generate, based on the analyzed telemetry, one or more models associating a first amount of latency of an application with one or more amounts of computing resources of a server utilized to execute the application;
generate one or more updated models by applying one or more changes to the one or more models;
determine whether the one or more changes decreases a latency of the application from the first amount of latency; and
in response to the determination of a decrease, apply the one or more changes to the network.

### Claim 9 (depends on 8)

The system of claim 8, further comprising instructions, which when executed causes the processor to:
determine a plurality of nodes of an application dependency map for the network by concatenating server features and process features;
determine a plurality of edges of the application dependency map based on the telemetry including one or more flows between pairs of nodes of the plurality of nodes;
determine a first feature vector for a first node of the plurality of nodes; and
determine a cluster including the first node and a second node of the plurality of nodes based on a similarity metric between the first feature vector and a second feature vector of the second node satisfying a similarity threshold.

### Claim 10 (depends on 9)

The system of claim 9, further comprising instructions, which when executed causes the processor to:
determine a plurality of flowlets for at least one flow between the first node and the second node;
determine one or more server latencies and one or more network latencies within at least one flowlet of the plurality of flowlets;
generate a data point including the one or more server latencies and the one or more network latencies; and
update a model of the one or more models using the data point.

### Claim 11 (depends on 8)

The system of claim 8, further comprising instructions, which when executed causes the processor to:
determine at least one of: an amount of CPU provisioned to execute the application, an amount of storage provisioned to execute the application, or an amount of disk provisioned to execute the application; and
determine at least one of: a total amount of CPU of the server, a total amount of storage of the server, or a total amount of disk of the server.

### Claim 12 (depends on 8)

The system of claim 8, wherein the one or more changes includes at least one of: alter a configuration of a node of the network, add a new node to the network, remove an existing node of the network, or migrate a node of the network from a first location to a second location.

### Claim 13 (depends on 8)

The system of claim 8, further comprising instructions, which when executed causes the processor to:
determine that the application executes at a first schedule; and
determine a second schedule for the application that reduces an amount of latency of the application,
wherein the one or more changes includes a change in a schedule of the application from the first schedule to the second schedule.

### Claim 14 (depends on 8)

The system of claim 8, further comprising instructions, which when executed causes the processor to:
determine, based on the telemetry, one or more distances of the server relative to one or more of the plurality of servers and the plurality of network devices.

### Claim 15

A non-transitory computer-readable medium storing instructions which when executed by a processor, causes the processor to:
capture telemetry from a plurality of servers and a plurality of network devices of a network;
analyze the telemetry;
generate, based on the analyzed telemetry, one or more models associating a first amount of latency of an application with one or more amounts of computing resources of a server utilized to execute the application;
generate one or more updated models by applying one or more changes to the one or more models; and
determine whether the one or more changes decreases a latency of the application from the first amount of latency; and
in response to the determination of a decrease, apply the one or more changes to the network.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, further comprising instructions, which when executed causes the processor to:
determine a plurality of nodes of an application dependency map for the network by concatenating server features and process features;
determine a plurality of edges of the application dependency map based on the telemetry including one or more flows between pairs of nodes of the plurality of nodes;
determine a first feature vector for a first node of the plurality of nodes; and
determine a cluster including the first node and a second node of the plurality of nodes based on a similarity metric between the first feature vector and a second feature vector of the second node satisfying a similarity threshold.

### Claim 17 (depends on 16)

The non-transitory computer-readable medium of claim 16, further comprising instructions, which when executed causes the processor to:
determine a plurality of flowlets for at least one flow between the first node and the second node;
determine one or more server latencies and one or more network latencies within at least one flowlet of the plurality of flowlets;
generate a data point including the one or more server latencies and the one or more network latencies; and
update a model of the one or more models using the data point.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, further comprising instructions, which when executed causes the processor to:
determine at least one of: an amount of CPU provisioned to execute the application, an amount of storage provisioned to execute the application, or an amount of disk provisioned to or utilized to execute the application; and
determine at least one of: a total amount of CPU of the server, a total amount of storage of the server, or a total amount of disk of the server.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the one or more changes includes at least one of: alter a configuration of a node of the network, add a new node to the network, remove an existing node of the network, or migrate a node of the network from a first location to a second location.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, further comprising instructions, which when executed causes the processor to:
determine that the application executes at a first schedule; and
determine a second schedule for the application that reduces an amount of latency of the application,
wherein the one or more changes includes a change in a schedule of the application from the first schedule to the second schedule.
