Prosecution Insights
Last updated: November 20, 2026
Application No. 18/945,647

METHOD FOR LOAD PROCESSING, ELECTRONIC DEVICE AND STORAGE MEDIUM

Non-Final OA §101§103
Filed
Nov 13, 2024
Priority
Jan 29, 2024 — CN 202410122248.9
Examiner
MILLS, FRANK D
Art Unit
2194
Tech Center
2100 — Computer Architecture & Software
Assignee
Beijing Zitiao Network Technology Co., Ltd.
OA Round
1 (Non-Final)
70%
Grant Probability
Favorable
1-2
OA Rounds
1y 4m
Est. Remaining
92%
With Interview

Examiner Intelligence

Grants 70% — above average
70%
Career Allowance Rate
431 granted / 618 resolved
+14.7% vs TC avg
Strong +23% interview lift
Without
With
+22.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
23 currently pending
Career history
653
Total Applications
across all art units

Statute-Specific Performance

§101
16.5%
-23.5% vs TC avg
§103
52.4%
+12.4% vs TC avg
§102
12.1%
-27.9% vs TC avg
§112
12.7%
-27.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 618 resolved cases

Office Action

§101 §103
DETAILED ACTION Claims 1-3, 10-12, and 16-18 rejected under 35 USC § 101. Claims 1-20 rejected under 35 USC § 103. 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 § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-3, 10-12, and 16-18 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. Claims 1, 10, and 16 Step 2A, Prong One. Claims 1, 10, and 16 recite acquiring a current overload or underload state, requiring a shorter overload detection cycle than underload detection cycle, and performing processing based on that state. The inequality between qualification intervals is a mathematical relationship expressed in words. The load assessment also encompasses mental observation and judgment. An administrator can assess reported load over a shorter period for overload and a longer period for underload. No required data volume, observation count or evaluation speed prevents that assessment from being performed mentally. The acquired state may be also supplied without calculation. These limitations recite mathematical concepts and mental processes under MPEP §2106.04(a)(2), subsections I.A and III. Step 2A, Prong Two. This judicial exception is not integrated into a practical application. State acquisition supplies input, and the target server identifies the computing environment and object of the response. Claim 10 adda processor and instruction memory, while claim 16 adds a tangible medium containing instructions executed by an electronic device. These component implement the recited procedure. The limitation “performing overload processing or underload processing on the target server based on the load state” requires a responsive function but does not specify the operation accomplishing it. The OR permits either alternative and does not request a sequence of load reduction and restoration. The unequal intervals constrain the assessment, but leave its technical application as a general instruction to perform load processing. Considered as a whole, the claims specify assessment criteria and a general responsive function without identifying a particular technical operation that applies the assessment. MPEP §§ 2106.04(d)(1), 2106.05(f), 2106.05(g), and 2106.05(h). Step 2B. The claims do not include additional elements sufficient to amount to significantly more than the judicial exception. In claims 10 and 16, instruction storage and retrieval correspond to “Storing and retrieving information in memory,” identified in MPEP § 2106.05(d), subsection II, computer functions item iv. These disclosures support the ordinary implementation functions under MPEP § 2106.07(a), subsection III. Considered together, the additional elements obtain the state and implement an unspecified response using those computing functions. They supply no particular technical arrangement beyond applying the assessment. The unequal intervals define the assessment relationship, while the general processing instruction adds no inventive implementation. Accordingly, the ordered combination does not supply significantly more. MPEP § 2106.05(f). Claims 2 and 11 Claims 2 and 11 add acquisition of cluster and individual load rates and an overload determination when either exceeds its threshold during the overload detection cycle. A person can compare supplied values and apply this OR rule mentally. The acquisitions provide inputs without requiring calculation of the average or a particular measurement technique. Together with the inherited limitations, these additions refine the assessment without specifying its technical application or adding significantly more. MPEP §§ 2106.04(a)(2), 21016.05(f), and 2106.05(g). Claims 3 and 12 Claims 3 and 12 add an AND test during the underload detection cycle, with both rates below recovery threshold that are strictly below their corresponding overload thresholds. These mentally practicable comparisons, combined with the inherited upper OR rule and unequal intervals, define more restrictive recovery criteria. The leave the responsive server operation unspecified and therefore provide neither practical integration nor significantly more. MPEP §§ 2106.04(a)(2) and 2106.05(f). Claim 17 Claim 17 adds recipient acquisition, multimedia transmission, and the upper OR test discussed for claims 2 and 11. Recipient acquisition identifies a destination, and transmission does not require any load responsive change to the stream. Specification paragraphs 0079 and 0116 describe stream forwarding and ordinary network communication, corresponding to “Receiving or transmitting data over a network” in MPEP § 2106.05(d), subsection II, computer function item i. Combined with claim 16, these additions place the assessment in a streaming environment without a particular technical application or inventive arrangement. MPEP §§ 2106.05(f), 2106.05(h), and 2106.07(a). Claim 18 Claims 18 adds the lower AND test and threshold ordering discussed for claims 3 and 12. Applied to the complete combination inherited from claim 17, these comparisons further constrain the assessment but require no change to the transmitted stream or other specified server operation. They therefore provide neither practical integration nor significantly more. MPEP §§ 2106.04(a)(2) and 2106.05(f). Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1, 4-10, 13-16, and 19-20 are rejected under 35 U.S.C. 103 as being unpatentable over Wright et al., U.S. PG-Publication No. 2021/0160155 A1 (hereinafter WRIGHT), in view of Jaska et al., U.S. PG-Publication No. 2015/0016253 A1 (hereinafter JASKA). Claim 1 WRIGHT discloses a method for load processing. ¶ 0077: Load management instructions encoded on a readable medium cause the computing device to perform the method. WRIGHT discloses acquiring a load state that is current for a target server, wherein the load state comprises an overload state or an underload state. ¶ 0360: The system identifies an overloaded volume server and “underutilized volume servers”. ¶ 0079: The performance manager can use information local to the particular volume server performing the management. WRIGHT discloses performing overload processing or underload processing on the target server based on the load state. ¶ 0350: High load restricts client operations near their minimum rate. Low load permits bursts above the ordinary maximum. ¶ 0136: The controller changes the client command window or the amount of data serviced at a time. WRIGHT does not expressly disclose an overload detection cycle corresponding to the overload state is less than an underload detection cycle corresponding to the underload state. JASKA discloses an overload detection cycle corresponding to the overload state is less than an underload detection cycle corresponding to the underload state. ¶ 0034: The controller can restrict on detecting congestion and “wait for a preset delay before expanding pipes” when spare capacity appears. Restriction can follow congestion detection while expansion waits. ¶ 0028: A congestion change can be detected based on its persisting “for more than some amount of time.” It would have been obvious to a person having ordinary skill in the art before the effective filing date of the claimed invention to modify the load state qualification of WRIGHT to incorporate the duration based detection and asymmetric recovery wait taught by JASKA. One of ordinary skill in the art would be motivated to integrate that recovery wait into WRIGHT, with a reasonable expectation of success, in order to reduce repeated restriction and release of client traffic by retaining the restriction while spare capacity is confirmed, as inferred from JASKA at ¶¶ 0028, 0034. Claim 4 WRIGHT discloses acquiring an accessor that accesses to the target server. ¶ 0061: The client identifies itself, names the volume and connects directly to the responsible volume server. ¶ 0068: The target returns read data to clients and recognizes video and audio as data types. JASKA discloses sending a multimedia data stream to the accessor. ¶ 0027: A streaming service delivers the same video to a subscriber at selectable bitrates. JASKA discloses performing a hierarchical degradation strategy on the multimedia data stream in response to the target server being in the overload state, wherein the hierarchical degradation strategy is used to gradually reduce data transmission amount of the multimedia data stream. ¶ 0034: Continuing congestion can trigger another incremental reduction on the same selected stream. ¶ 0032: A stream may move from Best to Better and then to Good. ¶ 0035: Reduced available throughput can cause the content source to lower the bitrate of the communicated media. It would have been obvious to a person having ordinary skill in the art before the effective filing date of the claimed invention to modify the client bandwidth control of WRIGHT to incorporate the staged adjustment of adaptive media throughput taught by JASKA. One of ordinary skill in the art would be motivated to integrate that staged adjustment into WRIGHT, with a reasonable expectation of success, in order to relieve congestion while preserving ongoing video playback and other client traffic by lowering adaptive streams to supported quality levels, as taught by JASKA at ¶¶ 0027, 0033. Claim 5 JASKA discloses performing hierarchical degradation strategy fallback on the multimedia data stream in response to the target server being in the underload state, wherein the hierarchical degradation strategy fallback is used to gradually increase the data transmission amount of the multimedia data stream. ¶ 0034: When spare capacity appears, the controller can expand the same previously restricted stream in successive increments. ¶ 0035: Expansion can cause the source to increase the quality of the communicated media. Claim 6 JASKA discloses wherein the hierarchical degradation strategy comprises a plurality of levels. ¶ 0032: The policy uses a “plurality of predefined throughput levels”. JASKA discloses reducing the data transmission amount of the multimedia data stream level by level based on the plurality of levels included in the hierarchical degradation strategy.¶ 0032: One embodiment moves the stream down one adjacent level at a time. ¶ 0034: A further congestion check can trigger a further reduction. Claim 7 JASKA discloses acquiring an accessor category corresponding to the accessor. ¶ 0029: The subscriber terminal is associated with a shaping policy that may depend on subscription level or device capabilities. ¶ 0031: The controller identifies subscribers exceeding their assigned throughput. JASKA discloses reducing the data transmission amount of the multimedia data stream based on the accessor category. ¶ 0031: Streams to those subscribers can be restricted first, faster or to a greater extent. Claim 8 JASKA discloses increasing a level of the hierarchical degradation strategy in response to the load state being the overload state. ¶ 0034: If congestion persists, the controller can restrict the identified stream again. ¶ 0032: The controller can move to the next lower throughput level. JASKA discloses decreasing the level of the hierarchical degradation strategy in response to the load state being the underload state. ¶ 0034: The controller can expand the same stream incrementally when spare capacity appears. Claim 9 JASKA discloses wherein the hierarchical degradation strategy comprises a plurality of levels.¶ 0032: The policy specifies multiple throughput levels. JASKA discloses reducing the data transmission amount of the multimedia data stream level by level based on the plurality of levels included in the hierarchical degradation strategy. ¶ 0032: The stream can move down one adjacent level at a time. Claims 10 and 13-15 Claims 10 and 13-15 are rejected utilizing the rationale for claims 1 and 4-6; the claims are directed to a medium storing instructions corresponding to the method. Claim 16 WRIGHT discloses a non-transitory computer-readable storage medium, wherein when the instructions in the non-transitory computer-readable storage medium are executed by a processor of an electronic device, the electronic device is caused to perform a method of load processing. ¶ 0077: Load management instructions encoded on a readable medium cause the computing device to perform the method. WRIGHT discloses acquiring a load state that is current for a target server; wherein the load state comprises an overload state or an underload state. ¶ 0360: Individual volume servers can be classified as overloaded or underutilized. WRIGHT discloses performing overload processing or underload processing on the target server based on the load state. ¶ 0350: The applicable load policy restricts or permits additional client service. WRIGHT does not expressly disclose an overload detection cycle corresponding to the overload state is less than an underload detection cycle corresponding to the underload state. JASKA discloses an overload detection cycle corresponding to the overload state is less than an underload detection cycle corresponding to the underload state. ¶ 0034: The controller can restrict on detecting congestion and “wait for a preset delay before expanding pipes” when spare capacity appears. Restriction can follow congestion detection while expansion waits. ¶ 0028: A congestion change can be detected based on its persisting “for more than some amount of time.” It would have been obvious to a person having ordinary skill in the art before the effective filing date of the claimed invention to modify the load state qualification of WRIGHT to incorporate the duration based detection and asymmetric recovery wait taught by JASKA. One of ordinary skill in the art would be motivated to integrate that recovery wait into WRIGHT, with a reasonable expectation of success, in order to reduce repeated restriction and release of client traffic by retaining the restriction while spare capacity is confirmed, as inferred from JASKA at ¶¶ 0028, 0034. Claim 19 WRIGHT discloses acquiring an accessor that accesses to the target server. ¶ 0061: The identified client connects directly to the responsible volume server. JASKA discloses sending a multimedia data stream to the accessor. ¶ 0027: Video continues to the subscriber at an available bitrate. JASKA discloses performing a hierarchical degradation strategy on the multimedia data stream in response to the target server being in the overload state, wherein the hierarchical degradation strategy is used to gradually reduce data transmission amount of the multimedia data stream. ¶ 0034: The controller can restrict the same stream repeatedly as congestion persists. ¶ 0035: The content source can reduce actual media bitrate to fit the restricted throughput. Claim 20 JASKA discloses performing hierarchical degradation strategy fallback on the multimedia data stream in response to the target server being in the underload state, wherein the hierarchical degradation strategy fallback is used to gradually increase the data transmission amount of the multimedia data stream. ¶ 0034: The same previously restricted stream can be expanded in successive increments. ¶ 0035: Expansion can cause the source to increase the quality of communicated media. Claims 2-3, 11-12, and 17-18 are rejected under 35 U.S.C. 103 as being unpatentable over WRIGHT, in view of JASKA, further in view of Subramaniam et al., U.S. PG-Publication No. 2020/0183758 A1 (hereinafter SUBRAMANIAM). Claim 2 SUBRAMANIAM discloses acquiring an average load rate of a server cluster where the target server is located and a single-machine load rate of the target server. ¶ 0044: Each host can report current processor utilization with its cluster identifier. ¶ 0018: A rule sets a ceiling on the “average processor utilization of servers” within a cluster. SUBRAMANIAM discloses in response to, during the overload detection cycle, the average load rate being greater than a first threshold value, or the single-machine load rate being greater than a second threshold value, determining that the current load state of the target server is the overload state. ¶ 0045: A 62% cluster average against a 50% ceiling establishes inadequate capacity. Any violated rule can suffice. ¶ 0032: A policy can also test whether a specified number or proportion of individual servers exceed their ceilings. It would have been obvious to a person having ordinary skill in the art before the effective filing date of the claimed invention to modify the load inputs of the target server controller of WRIGHT-JASKA to incorporate the cluster average and individual server utilization measures taught by SUBRAMIAM. One of ordinary skill in the art would be motivated to integrate those measures into WRIGHT-JASKA, with a reasonable expectation of success, in order to protect running workloads from a capacity shortfall by withholding additional traffic while either the serving host or its cluster lacks headroom ,as inferred from SUBRAMANIAM at ¶¶ 0018, 0032, 0045, and 0047-0048. Claim 3 WRIGHT discloses in response to, during the underload detection cycle, the average load rate being less than a third threshold value, and the single-machine load rate being less than a fourth threshold value, determining that the current load state of the target server is the underload state. ¶ 0210: The maximum function returns the highest of its inputs. ¶ 0208: The disclosed example selects among client read and write load measures. ¶ 0285: A reading strictly below the first boundary invoked the low policy. An example boundary is 0.33. WRIGHT discloses wherein the third threshold value is less than the first threshold value, and the fourth threshold value is less than the second threshold value. ¶ 0286: An example second boundary is 0.66. ¶ 0299: The worked example places 0.39 above the first boundary and below the second. Claims 11 and 12 Claims 11 and 12 are rejected utilizing the rationale for claims 2 and 3; the claims are directed to a medium storing instructions corresponding to the method. Claim 17 WRIGHT discloses acquiring an accessor that accesses to the target server. ¶ 0061: The named client connects directly to the selected volume server. ¶ 0143: Any load exceeding its corresponding threshold indicates overload. JASKA discloses sending a multimedia data stream to the accessor. ¶ 0027: An ongoing video stream is delivered to the subscriber. WRIGHT-JASKA does not expressly disclose in response to, during the overload detection cycle, the average load rate being greater than a first threshold value, or the single-machine load rate being greater than a second threshold value, determining that the current load state of the target server is the overload state. SUBRAMANIAM discloses in response to, during the overload detection cycle, the average load rate being greater than a first threshold value, or the single-machine load rate being greater than a second threshold value, determining that the current load state of the target server is the overload state. ¶ 0045: Exceeding the cluster average ceiling can establish inadequate cluster capacity. ¶ 0032: Resource rules also evaluate individual hosts against upper limits. It would have been obvious to a person having ordinary skill in the art before the effective filing date of the claimed invention to modify the load inputs of the target server controller of WRIGHT-JASKA to incorporate the cluster average and individual server utilization measures taught by SUBRAMIAM. One of ordinary skill in the art would be motivated to integrate those measures into WRIGHT-JASKA, with a reasonable expectation of success, in order to protect running workloads from a capacity shortfall by withholding additional traffic while either the serving host or its cluster lacks headroom ,as inferred from SUBRAMANIAM at ¶¶ 0018, 0032, 0045, and 0047-0048. Claim 18 WRIGHT discloses in response to, during the underload detection cycle, the average load rate being less than a third threshold value, and the single-machine load rate being less than a fourth threshold value, determining that the current load state of the target server is the underload state. ¶ 0210: The maximum function returns the highest of its inputs. ¶ 0208: The disclosed example selects among client read and write load measures. ¶ 0285: A reading strictly below the first boundary invoked the low policy. An example boundary is 0.33. WRIGHT discloses wherein the third threshold value is less than the first threshold value, and the fourth threshold value is less than the second threshold value. ¶ 0286: An example second boundary is 0.66. ¶ 0299: The worked example places 0.39 above the first boundary and below the second. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. See Shams et al., U.S. Patent No. 10,887,642 B1, teaching reducing streaming video bitrates when bandwidth consumption exceeds a capacity threshold, delivering reduced bitrate streams to existing viewers, and restoring higher bitrate quality when spare bandwidth becomes available. SHAMS col. 6, ll. 18 and 36-64; col. 7, ll. 15-27. Any inquiry concerning this communication or earlier communications from the examiner should be directed to FRANK D MILLS whose telephone number is (571)270-3194. The examiner can normally be reached M-F 9-5:30 CT. 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, KEVIN YOUNG can be reached at (571)270-3180. 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. /FRANK D MILLS/Primary Examiner, Art Unit 2194 November 10, 2026
Read full office action

Prosecution Timeline

Nov 13, 2024
Application Filed
Nov 13, 2026
Non-Final Rejection mailed — §101, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12801428
APPLICATION PERFORMANCE ENHANCEMENT SYSTEM AND METHOD BASED ON A USER'S MODE OF OPERATION
4y 5m to grant Granted Nov 17, 2026
Patent 12801958
SERVICE FOR MANAGING QUANTUM COMPUTING RESOURCES
3y 2m to grant Granted Nov 17, 2026
Patent 12792384
REBALANCING UNDER-UTILIZED VIRTUAL MACHINES IN HYPERSCALER ENVIRONMENTS
2y 11m to grant Granted Nov 10, 2026
Patent 12770006
METHOD AND USER INTERFACE FOR TRAINING ARTIFICIAL NEURAL NETWORK MODELS IN ENVIRONMENT INCLUDING MULTIPLE COMPUTING NODES
1y 3m to grant Granted Oct 20, 2026
Patent 12743305
METHOD AND APPARATUS FOR COLLABORATIVE TASK PLANNING FOR ARTIFICIAL INTELLIGENCE AGENTS
3y 4m to grant Granted Sep 22, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
70%
Grant Probability
92%
With Interview (+22.7%)
3y 4m (~1y 4m remaining)
Median Time to Grant
Low
PTA Risk
Based on 618 resolved cases by this examiner. Grant probability derived from career allowance 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