Prosecution Insights
Last updated: April 19, 2026
Application No. 18/472,947

VERTICAL SCALING OF COMPUTE CONTAINERS

Non-Final OA §102
Filed
Sep 22, 2023
Examiner
AKINTOLA, OLABODE
Art Unit
3691
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Microsoft Technology Licensing, LLC
OA Round
1 (Non-Final)
50%
Grant Probability
Moderate
1-2
OA Rounds
4y 2m
To Grant
59%
With Interview

Examiner Intelligence

Grants 50% of resolved cases
50%
Career Allow Rate
375 granted / 748 resolved
-1.9% vs TC avg
Moderate +9% lift
Without
With
+9.1%
Interview Lift
resolved cases with interview
Typical timeline
4y 2m
Avg Prosecution
36 currently pending
Career history
784
Total Applications
across all art units

Statute-Specific Performance

§101
35.2%
-4.8% vs TC avg
§103
33.9%
-6.1% vs TC avg
§102
10.2%
-29.8% vs TC avg
§112
10.1%
-29.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 748 resolved cases

Office Action

§102
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Rejections - 35 USC § 102 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claims 1, 3-8, 10-15 and 17-20 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Taherizadeh et al. (“Key Influencing Factors of the Kubernetes Auto-Scaler for Computing Intensive Microservice-Native Cloud-Based Applications”: Advances in Engineering Software, Elsevier Science, Oxford, GB, Vol. 140, 11/8/2019, pp 1-11) (hereinafter referred to as “Taherizadeh”). Re Claims 1, 8 and 15: Taherizadeh teaches a method (and corresponding system and computer readable storage medium) comprising: determining time-based resource utilization data for a workload executing on a deployment (deployment of modular applications based on microservices architecture, Section 1 Introduction; “Microservices generally are packages using container-based virtualization and deployed in the cloud.”, Section 2 Microservices architecture background; CLPT, Section 4.2 Adaptation interval called control loop time period (CLTP)); determining a resource availability based on the resource utilization data and a current resource allocation (current resource utilization and availability, Section 4.2 Adaptation interval called control loop time period (CLTP)); determining a severity of resource throttling of the workload based on the resource utilization data (threshold, CPU or I/O load factors, Section 4 Proposed key influencing factors); determining a scaling factor based at least on the severity of resource throttling (auto-scaling performed on three different workload scenarios, Section 5 Empirical evaluation); and scaling, in response to at least the resource availability satisfying a predetermined condition with a predetermined threshold, the deployment based on the scaling factor (Figure 3 and Section 5.1 Predictable bursting workload scenario; Figure 5 and Section 5.2 Unpredictable bursting workload scenario). Re claim 3, 10 and 17: Taherizadeh teaches wherein the resource utilization data comprises at least one of: historical resource utilization data for the workload; or predicted resource utilization data for the workload (Section 5.1 Predictable bursting workload scenario). Re claim 4 and 11: Taherizadeh teaches wherein the predicted resource utilization data comprises resource utilization data determined using one or more of: a heuristic model; or a machine-learning model (Section 4.3 learning algorithm, neural network). Re claim 5-7, 12-14 and 18-20: Taherizadeh teaches wherein said determining the scaling factor is further based on one or more of: a minimum resource allocation; a maximum resource allocation; a minimum slope threshold; a maximum slope threshold; a maximum single step scale-up amount; a maximum single step scale-down amount; or a resource allocation slack amount; wherein the resource utilization data comprises one or more of: computational resource utilization data; memory resource utilization data; request latency data; storage resource utilization data; or input/output (I/O) resource utilization data; wherein said scaling, in response the resource availability satisfying a predetermined condition with a predetermined threshold, the deployment based on the scaling factor comprises at least one of: increasing computational resources allocatable to the deployment; increasing memory resources allocatable to the deployment; increasing storage resources allocatable to the deployment; increasing input/output (I/O) resources allocatable to the deployment; decreasing computational resources allocatable to the deployment; decreasing memory resources allocatable to the deployment; decreasing memory resources allocatable to the deployment; or decreasing input/output (I/O) resources allocatable to the deployment (Section 4.1 “a CPU-based auto-scaling policy can be specified in a way that more container instances should be instantiated if the average CPU utilization reaches a fixed threshold such as 80%; while some container instances may be stopped if the average CPU utilization is below 80%). Allowable Subject Matter Claims 2, 9 and 16 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Balle et al. (USPAP 2018/0027055) teaches technologies for assigning workloads to balance multiple resource allocation objectives. Alsop et al. (USPAP 2025/0328377) teaches methods for scheduling workloads. Shami et al. (USPN 12,277,445) teaches predictive allocation and scheduling for distributed workload. Any inquiry concerning this communication or earlier communications from the examiner should be directed to OLABODE AKINTOLA whose telephone number is (571)272-3629. The examiner can normally be reached Mon-Fri 8:30a-6:00p. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Abhishek Vyas can be reached at 571-270-1836. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /OLABODE AKINTOLA/Primary Examiner, Art Unit 3691
Read full office action

Prosecution Timeline

Sep 22, 2023
Application Filed
Feb 17, 2026
Non-Final Rejection — §102
Apr 06, 2026
Interview Requested

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12602694
SYSTEMS AND METHODS FOR MOBILE PRE-AUTHORIZATION OF A CREDIT TRANSACTION
2y 5m to grant Granted Apr 14, 2026
Patent 12586128
SYSTEM AND METHOD FOR SMART ORDER ROUTING AND AUTOMATIC MARKET MAKER PATH DETERMINATION IN A DECENTRALIZED MARKET
2y 5m to grant Granted Mar 24, 2026
Patent 12586059
CHAT-BASED TRANSACTION AUTOMATION SYSTEM
2y 5m to grant Granted Mar 24, 2026
Patent 12572901
AUTOMATED TRANSACTION HANDLING USING SOFTWARE BOTS
2y 5m to grant Granted Mar 10, 2026
Patent 12567113
SYSTEMS AND METHODS FOR MEASURING RELATIONSHIPS BETWEEN INVESTMENTS AND OTHER VARIABLES
2y 5m to grant Granted Mar 03, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
50%
Grant Probability
59%
With Interview (+9.1%)
4y 2m
Median Time to Grant
Low
PTA Risk
Based on 748 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month