Prosecution Insights
Last updated: July 17, 2026
Application No. 18/892,128

VIRTUAL NETWORK VERIFICATION SERVICE

Final Rejection §DP
Filed
Sep 20, 2024
Priority
Nov 22, 2016 — continuation of 10/469,324 +2 more
Examiner
TURRIATE GASTULO, JUAN CARLOS
Art Unit
2446
Tech Center
2400 — Computer Networks
Assignee
Amazon Technologies Inc.
OA Round
2 (Final)
72%
Grant Probability
Favorable
3-4
OA Rounds
1y 2m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 72% — above average
72%
Career Allowance Rate
274 granted / 383 resolved
+13.5% vs TC avg
Strong +35% interview lift
Without
With
+34.9%
Interview Lift
resolved cases with interview
Typical timeline
2y 12m
Avg Prosecution
22 currently pending
Career history
413
Total Applications
across all art units

Statute-Specific Performance

§101
1.1%
-38.9% vs TC avg
§103
94.8%
+54.8% vs TC avg
§102
2.5%
-37.5% vs TC avg
§112
0.4%
-39.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 383 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 . DETAILED ACTION This action is in response to application filed 05/08/2026. Claims 21-40 are pending in this application. Response to Arguments Applicant’s arguments, see pg. 12-13, filed 05/08/2026, with respect to claims 21, 29, 36 have been fully considered and are persuasive. The prior art rejection of claims 21-40 has been withdrawn. 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 obviousness-type 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); 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 conflicting 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. Effective January 1, 1994, a registered attorney or agent of record may sign a terminal disclaimer. A terminal disclaimer signed by the assignee must fully comply with 37 CFR 3.73(b). Claims 21-40 are rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over claims 1-21 of U.S. Patented Case No. 10,469,324 B2. Although the conflicting claims are not identical, they are not patentably distinct from each other because claims 21-40 of the current application perform the same steps or limitations recited by claims 1-21 of U.S. Patented Case No. 10,469,324 B2 as detailed below by the examiner. Claim 21-40 Current Application Claim 1-21 Patent Case No. 10,469,324 B2 Claim 21: A system, comprising: one or more computing devices comprising one or more processors and memory configured to implement a service to: receive a query from a client about a virtual network; obtain a specification for networking primitives for the virtual network; obtain an encoded description of the virtual network and one or more encoded virtual networking rules for the virtual network that are distinct from the query, wherein: said obtain an encoded description of the virtual network comprises generate, according to a declarative logic programming language, the encoded description of the virtual network based at least in part on the specified networking primitives, or said obtain one or more encoded virtual networking rules comprises generate, according to the declarative logic programming language, the one or more encoded virtual networking rules for the virtual network based at least in part on the specified networking primitives; resolve the query, for the encoded description of the virtual network according to the encoded virtual networking rules for the virtual network, using a constraint solver; and send results of the query resolution for the virtual network to the client. Claim 1. A computer system including a processor coupled to a memory, the memory including instructions for a virtual network verification service that upon execution causes the system to: receive a query about a virtual network of a plurality of virtual networks from a particular client of a plurality of clients via a client device, wherein the query is expressed as a constraint problem, wherein the virtual network is instantiated for the particular client in a provider network and includes virtual machines, and wherein the provider network hosts the plurality of virtual networks for respective clients of the plurality of clients on a substrate network of the provider network; obtain rules for the particular client's virtual network, wherein one or more different rules apply to different individual ones of the plurality of virtual networks; encode the rules for the particular client's virtual network according to a declarative logic programming language to generate encoded virtual networking rules for the particular client's virtual network; and in response to the query: obtain descriptive information for the particular client's virtual network; encode the descriptive information for the particular client's virtual network according to the declarative logic programming language to generate an encoded description of the particular client's virtual network; resolve the query for the encoded description of the particular client's virtual network according to the encoded virtual networking rules using a constraint solver program, wherein the constraint solver program is configured to resolve constraint problems according to the declarative logic programming language and according to the encoded virtual networking rules; and provide results of the query resolution about the particular client's virtual network to the client device Claim 4: The system as recited in claim 1, wherein the descriptive information comprises one or more of information identifying instances of networking primitives that are implemented in the particular client's virtual network, descriptions of the virtual machines in the particular client's virtual network, descriptions of relationships among the virtual machines in the particular client's virtual network, or descriptions of interfaces to entities external to the particular client's virtual network. Claims 21-40 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1-20 of U.S. Patent No. 11,095,523 B2 in view of Monahan et al. (US 2007/0136788 A1). Regarding claim 21, US Patent ‘523 discloses a system, comprising: one or more computing devices comprising one or more processors and memory (claim 1, lines 1-4) configured to implement a service to: receive a query from a client about a virtual network (claim 1, 11-14); obtain a specification for networking primitives for the virtual network (claim 1, 5-6); obtain an encoded description of the virtual network and one or more encoded virtual networking rules for the virtual network that are distinct from the query (claim 1, 11-14), wherein: said obtain an encoded description of the virtual network comprises generate, according to a declarative logic programming language, the encoded description of the virtual network based at least in part on the specified networking primitives, or said obtain one or more encoded virtual networking rules comprises generate, according to the declarative logic programming language, the one or more encoded virtual networking rules for the virtual network based at least in part on the specified networking primitives (claim 1, 7-14); resolve the query, for the encoded description of the virtual network according to the encoded virtual networking rules for the virtual network, using a constraint solver (claim 1, 19-24). However, ‘523 does not disclose send results of the query resolution for the virtual network to the client. In an analogous art, Monahan discloses send results of the query resolution for the virtual network to the client ([0249]: an overall process for compiling and solving path queries. Any solutions found are to be displayed graphically in this example. Infrastructure Path Queries 510 are formulated as structured textual objects from a text file description or potentially via some Graphical User Interface). Therefore, it would have been obvious to a person of ordinary skill at the time the invention was made to modify ‘523 to comprise of “send results of the query resolution for the virtual network to the client” taught by Monahan. One of ordinary skilled in the art would have been motivated because it would have enabled to determine what parts of the network are reachable from a given point or part of the network if the configuration is altered and what security controls exist in new paths created between given points or regions of the network if the configuration is altered (Monahan, [0022]). Claims 21-40 are rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over claims 1-20 of U.S. Patented Case No. 12,126,495 B2. Although the conflicting claims are not identical, they are not patentably distinct from each other because claims 21-40 of the current application perform the same steps or limitations recited by claims 1-20 of U.S. Patented Case No. 12,126,495 B2. as detailed below by the examiner. Claim 21-40 Current Application Claim 1-20 Patent Case No. 12,126,495 B2 Claim 21: A system, comprising: one or more computing devices comprising one or more processors and memory configured to implement a service to: receive a query from a client about a virtual network; obtain a specification for networking primitives for the virtual network; obtain an encoded description of the virtual network and one or more encoded virtual networking rules for the virtual network that are distinct from the query, wherein: said obtain an encoded description of the virtual network comprises generate, according to a declarative logic programming language, the encoded description of the virtual network based at least in part on the specified networking primitives, or said obtain one or more encoded virtual networking rules comprises generate, according to the declarative logic programming language, the one or more encoded virtual networking rules for the virtual network based at least in part on the specified networking primitives; resolve the query, for the encoded description of the virtual network according to the encoded virtual networking rules for the virtual network, using a constraint solver; and send results of the query resolution for the virtual network to the client. Claim 1: A system, comprising: one or more computing devices comprising one or more processors and memory configured to implement virtual network verification service configured to: receive a query for a virtual network from a client, wherein the query is expressed as one or more constraint problems regarding the virtual network; obtain encoded virtual networking rules for the virtual network, wherein the virtual networking rules are encoded according to a declarative logic programming language, the encoded virtual networking rules distinct from the query expressed as one or more constraint problems; obtain an encoded description of the virtual network; resolve the query, expressed as one or more constraint problems, for the encoded description of the virtual network according to the declarative-logic-encoded virtual networking rules for the virtual network using a constraint solver engine; and provide results of the query resolution for the virtual network to the client. Claim 7: The system as recited claim 1, wherein the virtual network verification service is further configured to: obtain a specification for networking primitives for the virtual network; wherein to obtain the encoded virtual networking rules for the virtual network, the virtual network verification service is further configured to: generate, according to a declarative logic programming language, the encoded virtual networking rules for the virtual network based at least in part on the specified networking primitives; wherein to obtain the encoded description of the virtual network, the virtual network verification service is further configured to: generate, according to the declarative logic programming language, the encoded description of the virtual network based at least in part on the specified networking primitives. Additional References The prior art made of record and not relied upon is considered pertinent to applicants disclosure. Becker et al., US 2008/0066160 A1: Security Language Expressions for Logic Resolution. Tan et al., US 2020/0067962 A1: Model Based Methology for Translating High Level Cyber Treat Descriptions Into System Specific Actionable Defense Tactics. Amies et al., US 2014/0189125 A1.: Querying and Managing Computing Resources in a Networked Computing Environment. Conclusion THIS ACTION IS MADE FINAL. 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 nonprovisional extension fee (37 CFR 1.17(a)) 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 mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to JUAN C TURRIATE GASTULO whose telephone number is (571)272-6707. The examiner can normally be reached Monday - Friday 8 am-4 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, Brian J Gillis can be reached at 571-272-7952. 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. /J.C.T/Examiner, Art Unit 2446 /BRIAN J. GILLIS/Supervisory Patent Examiner, Art Unit 2446
Read full office action

Prosecution Timeline

Sep 20, 2024
Application Filed
Jan 12, 2026
Non-Final Rejection mailed — §DP
Mar 24, 2026
Applicant Interview (Telephonic)
Apr 04, 2026
Examiner Interview Summary
May 08, 2026
Response Filed
May 20, 2026
Examiner Interview (Telephonic)
Jun 10, 2026
Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12676906
METHODS AND SYSTEMS FOR STREAMING CONTENT
5y 0m to grant Granted Jul 07, 2026
Patent 12641052
Methods and Devices for Switching Data Frames in a Communications Network
2y 0m to grant Granted May 26, 2026
Patent 12634167
EDGE PLATFORM MANAGEMENT DEVICE, OPERATING METHOD OF EDGE PLATFORM MANAGEMENT DEVICE, AND EDGE GATEWAY DEVICE
1y 12m to grant Granted May 19, 2026
Patent 12603795
INFORMATION PROCESSING TERMINAL, INFORMATION PROCESSING DEVICE, AND SYSTEM
2y 2m to grant Granted Apr 14, 2026
Patent 12587432
Visual Map for Network Alerts
1y 10m to grant Granted Mar 24, 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
72%
Grant Probability
99%
With Interview (+34.9%)
2y 12m (~1y 2m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 383 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