# US 2026/0064852 A1 · Prioritized Updating Of Software In A Distributed Computing Environment

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

- Number: US 2026/0064852 A1
- Document ID: US20260064852A1
- Status: Published application
- Kind: A1
- Application number: 19/259,129
- Filed: 2025-07-03
- Published: 2026-03-05
- Earliest claimed: 2024-08-30
- Assignees: Dynatrace LLC
- Applicants: Dynatrace LLC
- Inventors: Philipp REMPLBAUER; Mario KAHLHOFER
- Web page: https://patentgrep.com/patent/US20260064852A1

## CPC

- G06F 21/577: {Assessing vulnerabilities and evaluating computer system security}
- G06F 8/65: Updates (security arrangements therefor G06F21/57)
- G06F 9/455: Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- H04L 63/1433: {Vulnerability analysis}
- G06F 2221/033: Test or assess software
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A prioritized method is presented for updating software in a distributed computing environment. The objective of the disclosure is to find a computer-implemented method for updating software on pods in the distributed computing environment. This is solved by calculating a risk rating for each pod in the manifest, taking into account a vulnerability score of the pod, the minimum number of inbound hops for reaching the pod, and the communication relationship between the given pod and other pods. Pods in the manifest are updated in accordance with the calculated risk ratings.

## Claims

### Claim 1

A computer-implemented method for updating software in a distributed computing environment, comprising:
receiving, by a computer processor, a manifest from a container orchestration system, where the manifest describes a portion of network topology in the distributed computing environment;
extracting, by the computer processor, pods enumerated in the manifest, where a pod specifies a container or group of containers in the network topology;
for each pod in the manifest, determining, by the computer processor, whether a given pod is able to communicate with another pod in the manifest, thereby defining a communication relationship between the given pod and the another pod;
for each pod in the manifest, determining, by the computer processor, the minimum number of inbound hops for reaching the pod from the outside of the distributed computing environment;
for each pod in the manifest, receiving, by the computer processor, a vulnerability score for the pod considering software on the pod;
for each pod in the manifest, calculating, by the computer processor, a risk rating taking into account the vulnerability score of the pod, the minimum number of inbound hops for reaching the pod, and the communication relationship between the given pod and other pods;
updating pods in the manifest in accordance with the calculated risk ratings.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1 wherein the vulnerability score is indicative of the severity of a software vulnerability of the pod in the network topology.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1 wherein the vulnerability score is from a vulnerability database.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1 wherein the risk rating for a given pod sums up contributions of vulnerability scores for pods being reachable from the given pod by n hops, where n is less than a threshold.

### Claim 5 (depends on 1)

The computer-implemented method according to claim 1, further comprises:
for each pod in the manifest, setting a criticality score taking into account the criticality of resources of the pod;
for each pod in the manifest, calculating, by the computer processor, the risk rating additionally taking into account the criticality score for the pod.

### Claim 6 (depends on 5)

The computer-implemented method of claim 5 wherein the risk rating for a given pod sums up contributions of criticality scores for pods being reachable from the given pod by n hops, where n is less than a threshold.

### Claim 7 (depends on 1)

The computer-implemented method according to claim 1, further comprises:
for each pod in the manifest, determining, by the computer processor, the minimum number of outbound hops for the pod reaching the outside of the distributed computing environment;
for each pod in the manifest, calculating, by the computer processor, the risk rating additionally taking into account the minimum number of outbound hops for the pod.

### Claim 8 (depends on 1)

The computer-implemented method according to claim 1 further comprises sorting pods in the manifest from highest risk rating to lowest risk rating and updating pods with highest risk rating before updating pods with lower risk ratings.

### Claim 9 (depends on 1)

The computer-implemented method according to claim 1 further comprises updating pods in the manifest by exchanging a vulnerable software component to a non-vulnerable software component.

### Claim 10

A non-transitory computer-readable medium having computer-executable instructions that, upon execution of the instructions by a processor of a computer, cause the computer to
receive a manifest from a container orchestration system, where the manifest describes a portion of network topology in the distributed computing environment;
extract pods enumerated in the manifest, where a pod specifies a container or group of containers in the network topology;
for each pod in the manifest, determine whether a given pod is able to communicate with another pod in the manifest, thereby defining a communication relationship between the given pod and the another pod;
for each pod in the manifest, determine the minimum number of inbound hops for reaching the pod from the outside of the distributed computing environment;
for each pod in the manifest, receive a vulnerability score for the pod considering software on the pod;
for each pod in the manifest, calculate a risk rating taking into account the vulnerability score of the pod, the minimum number of inbound hops for reaching the pod, and the communication relationship between the given pod and other pods;
updating pods in the manifest in accordance with the calculated risk ratings.

### Claim 11

A computer-implemented method for updating software in a distributed computing environment, comprising:
receiving, by a computer processor, a manifest from a container orchestration system, where the manifest describes a portion of network topology in the distributed computing environment;
extracting, by the computer processor, pods enumerated in the manifest, where a pod specifies a container or group of containers in the network topology;
for each pod in the manifest, determining, by the computer processor, whether the given pod is able to communicate with another pod in the manifest, thereby defining a communication relationship between the given pod and the other pod;
for each pod in the manifest, determining, by the computer processor, the minimum number of inbound hops for reaching the pod from the outside of the distributed computing environment;
for each pod in the manifest, receiving, by the computer processor, a vulnerability score for the pod considering software on the pod;
for each pod in the manifest, calculating, by the computer processor, a risk rating taking into account the vulnerability score of the pod, the minimum number of inbound hops for reaching the pod, and the communication relationship between the given pod and other pods; and
updating network policies for pods in the manifest based on the calculated risk ratings, where a network policy specifies traffic flow between entities in the network topology.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11 wherein the risk rating for a given pod sums up contributions of vulnerability scores for pods being reachable from the given pod by n hops, where n is less than a threshold.

### Claim 13 (depends on 11)

The computer-implemented method according to claim 11, further comprises:
for each pod in the manifest, setting a criticality score taking into account the criticality of resources of the pod;
for each pod in the manifest, calculating, by the computer processor, the risk rating additionally taking into account the criticality score for the pod.

### Claim 14 (depends on 13)

The computer-implemented method of claim 13 wherein the risk rating for a given pod sums up contributions of criticality scores for pods being reachable from the given pod by n hops, where n is less than a threshold.

### Claim 15 (depends on 11)

The computer-implemented method according to claim 11, further comprises:
for each pod in the manifest, determining, by the computer processor, the minimum number of outbound hops for the pod reaching the outside of the distributed computing environment; and
for each pod in the manifest, calculating, by the computer processor, the risk rating additionally taking into account the minimum number of outbound hops for the pod.

### Claim 16 (depends on 11)

The computer-implemented method of claim 11 further comprises restricting access to a given pod or access from a given pod in response to the risk ratings for the given pod exceeding a threshold.
