Prosecution Insights
Last updated: November 04, 2026
Application No. 18/692,716

METHODS AND SYSTEMS FOR ASSESSING AND ENHANCING CYBERSECURITY OF A NETWORK

Final Rejection §103
Filed
Mar 15, 2024
Priority
Sep 17, 2021 — provisional 63/245,621 +2 more
Examiner
DAILEY, THOMAS J
Art Unit
2458
Tech Center
2400 — Computer Networks
Assignee
Willowglen Systems Inc.
OA Round
2 (Final)
81%
Grant Probability
Favorable
3-4
OA Rounds
7m
Est. Remaining
96%
With Interview

Examiner Intelligence

Grants 81% — above average
81%
Career Allowance Rate
713 granted / 880 resolved
+23.0% vs TC avg
Moderate +15% lift
Without
With
+14.9%
Interview Lift
resolved cases with interview
Typical timeline
3y 2m
Avg Prosecution
21 currently pending
Career history
915
Total Applications
across all art units

Statute-Specific Performance

§101
11.6%
-28.4% vs TC avg
§103
51.6%
+11.6% vs TC avg
§102
18.9%
-21.1% vs TC avg
§112
11.6%
-28.4% vs TC avg
Black line = Tech Center average estimate • Based on career data from 880 resolved cases

Office Action

§103
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 . DETAILED ACTION Claims 19, 37, 55, 70, and 95-112 are pending. Response to Arguments Applicant's arguments with respect to the prior art rejection of the claims have been considered but are moot in view of the new ground(s) of rejection. Claim Objections Claim 108 and 111 are objected to because of the following informalities: reciting, “the data packet form the first node” rather than, “from” Appropriate correction is required. Claim 109 is objected to as it recites, “The method of any one of claim 55” rather than, “The method of claim 55” Appropriate correction is required. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. This application currently names joint inventors. In considering patentability of the claims the examiner presumes that the subject matter of the various claims was commonly owned as of the effective filing date of the claimed invention(s) absent any evidence to the contrary. Applicant is advised of the obligation under 37 CFR 1.56 to point out the inventor and effective filing dates of each claim that was not commonly owned as of the effective filing date of the later invention in order for the examiner to consider the applicability of 35 U.S.C. 102(b)(2)(C) for any potential 35 U.S.C. 102(a)(2) prior art against the later invention. Claims 19, 37, 55, 70, 95-99, 101-105, 108, 109, 111, and 112 are rejected under 35 U.S.C. 103 as being unpatentable over Whelan et al (US Pub. No. 2013/019317), hereafter, “Whelan,” in view of Brown, Jr. et al (US Pub. No. 2018/0198822), hereafter, “Brown.” As to claim 19, Whelan discloses a method for controlling a response of a network to a data packet addressed from a first node having a first node location to a second node having a second node location in the network (Fig. 1 and [0067], particularly, “When a network node (i.e. an originating transmission network node) wants to send data to another network node (i.e. a destination receiving network node), a particular path that stretches between the two network nodes for sending the data must be determined.”), the method comprising the steps of: (a) using the processor, in accordance with at least one rule stored in a memory, determining an access control score based on the first node location and the second node location ([0009], particularly, “In one or more embodiments, the method further involves utilizing at least one level of trust of at least one network node to determine a degree of trust of at least one path for routing the data, where the path(s) includes at least one of the network nodes. In one or more embodiments, there is more than one level for the degree of trust. In at least one embodiment, the degree of trust of at least one path is very high, high, medium, or low.” and further [0047], particularly “The level of trust for a network node may be determined by its certainty of physical location. The physical location of a node may be attained by placing the node in a known secure location, such as a military base or a government building; by verification of the physical location by using satellite geolocation techniques; or by estimation of the physical location by using network ping ranging measurements.”); and (b) in response to the access control score being lower than a predetermined value, using the processor ([0052], particularly, “The fourth main feature of the disclosed system and method relates to the use of at least one boundary firewall router. For this feature, at least one boundary firewall router is employed as a gatekeeper to data attempting to pass through the network. Specifically, a boundary firewall router is used to determine whether to allow data to pass through the boundary firewall router. In particular, the boundary firewall router will let data pass through it if the data has previously passed through a path with a high enough degree of trust.”), controlling the response of the network comprising: (i) preventing transmission of the data packet to the second node ([0052] and further, [0080], particularly, “Each boundary firewall node 5200 determines whether data, that is attempting to pass through the perimeter 5100 or boundary firewall node 5200, has previously traveled through a path with a high enough degree of trust. If the data has previously traveled through a path with a high enough degree of trust, the boundary firewall node 5200 will allow the data to pass through the boundary firewall node 5200. Each boundary firewall node 5200 has a set threshold degree of trust requirement, and it will require data to have previously traveled through a path having at least that threshold degree of trust in order for the boundary firewall node 5200 to allow the data to pass through it.”) and However, Whelan does not explicitly disclose (ii) extracting data from the data packet, and storing the data in a data buffer memory that is accessible to the network. But, Brown discloses (i) preventing transmission of a data packet to a second node and (ii) extracting data from the data packet, and storing the data in a data buffer memory that is accessible to the network ([0013], particularly, “In another embodiment, organizational servers that may be used in production are configured to selectively route network traffic either to a production service or to a honeypot server. For example, network traffic from non-whitelisted or blacklisted hosts may be forwarded to a honeypot server rather than being dropped.” and further [0022]-[0025], particularly, “For example, extensive logging functionality may be employed by the honeypot server 118 to chronicle all activity via the honeypot server 118. This logging functionality may be of a stealth nature, so as to avoid detection by the user…The log records may include network addresses of the connecting devices 106, timestamps, event descriptions, keystroke data, files and/or other resources accessed, operations performed, and/or other information.”) Therefore it would have been obvious to one of ordinary skill in the art prior to the effective filing date of the application to combine the teachings of Whelan and Brown in order to provide a means to store information that could later be used to improve the overall security of the networked environment. As to claim 37, it is rejected by a similar rationale to that set forth in claim 19’s rejection. As to claim 55, Whelan discloses a method for controlling a response of a network to a data packet addressed from a first node to a second node in the network (Fig. 1 and [0067], particularly, “When a network node (i.e. an originating transmission network node) wants to send data to another network node (i.e. a destination receiving network node), a particular path that stretches between the two network nodes for sending the data must be determined.”), the method comprising the steps of: (a) storing in a memory, a rule for determining a cybersecurity threat score for the first node ([0009], particularly, “In one or more embodiments, the method further involves utilizing at least one level of trust of at least one network node to determine a degree of trust of at least one path for routing the data, where the path(s) includes at least one of the network nodes. In one or more embodiments, there is more than one level for the degree of trust. In at least one embodiment, the degree of trust of at least one path is very high, high, medium, or low.”), wherein the rule is based on network information associated with the first node comprising one or a combination of: (i) a volume or a pattern of data packet traffic transmitted or received by the first node; (ii) a size, a content, or a communication protocol of the data packet or another data packet transmitted to or received by the first node; (iii) a network address of the first node;(iv) a connection relationship of the first node to another node in the network;(v) an identifier or a role of a user of the first node; (vi) an identifier of the first node ([0047]-[0049], see further [0064]-[0066] describing the pinging process); or (vii) operational data indicative of an operational parameter of the first node in a SCADA system; (b) using a processor, monitoring the network to acquire the network information; (c) using the processor, determining the cybersecurity threat score for the first node, based on the acquired network information and in accordance with the rule ([0009], particularly, “In one or more embodiments, the method further involves utilizing at least one level of trust of at least one network node to determine a degree of trust of at least one path for routing the data, where the path(s) includes at least one of the network nodes. In one or more embodiments, there is more than one level for the degree of trust. In at least one embodiment, the degree of trust of at least one path is very high, high, medium, or low.” and further [0047], particularly “The level of trust for a network node may be determined by its certainty of physical location. The physical location of a node may be attained by placing the node in a known secure location, such as a military base or a government building; by verification of the physical location by using satellite geolocation techniques; or by estimation of the physical location by using network ping ranging measurements.” [0064]-[0066] describing the pinging process); and (d) in response to the determined cybersecurity threat score being higher than a predetermined value, using the processor, controlling the response of the network comprising: (i) preventing transmission of the data packet to the second node ([0052] and further, [0080], particularly, “Each boundary firewall node 5200 determines whether data, that is attempting to pass through the perimeter 5100 or boundary firewall node 5200, has previously traveled through a path with a high enough degree of trust. If the data has previously traveled through a path with a high enough degree of trust, the boundary firewall node 5200 will allow the data to pass through the boundary firewall node 5200. Each boundary firewall node 5200 has a set threshold degree of trust requirement, and it will require data to have previously traveled through a path having at least that threshold degree of trust in order for the boundary firewall node 5200 to allow the data to pass through it.”; see further, [0180], “Although certain illustrative embodiments and methods have been disclosed herein, it can be apparent from the foregoing disclosure to those skilled in the art that variations and modifications of such embodiments and methods can be made without departing from the true spirit and scope of the art disclosed.” Illustrating the higher vs lower distinction (e.g. claim 55 vs 19) is a design choice not “departing from the true spirit and scope of the art disclosed.”); and However, Whelan does not explicitly disclose (ii) extracting data from the data packet, and storing the data in a data buffer memory that is accessible to the network. But, Brown discloses (i) preventing transmission of a data packet to a second node and (ii) extracting data from the data packet, and storing the data in a data buffer memory that is accessible to the network ([0013], particularly, “In another embodiment, organizational servers that may be used in production are configured to selectively route network traffic either to a production service or to a honeypot server. For example, network traffic from non-whitelisted or blacklisted hosts may be forwarded to a honeypot server rather than being dropped.” and further [0022]-[0025], particularly, “For example, extensive logging functionality may be employed by the honeypot server 118 to chronicle all activity via the honeypot server 118. This logging functionality may be of a stealth nature, so as to avoid detection by the user…The log records may include network addresses of the connecting devices 106, timestamps, event descriptions, keystroke data, files and/or other resources accessed, operations performed, and/or other information.”) Therefore it would have been obvious to one of ordinary skill in the art prior to the effective filing date of the application to combine the teachings of Whelan and Brown in order to provide a means to store information that could later be used to improve the overall security of the networked environment. As to claim 70, it is rejected by a similar rationale by that set forth in claim 55’s rejection. As to claims 95 and 101, the teachings of Whelan and Brown as combined for the same reasons set forth in claim 19’s rejection further disclose the processor determines the first and second node locations from contents of the data packet (Whelan, [0047], particularly “The level of trust for a network node may be determined by its certainty of physical location. The physical location of a node may be attained by placing the node in a known secure location, such as a military base or a government building; by verification of the physical location by using satellite geolocation techniques; or by estimation of the physical location by using network ping ranging measurements.” and [0064]-[0066] describing the pinging process). As to claims 96 and 102, the teachings of Whelan and Brown as combined for the same reasons set forth in claim 19’s rejection further disclose the access control score is determined in accordance with the at least one rule based on whether the first and second node locations are within a same domain or a same zone of the network (Whelan, [0047], particularly “The level of trust for a network node may be determined by its certainty of physical location. The physical location of a node may be attained by placing the node in a known secure location, such as a military base or a government building; by verification of the physical location by using satellite geolocation techniques; or by estimation of the physical location by using network ping ranging measurements.” and [0064]-[0066] describing the pinging process). As to claims 97 and 103, the teachings of Whelan and Brown as combined for the same reasons set forth in claim 19’s rejection further disclose he access control score is determined in accordance with the at least one rule based on whether the first node location is external to the network (Whelan, [0047], particularly “The level of trust for a network node may be determined by its certainty of physical location. The physical location of a node may be attained by placing the node in a known secure location, such as a military base or a government building; by verification of the physical location by using satellite geolocation techniques; or by estimation of the physical location by using network ping ranging measurements.” and [0064]-[0066] describing the pinging process). As to claims 98 and 104, the teachings of Whelan and Brown as combined for the same reasons set forth in claim 19’s rejection further disclose the response further comprises storing a time stamp in the data buffer memory, wherein the time stamp is indicative of an attempted transmission time of the data packet form the first node to the second node (Brown [0013], and further [0022]-[0025], particularly, “For example, extensive logging functionality may be employed by the honeypot server 118 to chronicle all activity via the honeypot server 118. This logging functionality may be of a stealth nature, so as to avoid detection by the user…The log records may include network addresses of the connecting devices 106, timestamps, event descriptions, keystroke data, files and/or other resources accessed, operations performed, and/or other information.”) As to claims 99 and 105, the teachings of Whelan and Brown as combined for the same reasons set forth in claim 19’s rejection further disclose the response further comprises varying the cybersecurity threat score for the second node based on the determined access control score (Whelan, [0047]). As to claims 108 and 111, the teachings of Whelan and Brown as combined for the same reasons set forth in claim 55’s rejection further disclose the response further comprises storing a time stamp in the data buffer memory, wherein the time stamp is indicative of an attempted transmission time of the data packet form the first node to the second node (Brown [0013], and further [0022]-[0025], particularly, “For example, extensive logging functionality may be employed by the honeypot server 118 to chronicle all activity via the honeypot server 118. This logging functionality may be of a stealth nature, so as to avoid detection by the user…The log records may include network addresses of the connecting devices 106, timestamps, event descriptions, keystroke data, files and/or other resources accessed, operations performed, and/or other information.”). As to claims 109 and 112, the teachings of Whelan and Brown as combined for the same reasons set forth in claim 55’s rejection further disclose the response comprises varying the cybersecurity threat score for the second node based on the determined cybersecurity threat score (Whelan, [0047]). Claims 100, 106, 107, and 110 are rejected under 35 U.S.C. 103 as being unpatentable over Whelan and Brown in view of Akella et al (US Pub. No. 2024/0048581), hereafter, “Akella.” As to claims 100 and 106, Whelan and Brown disclose the parent claim but do not disclose the second node is a component of the SCADA system. However, Akella discloses a method for controlling a response of a network to a data packet addressed from a first node having a first node location to a second node having a second node location in the network (Abstract Fig. 1A), the second node is a component of the SCADA system ([0094], particularly, “FIG. 6 depicts an example architecture of a network traffic sensor array 110. As depicted, network sensor array 110 includes Ethernet traffic sensor 602, SCADA traffic sensor 604, USB traffic sensor 606, IoT gateway traffic sensor 608, and arbitrary network packet broker 610. In general, network traffic sensor array 110 can be configured to detect any network traffic-related communication data associated with computing devices, for example, 102, 104, 106, 124, 134, or 142, on a network, for example, computer network 116.”). Therefore it would have been obvious to one of ordinary skill in the art prior the effective filing date of the application to combine the teachings of Whelan and Brown with Akella in order to extend the system to a broader range of networks and device types. As to claims 107 and 110, Whelan and Brown disclose the parent claim but do not disclose the first node is a component of a SCADA system. However, Akella discloses a method for controlling a response of a network to a data packet addressed from a first node having a first node location to a second node having a second node location in the network (Abstract Fig. 1A), the first node is a component of a SCADA system ([0094], particularly, “FIG. 6 depicts an example architecture of a network traffic sensor array 110. As depicted, network sensor array 110 includes Ethernet traffic sensor 602, SCADA traffic sensor 604, USB traffic sensor 606, IoT gateway traffic sensor 608, and arbitrary network packet broker 610. In general, network traffic sensor array 110 can be configured to detect any network traffic-related communication data associated with computing devices, for example, 102, 104, 106, 124, 134, or 142, on a network, for example, computer network 116.”). Therefore it would have been obvious to one of ordinary skill in the art prior the effective filing date of the application to combine the teachings of Whelan and Brown with Akella in order to extend the system to a broader range of networks and device types. Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply 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 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to THOMAS J DAILEY whose telephone number is (571)270-1246. The examiner can normally be reached on 9:30am-6:00pm. 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, Umar Cheema can be reached on 571-270-3037. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. 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). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /THOMAS J DAILEY/ Primary Examiner, Art Unit 2458
Read full office action

Prosecution Timeline

Mar 15, 2024
Application Filed
Aug 12, 2025
Non-Final Rejection mailed — §103
Feb 12, 2026
Response after Non-Final Action
Feb 12, 2026
Response Filed
Jul 30, 2026
Response Filed
Oct 02, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12783359
HOLISTIC PROTECTION OF CLOUD-BASED SERVERLESS APPLICATIONS
1y 11m to grant Granted Nov 03, 2026
Patent 12776197
MONITORING PHYSICAL ACCESS OF DEVICES USING LIGHT-BASED COMMUNICATIONS
3y 1m to grant Granted Oct 27, 2026
Patent 12764139
SYSTEMS, METHODS, AND APPARATUSES FOR DETERMINING PROBABILITY OF MISAPPROPRIATION OF A RESOURCE BASED ON GEOLOCATION TRACKING OVER AN ELECTRONIC NETWORK
3y 9m to grant Granted Oct 13, 2026
Patent 12758870
METHODS AND APPARATUSES FOR SIGNALING ENHANCEMENT IN WIRELESS COMMUNICATIONS
2y 8m to grant Granted Oct 13, 2026
Patent 12750251
Context-Dependent In-Call Video Codec Switching
2y 1m to grant Granted Sep 29, 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
81%
Grant Probability
96%
With Interview (+14.9%)
3y 2m (~7m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 880 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