# US 2026/0065191 A1 · Method and system to optimize cloud cost by analyzing pricing models

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

- Number: US 2026/0065191 A1
- Document ID: US20260065191A1
- Status: Published application
- Kind: A1
- Application number: 19/245,971
- Filed: 2025-06-23
- Published: 2026-03-05
- Earliest claimed: 2024-09-03
- Assignees: Tata Consultancy Services Limited
- Applicants: Tata Consultancy Services Limited
- Inventors: Uday Chandra BHOOKYA; Kunal JETHURI; Maitreya NATU; Sanjeeva Rayudu RAVURU
- Web page: https://patentgrep.com/patent/US20260065191A1

## CPC

- G06Q 10/06315: {Needs-based resource requirements planning or analysis}
- G06Q 30/0206: {Price or cost determination based on market factors}
- G06Q 30/0283: Price estimation or determination
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Existing tools provide statistical analysis but often lack comprehensive insights into where costs are accruing and how they can be optimized. The present method obtains optimal band by sorting set of datapoints in ascending order. Sliding window approach is applied on sorted set of datapoints for selected window size, wherein lower band and upper band is created. Minimum width is created by finding difference between lower band and upper band. New lower band and new upper band are obtained, and width is computed by finding difference between new lower band and new upper band. Width and minimum width are compared, and width is saved as optimal band. Total outlier factor is calculated to determine set of datapoints outside optimal band and to assess proximity of set of datapoints to optimal band. One or more recommendations for optimizing cloud cost are generated based on obtained optimal band and total outlier factor.

## Claims

### Claim 1

A processor implemented method, comprising:
obtaining, via one or more hardware processors, an optimal band from utilization of one or more metrics specific to one or more set of resources using a sliding window approach by:
(i) sorting a set of datapoints U corresponding to a timeseries U(t) over T timesteps, in an ascending order;
(ii) selecting one or more datapoints (n) from the sorted set of datapoints that covers a pre-defined percentage of the set of datapoints U, as a window size; and
(iii) applying the sliding window approach on the sorted set of datapoints U for the selected window size for obtaining the optimal band by:
(i) creating an initial band with the selected the one or more datapoints (n), wherein a first datapoint in the selected the one or more datapoints (n) is considered as a lower bound of the initial band ULower and a nth datapoint in the selected one or more datapoints (n) is considered as a upper bound of the initial band UUpper;
(ii) calculating a first width of the created initial band as a minimum width Wmin by finding a difference between the upper bound of the initial band UUpper and the lower bound of the initial band ULower as UUpper−ULower; and
(iii) iteratively performing until a penultimate datapoint from the set of datapoints U is indexed by:
a) obtaining a new lower bound of the initial band UNewLower and a corresponding new upper bound of the initial band UNewUpper by adding (n) to a starting point index, for each new starting point comprised in the lower bound of the initial band ULower;
b) computing a second width W by finding a difference between the associated new upper bound of the initial band UNewUpper and the new lower bound of the initial band UNewLower as UNewUpper−UNewLower;
c) comparing the second width W and the minimum width Wmin;
d) updating the minimum width Wmin based on the comparison and saving the second width W as the optimal band; and
e) selecting an interval [UUpper, ULower] that has minimum width Wmin, UUpper−ULower;
calculating, via the one or more hardware processors, a total outlier factor to determine the set of datapoints U outside the optimal band and assessing a proximity of the set of datapoints U to the optimal band, using a Root mean square deviation (RMSD) technique by:
(i) calculating a lower band penalty for each datapoint comprised in the set of datapoints U below the lower bound of the optimal band by determining a Root mean square deviation of the set of datapoints U with respect to the lower bound of the initial band;
(ii) calculating an upper band penalty for each datapoint set of datapoints U above the upper bound of the optimal by determining the Root mean square deviation of the set of datapoints U with respect to the upper bound of the band; and
(iii) calculating the total outlier factor based on the lower band penalty and the upper band penalty; and
generating, via the one or more hardware processors, one or more recommendations for optimizing a cloud cost based on the obtained optimal band and the total outlier factor comprising:
(i) providing the one or more set of resources for a long-term reserve instance (RI) pricing model, if the width of the optimal band is less than a first pre-defined threshold;
(ii) providing the one or more set of resources for the long-term reserve instance (RI) pricing model, if the total outlier factor is less than a second pre-defined threshold; and
(iii) providing the one or more set of resources for a short-term reserve instance (RI) pricing model, if the total outlier factor is greater than a third pre-defined threshold.

### Claim 2 (depends on 1)

The processor implemented method of claim 1, wherein the one or more set of resources are instances of one or more cloud services created within one or more resource groups.

### Claim 3 (depends on 1)

The processor implemented method of claim 1, wherein the one or more resource groups are one or more logical containers for deploying and managing the one or more set of resources, and wherein the one or more resource groups facilitate an organized resource management, a role-based access control, and a policy enforcement.

### Claim 4 (depends on 1)

The processor implemented method of claim 1, wherein the one or more cloud services comprises one or more virtual machines and one or more storage accounts.

### Claim 5 (depends on 1)

The processor implemented method of claim 1, wherein the one or more metrics specific to the one or more set of resources comprises a Central Processing Unit and a memory.

### Claim 6 (depends on 1)

The processor implemented method of claim 1, wherein one or more cost savings are computed for each of the one or more recommendations.

### Claim 7

A system, comprising:
a memory storing instructions;
one or more communication interfaces; and
one or more hardware processors coupled to the memory via the one or more communication interfaces, wherein the one or more hardware processors are configured by the instructions to:
obtain an optimal band from utilization of one or more metrics specific to one or more set of resources using a sliding window approach by:
(i) sorting a set of datapoints U corresponding to a timeseries U(t) over T timesteps, in an ascending order;
(ii) selecting one or more datapoints (n) from the sorted set of datapoints that covers a pre-defined percentage of the set of datapoints U, as a window size; and
(iii) applying the sliding window approach on the sorted set of datapoints U for the selected window size for obtaining the optimal band by:
(i) creating an initial band with the selected the one or more datapoints (n), wherein a first datapoint in the selected the one or more datapoints (n) is considered as a lower bound of the initial band ULower and a nth datapoint in the selected one or more datapoints (n) is considered as a upper bound of the initial band UUpper;
(ii) calculating a first width of the created initial band as a minimum width Wmin by finding a difference between the upper bound of the initial band Uupper and the lower bound of the initial band ULower as UUpper−ULower; and
(iii) iteratively performing until a penultimate datapoint from the set of datapoints U is indexed by:
a) obtaining a new lower bound of the initial band UNewLower and a corresponding new upper bound of the initial band UNewUpper by adding (n) to a starting point index, for each new starting point comprised in the lower bound of the initial band ULower;
b) computing a second width W by finding a difference between the associated new upper bound of the initial band UNewUpper and the new lower bound of the initial band UNewLower as UNewUpper−UNewLower;
c) comparing the second width W and the minimum width Wmin;
d) updating the minimum width Wmin based on the comparison and saving the second width W as the optimal band; and
e) selecting an interval [UUpper, ULower] that has minimum width Wmin, UUpper−ULower;
calculate a total outlier factor to determine the set of datapoints U outside the optimal band and assessing a proximity of the set of datapoints U to the optimal band, using a Root mean square deviation (RMSD) technique by:
(i) calculating a lower band penalty for each datapoint comprised in the set of datapoints U below the lower bound of the optimal band by determining a Root mean square deviation of the set of datapoints U with respect to the lower bound of the initial band;
(ii) calculating an upper band penalty for each datapoint set of datapoints U above the upper bound of the optimal by determining the Root mean square deviation of the set of datapoints U with respect to the upper bound of the band; and
(iii) calculating the total outlier factor based on the lower band penalty and the upper band penalty; and
generate one or more recommendations for optimizing a cloud cost based on the obtained optimal band and the total outlier factor comprising:
(i) providing the one or more set of resources for a long-term reserve instance (RI) pricing model, if the width of the optimal band is less than a first pre-defined threshold;
(ii) providing the one or more set of resources for the long-term reserve instance (RI) pricing model, if the total outlier factor is less than a second pre-defined threshold; and
(iii) providing the one or more set of resources for a short-term reserve instance (RI) pricing model, if the total outlier factor is greater than a third pre-defined threshold.

### Claim 8 (depends on 7)

The system of claim 7, wherein the one or more set of resources are instances of one or more cloud services created within one or more resource groups.

### Claim 9 (depends on 7)

The system of claim 7, wherein the one or more resource groups are one or more logical containers for deploying and managing the one or more set of resources, and wherein the one or more resource groups facilitate an organized resource management, a role-based access control, and a policy enforcement.

### Claim 10 (depends on 7)

The system of claim 7, wherein the one or more cloud services comprises one or more virtual machines and one or more storage accounts.

### Claim 11 (depends on 7)

The system of claim 7, wherein the one or more metrics specific to the one or more set of resources comprises a Central Processing Unit and a memory.

### Claim 12 (depends on 7)

The system of claim 7, wherein one or more cost savings is computed for each of the one or more recommendations and recommending the one or more cost savings with a most savings.

### Claim 13

One or more non-transitory machine-readable information storage mediums comprising one or more instructions which when executed by one or more hardware processors cause:
obtaining an optimal band from utilization of one or more metrics specific to one or more set of resources using a sliding window approach by:
(i) sorting a set of datapoints U corresponding to a timeseries U(t) over T timesteps, in an ascending order;
(ii) selecting one or more datapoints (n) from the sorted set of datapoints that covers a pre-defined percentage of the set of datapoints U, as a window size; and
(iii) applying the sliding window approach on the sorted set of datapoints U for the selected window size for obtaining the optimal band by:
(i) creating an initial band with the selected the one or more datapoints (n), wherein a first datapoint in the selected the one or more datapoints (n) is considered as a lower bound of the initial band ULower and a nth datapoint in the selected one or more datapoints (n) is considered as a upper bound of the initial band UUpper;
(ii) calculating a first width of the created initial band as a minimum width Wmin by finding a difference between the upper bound of the initial band Uupper and the lower bound of the initial band ULower as UUpper−ULower; and
(iii) iteratively performing until a penultimate datapoint from the set of datapoints U is indexed by:
a) obtaining a new lower bound of the initial band UNewLower and a corresponding new upper bound of the initial band UNewUpper by adding (n) to a starting point index, for each new starting point comprised in the lower bound of the initial band ULower;
b) computing a second width W by finding a difference between the associated new upper bound of the initial band UNewUpper and the new lower bound of the initial band UNewLower as UNewUpper−UNewLower;
c) comparing the second width W and the minimum width Wmin;
d) updating the minimum width Wmin based on the comparison and saving the second width W as the optimal band; and
e) selecting an interval [UUpper, ULower] that has minimum width Wmin, UUpper−ULower;
calculating a total outlier factor to determine the set of datapoints U outside the optimal band and assessing a proximity of the set of datapoints U to the optimal band, using a Root mean square deviation (RMSD) technique by:
(i) calculating a lower band penalty for each datapoint comprised in the set of datapoints U below the lower bound of the optimal band by determining a Root mean square deviation of the set of datapoints U with respect to the lower bound of the initial band;
(ii) calculating an upper band penalty for each datapoint set of datapoints U above the upper bound of the optimal by determining the Root mean square deviation of the set of datapoints U with respect to the upper bound of the band; and
(iii) calculating the total outlier factor based on the lower band penalty and the upper band penalty; and
generating one or more recommendations for optimizing a cloud cost based on the obtained optimal band and the total outlier factor comprising:
(i) providing the one or more set of resources for a long-term reserve instance (RI) pricing model, if the width of the optimal band is less than a first pre-defined threshold;
(ii) providing the one or more set of resources for the long-term reserve instance (RI) pricing model, if the total outlier factor is less than a second pre-defined threshold; and
(iii) providing the one or more set of resources for a short-term reserve instance (RI) pricing model, if the total outlier factor is greater than a third pre-defined threshold.

### Claim 14 (depends on 13)

The one or more non-transitory machine readable information storage mediums of claim 13, wherein the one or more set of resources are instances of one or more cloud services created within one or more resource groups.

### Claim 15 (depends on 13)

The one or more non-transitory machine readable information storage mediums of claim 13, wherein the one or more resource groups are one or more logical containers for deploying and managing the one or more set of resources, and wherein the one or more resource groups facilitate an organized resource management, a role-based access control, and a policy enforcement.

### Claim 16 (depends on 13)

The one or more non-transitory machine readable information storage mediums of claim 13, wherein the one or more cloud services comprises one or more virtual machines and one or more storage accounts.

### Claim 17 (depends on 13)

The one or more non-transitory machine readable information storage mediums of claim 13, wherein the one or more metrics specific to the one or more set of resources comprises a Central Processing Unit and a memory.

### Claim 18 (depends on 13)

The one or more non-transitory machine readable information storage mediums of claim 13, wherein one or more cost savings are computed for each of the one or more recommendations.
