Prosecution Insights
Last updated: August 17, 2026
Application No. 18/408,288

DECOUPLING CONGESTION MANAGEMENT STATE AND CONNECTION MANAGEMENT STATE IN HIGH PERFORMANCE COMPUTING

Final Rejection §103
Filed
Jan 09, 2024
Priority
Sep 22, 2023 — provisional 63/584,676
Examiner
VU, VIET D
Art Unit
2455
Tech Center
2400 — Computer Networks
Assignee
Hewlett Packard Enterprise Development L.P.
OA Round
2 (Final)
84%
Grant Probability
Favorable
3-4
OA Rounds
0m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allowance Rate
891 granted / 1061 resolved
+26.0% vs TC avg
Moderate +15% lift
Without
With
+14.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 7m
Avg Prosecution
21 currently pending
Career history
1078
Total Applications
across all art units

Statute-Specific Performance

§101
6.5%
-33.5% vs TC avg
§103
71.1%
+31.1% vs TC avg
§102
9.6%
-30.4% vs TC avg
§112
10.9%
-29.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1061 resolved cases

Office Action

§103
Art Rejection 1. The text of those sections of Title 35, U.S. Code not included in this action can be found in a prior Office action. 2. Claims 1-4, 10-13 and 18-19 are rejected under 35 U.S.C. 103 as being unpatentable over Raman, U.S. pat. Appl. Pub. No. 2012/0207175. Per claim 1, Raman discloses a computer-implemented method, comprising: a) establishing, by a first network endpoint 12, a connection with a second network endpoint 14 by transmitting a control packet including a first (flow) identifier associated with the connection and the first network endpoint 12 (see par 0014, 0024); b) storing, by the first network endpoint in a first data structure (e.g., flow table 30) based on the first identifier (see par 0024), a first connection state associated with the connection, i.e., recording a selected queue in the flow table (see par 0029, step 48 in fig. 4), the first connection state including an indirection value (e.g., queue ID) indicating an index of a corresponding entry in a second (congestion table 56) data structure (see par 0032) ; c) storing, by the first network endpoint in the second data structure 56 based on the indirection value (queue ID), a first congestion state associated with the connection (see par 0032); and d) identifying, for a data flow associated with the first identifier, a congestion state corresponding to the data flow by: i) obtaining the first connection state (assigned queue) by searching the first data structure (flow table) based on the first (flow identifier) (see par 0033, step 66 in fig. 6); and ii) identifying the first congestion state by searching the second data structure (congestion table) (see par 0034, step 70 in fig. 6). Raman does not explicitly identifying the first congestion state by searching the second data structure (congestion table) based on the indirection value (queue ID) indicated in the obtained first connection state. Raman however teaches assigning the flow to the previously assigned queue if the same queue does not get congested (see par 0034). Thus, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to also perform the congestion check on the flow with previously assigned queue because it would have enabled the system to assigning the flow to new queue when the previously assigned queue gets congested. Per claim 2, Raman teaches determining whether to schedule the data back (to a queue) based on at least a status of the obtained first connection state, i.e. whether a previous flow filter/record exists for the identified flow (see par 0034). Per claim 3, Raman teaches storing the first connection state in a first entry in the first data structure (flow table), the data structure comprising connection states associated with connections between the first network endpoint and at least the second network endpoint (see par 0024, 0029); and storing the first congestion state in a second entry in the second data structure (congestion table), the second data structure comprising congestion states associated with the connections between the first network endpoint and at least the second network endpoint (see par 0032). Per claim 4, Raman teaches that the first entry indicates at least the first identifier associated with the connection, one or more data packets pending to be transmitted, a first status associated with the connection (see par 0024, 0029), and a congestion index (queue ID) associated with the first congestion state stored in the second data structure (see par 0032). Raman also teaches identifying the first congestion state by searching the second data structure (congestion table) further based on the congestion index indicated in the first entry (see par 0034). Claims 10-13 and 18-19 are similar in scope as that of claims 1-4 and hence are rejected for the same rationale set forth for claims 1-4. Allowable Subject Matter 3. Claims 5-9, 14-17 and 20 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. Response to Amendment 4. Applicant’s arguments filed January 26, 2026 with respect to claims 1-4, 10-13 and 18-19 have been considered but are deemed moot in view of new ground of rejection set forth above. Conclusion 5. Applicant's amendment necessitated the new grounds of rejection. Accordingly, THIS ACTION IS MADE FINAL. See M.P.E.P. § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 C.F.R. § 1.136(a). A SHORTENED STATUTORY PERIOD FOR RESPONSE TO THIS FINAL ACTION IS SET TO EXPIRE THREE MONTHS FROM THE DATE OF THIS ACTION. IN THE EVENT A FIRST RESPONSE IS FILED WITHIN TWO MONTHS OF THE MAILING DATE OF THIS FINAL ACTION AND THE ADVISORY ACTION IS NOT MAILED UNTIL AFTER THE END OF THE THREE-MONTH SHORTENED STATUTORY PERIOD, THEN THE SHORTENED STATUTORY PERIOD WILL EXPIRE ON THE DATE THE ADVISORY ACTION IS MAILED, AND ANY EXTENSION FEE PURSUANT TO 37 C.F.R. § 1.136(a) WILL BE CALCULATED FROM THE MAILING DATE OF THE ADVISORY ACTION. IN NO EVENT WILL THE STATUTORY PERIOD FOR RESPONSE EXPIRE LATER THAN SIX MONTHS FROM THE DATE OF THIS FINAL ACTION. 6. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Viet Vu whose telephone number is 571-272-3977. The examiner can normally be reached on Monday through Thursday from 8:00am to 6:00pm. The Group general information number is 571-272-2400. The Group fax number is 571-273-8300. If attempts to reach the examiner by telephone are unsuccessful, the examiner's supervisor, Emmanuel Moise, can be reached at 571-272-3865. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). /Viet D Vu/ Primary Examiner, Art Unit 2455 8/3/26
Read full office action

Prosecution Timeline

Jan 09, 2024
Application Filed
Oct 29, 2025
Non-Final Rejection mailed — §103
Jan 22, 2026
Examiner Interview Summary
Jan 22, 2026
Applicant Interview (Telephonic)
Jan 26, 2026
Response Filed
Aug 05, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12705186
TECHNIQUES AND DEVICES FOR CONFIGURABLE MEMORY ENCRYPTION AND AUTHENTICATION
1y 12m to grant Granted Aug 11, 2026
Patent 12695660
SYSTEM AND METHOD FOR AUTONOMOUS POLICY CONFLICT DETECTION AND MITIGATION IN OPEN RADIO ACCESS NETWORK (O-RAN) DEPLOYMENTS
1y 9m to grant Granted Jul 28, 2026
Patent 12689556
NETWORK DEVICE UPGRADE BASED GROUP PRIORITY
2y 0m to grant Granted Jul 21, 2026
Patent 12689644
SAFETY AND SECURITY OF CYBER-PHYSICAL SYSTEMS CONNECTED THROUGH IOT NETWORK
1y 10m to grant Granted Jul 21, 2026
Patent 12659380
SYSTEMS AND METHODS FOR STORAGE-EFFICIENT SENSORS
2y 10m to grant Granted Jun 16, 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

3-4
Expected OA Rounds
84%
Grant Probability
99%
With Interview (+14.6%)
2y 7m (~0m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 1061 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