Prosecution Insights
Last updated: July 17, 2026
Application No. 18/316,638

REORDERING DATA IN DISPERSED STORAGE SYSTEMS

Non-Final OA §102§103§112
Filed
May 12, 2023
Examiner
NGUYEN, THAN VINH
Art Unit
2138
Tech Center
2100 — Computer Architecture & Software
Assignee
International Business Machines Corporation
OA Round
1 (Non-Final)
91%
Grant Probability
Favorable
1-2
OA Rounds
0m
Est. Remaining
95%
With Interview

Examiner Intelligence

Grants 91% — above average
91%
Career Allowance Rate
739 granted / 813 resolved
+35.9% vs TC avg
Minimal +4% lift
Without
With
+4.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 2m
Avg Prosecution
8 currently pending
Career history
820
Total Applications
across all art units

Statute-Specific Performance

§101
3.1%
-36.9% vs TC avg
§103
30.7%
-9.3% vs TC avg
§102
47.1%
+7.1% vs TC avg
§112
10.1%
-29.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 813 resolved cases

Office Action

§102 §103 §112
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 . Claims 1-20 are pending. The IDSes, filed 5/12/23, 6/5/23, 10/6/23, and 5/7/24 have been considered. Claim Rejections - 35 USC § 112 Claim 1 recites the limitation "the transformation" in line 5. There is insufficient antecedent basis for this limitation in the claim. Claim 8 recites the limitation "the delete request" in line 1. There is insufficient antecedent basis for this limitation in the claim. Claims 2-8 are also rejected for incorporating the deficiency of the parent claim 1. Claim Rejections - 35 USC § 102 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. Claim(s) 1-6, 9-14, and 16-20 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Reddy et al (US20210374157, “Reddy”). As to claim 1: Reddy teaches a method (method; 0004, 0007, 0023) comprising: receiving a request to transform one or more data regions of a data object (receive operation request to metadata service for an object in storage regions; 0046, 0050, 0064, 0072, 0076) along with a topology map (request to update object replication map which tracks objection locations; 0042, 0043) from an authorized application (request from user, API user, or another application; 0029, 0032, 0064); fetching object metadata containing an existing data topology map (access/R/W/update/delete metadata in objection replication map; 0042, 0045-0047, 0051); applying the transformation to one or more data regions of the data object (perform update to data object; 0042, 0045-0047, 0051); and returning an updated topology map to the authorized application (metadata is updated in object replication map; 0042, 0045, 0047; metadata in replication map accessible by applications connected to object virtual machines; 0032, 0064). As to claim 2, 10, 17: Reddy teaches the object is an immutable data object (storage structure 203 stores immutable data files in data structure; 052). As to claim 3, 11, 18: Reddy teaches the authorized application maintains an internal topology map corresponding to the topology map stored in a data processing unit of a dispersed storage network (maintain separate database maps in different geographic regions; 0023, 0042). As to claim 4, 12, 19: Reddy teaches the data object is the data object written with a multi-part upload scheme (larger objects may use multipart upload scheme; 0073). As to claim 5, 13, 20: Reddy teaches the data object is accessible to read applications and non-authorized applications during the transformation of the one or more data regions of the data object (object is accessible as long as replication is pending; 0043). As to claim 6, 14: Reddy teaches only the authorized application can issue one request to transform/delete multiple data regions of the data object by individual data regions (system and can modify object storage data and entities across multiple geographic regions; 0023; operation can be delete operation; 0042, 0061, 0097). As to claim 9: Reddy teaches a computer program product (computer program product storing code; 0165), the computer program product comprising a non-transitory tangible storage device having program code embodied therewith, the program code executable by a processor of a computer to perform a method, the method comprising: receiving a request to delete (receive operation request to metadata service for an object in storage regions; 0046, 0050, 0064, 0072, 0076; operation can be delete operation; 0042, 0061, 0097) one or more data regions of a data object with a topology map (request to update object replication map which tracks objection locations; 0042, 0043) from an authorized application (request from user, API user, or another application; 0029, 0032, 0064); fetching object metadata containing an existing data topology map (access/R/W/update/delete metadata in objection replication map; 0042, 0045-0047, 0051); deleting one or more data regions of the data object (perform update to data object; 0042, 0045-0047, 0051; operation can be delete operation; 0042, 0061, 0097); and returning an updated topology map to the authorized application (metadata is updated in object replication map; 0042, 0045, 0047; metadata in replication map accessible by applications connected to object virtual machines; 0032, 0064). As to claim 16: Reddy teaches a computer system (computing system 100; 0032), comprising: one or more processors (processor/CPU; 0005-0007, 0032); a memory coupled to at least one of the processors (memory storage; 0032); a set of computer program instructions(instructions; 0035-0036) stored in the memory and executed by at least one of the processors in order to perform actions of: receiving a request to delete (receive operation request to metadata service for an object in storage regions; 0046, 0050, 0064, 0072, 0076; operation can be delete operation; 0042, 0061, 0097) one or more data regions of a data object with a topology map (request to update object replication map which tracks objection locations; 0042, 0043) from an authorized application (request from user, API user, or another application; 0029, 0032, 0064); fetching object metadata containing an existing data topology map (access/R/W/update/delete metadata in objection replication map; 0042, 0045-0047, 0051); deleting one or more data regions of the data object (perform update to data object; 0042, 0045-0047, 0051; operation can be delete operation; 0042, 0061, 0097); and returning an updated topology map to the authorized application (metadata is updated in object replication map; 0042, 0045, 0047; metadata in replication map accessible by applications connected to object virtual machines; 0032, 0064). 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. Claim(s) 7-8 and 15 is/are rejected under 35 U.S.C. 103 as being unpatentable over Reddy et al (US20210374157, “Reddy”), in view of Kannan (US20200310659). As to claim 7, 8, 15: Reddy teaches performing transformation/delete (delete access; 0042, 0061, 0097) access via an API call (0064) for synchronous and asynchronous replication (0022-0023). However Reddy does not specifically teach the API is a RESTful API. It is well-known in the art to use a RESTful API to exchange information securely over the internet. One such art is Kannan, who teaches using a RESTful API for performing transactions over the internet to access shared data (0112), such as updating mapping data structure (0216). It would have been obvious to one of ordinary skills in the art, at the time of the invention, to use Kannan’s teaching of using RESTful API, in the invention of Reddy, for better secure transactions over the internet. Any inquiry concerning this communication or earlier communications from the examiner should be directed to THAN NGUYEN whose telephone number is (571)272-4198. The examiner can normally be reached M-F 7:00am -4:00pm. 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, Tim Vo can be reached at (571)272-3642. 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. /THAN NGUYEN/Primary Examiner, Art Unit 2138
Read full office action

Prosecution Timeline

May 12, 2023
Application Filed
Nov 29, 2023
Response after Non-Final Action
Jun 17, 2026
Non-Final Rejection mailed — §102, §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12675244
COMPUTER SYSTEM AND DATA MANAGEMENT METHOD IN STORAGE SYSTEM
1y 9m to grant Granted Jul 07, 2026
Patent 12675235
SYSTEM AND METHOD OF WRITING TO NONVOLATILE MEMORY USING WRITE BUFFERS
1y 9m to grant Granted Jul 07, 2026
Patent 12639005
STORAGE DEVICE FOR SKIPPING REDUNDANT REPLAY AND JOURNAL REPLAY METHOD THEREOF
1y 9m to grant Granted May 26, 2026
Patent 12638999
APPARATUS, METHOD, AND SYSTEM FOR MANAGING REPLICATION BASED ON REPLICATION DELAY TIME
1y 8m to grant Granted May 26, 2026
Patent 12625646
STORAGE DEVICE, STORAGE CONTROLLER, AND OPERATING METHOD FOR REORDERING READ REQUESTS
1y 9m to grant Granted May 12, 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
91%
Grant Probability
95%
With Interview (+4.2%)
2y 2m (~0m remaining)
Median Time to Grant
Low
PTA Risk
Based on 813 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