Prosecution Insights
Last updated: November 12, 2026
Application No. 18/887,977

ZERO-TRUST PACKET ROUTING

Final Rejection §103
Filed
Sep 17, 2024
Priority
Sep 18, 2023 — provisional 63/583,346
Examiner
SHITAYEWOLDETSADI, BERHANU
Art Unit
2455
Tech Center
2400 — Computer Networks
Assignee
Applied Invention, LLC
OA Round
2 (Final)
84%
Grant Probability
Favorable
3-4
OA Rounds
99%
With Interview

Examiner Intelligence

Grants 84% — above average
84%
Career Allowance Rate
331 granted / 395 resolved
+25.8% vs TC avg
Strong +25% interview lift
Without
With
+25.3%
Interview Lift
resolved cases with interview
Typical timeline
Avg Prosecution
22 currently pending
Career history
424
Total Applications
across all art units

Office Action

§103
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 . Response to Amendment This office action is responsive to amendment filed on July 27, 2026. Claims 5, 7, 10, and 20 have been amended. Claims 1-4, 12-19 have been withdrawn (i.e., Group I & II not elected). No claims have been newly added. Claims 1-20 presented for the examination and remain pending in the application. The previous objection to claims 5, 10 and 21 has been withdrawn due to claims amendment. Claim Rejections - 35 USC § 103 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 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. The text of those sections of Title 35, U.S. Code not included in this action can be found in a prior Office action. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. 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. Claim 5 is rejected under 35 U.S.C. 103 as being unpatentable over Hillis et al. U.S. Pub. No. 2021/0058369 A1, (hereinafter Hillis the first) in view of Houchen U.S. Pat. No. 7,272,116 B1 , (hereinafter Houchen). Regarding claim 5. Hillis the first teaches a method for moving IP-format packets though a network (Hillis the first teaches in Fig. 6 and Para. [0162] agent packet which is an IP-packet received from an adaptor into a transit packet for transmission through a SNN and subsequent conversion to an agent packet by an egress dock), comprising: encapsulating IP-format packets into a compressed form by replacing any of addresses, ports, protocols, and other header fields of the IP packet with a visa identifier (Hillis the first teaches in Fig. 6 element 6275 encapsulated agent packet (i.e., IP-packet) and Para. [0163] encapsulated agent packet (i.e., IP-packet) 6275 in its payload 6250 which, in combination with the associated visa's visa egress data, is sufficient to reconstruct the agent packet and further Hillis the first teaches in Para. [0164] the transit packet header, the encrypted packet checksum is a checksum encrypted by the visa key associated with the packet's visa…, the visa identifier can potentially change each time the packet is transmitted and further a forwarder may change the visa identifier of a packet header before transmitting it through a link as narrated in Para. [0171]. Here, the claim lists features in the alternative. While the claim lists a number of optional limitations only one limitation from the list is required and needs to be met by the prior art and thus, the prior art of record Hillis the first addressed the limitation of change (i.e., replacing) of header field); tracking a number and size of messages that have been transmitted (Hillis the first teaches in Para. [0127] packet processing unit (PPU) state includes the state information (i.e., messages) that the PPU requires to process packets,... This associated information (i.e., messages) includes the information required to track the rate and volume of information (i.e., number and size of the information which is the message is tracked) that is transmitted in association with those visas); implementing limits on an amount of information that can be transmitted under a particular permission by applying one or more procedures specified by a visa identified by the visa identifier (Hillis the first teaches in Para. [0143] the processing bandwidth limit (i.e., implementing limits) may be used to limit the rate of information transmitted over links under the permission of the visa and further, Hillis teaches in para. [0140] the visa may also specify a visa identifier that is uniquely associated with the visa, and an internal packet may specify this visa identifier to establish an association with the visa. Also, see para. [0142], [0146], [0152], [0162], [0164], [0166]-[0168]); and based on said visa identifier, a visa service using reserving bandwidth based on permission (Hillis the first teaches in Para. [0152] the visa service generates a visa endorsement which is associated with the visa identifier and further Hillis the first teaches in Para. [0151] the visa services uses this maximum duration, in conjunction with the bandwidth limits set by the communication policies…, and Hillis the first also teaches in Para. [0109] that the communication policies may also specify how much bandwidth should be reserved through PPUs to carry the packets associated with a visa and in what circumstances that bandwidth is reserved and further Hillis the first teaches in Para. [0152] that the ). Hillis the first does not explicitly teach wherein additional bandwidth is not made available once a reserved bandwidth is exhausted. However, Houchen teaches wherein additional bandwidth is not made available once a reserved bandwidth is exhausted (Houchen teaches [Col. 12, lines 15-19] note that if a node times out, it implies that it was somehow isolated from the other nodes during the signaling process. The action in this case is to simply remove the local data structure and free up (i.e., not available) any reserved bandwidth associated with the expired (i.e., exhausted) request (i.e., the reserved bandwidth is not made available since it is freed up and related to the expired request)). Therefore, Hillis the first and Houchen are analogues arts and they are in the same field of endeavor as they both are directed to the encapsulation of agent packets (i.e., IP-format packets) a bandwidth reservation process in order to the request packet is provided with a value indicating a number of nodes provided in a route, and the value indicating the number of rings provided in the route and representing a bandwidth required to establish cross-connects along the route. It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of simply remove and free up any reserved bandwidth associated with the expired request ([Col. 12, lines 15-19]) as taught, by Houchen into the teachings of Hillis the first. One would have been motivated to do so in order to the configuration of the node automatically provisions the traffic paths from the source node to the destination node across the synchronous optical network (SONET) multiplexers in the bi-directional line-switched ring network. The source node establishes a traffic route in a simple manner while reducing memory consumption at the source node. Claim 6 is rejected under 35 U.S.C. 103 as being unpatentable over Hillis the first in view of Houchen further in view of Ferstay et al. U.S. Pub. No. 2021/0149751 A1, (hereinafter Ferstay). Regarding claim 6. Hillis the first in view of Houchen teaches the method of claim 5. Hillis the first in view of Houchen does not explicitly teach implementing permissions that limit large-scale data exfiltration. However, Ferstay teaches implementing permissions that limit large-scale data exfiltration (Ferstay teaches in Para. [0242] data-collecting functionality prevents access to restricted resources in connection with a data-collection system… For example, a malicious third-party developer can generate code designed to attempt exfiltration of data from the data-collection system…, which may have been built without concern for data collection on a large scale). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of generating a code designed to attempt exfiltration of data from the data-collection system and building a data collection on a large scale ([0242]) as taught, by Ferstay into the teachings of Hillis in view of Houchen invention. One would have been motivated to do so in order to the computing system improves the time-based searching to facilitate the faster retrieval. The search head can perform the field-extraction operations on the superset to produce the reduced set of search results. The set of messages is processed more efficiently and result in a less expensive recovery from processing failure as redundant message processing is reduced or avoided. Claims 7 and 8 are rejected under 35 U.S.C. 103 as being unpatentable over Hillis the first in view of Baukes et al. 2017/0244761 A1, (hereinafter Baukes). Regarding claim 7. Hillis the first teaches in a network consisting of a set of communicating nodes and internal services, including a visa service and an administrative service (Hillis the first teaches in Para. [0117] policies determine any internal and external communication system of the hardware units (i.e., a set of communication nodes) in a reliable, secure channels to services such as the visa service), a method comprising: encapsulating IP-format packets into a compressed form by replacing any of addresses, ports, protocols, and other header fields of the IP packet with a visa identifier providing one or more individual instances of said network (Hillis the first teaches in Fig. 6 element 6275 encapsulated agent packet (i.e., IP-packet) and Para. [0163] encapsulated agent packet 6275 in its payload 6250 which, in combination with the associated visa's visa egress data, is sufficient to reconstruct the agent packet and further Hillis the first teaches in Para. [0164] the transit packet header, the encrypted packet checksum is a checksum encrypted by the visa key associated with the packet's visa…, the visa identifier can potentially change each time the packet is transmitted and further a forwarder may change the visa identifier of a packet header before transmitting it through a link as narrated in Para. [0171]. Here, the claim lists features in the alternative. While the claim lists a number of optional limitations only one limitation from the list is required and needs to be met by the prior art and thus, the prior art of record Hillis the first addressed the limitation of change (i.e., replacing) of header field); wherein each individual instance of said network comprises its own communication policies (Hillis the first teaches in Para. [0036] the policy defines multiple categories of policy that govern the activity of a SNS, including communication policies, authentication policies, connection policies, and reporting policies. Communication policies define which agents can communicate and under what circumstances and what resources they are allocated to do so). Hillis the first teaches about the policies for the hardware units as indicated above in Para. [0117] and Hillis the first further teaches about by applying one or more procedures specified by a visa identified by the visa identifier in para. [0141] isa may also specify a visa identifier that is uniquely associated with the visa, and an internal packet may specify this visa identifier to establish an association with the visa…Also, see para. [0142], [0146] . [0152], [0160]-[0167] and [0170]-[0174]). Hillis the first does not explicitly teach wherein every node of said network enforces said policies. However, Baukes teaches wherein every node of said network enforces said policies (Baukes teaches in Para. [0002] there is a need for individual nodes of a network to enforce the policy of neighboring nodes as part of a consensus-based enforcement scheme). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of enforcing the policy of neighboring nodes ([0002]) as taught, by Baukes into the teachings of Hillis in view of Houchen invention. One would have been motivated to do so in order to provide configuration information and/or information associated with node objects installed at the node and the scan engine performs the scan at the node. Enable nodes to determine if a target node is misconfigured by determining if the target node is able to perform or participate in a restriction communication or interaction. In order to ensure that restrictions in communication, interaction, or resource access are property affected between nodes, an enforcement mechanism of negative checking is implemented in a network. Regarding claim 8. Hillis the first in view of Baukes teaches wherein a single node is configurable to implement any combination of functions of docks, forwarders, and node endpoints, as long said node enforces the policies on all packets that pass through it (Hillis the first teaches in Para. [0134] two types of communication PEPs are compiled from communication policies; one type is used by docks and the other by forwarders…,in a packet processing available on the hardware unit (i.e., a single node) and further Baukes in Para. [0002] enforce the policy of neighboring nodes as part of a consensus-based enforcement scheme). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of enforcing the policy of neighboring nodes ([0002]) as taught, by Baukes into the teachings of applying policies that can be used by docks and the other by forwarders in a packet processing available on the hardware unit (i.e., a single node) ([0134]) a taught, by Hillis the first. One would have been motivated to do so in order to the system has a secure network comprising the packet processing units (PPUs) communicatively coupled by an internal communication system. Multiple internal packets are provided with which the secure network transports the information. A visa is associated with each of the internal packets. The visa references the policies. The PPU among the PPUs transmits an internal packet of the information only when allowed by the policies as referenced by the visa. Claim 9 is rejected under 35 U.S.C. 103 as being unpatentable over Hillis the first in view of Baukes further in view of Chanak et al. U.S. Pub. No. 2021/0314301 A1, (hereinafter Chanak). Regarding claim 9. Hillis the first in view of Baukes teaches the method of claim 7. Hillis the first in view of Baukes does not explicitly teach wherein an entire private cloud, real or virtual, comprises a single node. However, Chanak teaches wherein an entire private cloud, real or virtual, comprises a single node (Chanak teaches in Fig. 1 element 100 private cloud system and Para. [0081] provide virtual private access through the cloud-based system 100 and further Chanak teaches in Para. [0085] the policy engine delivers connection information to the application 350 and app-side enforcement nodes 150, which includes the location of a single enforcement nodes 150). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of using a private cloud system and a single enforcement node ([0081] and [0085]) as taught, by Chanak into the teachings of Hillis the first in view of Baukes invention. One would have been motivated to do so in order to the method enables utilizing a cloud-based system to allow a user to connect to a private service edge node in an enterprise network, so that the user can access the private application in an efficient manner. The method allows the user to access the application in a secure manner, thus reducing the risk for the enterprise data residing on unsecured and unmanaged devices as well as the security risks in access to the Internet, and hence providing seamless, zero trust access to private applications running on the public cloud, within the data center and within the enterprise network in an effective manner. Claims 20-25 are rejected under 35 U.S.C. 103 as being unpatentable over Hillis the first in view of Soliman et al. 2009/0119770 A1, (hereinafter Soliman). Regarding claim 20. Hillis the first teaches a method for transmitting a packet across a packet-switched communications network consisting of multiple nodes (Hillis the first teaches in Para. [0039] physical or virtual and either is a complete hardware unit (i.e., multiple nodes) or has an associated hardware unit that contains it,…, optionally augmented with specialized PPU components and other specialized packet switching hardware), comprising: transmitting packets from a first communicator to a first node of the network which is associated with a source address (Hillis the first teaches I Para. [0072] transmitted an agent packet through a tether using a particular agent address as a source agent address, the visa service records that source agent address (i.e., source address) as associated with the tether, allowing other agents to transmit packets to that agent through that tether); transmitting packets from a second node of the network to a second communicator which is associated with a destination address (Hillis the first teaches in Para. [0034] the packet is transmitted within the SNN (i.e., selective node network); back through a tie-in to an adaptor (i.e., a second communicator) and finally, to a destination agent); each node communicating bidirectionally with a visa service (Hillis the first teaches in Para. [0221] each of the hardware units (i.e., each node) implementing a visa service sub-server has a similar instance of sub-server software that can communicate through a secure channel to docks to issue a visa. All sub-servers store all communication policies); the visa service determining communications policies of the network (Hillis the first teaches in Para. [0132] receive information over the internal communication system or method of adaptor-SNN communication, invoke reporting procedures, invoke authentication procedures, communicate with the visa service, and establish docks and links); the visa service determining when the transmission of a first packet is compliant with the policies of the network (Hillis the first teaches in [Abstract] the visa specifies the procedures governing the processing of the packet by the packet processing units as it is transported along a compliant flow, between agents thorough the network, according to a set of policies specified in a network configuration. Also, see Para. [0137]); and wherein when a first packet is transmitted to the first node of the network, the first node communicates with the visa server information derived from the first packet to determine if the delivery of the first packet is compliant with the policies of the network (Hillis the first teaches in Para. [0084] sends agent packets destined for the server through an adaptor. When issuing a visa for the first of these agent packets, the visa service,…, and further Hillis the first teaches in Para. [0141] endorsement can be validated by using the public key or keys of the visa server, the visa may also specify a visa identifier that is uniquely associated with the visa, and an internal packet may specify this visa identifier to establish an association with the visa). Hillis the first further teaches by applying one or more procedures specified by a visa identified by the visa identifier in para. in para. [0141] isa may also specify a visa identifier that is uniquely associated with the visa, and an internal packet may specify this visa identifier to establish an association with the visa…Also, see para. [0142], [0146] . [0152], [0160]-[0167] and [0170]-[0174]). Hillis the first does not explicitly teach wherein the first packet is delivered to the second node only if it is compliant with policies as determined by the visa service. However, Soliman teaches wherein the first packet is delivered to the second node only if it is compliant with policies as determined by the visa service (Soliman teaches in Para. [0046] a connection state may be created between the first node 130, which may be a host, and the second node 132 when the two exchange data compliant with the set policies of the PDP 120 and further the PDP 120 of its intention to send (i.e., delivered) packets to the second node as narrated in Para. [0048]). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of sending packet when the two exchange data compliant with the set policies of the PDP 120 ([0046]) as taught, by Soliman into the teachings of Hillis the first invention. One would have been motivated to do so in order to the policy decision point is located at the edge of the network, and communicates with reduced number of nodes or users, thus reducing bottleneck in the network. The interior node defers processing digital signatures on receiving policy decision point responses to determine whether a digital signature is to be processed, thus reducing denial of service replies. Regarding claim 21. Hillis the first teaches the visa service determining attributes of the communicators (Hillis the first teaches in [0149] determining the identity of the addressed agents, the visa service attempts to identify communication policies of the active configuration that would allow those agents to communicate... Also, see Para. [0050]); wherein the policies of the network are dependent on the attributes of communicators (Hillis the first teaches in Para. [0050] determine when attributes of the identity of an agent need to be authenticated and how they may be authenticated. Depending on the attributes within the identity,...). Regarding claim 22. Hillis the first teaches the first packet providing a communication to prove its identity to a node (Hillis the first teaches in Para. [0233] device is a hardware unit, called an adaptor device, that implements the functionality of an adaptor and interaction interfaces for communicating with an agent or assisting in determining and authenticating the identity of an agent). Regarding claim 23. Hillis the first teaches a communicator demonstrating to a node that it has access to credentials that prove its identity (Hillis the first teaches in Para. [0030] each of the agents has an identity and access to a set of credentials that can be used to authenticate attributes of that identity and further Hillis the first teaches that the adaptor may prove its access to the tie-in by transmitting the agent packets through the tie-in and demonstrate its access to the credentials by facilitating the authentication of the identity attributes as narrated in Para. [0114]). Regarding claim 24. Hillis the first teaches wherein the policies of the network depend on the destination address of the second node (Hillis the first teaches in Para. [0034] the packet is transmitted within the SNN (i.e., selective node network); back through a tie-in to an adaptor (i.e., a second communicator) and finally, to a destination agent); and wherein the information transmitted by the first node to the visa service includes the destination address associated with the second node (Hillis the first teaches in Para. [0136] the associated parameters of the visa (described later) include the tether address of the destination, although in some cases, such as a broadcast visa, the destination tether address may be implied by the algorithm encoded into the forwarder PEP). Regarding claim 25. Hillis the first teaches wherein the policies of the network depend on the source address of the first node (Hillis the first teaches I Para. [0072] transmitted an agent packet through a tether using a particular agent address as a source agent address, the visa service records that source agent address (i.e., source address) as associated with the tether, allowing other agents to transmit packets to that agent through that tether); and wherein the information transmitted by the first node to the visa service includes the source address associated with the first node (Hillis the first teaches in Para. [0034] communication packets travel from a source agent to its adaptor; through a tie-in to the SNN, where policies specified by the associated visa are enforced each time the packet is transmitted within the SNN). Claim 26 is rejected under 35 U.S.C. 103 as being unpatentable over Hillis the first in view of Soliman further in view of Apostolopouos U.S. Pub. No. 2006/0005031 A1, (hereinafter Apostolopouos). Regarding claim 26. Hillis the first in view of Soliman teaches the method of claim 20. Hillis the first in view of Soliman does not explicitly teach the visa service communicating to the first and second node a cryptographic key used for computing a message integrity check value (MICV). However, Apostolopouos teaches the visa service communicating to the first and second node a cryptographic key used for computing a message integrity check value (MICV) (Apostolopouos teaches in Para. [0007] A cryptographic checksum (CCS) is created by performing a complicated series of mathematical operations (known as a cryptographic algorithm) that translates the data in the file and the key into a fixed string of digits…, an integrity check without a key allows anyone to compute the integrity check (for verification or for replacement of the original integrity check value (i.e., MICV)). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of using an integrity check value ([0007]) as taught, by Apostolopouos into the teachings of Hillis the first in view of Soliman invention. One would have been motivated to do so in order to a cryptographic integrity check value for one of the components of trans codable content is recorded when integrity check for the component is completed. The cryptographic integrity check is completed to generate a cryptographic integrity check value for the component of trans codable content and this method helps to perform the integrity check cost effectively and without much computational complexity. Claim 27 is rejected under 35 U.S.C. 103 as being unpatentable over Hillis the first in view of Soliman further in view of Hillis the first et al. U.S. Pub. No. 2023/0171228 A1, (hereinafter Hillis the second). Regarding claim 27. Hillis the first in view of Soliman teaches the method of claim 20. Hillis the first further teaches the visa service providing the first node with a visa ID when the packet is policy compliant (Hillis the first teaches in Para. [0155] visa service maintains state information about the identity, tether address, and the authentication status of the identity attributes of each agent using the SNN). Hillis the first in view of Soliman does not explicitly teach the visa service communicating the visa ID and associated forwarding information to a set of nodes along a path the connects the first and second node; the visa service communicating the visa ID and associated forwarding information to a set of nodes along a path the connects the first and second node; the first node creating a second packet that includes the visa ID and transmitting it to the first node on the connecting path; and the set of nodes along the connecting path forwarding the packet with the visa ID along the path. However, Hillis the second teaches the visa service communicating the visa ID and associated forwarding information to a set of nodes along a path the connects the first and second node (Hillis the second teaches in Para. [0089] all packets associated with a visa associated with the configuration ID and further teaches in Para. [0142] the visa service determines agent identities and authenticates agent identity attributes based on its state information and further visa distribution may be initiated by an ingress dock that has accepted a visa issued by the visa service to distribute the visa to an initial sequence of nodes that can transmit it to its destination as narrated in Para. [0172]); the visa service communicating the visa ID and associated forwarding information to a set of nodes along a path the connects the first and second node (Hillis the second teaches in Para. [0089] all packets associated with a visa associated with the configuration ID and further teaches in Para. [0172] visa distribution may also be initiated by a forwarder to distribute the visa to a new sequence of nodes (i.e., note that here sequence of nodes include the claimed a set of nodes which is “the first and the second node”) that can transmit it to its destination. By decrementing the herald packet's hop count each time it is forwarded, the length of these potential paths can be limited, for example, to the maximum allowed path length of the associated configuration); the first node creating a second packet that includes the visa ID and transmitting it to the first node on the connecting path (Hillis the second teaches in Para. [0172] distribution may also be initiated by a forwarder to distribute the visa to a new sequence of nodes (i.e., the first and the second nodes are included in the sequence of nodes) that can transmit it to its destination. By decrementing the herald packet's hop count each time it is forwarded); and the set of nodes along the connecting path forwarding the packet with the visa ID along the path (Hillis the second teaches in Para. [0089] all packets associated with a visa associated with the configuration ID and further Hillis the second teaches in Para. [0172] a new sequence of nodes that can transmit it to its destination). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of using a visa ID along with the forwarder to distribute the visa to a new sequence of nodes (i.e., a set of nodes) in different paths ([0089] and [0172]) as taught, by Hillis the second into the teachings of Hillis the first in view of Soliman invention. One would have been motivated to do so in order to the method eliminates the requirement that the packets do not require a hop count field that is changed each time the packet is forwarded. Allowable Subject Matter Claims 10-11 are objected to as being dependent upon a rejected base claim, but would be allowable if claim 10 is overcome the outstanding objection above under section 10 and if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Response to Arguments Applicant argues that removing a local data structure and freeing up bandwidth…, does not teach or suggest “implementing limits on an amount of information that can be transmitted under a particular permission by applying one or more procedures specified by a visa identified by a vis identifier” and further indicates that the prior art of record Hillis the first in view of Houchen does not teach the amended limitation of independent claims 5 and 7. (Remarks. Page 12). In response to the above argument, the Examiner respectfully disagrees because, the prior arts of record Hillis the first in view of Houchen from the same field of endeavor teach the claimed limitations as recited now. For example, Hillis the first disclosed in Para. [0143] about how bandwidth limit is processing which indicates (i.e., implementing the limits) that includes the rate of information transmitted over links under the permission of the visa and further, Hillis teaches in para. [0140] the visa may also specify a visa identifier that is uniquely associated with the visa, and an internal packet may specify this visa identifier to establish an association with the visa. Also, see para. [0142], [0146], [0152], [0162], [0164], [0166]-[0168]). Applicant also argues that the prior art of record Baukes, does not teach, suggest, or describe the recitation of amended claim 7 for "wherein every node of said network enforces said policies by applying one or more Page procedures specified by a visa identified by the visa identifier". (Remarks. Page 13). In response to the above argument, the Examiner respectfully disagrees because the prior art of record Baukes was not responsible to address the limitation which was not recited in the previous limitation in claim 7. However, the newly added limitation in claim 7 is addressed by the prior art of record Hillis the first as disclosed in the 103 rejection above in claim 7. Therefore, Hillis the first clearly addressed at least in paragraphs [0141]-[0142], [0160]-[0164], [0171]-[0174] the visa may also specify a visa identifier that is uniquely associated with the visa, and an internal packet may specify this visa identifier to establish an association with the visa. Applicant further argues with respect to claim 20 that Soliman fails to teach or suggest the recitations of amended claim 20 for "wherein the first packet is delivered to the second node only if it is compliant with policies as determined by the visa service by applying one or more procedures specified by a visa identified by the visa identifier" and further indicated that the cited reference alone or in combination, fail to disclose the amended limitation of claim 20, and claims depending from claim 20. (Remarks. Pages 13-14). In response to the above argument, the Examiner respectfully disagrees because the prior art of record Soliman was not responsible to address the limitation which was not recited in the previous limitation in claim 20. However, the prior art of record Hillis the first clearly addressed the newly added limitation in claim 20 in para. [0141] isa may also specify a visa identifier that is uniquely associated with the visa, and an internal packet may specify this visa identifier to establish an association with the visa…Also, see para. [0142], [0146] . [0152], [0160]-[0167] and [0170]-[0174]. Therefore, the combination of the prior arts of record addressed all of the limitations recited in the claims from the same field of endeavor reasonably. Therefore, the arguments are not persuasive and the Examiner made final rejection on the merit. Furthermore, the Examiner found the allowable subject matter in claims 10-11 remain the same. 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 BERHANU SHITAYEWOLDETSADIK whose telephone number is (571)270-7142. The examiner can normally be reached M-F. 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, Emmanuel Moise can be reached at 5712723865. 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. /BERHANU SHITAYEWOLDETSADIK/ Primary Examiner, Art Unit 2455
Read full office action

Prosecution Timeline

Sep 17, 2024
Application Filed
Jan 28, 2026
Non-Final Rejection mailed — §103
Jul 27, 2026
Response Filed
Jul 27, 2026
Applicant Interview (Telephonic)
Jul 27, 2026
Examiner Interview Summary
Sep 10, 2026
Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12761945
INTELLIGENT DATA PLANE ACCELERATION BY OFFLOADING TO DISTRIBUTED SMART NETWORK INTERFACES
1y 9m to grant Granted Oct 13, 2026
Patent 12739219
DYNAMIC PRIORITIZATION OF EMAIL MESSAGES WITH UNDO FUNCTIONALITY IN AN IMMERSIVE ENVIRONMENT
2y 0m to grant Granted Sep 15, 2026
Patent 12726520
ENTITY POLICY CONTEXTS FOR SECURE DNS RESOLUTION
2y 8m to grant Granted Sep 01, 2026
Patent 12717612
MANAGEMENT AND ORCHESTRATION OF MICROSERVICES
1y 8m to grant Granted Aug 25, 2026
Patent 12712873
Cross-Tenancy Resource Association For Container Orchestration System
2y 4m to grant Granted Aug 18, 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 (+25.3%)
Moderate
PTA Risk
Based on 395 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