# US 2026/0094058 A1 · Asynchronous microservice-based supervised learning for adaptive message queue prioritization in data protection operations

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

- Number: US 2026/0094058 A1
- Document ID: US20260094058A1
- Status: Published application
- Kind: A1
- Application number: 18/903,744
- Filed: 2024-10-01
- Published: 2026-04-02
- Earliest claimed: 2024-10-01
- Assignees: Dell Products L.P.
- Applicants: Dell Products L.P.
- Inventors: Avinash Kumar; Nitesh Kumar Pandey; Shelesh Chopra; Gururaj Kulkarni; Mahantesh M. Ambaljeri
- Web page: https://patentgrep.com/patent/US20260094058A1

## CPC

- G06N 20/00: Machine learning
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A method for message prioritization includes obtaining, by a message prioritization service, data comprising a first set of messages, each message in the data being associated with communication between a production environment and a data protection system. In response to obtaining the data, the method further includes: performing a data pre-processing on the data to obtain processed data and to identify features, performing a data partitioning of the processed data to obtain a training set and a testing set, performing a model training on the training set using the features by applying a k-nearest neighbors (KNN) algorithm on the training set to obtain a trained model, and deploying the trained model in a data protection system to perform message prioritization of messages.

## Claims

### Claim 1

A method for managing asynchronous message transfer, the method comprising:
obtaining, by a message prioritization service, data comprising a first set of messages, wherein each of the first set of messages is associated with communication between a production environment and a data protection system; and
in response to obtaining the data:
performing a data pre-processing on the data to obtain processed data, wherein the data pre-processing comprises identifying features of the data associated with the communication;
performing a data partitioning of the processed data to obtain a training set and a testing set;
performing a model training on the training set using the features by applying a k-nearest neighbors (KNN) algorithm on the training set to obtain a trained model; and
deploying the trained model in the data protection system to perform message prioritization of messages.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first set of messages comprise at least one of each of a list consisting of: a request to back up an asset of the production environment, a response to the request to back up, a request to recover the asset, a response to the request to recover, and a request to index a set of assets.

### Claim 3 (depends on 2)

The method of claim 2, wherein the request to back up and the response to the request to backup are sent asynchronously.

### Claim 4 (depends on 1)

The method of claim 1, wherein the features are each associated with either a content or a context of the first set of messages.

### Claim 5 (depends on 4)

The method of claim 4, wherein the features each comprise one of a list consisting of: a payload type of a message, a criticality of data in the message, a size of data in the message, a dependency of a process in the message to another process, a recovery point objective (RPO) of the payload type of the message, a task type priority of the message, and a priority listing for data protection tasks.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
after the deploying, receiving a new message associated with the communication between the production environment and the data protection system;
performing a feature selection to identify a subset of the features for the new message;
applying the subset of the features to the trained model to obtain a priority assignment of the new message; and
storing the new message in a queue of the data protection system based on the priority assignment.

### Claim 7 (depends on 6)

The method of claim 6, further comprising: updating the trained model based on the priority assignment and based on the storing.

### Claim 8

A non-transitory computer readable medium comprising computer readable program code, which when executed by a computer processor enables the computer processor to perform a method for managing data access, the method comprising:
obtaining, by a message prioritization service, data comprising a first set of messages, wherein the first set of messages are associated with communication between a production environment and a data protection system; and
in response to obtaining the data:
performing a data pre-processing on the data to obtain processed data, wherein the data pre-processing comprises identifying features of the data associated with the communication;
performing a data partitioning of the processed data to obtain a training set and a testing set;
performing a model training on the training set using the features by applying a k-nearest neighbors (KNN) algorithm on the training set to obtain a trained model; and
deploying the trained model in a to perform message prioritization of messages.

### Claim 9 (depends on 8)

The non-transitory computer readable medium of claim 8, wherein the first set of messages comprise at least one of each of a list consisting of: a request to back up an asset of the production environment, a response to the request to back up, a request to recover the asset, a response to the request to recover, and a request to index a set of assets.

### Claim 10 (depends on 9)

The non-transitory computer readable medium of claim 9, wherein the request to back up and the response to the request to backup are sent asynchronously.

### Claim 11 (depends on 8)

The non-transitory computer readable medium of claim 8, wherein the features are each associated with either a content or a context of the first set of messages.

### Claim 12 (depends on 11)

The non-transitory computer readable medium of claim 11, wherein the features each comprise one of a list consisting of: a payload type of a message, a criticality of data in the message, a size of data in the message, a dependency of a process in the message to another process, a recovery point objective (RPO) of the payload type of the message, a task type priority of the message, and a priority listing for data protection tasks.

### Claim 13 (depends on 8)

The non-transitory computer readable medium of claim 8, further comprising:
after the deploying, receiving a new message associated with the communication between the production environment and the data protection system;
performing a feature selection to identify a subset of the features for the new message;
applying the subset of the features to the trained model to obtain a priority assignment of the new message; and
storing the new message in a queue of the data protection system based on the priority assignment.

### Claim 14 (depends on 13)

The non-transitory computer readable medium of claim 13, further comprising: updating the trained model based on the priority assignment and based on the storing.

### Claim 15

A system, comprising:
a processor, and
memory comprising instructions, which when executed by the processor, cause the processor to perform a method, the method comprising:
obtaining, by a message prioritization service, data comprising a first set of messages, wherein the first set of messages are associated with communication between a production environment and a data protection system; and
in response to obtaining the data:
performing a data pre-processing on the data to obtain processed data, wherein the data pre-processing comprises identifying features of the data associated with the communication;
performing a data partitioning of the processed data to obtain a training set and a testing set;
performing a model training on the training set using the features by applying a k-nearest neighbors (KNN) algorithm on the training set to obtain a trained model; and
deploying the trained model in a to perform message prioritization of messages.

### Claim 16 (depends on 15)

The system of claim 15, wherein the first set of messages comprise at least one of each of a list consisting of: a request to back up an asset of the production environment, a response to the request to back up, a request to recover the asset, a response to the request to recover, and a request to index a set of assets.

### Claim 17 (depends on 16)

The system of claim 16, wherein the request to back up and the response to the request to backup are sent asynchronously.

### Claim 18 (depends on 15)

The system of claim 15, wherein the features are each associated with either a content or a context of the first set of messages.

### Claim 19 (depends on 18)

The system of claim 18, wherein the features each comprise one of a list consisting of: a payload type of a message, a criticality of data in the message, a size of data in the message, a dependency of a process in the message to another process, a recovery point objective (RPO) of the payload type of the message, a task type priority of the message, and a priority listing for data protection tasks.

### Claim 20 (depends on 15)

The system of claim 15, further comprising:
after the deploying, receiving a new message associated with the communication between the production environment and the data protection system;
performing a feature selection to identify a subset of the features for the new message;
applying the subset of the features to the trained model to obtain a priority assignment of the new message;
storing the new message in a queue of the data protection system based on the priority assignment; and
updating the trained model based on the priority assignment and based on the storing.
