Prosecution Insights
Last updated: April 19, 2026
Application No. 18/431,466

METHOD, DEVICE, AND SYSTEM FOR BUFFER STATUS REPORT

Non-Final OA §102
Filed
Feb 02, 2024
Examiner
TOWFIGHI, AFSHAWN M
Art Unit
2469
Tech Center
2400 — Computer Networks
Assignee
ZTE CORPORATION
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
2y 8m
To Grant
97%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allow Rate
828 granted / 946 resolved
+29.5% vs TC avg
Moderate +9% lift
Without
With
+9.1%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
28 currently pending
Career history
974
Total Applications
across all art units

Statute-Specific Performance

§101
5.6%
-34.4% vs TC avg
§103
39.4%
-0.6% vs TC avg
§102
34.3%
-5.7% vs TC avg
§112
10.6%
-29.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 946 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 . Information Disclosure Statement The information disclosure statement (IDS) submitted on 5/22/25, 2/26/25, 1/30/25, 2/2/24 is being considered by the examiner. Specification The title of the invention is not descriptive. A new title is required that is clearly indicative of the invention to which the claims are directed. The following title is suggested: METHOD, DEVICE, AND SYSTEM FOR INDICATICATING A BUFFER STATUS REPORT WITH AN INDEX TO A DATA SIZE TABLE. Claim Objections Claim 20 is objected to because of the following informalities: Claim 20 simply recited the same limitation from lines 5 and 6 of independent claim 19. Claim 20 must introduce narrowing limitations. Appropriate correction is required. Claim 39 is objected to because the preamble recites a device and the body of the claim recites action/steps. For clarity, it is suggested to add a colon “:” after the word comprising. Appropriate correction is required. 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, 4, 7, 12-14, 18-20, 22, 25, 30, 39-42 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Xu et al (Pub No: 2013/0100908). As to claim 1, Xu teaches a method performed by a wireless terminal in a wireless network (Xu, [0155], Fig 1 & 2, a method by a terminal in a wireless network), comprising: transmitting, to a wireless communication node in the wireless network, indication information indicating an index pointing to an entry value in a precise data size table (Xu, [0155]-[0160], sending the index to the extended buffer status report table to the base station), the entry value indicating a requested data size for transmitting UL traffic to the wireless communication node (Xu, [0003]-[0007], the index is into a table that represents the amount of data in the buffer for transmission to the base station (uplink)), wherein the precise data size table is associated with or supplemental to a base data size table (Xu, [0012][0014][0015], the extended buffer status report table is an extended (supplement) to the buffer status report table)). As to claim 4, Xu teaches wherein the indication information comprises a buffer status report (BSR) (Xu, Fig 4, [0015], the index information is a buffer status report since it reports to the base station the index which is a status reporting of the data in the buffer). As to claim 7, Xu teaches wherein the base data size table comprises M data size ranges, each of the M data size ranges associated with two adjacent indexes of the base data size table, and characterized by a lower bound X, an upper bound Y, and a range length defined by X and Y, X and Y being non-negative numbers (Xu, Fig 10 [0031] [0012], the buffer status report table has 64 size ranches associated with a high and lower bound, where the range of buffer status is defined by the upper an lower bounds). As to claim 12, Xu teaches wherein the indication information is indicative of a data size range from the M data size ranges, and the requested data size is within the data size range (Xu, [0158], the sent index indication is for data within the buffer status report table (M data size ranges and within the range)). As to claim 13, Xu teaches wherein the indication information is indicative of a subrange index L of a subrange in the data size range, and the requested data size is associated with the subrange index, L being a non-negative integer (Xu, [0158], the index can point to a data size range in the extended buffer status report table which is non-negative and a subrange of the 15000+ L). As to claim 14, Xu teaches wherein the requested data size is determined by the lower bound of the data size range, the upper bound of the data size range, a sub-range index L associated with a sub-range in the data size range, and a number of sub-ranges N in the data size range, N being a positive integer (Xu, [0158]-[0160], the data size is indexed which determines the lower bound and upper bound, the 150000+ sub range being 0-64 in the extended table land L). As to claim 18, Xu teaches wherein the indication information further indicates a remaining delay budget of the UL traffic (Xu, [0003]-[0007],a buffer of data amount to be transmitted is an indication of delay budget towards the base station (UL)). As to claim 19, Xu teaches a method performed by a wireless communication node in a wireless network (Xu, [0155], Fig 1 & 2, a method by a base station in a wireless network),, comprising: receiving, from a wireless terminal, indication information indicating an index pointing to an entry value in a precise data size table (Xu, [0155]-[0160], receiving the index to the extended buffer status report table from the UE), the entry value indicating a requested data size for transmitting UL traffic to the wireless communication node (Xu, [0003]-[0007], the index is into a table that represents the amount of data in the buffer for transmission to the base station (uplink)), the precise data size table being supplemental to and configured based on a base data size table (Xu, [0012][0014][0015], the extended buffer status report table is an extended (supplement) to the buffer status report table)). As to claim 20, Xu teaches wherein the precise data size table being supplemental to and configured based on a base data size table (Xu, [0012][0014][0015], the extended buffer status report table is an extended (supplement) to the buffer status report table)). As to claim 22, Xu teaches wherein the indication information comprises a buffer status report (BSR) (Xu, Fig 4, [0015], the index information is a buffer status report since it reports to the base station the index which is a status reporting of the data in the buffer). As to claim 25, Xu teaches wherein the base data size table comprises M data size ranges, each of the M data size ranges associated with two adjacent indexes of the base data size table, and characterized by a lower bound X, an upper bound Y, and a range length defined by X and Y, X and Y being non-negative numbers (Xu, Fig 10 [0031] [0012], the buffer status report table has 64 size ranches associated with a high and lower bound, where the range of buffer status is defined by the upper an lower bounds). As to claim 30, Xu teaches wherein the indication information is indicative of a data size range from the M data size ranges, and the requested data size is within the data size range (Xu, [0158], the sent index indication is for data within the buffer status report table (M data size ranges and within the range)). As to claim 39, Xu teaches a wireless device comprising a memory for storing computer instructions and a processor in communication with the memory, wherein, when the processor executes the computer instructions, the processor is configured to cause the wireless device (Xu, [0155], Fig 1 & 2, a terminal in a wireless network) to: transmit, to a wireless communication node, indication information indicating an index pointing to an entry value in a precise data size table (Xu, [0155]-[0160], sending the index to the extended buffer status report table to the base station), the entry value indicating a requested data size for transmitting UL traffic to the wireless communication node (Xu, [0003]-[0007], the index is into a table that represents the amount of data in the buffer for transmission to the base station (uplink)), the precise data size table being supplemental to and configured based on a base data size table (Xu, [0012][0014][0015], the extended buffer status report table is an extended (supplement) to the buffer status report table)). As to claim 40, Xu teaches a computer program product comprising a non-transitory computer-readable program medium with computer code stored thereupon, the computer code, when executed by one or more processors (Xu, [0155], Fig 14, computer memory with processor) causing the one or more processors to implement a method of claim 1 (Xu, citations for claim 1). As to claim 41, Xu teaches a device for wireless communication comprising a memory for storing computer instructions and a processor in communication with the memory, wherein, when the processor executes the computer instructions Xu, [0155], Fig 14, computer memory with processor), the processor is configured to implement a method of claim 19 (Xu, citations for claim 19). As to claim 42, Xu teaches a computer program product comprising a non-transitory computer-readable program medium with computer code stored thereupon, the computer code, when executed by one or more processors Xu, [0155], Fig 14, computer memory with processor), causing the one or more processors to implement a method of claim 19 (Xu, citations for claim 19). Allowable Subject Matter Claims 9, 11, 27, 29 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. Lee et al (Pub No: 2011/0171967) [0026]-[0035] LG (Pub No: EP 2 584 714 B1) [0041]-[0071] Any inquiry concerning this communication or earlier communications from the examiner should be directed to AFSHAWN M TOWFIGHI whose telephone number is (571)270-7296. The examiner can normally be reached M-F 8:00 AM -5:00 PM. 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, Ian N Moore can be reached at 571-272-3085. 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. /AFSHAWN M TOWFIGHI/Primary Examiner, Art Unit 2469
Read full office action

Prosecution Timeline

Feb 02, 2024
Application Filed
Mar 10, 2026
Non-Final Rejection — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12598140
CALCULATOR SYSTEM AND CONGESTION AVOIDANCE METHOD
2y 5m to grant Granted Apr 07, 2026
Patent 12598029
SIDELINK CARRIER AGGREGATION WITH CROSS-CARRIER RETRANSMISSION
2y 5m to grant Granted Apr 07, 2026
Patent 12588054
Message Transmission Method, Terminal and Storage Medium
2y 5m to grant Granted Mar 24, 2026
Patent 12587253
BASE STATION AND METHOD FOR A COOPERATIVE SCHEME IN SIGNAL TRANSMISSION
2y 5m to grant Granted Mar 24, 2026
Patent 12587263
Dual Path Switchable Repeater
2y 5m to grant Granted Mar 24, 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
88%
Grant Probability
97%
With Interview (+9.1%)
2y 8m
Median Time to Grant
Low
PTA Risk
Based on 946 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