Prosecution Insights
Last updated: November 20, 2026
Application No. 19/065,344

COMMAND TO REMOVE ONE OR MORE NODES OF A NETWORK FABRIC

Non-Final OA §102
Filed
Feb 27, 2025
Examiner
MEJIA, ANTHONY
Art Unit
2451
Tech Center
2400 — Computer Networks
Assignee
International Business Machines Corporation
OA Round
1 (Non-Final)
84%
Grant Probability
Favorable
1-2
OA Rounds
1y 2m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allowance Rate
625 granted / 746 resolved
+25.8% vs TC avg
Strong +18% interview lift
Without
With
+17.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 11m
Avg Prosecution
14 currently pending
Career history
759
Total Applications
across all art units

Statute-Specific Performance

§101
15.3%
-24.7% vs TC avg
§103
48.4%
+8.4% vs TC avg
§102
17.3%
-22.7% vs TC avg
§112
10.3%
-29.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 746 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 . Examiner’s Comments Claims 1-12 currently recite: “A computer program product comprising: a set of one or more computer-readable storage media ….” Applicants at par [0016] of specification as filed: “…A computer-readable storage medium, as that term is used in the present disclosure, is not to be construed as storage in the form of transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide, light pulses passing through a fiber optic cable, electrical signals communicated through a wire, and/or other transmission media…” (emphasis added). Thus, the claimed “a set of one or more computer-readable storage media” is/are being interpreted as non-transitory storage. Applicants are encouraged to amend claims 1-12 to include “non-transitory”. Claims 3-4, 8-9, 15-16, and 19-20 are 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 AND overcome the current 35 U.S.C. 101 obvious-double patenting rejection below. Double Patenting The non-statutory 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 non-statutory double patenting rejection is appropriate where the conflicting claims 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); 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 non-statutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a non-statutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based e-Terminal Disclaimer may be filled out completely online using web-screens. An e-Terminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about e-Terminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. Claims 1-20 are provisionally rejected on the ground of non-statutory double patenting as being unpatentable over a least claim 1 of co-pending U.S. Application No. 19/065391. Although the claims at issue are not identical, they are not patentably distinct from each other because claim 1 of the co-pending applications anticipates all of the limitations of the instant application and only recites obvious differences (see table below) This is a provisional non-statutory double patenting rejection because the patentably indistinct claims have not in fact been patented. U.S. AP No. 19/065391 U.S. AP No. 19/065344 (Instant Application) A computer program product comprising: a set of one or more computer-readable storage media, wherein the set of one or more computer-readable storage media is not a transitory signal per se; and program instructions, collectively stored in the set of one or more computer-readable storage media, for causing at least one device to perform computer operations including: obtaining, by a receiving network device, a command built to enable a control program of a device coupled to the receiving network device to request removal of a network device, the command including an indication of the network device; initiating, by the receiving network device, removal of the network device indicated by the command, the initiating removal of the network device including initiating removal of one or more paths of the network device; and providing, by the receiving network device, a response to the request for removal of the network device. A computer program product comprising: a set of one or more computer-readable storage media; and program instructions, collectively stored in the set of one or more computer- readable storage media, for causing at least one device to perform computer operations including: obtaining, by a receiving network device, a command built to enable a control program of a device coupled to the receiving network device to request removal of a node from a network fabric, the command including an indication of the node; performing, by the receiving network device, removal processing to remove the node indicated by the command from the network fabric; and providing, by the receiving network device, a response to the request for removal of the node from the network fabric. It would have been obvious to one of ordinary skill in the art at the time invention was filed to remove one or more paths of the network device. One of ordinary skill in the art at the time the invention was filed would have been motivated to improve the network to facilitate communication and/or processing within the computing environment. 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-2, 5-7, 10-14, and 17-18 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Martin (US 11,516,725 B1) (hereinafter as Martin). Regarding Claim 1. Martin teaches a computer program product comprising: a set of one or more computer-readable storage media (col.6, lines 1-45 and col.9, lines 5-29); and program instructions, collectively stored in the set of one or more computer- readable storage media (col.6, lines 1-45 and col.9, lines 5-29); for causing at least one device to perform computer operations including: obtaining, by a receiving network device, a command built to enable a control program of a device coupled to the receiving network device to request removal of a node from a network fabric, the command including an indication of the node (After installation of the network 120 (for example, installation of the devices acting as nodes 125 in a facility), a node 125 may be known to the network management server 110 by its MAC address or other type of address or ID. The gateway 115 conducts a process of identifying the node 125 to be part of the network and associating the node at the server with its unique identifier, such process being referred to herein as an automated topological discovery process. The discovery may also be performed at other times, e.g., upon request of a network management device or administrator, after network maintenance is conducted, when devices are added, removed, or change location, or otherwise periodically or as scheduled. The topological discovery process is intended to identify all or a subset of the nodes on the network (or subnetwork) specified by the parameters included in the discovery request, col. 9, lines 30-53); performing, by the receiving network device, removal processing to remove the node indicated by the command from the network fabric (gateway removes node, col.14, lines 59-64); and providing, by the receiving network device, a response to the request for removal of the node from the network fabric (responses are sent unicast/multicast to the gateway, along with status of links and neighbors, col.12, lines 20-67). Regarding Claim 2. Martin teaches the computer program product of claim 1, wherein the performing removal processing includes removing the node from one or more routing data structures of the network fabric (when the link quality does not meet the threshold value, the edge is added to the list of bad edges, the query node is removed from the list of unlinked nodes (if still there), but the neighboring node is retained in the list of unlinked nodes (if still there), col.4, lines 35-56). Regarding Claim 5. Martin teaches the computer program product of claim 2, wherein the performing removal processing further includes removing the node from the one or more routing data structures based on ascertaining that a last path situation is undetected, wherein the removing the node from the one or more routing data structures includes removing from the one or more routing data structures at least one identifier of the node (remove nodes from list that are not responding, which includes information pertaining to the nodes and link.14, lines 17-56).. Regarding Claim 6. Martin teaches the computer program product of claim 5, wherein the ascertaining that the last path situation is undetected is performed based on an indicator of the command indicating a last path check is to be performed (must find the path for each node, including bad nodes that are not responding (undetected) , col.14, lines 17-56). Regarding Claim 7. Martin teaches the computer program product of claim 1, wherein the response includes status of the removal of the node (nodes are removed, and information received from neighboring nodes of the remove(d) node at the gateway, col. 14, lines 17-66). Regarding Claim 10. The computer program product of claim 1, wherein the receiving network device is a same device as the node(node N1 collects information about link status between the source node (node N7) and itself (node N1), such as an indicator of link quality, the gateway waits for responses from nodes, including neighboring nodes and information about the links, col.14, lines 17-56 ). Regarding Claim 11. Martin teaches the computer program product of claim 1, wherein the receiving network device is a different device than the node (node N1 collects information about link status between the source node (node N7) and itself (node N1), such as an indicator of link quality, the gateway waits for responses from nodes, including neighboring nodes and information about the links, col.14, lines 17-56 ). Regarding Claim 12. Martin teaches the computer program product of claim 11, wherein the performing removal processing includes initiating removal of the node from the network fabric by forwarding at least an indication of the command towards the node, the node to perform the removal of the node from the network fabric (a multicast message does not follow a single path defined by routing tables to a destination node, but is instead “forwarding” by nodes that receive the message regardless of the message's destination or destinations. A multicast message is typically retransmitted by each node that receives it, and a node that receives a multicast message usually does not return an acknowledgment to the sender. A multicast message includes a header and a payload portion that includes the intended content data, if any. Nodes process, retransmit, and/or broadcast the message through the network based on the information, (col.9, lines 30-53). Regarding Claims 13-14, these system claims comprise limitations substantially the same, as those discussed in claims 1-2 above, same rationale of rejection is applicable. Regarding Claims 17-18, these system claims comprise limitations substantially the same, as those discussed in claims 1-2 above, same rationale of rejection is applicable. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to ANTHONY MEJIA whose telephone number is (571)270-3630. The examiner can normally be reached Monday-Friday 10:30 AM-6:30 PM EST. 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, CHRISTOPHER PARRY can be reached at (571)272-8328. 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. /ANTHONY MEJIA/Primary Examiner, Art Unit 2451
Read full office action

Prosecution Timeline

Feb 27, 2025
Application Filed
Oct 01, 2026
Non-Final Rejection mailed — §102 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12795593
METHOD FOR TRANSMITTING AND RECEIVING SIGNALS IN WIRELESS COMMUNICATION SYSTEM, AND APPARATUS SUPPORTING SAME
2y 0m to grant Granted Nov 10, 2026
Patent 12794768
ARTIFICIAL INTELLIGENCE-BASED UNBOXING SETUP GUIDANCE SYSTEM, METHOD FOR ELECTRONIC PRODUCTS AND SMART MOBILE TERMINAL
1y 9m to grant Granted Nov 10, 2026
Patent 12786113
Edge Computing Data and Service Discovery Using an Interior Gateway Protocol (IGP)
3y 5m to grant Granted Nov 03, 2026
Patent 12785847
SCALABLE PACKET COMMUNICATION IN A LONG RANGE WIRELESS SYSTEM
3y 4m to grant Granted Nov 03, 2026
Patent 12787048
TECHNIQUES FOR ROBUST PREAMBLE GENERATION FOR SCALABLE PACKETS IN LONG RANGE WIRELESS NETWORK
2y 10m to grant Granted Nov 03, 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
84%
Grant Probability
99%
With Interview (+17.6%)
2y 11m (~1y 2m remaining)
Median Time to Grant
Low
PTA Risk
Based on 746 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