Prosecution Insights
Last updated: November 04, 2026
Application No. 18/809,043

SYSTEM AND METHOD FOR LATENCY CRITICAL QUALITY OF SERVICE USING CONTINUOUS BANDWIDTH CONTROL

Non-Final OA §DP
Filed
Aug 19, 2024
Priority
Dec 02, 2019 — provisional 62/942,299 +2 more
Examiner
CHOUDHURY, FAISAL
Art Unit
2478
Tech Center
2400 — Computer Networks
Assignee
Drw Technologies LLC
OA Round
1 (Non-Final)
85%
Grant Probability
Favorable
1-2
OA Rounds
5m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 85% — above average
85%
Career Allowance Rate
703 granted / 825 resolved
+27.2% vs TC avg
Strong +15% interview lift
Without
With
+15.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
27 currently pending
Career history
851
Total Applications
across all art units

Statute-Specific Performance

§101
5.0%
-35.0% vs TC avg
§103
54.8%
+14.8% vs TC avg
§102
18.7%
-21.3% vs TC avg
§112
12.9%
-27.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 825 resolved cases

Office Action

§DP
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 . Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the claims at issue are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); and In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on a nonstatutory double patenting ground provided the reference application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO internet Web site contains terminal disclaimer forms which may be used. Please visit http://www.uspto.gov/forms/. The filing date of the application will determine what form should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to http://www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. Claims 1 and 11 is/are rejected on the ground of nonstatutory double patenting as being unpatentable over claim 1 of U.S. Patent No 12,095,673. Although the claims at issue are not identical, they are not patentably distinct from each other because the following table shows mapping of how the claim of the instant application are made obvious by applicant and in views of what was known in the prior art at the time of invention. US Patent 12,095,673 Instant Application 18/809,043 Claim 1 A buffer arbitration communication system, said system including: a first buffer, wherein said first buffer receives a first packet, wherein said first packet includes at least a first packet first word and a first packet second word, wherein said first buffer is associated with a first buffer real rank; a second buffer, wherein said second buffer receives a second packet, wherein said second packet includes at least one second packet word, wherein said second buffer is associated with a second buffer real rank; a data sink, wherein said data sink may receive data words from either said first buffer or said second buffer; a buffer rank calculator, wherein said buffer rank calculator stores said first buffer real rank and said second buffer real rank, wherein said first buffer real rank is increased according to a first stored decay equation for each first packet word transmitted by said first buffer to said sink, wherein said first buffer real rank is decreased according to a first stored recovery equation for each sink transmission cycle during which said first buffer does not transmit a first packet word to said sink, down to a minimum of a predetermined minimum rank for said first buffer, wherein said second buffer real rank is increased according to a second stored decay equation for each second packet word transmitted by said second buffer to said sink, wherein said second stored decay equation differs from said first stored decay equation, wherein said second buffer real rank is decreased according to a second stored recovery equation for each sink transmission cycle during which said second buffer does not transmit a second packet word to said sink, down to a minimum of a predetermined minimum rank for said second buffer wherein said buffer rank calculator determines a first buffer absolute rank by rounding said first buffer real rank down to the next whole integer, wherein said buffer rank calculator determines a second buffer absolute rank by rounding said second buffer real rank down to the next whole integer; and a buffer selector wherein said buffer selector selects which of said first buffer and said second buffer to allow to transmit words to said sink, wherein, when said first buffer is transmitting said first packet first word to said sink and said buffer selector determines that said second buffer absolute rank has become less than said first buffer absolute rank, said buffer selector causes said first buffer to cease transmission of said first packet prior to the transmission of said first packet second word. Claims 1 and 11 A buffer arbitration communication system, said system including: a first buffer, wherein said first buffer receives a first packet, wherein said first packet includes at least one first packet word, wherein said first buffer is associated with a first buffer real rank; a second buffer, wherein said second buffer receives a second packet, wherein said second packet includes at least one second packet word, wherein said second buffer is associated with a second buffer real rank; a data sink, wherein said data sink may receive data words from either said first buffer or said second buffer; a buffer rank calculator, wherein said buffer rank calculator stores said first buffer real rank and said second buffer real rank, wherein said first buffer real rank is increased according to a first stored decay equation for each first packet word transmitted by said first buffer to said sink, wherein said first buffer real rank is decreased according to a first stored recovery equation for each sink transmission cycle during which said first buffer does not transmit a first packet word to said sink, down to a minimum of a predetermined minimum rank for said first buffer, wherein said second buffer real rank is increased according to a second stored decay equation for each second packet word transmitted by said second buffer to said sink, wherein said second stored decay equation differs from said first stored decay equation, wherein said second buffer real rank is decreased according to a second stored recovery equation for each sink transmission cycle during which said second buffer does not transmit a second packet word to said sink, down to a minimum of a predetermined minimum rank for said second buffer, wherein said buffer rank calculator determines a first buffer absolute rank by rounding said first buffer real rank down to the next whole integer, wherein said buffer rank calculator determines a second buffer absolute rank by rounding said second buffer real rank down to the next whole integer; and a buffer selector wherein said buffer selector selects which of said first buffer and said second buffer to allow to transmit words to said sink, wherein said buffer selector selects said first buffer when said first buffer absolute rank is less than said second buffer absolute rank and selects said second buffer when said second buffer absolute rank is less than said first buffer absolute rank, wherein, when said first buffer is transmitting a first packet word to said sink and said transmitting takes place over a plurality of sink transmission cycles, said second buffer real rank is decreased according to said second stored recovery equation at each of said plurality of sink transmission cycles. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to FAISAL CHOUDHURY whose telephone number is (571)270-3001. The examiner can normally be reached M-F 8AM-6P.M. 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, Joseph Avellino can be reached at 5712723905. 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. /FAISAL CHOUDHURY/Primary Examiner, Art Unit 2478
Read full office action

Prosecution Timeline

Aug 19, 2024
Application Filed
Sep 29, 2026
Non-Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12786855
Duplicated SIB Handling in Sidelink Relay
3y 2m to grant Granted Nov 03, 2026
Patent 12786853
NETWORK NODE SELECTION BY A USER EQUIPMENT (UE) USING ONE OR MORE PROBABILITY VALUES
3y 4m to grant Granted Nov 03, 2026
Patent 12776818
MODEL PROCESSING METHOD, ELECTRONIC DEVICE, NETWORK DEVICE, AND TERMINAL DEVICE
2y 8m to grant Granted Oct 27, 2026
Patent 12777422
WAKE-UP ALIGNMENT METHOD, SYSTEM, AND RELATED APPARATUS
2y 6m to grant Granted Oct 27, 2026
Patent 12771468
CONDITION MONITORING DEVICE, GROUND WIRELESS DEVICE, ON-BOARD WIRELESS DEVICE, FAILURE RISK DETERMINATION METHOD, CONTROL CIRCUIT, AND STORAGE MEDIUM
3y 4m to grant Granted Oct 20, 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
85%
Grant Probability
99%
With Interview (+15.2%)
2y 7m (~5m remaining)
Median Time to Grant
Low
PTA Risk
Based on 825 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