Prosecution Insights
Last updated: August 17, 2026
Application No. 18/915,400

Packet Transmission with Implicit Loss Indication (ILI)

Non-Final OA §102
Filed
Oct 15, 2024
Examiner
SCHEIBEL, ROBERT C
Art Unit
2467
Tech Center
2400 — Computer Networks
Assignee
Mellanox Technologies Ltd.
OA Round
1 (Non-Final)
81%
Grant Probability
Favorable
1-2
OA Rounds
11m
Est. Remaining
96%
With Interview

Examiner Intelligence

Grants 81% — above average
81%
Career Allowance Rate
654 granted / 810 resolved
+22.7% vs TC avg
Moderate +15% lift
Without
With
+14.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
32 currently pending
Career history
840
Total Applications
across all art units

Statute-Specific Performance

§101
6.2%
-33.8% vs TC avg
§103
47.4%
+7.4% vs TC avg
§102
19.4%
-20.6% vs TC avg
§112
16.6%
-23.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 810 resolved cases

Office Action

§102
DETAILED ACTION 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. Claims 1, 3, and 13 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Dhanabalan et al (US 2021/0092062). Regarding claim 1: Dhanabalan discloses a network device, comprising: a port, to connect to a network (see communication interface 118 of Figure 2, for example); and packet processing circuitry (see processor 103 of Figure 2, for example), to: transmit a data packet to the network (disclosed throughout; see [0095], for example, which discloses that “packets may be duplicated over the current path (e.g., duplicated over the same path)”; the first of these packets maps to the claimed data packet); and after transmitting the data packet, transmit to the network an Implicit Loss Indication (ILI) packet that (i) references the data packet and (ii) is provisioned to traverse a same route via the network as the data packet (disclosed throughout; see [0095], for example, which, as noted above, discloses sending duplicate packets over the same path; the second packet is interpreted as an implicit loss indication packet as it is transmitted when “the level or quality of all other identified paths is so low that no meaningful benefit can be gained by duplicating the flow over those path” [0095], thus implying that loss would occur on those paths; further, this duplicated packet references the data packet (in that it has the same information in it) and is provisioned to travers a same route (the same path discussed above)). Regarding claim 13: Dhanabalan discloses a method, comprising: transmitting a data packet to the network (disclosed throughout; see [0095], for example, which discloses that “packets may be duplicated over the current path (e.g., duplicated over the same path)”; the first of these packets maps to the claimed data packet); and after transmitting the data packet, transmitting to the network an Implicit Loss Indication (ILI) packet that (i) references the data packet and (ii) is provisioned to traverse a same route via the network as the data packet (disclosed throughout; see [0095], for example, which, as noted above, discloses sending duplicate packets over the same path; the second packet is interpreted as an implicit loss indication packet as it is transmitted when “the level or quality of all other identified paths is so low that no meaningful benefit can be gained by duplicating the flow over those path” [0095], thus implying that loss would occur on those paths; further, this duplicated packet references the data packet (in that it has the same information in it) and is provisioned to travers a same route (the same path discussed above)). Regarding claim 3: Dhanabalan discloses the limitations that the packet processing circuitry is to assign the ILI packet a Layer-2 (L2) header and a Layer-3 (L3) header that match the L2 header and the L3 header of the data packet (disclosed throughout; see [0095], which, as noted above, discloses sending duplicate packets over the same path; the duplicate packet clearly has matching (duplicated) L2 and L3 headers). Claims 1 and 13 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Shokarev et al (US 2020/0092174). Regarding claim 1: Shokarev discloses a network device, comprising: a port, to connect to a network (disclosed throughout; see the input/output components 305/315 of Figure 3, which are ports to a network connected via the physical link(s)); and packet processing circuitry (disclosed throughout; see the controller 320 of Figure 3, for example), to: transmit a data packet to the network (disclosed throughout; see the transmission of the traffic flow disclosed throughout; for example, see element 130 of Figure 1B; the packets of the traffic flow (including the “selected packet” discussed below) are transmitted “as part of” the traffic flow); and after transmitting the data packet, transmit to the network an Implicit Loss Indication (ILI) packet that (i) references the data packet and (ii) is provisioned to traverse a same route via the network as the data packet (disclosed throughout; the “packet replica” (of a selected packet) is interpreted as an implicit loss indication packet; for example, see [0015]-[0016], for example, which indicates that the first network device may generate a packet replica of a packet that is part of the traffic flow and may “modify a value in a header of the packet replica, such that the second network device is unable to validate the packet replica as a result of the modification”; this modified header value implicitly indicates a packet loss; further, the replica packet references the data packet (by including all but the modified portions of the selected packet; for example, as indicated in [0017], the replica packet includes the same IP address information) and is provisioned to traverse the same route as the data packet (see Figure 1B, for example, which indicates that the replica packets traverse the same route as the selected packets that are part of the same traffic flow)). Regarding claim 13: Shokarev discloses a method, comprising: transmitting a data packet to the network (disclosed throughout; see the transmission of the traffic flow disclosed throughout; for example, see element 130 of Figure 1B; the packets of the traffic flow (including the “selected packet” discussed below) are transmitted “as part of” the traffic flow); and after transmitting the data packet, transmitting to the network an Implicit Loss Indication (ILI) packet that (i) references the data packet and (ii) is provisioned to traverse a same route via the network as the data packet (disclosed throughout; the “packet replica” (of a selected packet) is interpreted as an implicit loss indication packet; for example, see [0015]-[0016], for example, which indicates that the first network device may generate a packet replica of a packet that is part of the traffic flow and may “modify a value in a header of the packet replica, such that the second network device is unable to validate the packet replica as a result of the modification”; this modified header value implicitly indicates a packet loss; further, the replica packet references the data packet (by including all but the modified portions of the selected packet; for example, as indicated in [0017], the replica packet includes the same IP address information) and is provisioned to traverse the same route as the data packet (see Figure 1B, for example, which indicates that the replica packets traverse the same route as the selected packets that are part of the same traffic flow)). Allowable Subject Matter Claims 2, 4-7, and 14-16 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. Claims 8-12 and 17-20 are allowed. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Dohadwala et al (US 2024/0421937) discloses a method including fast retransmission mechanisms to mitigate stragglers and high tail latencies for reliable out of order transport protocols. Hausauer et al (US 2024/0314203) discloses an RDMA NIC utilizing packet level request and response interleaving. Ramasamy et al (US 2017/0064762) discloses a method for providing integrity protection in a dual SIM dual standby device. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Robert C Scheibel whose telephone number is (571)272-3169. The examiner can normally be reached Monday-Friday 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, Hassan A Phillips can be reached at 571-272-3940. 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. Robert C. Scheibel Primary Examiner Art Unit 2467 /Robert C Scheibel/Primary Examiner, Art Unit 2467 July 31, 2026
Read full office action

Prosecution Timeline

Oct 15, 2024
Application Filed
Aug 04, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12701548
PRE-PAGING FOR DEEP COVERAGE SCENARIOS
2y 11m to grant Granted Aug 04, 2026
Patent 12696075
Method For Obtaining Capability Information Of Terminal, Apparatus, And System
5y 2m to grant Granted Jul 28, 2026
Patent 12696128
PROTOCOL OVERHEAD REDUCTION
3y 2m to grant Granted Jul 28, 2026
Patent 12672064
METHOD FOR OPERATION OF UWB TAG, UWB TAG, AND STORAGE MEDIUM
2y 9m to grant Granted Jun 30, 2026
Patent 12665624
CORRELATING NETWORK & PHYSICAL LAYER ACTIVITIES
3y 0m to grant Granted Jun 23, 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
81%
Grant Probability
96%
With Interview (+14.8%)
2y 9m (~11m remaining)
Median Time to Grant
Low
PTA Risk
Based on 810 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