Automated preemptive polymorphic deception

Information

  • Patent Grant
  • 12107888
  • Patent Number
    12,107,888
  • Date Filed
    Monday, November 1, 2021
    3 years ago
  • Date Issued
    Tuesday, October 1, 2024
    3 months ago
Abstract
Embodiments are directed to monitoring network traffic using network monitoring computers (NMCs). Anomalous events may be classified based on the monitored network traffic and attack models such that the classification determines that targets of the anomalous events may be currently subject to attacks by entities communicating on the networks. A honeypot trap may be provided in the networks based on the classified events such that the honeypot trap mimics characteristics of the targets. The portions of the network traffic associated with the honeypot trap may be monitored. Characteristics of the attacks may be determined based on the monitored portions of network traffic. Reports that include information based on the characteristics of the attacks may be generated.
Description
TECHNICAL FIELD

The present invention relates generally to network monitoring, and more particularly, but not exclusively, to monitoring networks in a distributed network monitoring environment.


BACKGROUND

On most computer networks, bits of data arranged in bytes are packaged into collections of bytes called packets. These packets are generally communicated between computing devices over networks in a wired or wireless manner. A suite of communication protocols is typically employed to communicate between at least two endpoints over one or more networks. The protocols are typically layered on top of one another to form a protocol stack. One model for a network communication protocol stack is the Open Systems Interconnection (OSI) model, which defines seven layers of different protocols that cooperatively enable communication over a network. The OSI model layers are arranged in the following order: Physical (1), Data Link (2), Network (3), Transport (4), Session (5), Presentation (6), and Application (7).


Another model for a network communication protocol stack is the Internet Protocol (IP) model, which is also known as the Transmission Control Protocol/Internet Protocol (TCP/IP) model. The TCP/IP model is similar to the OSI model except that it defines four layers instead of seven. The TCP/IP model's four layers for network communication protocol are arranged in the following order: Link (1), Internet (2), Transport (3), and Application (4). To reduce the number of layers from seven to four, the TCP/IP model collapses the OSI model's Application, Presentation, and Session layers into its Application layer. Also, the OSI's Physical layer is either assumed or is collapsed into the TCP/IP model's Link layer. Although some communication protocols may be listed at different numbered or named layers of the TCP/IP model versus the OSI model, both of these models describe stacks that include basically the same protocols. For example, the TCP protocol is listed on the fourth layer of the OSI model and on the third layer of the TCP/IP model. To assess and troubleshoot communicated packets and protocols over a network, different types of network monitors can be employed. One type of network monitor, a “packet sniffer” may be employed to generally monitor and record packets of data as they are communicated over a network. Some packet sniffers can display data included in each packet and provide statistics regarding a monitored stream of packets. Also, some types of network monitors are referred to as “protocol analyzers” in part because they can provide additional analysis of monitored and recorded packets regarding a type of network, communication protocol, or application.


Generally, packet sniffers and protocol analyzers passively monitor network traffic without participating in the communication protocols. In some instances, they receive a copy of each packet on a particular network segment or VLAN from one or more members of the network segment. They may receive these packet copies through a port mirror on a managed Ethernet switch, e.g., a Switched Port Analyzer (SPAN) port, a Roving Analysis Port (RAP), or the like, or combinations thereof. Port mirroring enables analysis and debugging of network communications. Port mirroring can be performed for inbound or outbound traffic (or both) on single or multiple interfaces. In other instances, packet copies may be provided to the network monitors from a specialized network tap or from a software entity running on the client or server. In virtual environments, port mirroring may be performed on a virtual switch that is incorporated within the hypervisor.


Networks of organizations often are attacked by malicious actors from external or internal locations. Vigilant organizations employ a variety of defenses or security mechanisms to help ensure the safety or integrity of the their networks or the data stored on networked devices or computers. In some cases, because attackers may continually update their tactics, it may be necessary for organizations to continually update their defenses. In some cases, organizations may employ one or more deception techniques to thwart attacks or learn more about the attackers. However, one or more factors may make deceptive tactics difficult, including the scale or size or modern networks, the dynamic nature of modern networking environments, growing sophistication of attackers or attacks, or the like. Thus, it is with respect to these considerations and others that the present invention has been made.





BRIEF DESCRIPTION OF THE DRAWINGS

Non-limiting and non-exhaustive embodiments of the present innovations are described with reference to the following drawings. In the drawings, like reference numerals refer to like parts throughout the various figures unless otherwise specified. For a better understanding of the described innovations, reference will be made to the following Detailed Description of Various Embodiments, which is to be read in association with the accompanying drawings, wherein:



FIG. 1 illustrates a system environment in which various embodiments may be implemented;



FIG. 2 illustrates a schematic embodiment of a client computer;



FIG. 3 illustrates a schematic embodiment of a network computer;



FIG. 4 illustrates a logical architecture of a system for automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 5 illustrates a logical schematic of a system for automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 6A illustrates a logical representation of a system for automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 6B illustrates a logical schematic of a system if an NMC has engaged in automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 7 illustrates a logical schematic of a system for automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 8A illustrates a logical schematic of a portion of an NMC for using NMCs to provide automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 8B illustrates a logical schematic of a portion of an NMC for using NMCs to provide automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 8C illustrates a logical schematic of a portion of an NMC for using NMCs to provide automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 9 illustrates an overview flowchart of a process for automated preemptive polymorphic deception in accordance with one or more of the various embodiments;



FIG. 10 illustrates a flowchart of a process for automated preemptive polymorphic deception in accordance with one or more of the various embodiments; and



FIG. 11 illustrates a flowchart of a process for automated preemptive polymorphic deception in accordance with one or more of the various embodiments.





DETAILED DESCRIPTION OF VARIOUS EMBODIMENTS

Various embodiments now will be described more fully hereinafter with reference to the accompanying drawings, which form a part hereof, and which show, by way of illustration, specific exemplary embodiments by which the invention may be practiced. The embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the embodiments to those skilled in the art. Among other things, the various embodiments may be methods, systems, media or devices. Accordingly, the various embodiments may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. The following detailed description is, therefore, not to be taken in a limiting sense.


Throughout the specification and claims, the following terms take the meanings explicitly associated herein, unless the context clearly dictates otherwise. The phrase “in one embodiment” as used herein does not necessarily refer to the same embodiment, though it may. Furthermore, the phrase “in another embodiment” as used herein does not necessarily refer to a different embodiment, although it may. Thus, as described below, various embodiments may be readily combined, without departing from the scope or spirit of the invention.


In addition, as used herein, the term “or” is an inclusive “or” operator, and is equivalent to the term “and/or,” unless the context clearly dictates otherwise. The term “based on” is not exclusive and allows for being based on additional factors not described, unless the context clearly dictates otherwise. In addition, throughout the specification, the meaning of “a,” “an,” and “the” include plural references. The meaning of “in” includes “in” and “on.”


For example embodiments, the following terms are also used herein according to the corresponding meaning, unless the context clearly dictates otherwise.


As used herein the term, “engine” refers to logic embodied in hardware or software instructions, which can be written in a programming language, such as C, C++, Objective-C, COBOL, Java™, PHP, Perl, Python, R, Julia, JavaScript, Ruby, VBScript, Microsoft .NET™ languages such as C#, or the like. An engine may be compiled into executable programs or written in interpreted programming languages. Software engines may be callable from other engines or from themselves. Engines described herein refer to one or more logical modules that can be merged with other engines or applications, or can be divided into sub-engines. The engines can be stored in non-transitory computer-readable medium or computer storage device and be stored on and executed by one or more general purpose computers, thus creating a special purpose computer configured to provide the engine.


As used herein, the term “session” refers to a semi-permanent interactive packet interchange between two or more communicating endpoints, such as network devices. A session is set up or established at a certain point in time, and torn down at a later point in time. An established communication session may involve more than one message in each direction. A session may have stateful communication where at least one of the communicating network devices saves information about the session history to be able to communicate. A session may also provide stateless communication, where the communication consists of independent requests with responses between the endpoints. An established session is the basic requirement to perform a connection-oriented communication. A session also is the basic step to transmit in connectionless communication modes.


As used herein, the terms “network connection,” and “connection” refer to communication sessions with a semi-permanent connection for interactive packet interchange between two or more communicating endpoints, such as network devices. The connection may be established before application data is transferred, and where a stream of data is delivered in the same or different order than it was sent. The alternative to connection-oriented transmission is connectionless communication. For example, the datagram mode of communication used by the Internet Protocol (IP) and the Universal Datagram Protocol (UDP) may deliver packets out of order, since different packets may be routed independently and could be delivered over different paths. Packets associated with a TCP protocol connection may also be routed independently and could be delivered over different paths. However, for TCP connections the network communication system may provide the packets to application endpoints in the correct order.


Connection-oriented communication may be a packet-mode virtual circuit connection. For example, a transport layer virtual circuit protocol such as the TCP protocol can deliver packets of data in order although the lower layer switching is connectionless. A connection-oriented transport layer protocol such as TCP can also provide connection-oriented communications over connectionless communication. For example, if TCP is based on a connectionless network layer protocol (such as IP), this TCP/IP protocol can then achieve in-order delivery of a byte stream of data, by means of segment sequence numbering on the sender side, packet buffering and data packet reordering on the receiver side. Alternatively, the virtual circuit connection may be established in a datalink layer or network layer switching mode, where all data packets belonging to the same traffic stream are delivered over the same path, and traffic flows are identified by some connection identifier rather than by complete routing information, which enables fast hardware based switching.


As used herein, the terms “session flow” and “network flow” refer to one or more network packets or a stream of network packets that are communicated in a session that is established between at least two endpoints, such as two network devices. In one or more of the various embodiments, flows may be useful if one or more of the endpoints of a session may be behind a network traffic management device, such as a firewall, switch, router, load balancer, or the like. In one or more of the various embodiments, such flows may be used to ensure that the packets sent between the endpoints of a flow may be routed appropriately.


Typically, establishing a TCP based connection between endpoints begins with the execution of an initialization protocol and creates a single bi-directional flow between two endpoints, e.g., one direction of flow going from endpoint A to endpoint B, the other direction of the flow going from endpoint B to endpoint A, where each endpoint is at least identified by an IP address and a TCP port.


Also, some protocols or network applications may establish a separate flow for control information that enables management of at least one or more flows between two or more endpoints. Further, in some embodiments, network flows may be half-flows that may be unidirectional.


As used herein, the term “tuple” refers to a set of values that identify a source and destination of a network packet, which may, under some circumstances, be a part of a network connection. In one embodiment, a tuple may include a source Internet Protocol (IP) address, a destination IP address, a source port number, a destination port number, virtual LAN segment identifier (VLAN ID), tunnel identifier, routing interface identifier, physical interface identifier, or a protocol identifier. Tuples may be used to identify network flows (e.g., connection flows).


As used herein the term “related flows,” or “related network flows” as used herein are network flows that while separate they are operating cooperatively. For example, some protocols, such as, FTP, SIP, RTP, VOIP, custom protocols, or the like, may provide control communication over one network flow and data communication over other network flows. Further, configuration rules may define one or more criteria that are used to recognize that two or more network flows should be considered related flows. For example, configuration rules may define that flows containing a particular field value should be grouped with other flows having the same field value, such as, a cookie value, or the like. In cases, related flows may be flows in different networks or network segments that may be associated the same user, application, client computer, source, destination, or the like.


As used herein, the terms “network monitor”, “network monitoring computer”, or “NMC” refer to an application (software, hardware, or some combination) that is arranged to monitor and record flows of packets in a session that are communicated between at least two endpoints over at least one network. The NMC can provide information for assessing different aspects of these monitored flows. In one or more embodiments, the NMC may passively monitor network packet traffic without participating in the communication protocols. This monitoring may be performed for a variety of reasons, including troubleshooting and proactive remediation, anomaly detection, end-user experience monitoring, SLA monitoring, capacity planning, application lifecycle management, infrastructure change management, infrastructure optimization, business intelligence, security, and regulatory compliance. The NMC can receive network communication for monitoring through a variety of means including network taps, wireless receivers, port mirrors or directed tunnels from network switches, clients or servers including the endpoints themselves, or other infrastructure devices. In at least some of the various embodiments, the NMC may receive a copy of each packet on a particular network segment or virtual local area network (VLAN). Also, for at least some of the various embodiments, they may receive these packet copies through a port mirror on a managed Ethernet switch, e.g., a Switched Port Analyzer (SPAN) port, a Roving Analysis Port (RAP), or the like, or combination thereof. Port mirroring enables analysis and debugging of network communications. Port mirroring can be performed for inbound or outbound traffic (or both) on single or multiple interfaces.


The NMC may track network connections from and to end points such as a client or a server. The NMC may also extract information from the packets including protocol information at various layers of the communication protocol stack. The NMC may reassemble or reconstruct the stream of data exchanged between the endpoints. The NMC may perform decryption of the payload at various layers of the protocol stack. The NMC may passively monitor the network traffic or it may participate in the protocols as a proxy. The NMC may attempt to classify the network traffic according to communication protocols that are used.


The NMC may also perform one or more actions for classifying protocols that may be a necessary precondition for application classification. While some protocols run on well-known ports, others do not. Thus, even if there is traffic on a well-known port, it is not necessarily the protocol generally understood to be assigned to that port. As a result, the NMC may perform protocol classification using one or more techniques, such as, signature matching, statistical analysis, traffic analysis, and other heuristics. In some cases, the NMC may use adaptive protocol classification techniques where information used to classify the protocols may be accumulated or applied over time to further classify the observed protocols. In some embodiments, NMCs may be arranged to employ stateful analysis. Accordingly, for each supported protocols, an NMC may use network packet payload data to drive a state machine that mimics the protocol state changes in the client/server flows being monitored. The NMC may categorize the traffic where categories might include file transfers, streaming audio, streaming video, database access, interactive, gaming, and the like. The NMC may attempt to determine whether the traffic corresponds to known communications protocols, such as HTTP, FTP, SMTP, RTP, TDS, TCP, IP, and the like.


In addition, in one or more of the various embodiments, NMCs or NMC functionality may be implemented using hardware or software based proxy devices that may be arranged to intercept network traffic in the monitored networks rather than being restricted to passive (pass through) monitoring.


As used herein, the terms “layer” and “model layer” refer to a layer of one or more communication protocols in a stack of communication protocol layers that are defined by a model, such as the OSI model and the TCP/IP (IP) model. The OSI model defines seven layers and the TCP/IP model defines four layers of communication protocols.


For example, at the OSI model's lowest or first layer (Physical), streams of electrical/light/radio impulses (bits) are communicated between computing devices over some type of media, such as cables, network interface cards, radio wave transmitters, and the like. At the next or second layer (Data Link), bits are encoded into packets and packets are also decoded into bits. The Data Link layer also has two sub-layers, the Media Access Control (MAC) sub-layer and the Logical Link Control (LLC) sub-layer. The MAC sub-layer controls how a computing device gains access to the data and permission to transmit it. The LLC sub-layer controls frame synchronization, flow control and error checking. At the third layer (Network), logical paths are created, known as virtual circuits, to communicated data from node to node. Routing, forwarding, addressing, internetworking, error handling, congestion control, and packet sequencing are functions of the Network layer. At the fourth layer (Transport), transparent transfer of data between end computing devices, or hosts, is provided. The Transport layer is responsible for end to end recovery and flow control to ensure complete data transfer over the network.


At the fifth layer (Session) of the OSI model, connections between applications are established, managed, and terminated. The Session layer sets up, coordinates, and terminates conversations, exchanges, and dialogues between applications at each end of a connection. At the sixth layer (Presentation), independence from differences in data representation, e.g., encryption, is provided by translating from application to network format and vice versa. Generally, the Presentation layer transforms data into the form that the protocols at the Application layer (7) can accept. For example, the Presentation layer generally handles the formatting and encrypting/decrypting of data that is communicated across a network.


At the top or seventh layer (Application) of the OSI model, application and end user processes are supported. For example, communication partners may be identified, quality of service can be identified, user authentication and privacy may be considered, and constraints on data syntax can be identified. Generally, the Application layer provides services for file transfer, messaging, and displaying data. Protocols at the Application layer include FTP, HTTP, and Telnet.


To reduce the number of layers from seven to four, the TCP/IP model collapses the OSI model's Application, Presentation, and Session layers into its Application layer. Also, the OSI's Physical layer is either assumed or may be collapsed into the TCP/IP model's Link layer. Although some communication protocols may be listed at different numbered or named layers of the TCP/IP model versus the OSI model, both of these models describe stacks that include basically the same protocols.


As used herein, the term “entity” refers to an actor in the monitored network. Entities may include applications, services, programs, processes, network devices, network computers, client computers, or the like, operating in the monitored network. For example, individual entities may include, web clients, web servers, database clients, database servers, mobile app clients, payment processors, groupware clients, groupware services, or the like. In some cases, multiple entities may co-exist on or in the same network computer, process, application, compute container, or cloud compute instance.


As used herein, the term “observation port” refers to network taps, wireless receivers, port mirrors or directed tunnels from network switches, clients or servers, virtual machines, cloud computing instances, other network infrastructure devices or processes, or the like, or combination thereof. Observation ports may provide a copy of each network packet included in wire traffic on a particular network segment or virtual local area network (VLAN). Also, for at least some of the various embodiments, observation ports may provide NMCs network packet copies through a port mirror on a managed Ethernet switch, e.g., a Switched Port Analyzer (SPAN) port, or a Roving Analysis Port (RAP).


As used herein, the term “honeypot trap” refers one or more deceptions that may be targeted at deceiving attackers. Typically, honeypot traps may be employed to trick attackers into believing that they have accessed interesting or valuable resources in network they are attacking. Also, honeypot traps may be designed to collect metrics or other information about the attack or attackers to enable researchers to learn more about the attackers or attack. Such information may be used to identify the source of the attacks or to help improve defenses against subsequent attacks. For example, honeypot traps may include one or more computers or computer systems intended to mimic likely targets of attackers.


As used herein, the term “anomalous activity” refers to network activity that triggers one or more alarms or otherwise meets conditions defined to be anomalous by an organization. NMCs may be configured to recognize various patterns of behavior that may be considered anomalous by the organization that owns or operates a computer network. For example, such activity may include, port scans, malformed queries or requests, patterns of activity associated with known exploits, or the like. NMCs may be arranged to evaluate observed behavior using pattern matching, machine-learning classifiers, rules, protocol state machines, or the like, to identify anomalous activity.


As used herein, the term “attack” refers to anomalous activity that is determined to be a malicious intrusion or other type of ongoing exploit or attempted exploit that has been determine harmful enough to require an active response to prevent or reduce the harm that may be caused by the activity. NMCs may be arranged to evaluate observed behavior using pattern matching, machine-learning classifiers, rules, protocol state machines, or the like, to determine if anomalous activity ripens into an attack.


As used herein, the term “attack profile” refers to data structures that represent various characteristics of a pending attack. NMCs may be arranged to map metrics or network traffic characteristics to one or more field values in of the attack profile. Attack profiles are not limited to a particular set of fields or data structures. Attack profiles may be considered data structures that include information about the attack that may be derived from various sources, including monitored network traffic, as described in more detail below.


As used herein, the term “flow profile” refers to data structures that represent various characteristics of a portion of network traffic being monitored by NMCs. In some cases, particular flows may be distinguished by tuple information, or the like, that is associated with a portion of network traffic. Flow profiles are data structures that include fields or values based on a mapping of observed network traffic characteristics to fields in the flow profile, as described in more detail below.


As used herein, the term “response profile” refers to data structures that include information describing or defining information about the type of actions that should be taken in response to a pending attack. Generally, response profiles include instructions or configuration information associated with providing or deploying honeypot traps for pending attacks. Response profiles may include various information for selecting honeypot traps, configuring honeypot traps, monitoring honeypot traps, or the like, as described in more detail below.


As used herein the term, “configuration information” refers to information that may include rule based policies, pattern matching, scripts (e.g., computer readable instructions), or the like, that may be provided from various sources, including, configuration files, databases, user input, built-in defaults, or the like, or combination thereof. In some cases, configuration information may include or reference information stored in other systems or services, such as, configuration management databases, Lightweight Directory Access Protocol (LDAP) servers, name services, public key infrastructure services, or the like.


The following briefly describes embodiments of the invention in order to provide a basic understanding of some aspects of the invention. This brief description is not intended as an extensive overview. It is not intended to identify key or critical elements, or to delineate or otherwise narrow the scope. Its purpose is merely to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.


Briefly stated, various embodiments are directed monitoring network traffic using one or more network monitoring computers. In one or more of the various embodiments, network traffic associated with a plurality of entities in one or more networks may be monitored. In one or more of the various embodiments, one or more anomalous events may be classified based on the monitored network traffic and one or more attack models such that the classification determines that one or more targets of the one or more anomalous events may be currently subject to one or more attacks by one or more entities communicating on the one or more networks. In one or more of the various embodiments, determining the one or more targets may include determining one or more of one or more target network addresses, one or more target applications, one or more target users, one or more target user roles, one or more target assets, one or more target data stores, or one or more target file systems.


In one or more of the various embodiments, a honeypot trap may be provided in the one or more networks based on the one or more classified events such that the honeypot trap mimics one or more characteristics of the one or more targets. In one or more of the various embodiments, providing the honeypot trap may include: determining network information associated with the one or more anomalous events; modifying the honeypot trap based on the network information; deploying the further modified honeypot trap based on the network information; or the like.


In one or more of the various embodiments, one or more portions of the network traffic associated with the honeypot trap may be monitored. In one or more of the various embodiments, monitoring the one or more portions of the network traffic associated with the honeypot trap may include determining a number of the one or more attacks that may be attracted to one or more honeypot trap. And, in some embodiments, scoring the one or more honeypot traps based on the number of attracted attacks such that each honeypot trap may be scored higher than the one or more honeypot traps that attract fewer attackers, and such that each honeypot trap may be scored lower than the one or more honeypot traps that attract more attackers.


In one or more of the various embodiments, one or more characteristics of the one or more attacks may be determined based on the monitored one or more portions of network traffic such that the honeypot trap may be separate or isolated from the one or more network computers.


In one or more of the various embodiments, providing one or more other honeypot traps based on the monitored network traffic. In one or more of the various embodiments, the one or more other honeypot traps may be deployed based on the monitored network traffic.


In one or more of the various embodiments, one or more metrics associated with the honeypot trap and one or more metrics associated with the one or more other honeypot traps may be correlated.


In one or more of the various embodiments, false information based on one or more characteristics of the one or more targets may be generated such that the false information includes one or more of, email addresses, location names, street addresses, telephone numbers, payroll information, product descriptions, network address information, or hostname information, that are based on an organization that is a target of the one or more anomalous events. And, in some embodiments, the false information may be deployed on the honeypot trap.


In one or more of the various embodiments, one or more subsequent anomalous events may be predicted based on the one or more anomalous events based on the one or more attack models. In some embodiments, one or more secondary honeypot traps that are associated with the honeypot trap based on the one or more predicted subsequent anomalous events may be provided. And, in some embodiments, one or more portions of the network traffic that are associated with the one or more secondary honeypot traps may be monitored.


In one or more of the various embodiments, one or more reports that include information based on the one or more characteristics of the one or more attacks may be generated.


Illustrated Operating Environment


FIG. 1 shows components of one embodiment of an environment in which embodiments of the invention may be practiced. Not all of the components may be required to practice the invention, and variations in the arrangement and type of the components may be made without departing from the spirit or scope of the invention. As shown, system 100 of FIG. 1 includes local area networks (LANs)/wide area networks (WANs)—(network) 110, wireless network 108, client computers 102-105, application server computer 116, network monitoring computer 118, or the like.


At least one embodiment of client computers 102-105 is described in more detail below in conjunction with FIG. 2. In one embodiment, at least some of client computers 102-105 may operate over one or more wired or wireless networks, such as networks 108, or 110. Generally, client computers 102-105 may include virtually any computer capable of communicating over a network to send and receive information, perform various online activities, offline actions, or the like. In one embodiment, one or more of client computers 102-105 may be configured to operate within a business or other entity to perform a variety of services for the business or other entity. For example, client computers 102-105 may be configured to operate as a web server, firewall, client application, media player, mobile telephone, game console, desktop computer, or the like. However, client computers 102-105 are not constrained to these services and may also be employed, for example, as for end-user computing in other embodiments. It should be recognized that more or less client computers (as shown in FIG. 1) may be included within a system such as described herein, and embodiments are therefore not constrained by the number or type of client computers employed.


Computers that may operate as client computer 102 may include computers that typically connect using a wired or wireless communications medium such as personal computers, multiprocessor systems, microprocessor-based or programmable electronic devices, network PCs, or the like. In some embodiments, client computers 102-105 may include virtually any portable computer capable of connecting to another computer and receiving information such as, laptop computer 103, mobile computer 104, tablet computers 105, or the like. However, portable computers are not so limited and may also include other portable computers such as cellular telephones, display pagers, radio frequency (RF) devices, infrared (IR) devices, Personal Digital Assistants (PDAs), handheld computers, wearable computers, integrated devices combining one or more of the preceding computers, or the like. As such, client computers 102-105 typically range widely in terms of capabilities and features. Moreover, client computers 102-105 may access various computing applications, including a browser, or other web-based application.


A web-enabled client computer may include a browser application that is configured to send requests and receive responses over the web. The browser application may be configured to receive and display graphics, text, multimedia, and the like, employing virtually any web-based language. In one embodiment, the browser application is enabled to employ JavaScript, HyperText Markup Language (HTML), eXtensible Markup Language (XML), JavaScript Object Notation (JSON), Cascading Style Sheets (CSS), or the like, or combination thereof, to display and send a message. In one embodiment, a user of the client computer may employ the browser application to perform various activities over a network (online). However, another application may also be used to perform various online activities.


Client computers 102-105 also may include at least one other client application that is configured to receive or send content between another computer. The client application may include a capability to send or receive content, or the like. The client application may further provide information that identifies itself, including a type, capability, name, and the like. In one embodiment, client computers 102-105 may uniquely identify themselves through any of a variety of mechanisms, including an Internet Protocol (IP) address, a phone number, Mobile Identification Number (MIN), an electronic serial number (ESN), a client certificate, or other device identifier. Such information may be provided in one or more network packets, or the like, sent between other client computers, application server computer 116, network monitoring computer 118, or other computers.


Client computers 102-105 may further be configured to include a client application that enables an end-user to log into an end-user account that may be managed by another computer, such as application server computer 116, network monitoring computer 118, or the like. Such an end-user account, in one non-limiting example, may be configured to enable the end-user to manage one or more online activities, including in one non-limiting example, project management, software development, system administration, configuration management, search activities, social networking activities, browse various websites, communicate with other users, or the like. Further, client computers may be arranged to enable users to provide configuration information, policy information, or the like, to network monitoring computer 118. Also, client computers may be arranged to enable users to display reports, interactive user-interfaces, results provided by network monitor computer 118, or the like. Wireless network 108 is configured to couple client computers 103-105 and its components with network 110. Wireless network 108 may include any of a variety of wireless sub-networks that may further overlay stand-alone ad-hoc networks, and the like, to provide an infrastructure-oriented connection for client computers 103-105. Such sub-networks may include mesh networks, Wireless LAN (WLAN) networks, cellular networks, and the like. In one embodiment, the system may include more than one wireless network.


Wireless network 108 may further include an autonomous system of terminals, gateways, routers, and the like connected by wireless radio links, and the like. These connectors may be configured to move freely and randomly and organize themselves arbitrarily, such that the topology of wireless network 108 may change rapidly.


Wireless network 108 may further employ a plurality of access technologies including 2nd (2G), 3rd (3G), 4th (4G) 5th (5G) generation radio access for cellular systems, WLAN, Wireless Router (WR) mesh, and the like. Access technologies such as 2G, 3G, 4G, 5G, and future access networks may enable wide area coverage for mobile computers, such as client computers 103-105 with various degrees of mobility. In one non-limiting example, wireless network 108 may enable a radio connection through a radio network access such as Global System for Mobil communication (GSM), General Packet Radio Services (GPRS), Enhanced Data GSM Environment (EDGE), code division multiple access (CDMA), time division multiple access (TDMA), Wideband Code Division Multiple Access (WCDMA), High Speed Downlink Packet Access (HSDPA), Long Term Evolution (LTE), and the like. In essence, wireless network 108 may include virtually any wireless communication mechanism by which information may travel between client computers 103-105 and another computer, network, a cloud-based network, a cloud instance, or the like.


Network 110 is configured to couple network computers with other computers, including, application server computer 116, network monitoring computer 118, client computers 102-105 through wireless network 108, or the like. Network 110 is enabled to employ any form of computer readable media for communicating information from one electronic device to another. Also, network 110 can include the Internet in addition to local area networks (LANs), wide area networks (WANs), direct connections, such as through a universal serial bus (USB) port, Ethernet port, other forms of computer-readable media, or any combination thereof. On an interconnected set of LANs, including those based on differing architectures and protocols, a router acts as a link between LANs, enabling messages to be sent from one to another. In addition, communication links within LANs typically include twisted wire pair or coaxial cable, while communication links between networks may utilize analog telephone lines, full or fractional dedicated digital lines including T1, T2, T3, and T4, or other carrier mechanisms including, for example, E-carriers, Integrated Services Digital Networks (ISDNs), Digital Subscriber Lines (DSLs), wireless links including satellite links, or other communications links known to those skilled in the art. Moreover, communication links may further employ any of a variety of digital signaling technologies, including without limit, for example, DS-0, DS-1, DS-2, DS-3, DS-4, OC-3, OC-12, OC-48, or the like. Furthermore, remote computers and other related electronic devices could be remotely connected to either LANs or WANs via a modem and temporary telephone link. In one embodiment, network 110 may be configured to transport information using one or more network protocols, such Internet Protocol (IP).


Additionally, communication media typically embodies computer readable instructions, data structures, program modules, or other transport mechanism and includes any information non-transitory delivery media or transitory delivery media. By way of example, communication media includes wired media such as twisted pair, coaxial cable, fiber optics, wave guides, and other wired media and wireless media such as acoustic, RF, infrared, and other wireless media.


One embodiment of application server computer 116 is described in more detail below in conjunction with FIG. 3. One embodiment of network monitoring computer 118 is described in more detail below in conjunction with FIG. 3. Although FIG. 1 illustrates application server computer 116, and network monitoring computer 118, each as a single computer, the innovations or embodiments are not so limited. For example, one or more functions of application server computer 116, network monitoring computer 118, or the like, may be distributed across one or more distinct network computers. Moreover, in one or more embodiment, network monitoring computer 118 may be implemented using a plurality of network computers. Further, in one or more of the various embodiments, application server computer 116, or network monitoring computer 118 may be implemented using one or more cloud instances in one or more cloud networks. Accordingly, these innovations and embodiments are not to be construed as being limited to a single environment, and other configurations, and other architectures are also envisaged.


Illustrative Client Computer


FIG. 2 shows one embodiment of client computer 200 that may include many more or less components than those shown. Client computer 200 may represent, for example, at least one embodiment of mobile computers or client computers shown in FIG. 1.


Client computer 200 may include processor 202 in communication with memory 204 via bus 228. Client computer 200 may also include power supply 230, network interface 232, audio interface 256, display 250, keypad 252, illuminator 254, video interface 242, input/output interface 238, haptic interface 264, global positioning systems (GPS) receiver 258, open air gesture interface 260, temperature interface 262, camera(s) 240, projector 246, pointing device interface 266, processor-readable stationary storage device 234, and processor-readable removable storage device 236. Client computer 200 may optionally communicate with a base station (not shown), or directly with another computer. And in one embodiment, although not shown, a gyroscope may be employed within client computer 200 for measuring or maintaining an orientation of client computer 200.


Power supply 230 may provide power to client computer 200. A rechargeable or non-rechargeable battery may be used to provide power. The power may also be provided by an external power source, such as an AC adapter or a powered docking cradle that supplements or recharges the battery.


Network interface 232 includes circuitry for coupling client computer 200 to one or more networks, and is constructed for use with one or more communication protocols and technologies including, but not limited to, protocols and technologies that implement any portion of the OSI model for mobile communication (GSM), CDMA, time division multiple access (TDMA), UDP, TCP/IP, SMS, MMS, GPRS, WAP, UWB, WiMax, SIP/RTP, GPRS, EDGE, WCDMA, LTE, UMTS, OFDM, CDMA2000, EV-DO, HSDPA, or any of a variety of other wireless communication protocols. Network interface 232 is sometimes known as a transceiver, transceiving device, or network interface card (MC).


Audio interface 256 may be arranged to produce and receive audio signals such as the sound of a human voice. For example, audio interface 256 may be coupled to a speaker and microphone (not shown) to enable telecommunication with others or generate an audio acknowledgement for some action. A microphone in audio interface 256 can also be used for input to or control of client computer 200, e.g., using voice recognition, detecting touch based on sound, and the like.


Display 250 may be a liquid crystal display (LCD), gas plasma, electronic ink, light emitting diode (LED), Organic LED (OLED) or any other type of light reflective or light transmissive display that can be used with a computer. Display 250 may also include a touch interface 244 arranged to receive input from an object such as a stylus or a digit from a human hand, and may use resistive, capacitive, surface acoustic wave (SAW), infrared, radar, or other technologies to sense touch or gestures.


Projector 246 may be a remote handheld projector or an integrated projector that is capable of projecting an image on a remote wall or any other reflective object such as a remote screen.


Video interface 242 may be arranged to capture video images, such as a still photo, a video segment, an infrared video, or the like. For example, video interface 242 may be coupled to a digital video camera, a web-camera, or the like. Video interface 242 may comprise a lens, an image sensor, and other electronics. Image sensors may include a complementary metal-oxide-semiconductor (CMOS) integrated circuit, charge-coupled device (CCD), or any other integrated circuit for sensing light.


Keypad 252 may comprise any input device arranged to receive input from a user. For example, keypad 252 may include a push button numeric dial, or a keyboard. Keypad 252 may also include command buttons that are associated with selecting and sending images.


Illuminator 254 may provide a status indication or provide light. Illuminator 254 may remain active for specific periods of time or in response to event messages. For example, when illuminator 254 is active, it may backlight the buttons on keypad 252 and stay on while the client computer is powered. Also, illuminator 254 may backlight these buttons in various patterns when particular actions are performed, such as dialing another client computer. Illuminator 254 may also cause light sources positioned within a transparent or translucent case of the client computer to illuminate in response to actions.


Further, client computer 200 may also comprise hardware security module (HSM) 268 for providing additional tamper resistant safeguards for generating, storing or using security/cryptographic information such as, keys, digital certificates, passwords, passphrases, two-factor authentication information, or the like. In some embodiments, hardware security module may be employed to support one or more standard public key infrastructures (PKI), and may be employed to generate, manage, or store keys pairs, or the like. In some embodiments, HSM 268 may be a stand-alone computer, in other cases, HSM 268 may be arranged as a hardware card that may be added to a client computer.


Client computer 200 may also comprise input/output interface 238 for communicating with external peripheral devices or other computers such as other client computers and network computers. The peripheral devices may include an audio headset, virtual reality headsets, display screen glasses, remote speaker system, remote speaker and microphone system, and the like. Input/output interface 238 can utilize one or more technologies, such as Universal Serial Bus (USB), Infrared, WiFi, WiMax, Bluetooth™, and the like.


Input/output interface 238 may also include one or more sensors for determining geolocation information (e.g., GPS), monitoring electrical power conditions (e.g., voltage sensors, current sensors, frequency sensors, and so on), monitoring weather (e.g., thermostats, barometers, anemometers, humidity detectors, precipitation scales, or the like), or the like. Sensors may be one or more hardware sensors that collect or measure data that is external to client computer 200.


Haptic interface 264 may be arranged to provide tactile feedback to a user of the client computer. For example, the haptic interface 264 may be employed to vibrate client computer 200 in a particular way when another user of a computer is calling. Temperature interface 262 may be used to provide a temperature measurement input or a temperature changing output to a user of client computer 200. Open air gesture interface 260 may sense physical gestures of a user of client computer 200, for example, by using single or stereo video cameras, radar, a gyroscopic sensor inside a computer held or worn by the user, or the like. Camera 240 may be used to track physical eye movements of a user of client computer 200.


GPS transceiver 258 can determine the physical coordinates of client computer 200 on the surface of the Earth, which typically outputs a location as latitude and longitude values. GPS transceiver 258 can also employ other geo-positioning mechanisms, including, but not limited to, triangulation, assisted GPS (AGPS), Enhanced Observed Time Difference (E-OTD), Cell Identifier (CI), Service Area Identifier (SAI), Enhanced Timing Advance (ETA), Base Station Subsystem (BSS), or the like, to further determine the physical location of client computer 200 on the surface of the Earth. It is understood that under different conditions, GPS transceiver 258 can determine a physical location for client computer 200. In one or more embodiment, however, client computer 200 may, through other components, provide other information that may be employed to determine a physical location of the client computer, including for example, a Media Access Control (MAC) address, IP address, and the like.


Human interface components can be peripheral devices that are physically separate from client computer 200, allowing for remote input or output to client computer 200. For example, information routed as described here through human interface components such as display 250 or keyboard 252 can instead be routed through network interface 232 to appropriate human interface components located remotely. Examples of human interface peripheral components that may be remote include, but are not limited to, audio devices, pointing devices, keypads, displays, cameras, projectors, and the like. These peripheral components may communicate over a Pico Network such as Bluetooth™, Zigbee™ and the like. One non-limiting example of a client computer with such peripheral human interface components is a wearable computer, which might include a remote pico projector along with one or more cameras that remotely communicate with a separately located client computer to sense a user's gestures toward portions of an image projected by the pico projector onto a reflected surface such as a wall or the user's hand.


A client computer may include web browser application 226 that is configured to receive and to send web pages, web-based messages, graphics, text, multimedia, and the like. The client computer's browser application may employ virtually any programming language, including a wireless application protocol messages (WAP), and the like. In one or more embodiment, the browser application is enabled to employ Handheld Device Markup Language (HDML), Wireless Markup Language (WML), WMLScript, JavaScript, Standard Generalized Markup Language (SGML), HyperText Markup Language (HTML), eXtensible Markup Language (XML), HTML5, and the like.


Memory 204 may include RAM, ROM, or other types of memory. Memory 204 illustrates an example of computer-readable storage media (devices) for storage of information such as computer-readable instructions, data structures, program modules or other data. Memory 204 may store BIOS 208 for controlling low-level operation of client computer 200. The memory may also store operating system 206 for controlling the operation of client computer 200. It will be appreciated that this component may include a general-purpose operating system such as a version of UNIX, or LINUX™, or a specialized client computer communication operating system such as Windows Phone™, or the Symbian® operating system. The operating system may include, or interface with a Java virtual machine module that enables control of hardware components or operating system operations via Java application programs.


Memory 204 may further include one or more data storage 210, which can be utilized by client computer 200 to store, among other things, applications 220 or other data. For example, data storage 210 may also be employed to store information that describes various capabilities of client computer 200. The information may then be provided to another device or computer based on any of a variety of methods, including being sent as part of a header during a communication, sent upon request, or the like. Data storage 210 may also be employed to store social networking information including address books, buddy lists, aliases, user profile information, or the like. Data storage 210 may further include program code, data, algorithms, and the like, for use by a processor, such as processor 202 to execute and perform actions. In one embodiment, at least some of data storage 210 might also be stored on another component of client computer 200, including, but not limited to, non-transitory processor-readable removable storage device 236, processor-readable stationary storage device 234, or even external to the client computer.


Applications 220 may include computer executable instructions which, when executed by client computer 200, transmit, receive, or otherwise process instructions and data. Applications 220 may include, for example, other client applications 224, web browser 226, or the like. Client computers may be arranged to exchange communications, such as, queries, searches, messages, notification messages, event messages, alerts, performance metrics, log data, API calls, or the like, combination thereof, with application servers or network monitoring computers. Other examples of application programs include calendars, search programs, email client applications, IM applications, SMS applications, Voice Over Internet Protocol (VOIP) applications, contact managers, task managers, transcoders, database programs, word processing programs, security applications, spreadsheet programs, games, search programs, and so forth.


Additionally, in one or more embodiments (not shown in the figures), client computer 200 may include one or more embedded logic hardware devices instead of CPUs, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof. The embedded logic hardware devices may directly execute embedded logic to perform actions. Also, in one or more embodiments (not shown in the figures), client computer 200 may include one or more hardware microcontrollers instead of CPUs. In one or more embodiments, the microcontrollers may directly execute their own embedded logic to perform actions and access their own internal memory and their own external Input and Output Interfaces (e.g., hardware pins or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.


Illustrative Network Computer


FIG. 3 shows one embodiment of network computer 300 that may be included in a system implementing at least one of the various embodiments. Network computer 300 may include many more or less components than those shown in FIG. 3. However, the components shown are sufficient to disclose an illustrative embodiment for practicing these innovations. Network computer 300 may represent, for example, one embodiment of at least one of application server computer 116, or network monitoring computer 118 of FIG. 1.


As shown in the figure, network computer 300 includes a processor 302 that may be in communication with a memory 304 via a bus 328. In some embodiments, processor 302 may be comprised of one or more hardware processors, or one or more processor cores. In some cases, one or more of the one or more processors may be specialized processors designed to perform one or more specialized actions, such as, those described herein. Network computer 300 also includes a power supply 330, network interface 332, audio interface 356, display 350, keyboard 352, input/output interface 338, processor-readable stationary storage device 334, and processor-readable removable storage device 336. Power supply 330 provides power to network computer 300.


Network interface 332 includes circuitry for coupling network computer 300 to one or more networks, and is constructed for use with one or more communication protocols and technologies including, but not limited to, protocols and technologies that implement any portion of the Open Systems Interconnection model (OSI model), global system for mobile communication (GSM), code division multiple access (CDMA), time division multiple access (TDMA), user datagram protocol (UDP), transmission control protocol/Internet protocol (TCP/IP), Short Message Service (SMS), Multimedia Messaging Service (MMS), general packet radio service (GPRS), WAP, ultra-wide band (UWB), IEEE 802.16 Worldwide Interoperability for Microwave Access (WiMax), Session Initiation Protocol/Real-time Transport Protocol (SIP/RTP), or any of a variety of other wired and wireless communication protocols. Network interface 332 is sometimes known as a transceiver, transceiving device, or network interface card (NIC). Network computer 300 may optionally communicate with a base station (not shown), or directly with another computer.


Audio interface 356 is arranged to produce and receive audio signals such as the sound of a human voice. For example, audio interface 356 may be coupled to a speaker and microphone (not shown) to enable telecommunication with others or generate an audio acknowledgement for some action. A microphone in audio interface 356 can also be used for input to or control of network computer 300, for example, using voice recognition.


Display 350 may be a liquid crystal display (LCD), gas plasma, electronic ink, light emitting diode (LED), Organic LED (OLED) or any other type of light reflective or light transmissive display that can be used with a computer. In some embodiments, display 350 may be a handheld projector or pico projector capable of projecting an image on a wall or other object.


Network computer 300 may also comprise input/output interface 338 for communicating with external devices or computers not shown in FIG. 3. Input/output interface 338 can utilize one or more wired or wireless communication technologies, such as USB™, Firewire™, WiFi, WiMax, Thunderbolt™, Infrared, Bluetooth™, Zigbee™, serial port, parallel port, and the like.


Also, input/output interface 338 may also include one or more sensors for determining geolocation information (e.g., GPS), monitoring electrical power conditions (e.g., voltage sensors, current sensors, frequency sensors, and so on), monitoring weather (e.g., thermostats, barometers, anemometers, humidity detectors, precipitation scales, or the like), or the like. Sensors may be one or more hardware sensors that collect or measure data that is external to network computer 300. Human interface components can be physically separate from network computer 300, allowing for remote input or output to network computer 300. For example, information routed as described here through human interface components such as display 350 or keyboard 352 can instead be routed through the network interface 332 to appropriate human interface components located elsewhere on the network. Human interface components include any component that allows the computer to take input from, or send output to, a human user of a computer. Accordingly, pointing devices such as mice, styluses, track balls, or the like, may communicate through pointing device interface 358 to receive user input.


GPS transceiver 340 can determine the physical coordinates of network computer 300 on the surface of the Earth, which typically outputs a location as latitude and longitude values. GPS transceiver 340 can also employ other geo-positioning mechanisms, including, but not limited to, triangulation, assisted GPS (AGPS), Enhanced Observed Time Difference (E-OTD), Cell Identifier (CI), Service Area Identifier (SAI), Enhanced Timing Advance (ETA), Base Station Subsystem (BSS), or the like, to further determine the physical location of network computer 300 on the surface of the Earth. It is understood that under different conditions, GPS transceiver 340 can determine a physical location for network computer 300. In one or more embodiment, however, network computer 300 may, through other components, provide other information that may be employed to determine a physical location of the client computer, including for example, a Media Access Control (MAC) address, IP address, and the like.


In at least one of the various embodiments, applications, such as, operating system 306, network monitoring engine 322, honeypot engine 324, classification engine 326, web services 329, or the like, may be arranged to employ geo-location information to select one or more localization features, such as, time zones, languages, currencies, calendar formatting, or the like. Localization features may be used when interpreting network traffic, monitoring application protocols, user-interfaces, generating reports, as well as internal processes or databases. In at least one of the various embodiments, geo-location information used for selecting localization information may be provided by GPS 340. Also, in some embodiments, geolocation information may include information provided using one or more geolocation protocols over the networks, such as, wireless network 108 or network 111.


Memory 304 may include Random Access Memory (RAM), Read-Only Memory (ROM), or other types of memory. Memory 304 illustrates an example of computer-readable storage media (devices) for storage of information such as computer-readable instructions, data structures, program modules or other data. Memory 304 stores a basic input/output system (BIOS) 308 for controlling low-level operation of network computer 300. The memory also stores an operating system 306 for controlling the operation of network computer 300. It will be appreciated that this component may include a general-purpose operating system such as a version of UNIX, or LINUX™, or a specialized operating system such as Microsoft Corporation's Windows® operating system, or the Apple Corporation's IOS® operating system. The operating system may include, or interface with a Java virtual machine module that enables control of hardware components or operating system operations via Java application programs. Likewise, other runtime environments may be included.


Memory 304 may further include one or more data storage 310, which can be utilized by network computer 300 to store, among other things, applications 320 or other data. For example, data storage 310 may also be employed to store information that describes various capabilities of network computer 300. The information may then be provided to another device or computer based on any of a variety of methods, including being sent as part of a header during a communication, sent upon request, or the like. Data storage 310 may also be employed to store social networking information including address books, buddy lists, aliases, user profile information, or the like. Data storage 310 may further include program code, data, algorithms, and the like, for use by a processor, such as processor 302 to execute and perform actions such as those actions described below. In one embodiment, at least some of data storage 310 might also be stored on another component of network computer 300, including, but not limited to, non-transitory media inside processor-readable removable storage device 336, processor-readable stationary storage device 334, or any other computer-readable storage device within network computer 300, or even external to network computer 300. Data storage 310 may include, for example, network topology database 314, protocol information 316, attack models 318, or the like. In some embodiments, network topology database 314 may be a data store that contains information related to the topology of one or more network monitored by a NMC, including one or more device relation models. And, protocol information 316 may store various rules or configuration information related to one or more network communication protocols, including application protocols, secure communication protocols, client-server protocols, peer-to-peer protocols, shared file system protocols, protocol state machines, or the like, that may be employed for protocol analysis, entity auto-discovery, anomaly detections, or the like, in a monitored network environment. Also, in some embodiments, attack models 318 may store various analytical models that are arranged to infer various characteristics of pending attacks based on network traffic, including network traffic that is associated with one or more honeypot traps.


Applications 320 may include computer executable instructions which, when executed by network computer 300, transmit, receive, or otherwise process messages (e.g., SMS, Multimedia Messaging Service (MMS), Instant Message (IM), email, or other messages), audio, video, and enable telecommunication with another user of another mobile computer. Other examples of application programs include calendars, search programs, email client applications, IM applications, SMS applications, Voice Over Internet Protocol (VOIP) applications, contact managers, task managers, transcoders, database programs, word processing programs, security applications, spreadsheet programs, games, search programs, and so forth. Applications 320 may include network monitoring engine 322, honeypot engine 324, classification engine 326, web services 329, or the like, that may be arranged to perform actions for embodiments described below. In one or more of the various embodiments, one or more of the applications may be implemented as modules or components of another application. Further, in one or more of the various embodiments, applications may be implemented as operating system extensions, modules, plugins, or the like.


Furthermore, in one or more of the various embodiments, network monitoring engine 322, honeypot engine 324, classification engine 326, web services 329, or the like, may be operative in a cloud-based computing environment. In one or more of the various embodiments, these applications, and others, that comprise a network monitoring computer may be executing within virtual machines or virtual servers that may be managed in a cloud-based based computing environment. In one or more of the various embodiments, in this context the applications may flow from one physical network computer within the cloud-based environment to another depending on performance and scaling considerations automatically managed by the cloud computing environment. Likewise, in one or more of the various embodiments, virtual machines or virtual servers dedicated to network monitoring engine 322, honeypot engine 324, classification engine 326, web services 329, or the like, may be provisioned and de-commissioned automatically.


Also, in one or more of the various embodiments, network monitoring engine 322, honeypot engine 324, classification engine 326, web services 329, or the like, may be located in virtual servers running in a cloud-based computing environment rather than being tied to one or more specific physical network computers. Likewise, in some embodiments, one or more of network monitoring engine 322, honeypot engine 324, classification engine 326, web services 329, or the like, may be configured to execute in a container-based environment.


Further, network computer 300 may also comprise hardware security module (HSM) 360 for providing additional tamper resistant safeguards for generating, storing or using security/cryptographic information such as, keys, digital certificates, passwords, passphrases, two-factor authentication information, or the like. In some embodiments, hardware security module may be employ to support one or more standard public key infrastructures (PKI), and may be employed to generate, manage, or store keys pairs, or the like. In some embodiments, HSM 360 may be a stand-alone network computer, in other cases, HSM 360 may be arranged as a hardware card that may be installed in a network computer.


Additionally, in one or more embodiments (not shown in the figures), network computer 300 may include one or more embedded logic hardware devices instead of CPUs, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof. The embedded logic hardware device may directly execute its embedded logic to perform actions. Also, in one or more embodiments (not shown in the figures), the network computer may include one or more hardware microcontrollers instead of CPUs. In one or more embodiments, the one or more microcontrollers may directly execute their own embedded logic to perform actions and access their own internal memory and their own external Input and Output Interfaces (e.g., hardware pins or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.


Illustrative Logical System Architecture


FIG. 4 illustrates a logical architecture of system 400 for automated preemptive polymorphic deception in accordance with one or more of the various embodiments. System 400 may be arranged to include a plurality of network devices or network computers on first network 402 and a plurality of network devices or network computers on second network 404. In this example communication between the first network and the second network is managed by switch 406. Also, NMC 408 may be arranged to passively monitor or record packets (network traffic) that are communicated in network flows between network devices or network computers on first network 402 and second network 404. For example, the communication of flows of packets between the Host B network computer and the Host A network computer are managed by switch 406 and NMC 408 may be passively monitoring and recording some or all of the network traffic comprising these flows.


NMC 408 may be arranged to receive network communication for monitoring through a variety of means including network taps, wireless receivers, port mirrors or directed tunnels from network switches, clients or servers including the endpoints themselves, virtual machine, cloud computing instances, other network infrastructure devices, or the like, or combination thereof. In at least some of the various embodiments, the NMC may receive a copy of each packet on a particular network segment or virtual local area network (VLAN). Also, for at least some of the various embodiments, NMCs may receive these packet copies through a port mirror on a managed Ethernet switch, e.g., a Switched Port Analyzer (SPAN) port, or a Roving Analysis Port (RAP). Port mirroring enables analysis and debugging of network communications. Port mirroring can be performed for inbound or outbound traffic (or both) on single or multiple interfaces. For example, in some embodiments, NMCs may be arranged to receive electronic signals over or via a physical hardware sensor that passively receives taps into the electronic signals that travel over the physical wires of one or more networks.



FIG. 5 illustrates a logical schematic of system 500 for automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In one or more of the various embodiments, an NMC, such as NMC 502 may be arranged to monitor network traffic in one or more networks, such as, network 504, network 506, or network 508. In this example, network 504, network 506, or network 508 may be considered similar to network 108 or network 110. Also, in some embodiments, one or more of network 504, network 506, or network 508 may be considered cloud computing environments. Likewise, in some embodiments, one or more of network 504, network 506, or network 508 may be considered remote data centers, local data centers, co-location computing environments, or the like, or combination thereof.


In one or more of the various embodiments, NMCs, such as NMC 502 may be arranged to communicate with one or more capture agents, such as, capture agent 512, capture agent 514, or capture agent 514. In some embodiments, capture agents may be arranged to selectively capture network traffic or collect network traffic metrics that may be provided to NMC 502 for additional analysis.


In one or more of the various embodiments, capture agents may be NMCs that are distributed in various networks or cloud environments. For example, in some embodiments, a simplified system may include one or more NMCs that also provide capture agent services. In some embodiments, capture agents may be NMCs arranged to instantiate one or more capture engines to perform one or more capture or collection actions. Similarly, in one or more of the various embodiments, one or more capture agents may be instantiated or hosted separately from one or more NMCs.


In one or more of the various embodiments, capture agents may be selectively installed such that they may capture metrics for selected portions of the monitored networks. Also, in some embodiments, in networks that have groups or clusters of the same or similar entities, capture agents may be selectively installed on one or more entities that may be representative of entire groups or clusters pf similar entities. Thus, in some embodiments, capture agents on the representative entities may collect metrics or traffic that may be used to infer the metrics or activity associated with similarly situated entities that do not include a capture agent.


Likewise, in one or more of the various embodiments, one or more capture agents may be installed or activated for a limited time period to collect information that may be used to infer activity information about the monitored networks. Accordingly, in one or more of the various embodiments, these one or more capture agents may be removed or de-activated if sufficient activity information or network traffic has been collected.


In one or more of the various embodiments, system 500 may include one or more network entities, such as, entities 518, entities 520, or the like, that communicate in or over one or more of the monitored networks. Entities 518 and entities 520 are illustrated here as cloud environment compute instances (e.g., virtual machines), or the like. However, one of ordinary skill in the art will appreciate that entities may be considered to be various network computers, network appliances, routers, switches, applications, services, containers, or the like, subject to network monitoring by one or more NMCs. (See, FIG. 4, as well).


In this example, for one or more of the various embodiments, capture agents, such as capture agent 512 may be arranged capture network traffic or network traffic metrics associated with one or more entities, such as, entities 518. Accordingly, in some embodiments, some or all of the information captured by capture agents may be provided to one or more NMCs, such as, NMC 502 for additional analysis. Also, in one or more of the various embodiments, capture agents or NMCs may be arranged to selectively store network traffic in a captured data store, such as, captured data store 522.



FIGS. 6A and 6B illustrate automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In short, FIG. 6A represents a system under attack and FIG. 6B represents the same system if the NMC has initiated automated preemptive polymorphic deception to defend against the attack by deploying a honeypot trap.



FIG. 6A illustrates a logical representation of system 600 for automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In this example, network 602 may be considered similar to network 108 or network 110. In some embodiments, network 602 may represent a network or sub-network that NMC 604 may be arranged to monitor. Accordingly, in some embodiments, one or more NMCs, such as, NMC 604 may be arranged to passively monitor some or all of the network traffic that may occur in network 602.


In one or more of the various embodiments, system 600 may include one or more entities, such as, network computer 606, network computer 608, or network computer 610. Further, in this example, client computers, such as, client computer 612 may be arranged to communicate with one or more of the entities in network 602. In this example, user 614 represents one or more authorized users that may be accessing network 602 or its entities.


Also, in some embodiments, one or more of network computer 606, network computer 608, or network computer 610, as well as, some or all of network 602 may be considered to be in one or more cloud computing environments. Likewise, in some embodiments, one or more of network computer 606, network computer 608, or network computer 610, as well as, some or all of network 602 may be considered to be located in remote data centers, local data centers, co-location computing environments, or the like, or combination thereof.


In this example, for some embodiments, client computer 616 (along with user 618) represent a source of anomalous activity, such as, activity 620, that may be directed to performing one or more malicious actions. In this example, anomalous activity 620 may represent activity that originates inside or outside one or more monitored networks. In this example, the attack is illustrated as originating outside of network 602, but one of ordinary skill in the art will appreciated that one or more of the innovations disclosed herein may originate inside an otherwise secure/monitored network.


In this example, anomalous activity 620 has been detected by NMC 604. Accordingly, in some embodiments, NMC 604 may be arranged to perform various actions, including: classifying the anomalous activity, generating a honeypot trap based on the classification, deploying one or more honeypot traps, monitoring network traffic associated with the deployed honeypot traps, or the like.



FIG. 6B illustrates a logical schematic of system 600 if NMC 602 has engaged in automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In this example, the entities in FIG. 6A are included in FIG. 6B. However, in this example, NMC 602 has deployed honeypot trap 622 in an attempt to lure the attacker towards a “safe” target that may be monitored by the NMC or other security services. In this example, honeypot trap 622 is illustrated as a computer in network 602. However, as described herein, honeypot traps are not so limited.


In one or more of the various embodiments, honeypot trap 622 may be a virtual machine instance that is deployed in a conventional or cloud computing environment. In some embodiments, in cloud computing environments, NMCs may be arranged to integrate with APIs or services provided by the cloud computing provider to automatically deploy or configure one or more honeypot traps, such as, honeypot trap 622. In some embodiments, honeypot trap 622 may be a physical device that may be dynamically configured or enabled to become visible to the attacker. For example, in one or more of the various embodiments, network configuration (e.g., software defined networks) may be employed to put honeypot trap 622 on network 602 visible or accessible to attacker 618.


In one or more of the various embodiments, if the attacker is lured by the honeypot trap to infiltrate the trap computer (e.g., honeypot trap 622), NMC 604 may be arranged to monitor the network traffic entering or leaving honeypot trap 622. In some embodiments, additional honeypot traps may be deployed based on the network activity observed by NMC 604. For example, if attacker 618 is seeking to exploit a computer in network 602 to use as a jumping off point for additional attacks, NMC 602 may detect or predict such attacks and either modify one or more deployed honeypot traps or deploy additional honeypot traps that may be arranged to thwart the subsequent attacks.



FIG. 7 illustrates a logical schematic of system 700 for automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In one or more of the various embodiments, system 700 includes one or more NMCs, such as, NMC 702, and one or more honeypot traps, such as, honeypot trap 704. In this example, honeypot trap 704 represents a honeypot trap deployed or configured by one or more NMCs. Accordingly, in some embodiments, NMC 704 may employ one or more observation ports, such as, observation port 706 or observation port 708 to monitor the network traffic that may be associated with honeypot trap 704.


Accordingly, in one or more of the various embodiments, NMC 704 may be arranged to monitor network activity associated with honeypot trap 704 without relying on dedicated agents, processes, or APIs. In some embodiments, honeypot traps, such as, honeypot trap 704 may be arranged to include conventional components including agents, processes, or APIs that may be discovered or detected by the attackers. For example, in some embodiments, an attack may be using one or more tools or scripts to determine various characteristics about the compromised computer/honeypot trap. For example, an attack may scan compromised computers to inventory the installed or running programs after it infiltrates a honeypot trap. Accordingly, in this example, if the honeypot trap includes one or more non-standard programs or configurations the attacker may determine it has found a honeypot trap rather than a desired/expected target.


In one or more of the various embodiments, NMCs, such as, NMC 702 may be arranged to directly interact with one or more services or programs running on honeypot trap 704. In such cases, communication path 710 may be arranged to enables communication between NMC 702 and honeypot trap 704. In some embodiments, the communication may be related to honeypot trap actions.



FIG. 8A illustrates a logical schematic of a portion of NMC 800 for using NMCs to provide automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In this example, NMC 800 may be considered to be a full featured NMC as described above. However, in the interest of brevity and clarity many of the components or parts of NMC 800 are omitted from FIG. 8. Though, one of ordinary skill in the art will appreciate that the portion of NMC 800 described here is at least sufficient for disclosing the innovations for automated preemptive polymorphic deception.


In one or more of the various embodiments, NMCs may be arranged to include one or more classification engines, such as, classification engine 802. In some embodiments, classification engines may be provided flow information, such as, flow information 804. In some embodiments, flow information may include information, such as, one or more flow profiles, that may be based on or derived from monitoring network flows that may be associated with one or more honeypot traps. In this example, flow profile 804A and flow profile 804B may represent information for different flows that may be associated with honeypot traps.


In one or more of the various embodiments, flow profiles, such as, flow profile 804A or flow profile 804B may be data structures that store one or more values that may be based on or derived from metrics collected by NMCs monitoring the network traffic associated with one or more honeypot traps.


In some embodiments, flow information may be continuously provided to classification engines as the information is produced. In other embodiments, NMCs may be arranged to periodically provide flow information to classification engines. In one or more of the various embodiments, classification engines, such as, classification engine 802 may be arranged to employ one or more attack models, such as, attack models 806 to determine one or more attack profiles, such as, attack profile 808 on the flow information associated with network traffic coming or going from honeypot traps. In this example, flow information 804 has flow profiles for two different flows. Accordingly, in this example, classification engine 802 may generate an attack profile, such as, attack profile 808, that includes the classification results produced by attack models 806.


In one or more of the various embodiments, attack profiles may be arranged to include results produced by some or all of the attack models. In some embodiments, values from two or more attack models may be weighted or summed together to produce a combined score. Thus, in some embodiments, the individual scores may be considered attack sub-scores, or the like.


In some embodiments, classification engines may be arranged to determine weights for individual attack models based on configuration information. Also, in some embodiments, some attack models may provide a confidence score that represents the likelihood that the its results may be accurate. In some cases, the confidence score may be represented as margins of error, probability distributions, probabilities, variances, or the like.


In one or more of the various embodiments, attack models are not limited to any particular theoretic method. Accordingly, in some embodiments, attack models may include models that may be arranged to accept flow profiles or flow profile information as input parameters and provide attack or attacker information as outputs. Further, in some embodiments, different attack models may be arranged to receive more or fewer parameters than other attack models. In one or more of the various embodiments, attack models may be based on one or more heuristics, linear regressions, other linear models, machine learning models, or the like, or combination thereof. In some embodiments, scores (sub-scores) may be arranged to be expressed in various ranges having various intervals.


Accordingly, in one or more of the various embodiments, classification engines may be arranged to employ rules or instructions that may be provided via configuration information to normalize or otherwise adjust the values to a common scale, interval, or distribution.


In one or more of the various embodiments, flow profiles may include values associated with one or more metrics collected based on network traffic monitoring performed by one or more NMCs. In some embodiments, such metrics may include various information or values associated with state information, protocol status information, security/cryptography information, tuple information, transmission rates, latency measurements, or the like. For example, in one or more of the various embodiments, flow profiles may include information that represent various states or activities, including: connection status/behavior, such as opening, closing, resets, other connection information, or the like; session information/behavior; propagation of events/actions associated with connections, sessions, or applications; application protocol features, such as, cookies, handshakes, tokens, or the like; control flow vs data flow activity; security associations; Transmission Control Protocol (TCP) flags/state; fast/slow startup; basic authorization activity; Kerberos tokens; Transport Layer Security (TLS) session tokens, x509 certificates; various temporal metrics, such as, latency, jitter, or the like.


In one or more of the various embodiments, generally, metrics or state information collected by NMCs may be transformed or formatted into values that may be included in flow profiles. In some embodiments, such values may be continuous, discrete, categorical, numeric, alphanumeric, compound (more than one sub-part), or the like, or combination thereof. Also, in some embodiments, flow profiles may be arranged to include fields that one or more attack models may ignore. Likewise, in some embodiments, one or more attack models may require one or more fields that may not be included in every flow profile. In one or more of the various embodiments, one or more attack models may include defaults to provide values for field values not provided by a given flow profile. Alternatively, in one or more of the various embodiments, some attack models may be included or excluded from determining attack characteristics depending on the fields available in the flow profiles under consideration. In one or more of the various embodiments, classification engines may be arranged to employ configuration information to determine rules for including or excluding attack models from determining attack profile information.


In one or more of the various embodiments, flow profiles may be updated on the fly as more recent or relevant information may be collected by NMCs. Also, in one or more of the various embodiments, attack profiles may be progressively updated as new or updated attack information or flow profiles are provided.



FIG. 8B illustrates a logical schematic of a portion of NMC 800 for using NMCs to provide automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In this example, NMC 800 may be considered to be a full featured NMC as described above. However, in the interest of brevity and clarity, many of the components or parts of NMC 800 are omitted from FIG. 8B. Though, one of ordinary skill in the art will appreciate that the portion of NMC 800 described here is at least sufficient for disclosing the innovations for automated preemptive polymorphic deception.


In one or more of the various embodiments, NMCs may be arranged to employ a honeypot trap engine, such as honeypot trap engine 812 to determine one or more response profiles, such as, response profiles 816 based on one or more attack profiles, such as, attack profile 808. Accordingly, in one or more of the various embodiments, honeypot trap engine 812 may be arranged to employ one or more response models, such as, response models 814 to determine one or more response profiles.


In one or more of the various embodiments, response models may be considered similar to attack models used for classifying anomalous network activity into attack profiles. However, in some embodiments, rather than including information related to the attacks, response profiles may include rules, instructions, or conditions that define or recommend various features or attributes for honeypot traps that may be arranged to address the pending attacks.


In one or more of the various embodiments, response models may be considered analytical models similar to attack models as described above. However, response models may be arranged for providing response profiles based on inputs that include attack profiles.


In some embodiments, the NMCs may be arranged to instantiate one or more honeypot traps based on response profiles 816. In some embodiments, response profiles may be provided to one or more other processes or services, including external or third-party services, that may instantiate the actual honeypot traps based on the response profile.


In one or more of the various embodiments, response profiles may include various information, such as, the type of honeypot trap, network information associated with configuring/deploying the honeypot traps, or the like. Also, in some embodiments, response profiles may include additional information, such as, applications, operating system, or the like, that should be included in a honeypot trap. For example, if an attack profile indicates that the attack is attempting to identify or compromise a customer database, the corresponding response profile may include information or instructions that indicate that honeypot trap should be a database server that appears to include customer data.


Note, the information included in a response profile may be determined based on the attack profile and the response models. In some embodiments, NMCs may be arranged to obtain response models from configuration information. Accordingly, in some embodiments, organizations may be enabled to configure how response models map attack profiles to response profiles.



FIG. 8C illustrates a logical schematic of a portion of NMC 800 for using NMCs to provide automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In this example, NMC 800 may be considered to be a full featured NMC as described above. However, in the interest of brevity and clarity many of the components or parts of NMC 800 are omitted from FIG. 8B. Though, one of ordinary skill in the art will appreciate that the portion of NMC 800 described here is at least sufficient for disclosing the innovations for automated preemptive polymorphic deception.


In one or more of the various embodiments, network monitoring engines, such as, 818 may be arranged to employ one or more inputs, such as, response profile 816 to provide one or more honeypot traps, such as, honeypot traps 820. Accordingly, in some embodiments, network monitoring engine 818 may be arranged to employ the response profile information to provide one or more honeypot traps.


In one or more of the various embodiments, NMCs may be arranged to communicate with other services or providers to instantiate the honeypot traps. Accordingly, in some embodiments, NMCs may be arranged to employ information included in response profiles to determine one or more commands or signals that enable the desired honeypot traps to be deployed in the monitored network environment.


In some embodiments, the particular commands or signals may depend on one or more characteristics of network environment. For example, different cloud computing providers may have different commands or APIs. Likewise, for example, different operation system or applications may require specific commands or configurations. Accordingly, in some embodiments, NMCs may determine the commands, signal, configuration, or the like, for a given honeypot trap based on configuration information. For example, in some embodiments, if response profile 816 requires the provisional of a mock or decoy Microsoft Domain Controller, NMCs may employ configuration information to determine the specific commands or signals for deploying the honeypot trap Domain Controller. For example, in some embodiments, this may include defining the identity or location of predefined virtual machine images or containers that are compatible with the monitored networking environment.


Generalized Operations


FIGS. 9-11 represent generalized operations for automated preemptive polymorphic deception in accordance with one or more of the various embodiments. In one or more of the various embodiments, processes 900, 1000, and 1100 described in conjunction with FIGS. 9-11 may be implemented by or executed by one or more processors on a single network computer (or network monitoring computer), such as network computer 300 of FIG. 3. In other embodiments, these processes, or portions thereof, may be implemented by or executed on a plurality of network computers, such as network computer 300 of FIG. 3. In yet other embodiments, these processes, or portions thereof, may be implemented by or executed on one or more virtualized computers, such as, those in a cloud-based environment. However, embodiments are not so limited and various combinations of network computers, client computers, or the like may be utilized. Further, in one or more of the various embodiments, the processes described in conjunction with FIGS. 9-11 may be used for automated preemptive polymorphic deception in accordance with at least one of the various embodiments or architectures such as those described in conjunction with FIGS. 4-8. Further, in one or more of the various embodiments, some or all of the actions performed by processes 900, 1000, and 1100 may be executed in part by network monitoring engine 322, honeypot engine 324, classification engine 326, or the like, running on one or more processors of one or more network computers.



FIG. 9 illustrates an overview flowchart of process 900 for automated preemptive polymorphic deception in accordance with one or more of the various embodiments. After a start block, at block 902, in one or more of the various embodiments, NMCs may be arranged to monitor network traffic that may be associated with one or more networks. As described herein, NMCs may be arranged to monitor network traffic in a network environment. Accordingly, in some embodiments, NMCs may collect a variety of metrics associated with the one or more flows that comprise network traffic in monitored networks.


At decision block 904, in one or more of the various embodiments, if anomalous network activity may be detected, control may flow to block 906; otherwise, control may loop back to block 902. In one or more of the various embodiments, NMCs may be arranged to apply various threshold tests, recognizers, pattern matching, protocol state machine, heuristics, machine learning derived models, or the like, identify anomalous network activity in the monitored networks.


At block 906, in one or more of the various embodiments, NMCs may be arranged to classify the anomalous activity. In one or more of the various embodiments, NMCs may include one or more classification engines that may be arranged to determine if anomalous activity may be associated with an attack on the monitored network. In some embodiments, network activity associated with the anomalous activity may be categorized into flows. Thus, in some embodiments, NMCs may provide flow profiles that describe one or more characteristics of the network traffic associated with the anomalous activity. In some embodiments, a flow profile may be associated one or more network flows. For example, if one or more flows are related flows, in some embodiments, information for each related flow may be included in one flow profile. In some embodiments, a flow profile may be arranged to include one or more other flow profiles, also known as, flow sub-profiles.


Accordingly, in one or more of the various embodiments, NMCs may be arranged to classify or categorize anomalous activity into one or more attack profiles that may define or describe particular attacks. In some embodiments, the same flow profile may match with more than one attack profile.


At block 908, in one or more of the various embodiments, NMCs may be arranged to deploy one or more honeypot traps based on the classification of the anomalous activity. In one or more of the various embodiments, NMCs may be arranged to determine one or more responses to the determined attack profiles. In one or more of the various embodiments, the one or more responses may include provisioning or deploying one or more honeypot traps directed to the one or more attacks. In some embodiments, NMCs may be arranged to provide response profiles that include the instructions or rules regarding the provisioning of honeypot traps and the management thereof.


At block 910, in one or more of the various embodiments, NMCs may be arranged to monitor the network activity associated with the one or more honeypot traps. In one or more of the various embodiments, NMCs may be arranged to observe how an attack interacts with honeypot traps based on monitoring the honeypot traps to observe the ingress or egress of network traffic associated with the honeypot traps. Accordingly, in one or more of the various embodiments, NMCs may be arranged to determine information about the attack or attackers absent a detectable presence on honeypot traps. Accordingly, in one or more of the various embodiments, employ NMCs to monitor honeypot traps rather than relying on onboard agents or diagnostic reduce the attackers ability to discern that they are engaged with honeypot traps. For example, in one or more of the various embodiments, a conventional honeypot trap may include an onboard agent or specific configuration that a sophisticated attacker may detect. In contrast, in one or more of the various embodiments, analyzing attacker engagement with the honeypot traps based on monitoring of network traffic outside the honeypot traps may increase the difficultly for attackers to detect that they are engaging with honeypot traps.


At block 912, in one or more of the various embodiments, NMCs may be arranged to perform one or more actions based on the network activity associated with the honeypot traps. In one or more of the various embodiments, NMCs may be arranged to provision additional honeypot traps, generate reports, send notifications, or the like, based on information determined from monitoring the honeypot traps.


In one or more of the various embodiments, NMCs may employ one or more response profiles that define the various actions to perform based on the network activity associated with the honeypot traps. Accordingly, in one or more of the various embodiments, as conditions defined in a response profile are met, NMCs may be triggered to perform one or more associated actions. In some embodiments, one or more of the actions may be defined via configuration information.


Next, in one or more of the various embodiments, control may be returned to a calling process.



FIG. 10 illustrates a flowchart of process 1000 for automated preemptive polymorphic deception in accordance with one or more of the various embodiments. After a start block, at block 1002, in one or more of the various embodiments, NMCs may be arranged to detect anomalous network activity based on monitoring network traffic that may be associated with one or more networks.


At block 1004, in one or more of the various embodiments, NMCs may be arranged to generate one or more flow profiles based on metrics associated with the monitored network traffic. As described above, in some embodiments, NMCs may be arranged to generate flow profiles that represent one or more characteristics of monitored network traffic. In some embodiments, flow profiles may include one or more fields that have values based on one or more metrics determined by NMCs. In some embodiments, flow profiles or portions of flow profiles may be arranged to conform to the input requirements for one or more classification engines.


At block 1006, in one or more of the various embodiments, NMCs may be arranged to employ a classification engine to generate one or more attack profiles based on the one or more flow profiles. In one or more of the various embodiments, flow profiles or portions of flow profiles may be provided as inputs to one or more classification engines that may employ the inputs to determine if the anomalous activity associated with the flow profile may be an attack.


Accordingly, in one or more of the various embodiments, classification engines may be arranged to employ one or more attack models to determine if the flow profiles are associated with attack. In some embodiments, information about attacks may be represented as attack profiles. Accordingly, in one or more of the various embodiments, classification engines may be arranged to map attack profiles to flows profiles based on one or more attack models. In some embodiments, the each individual mapping of attack profiles to flow profiles may include a confidence score, or the like, that indicates how close a given attack model matches the one or more flow profiles associated with the anomalous activity.


In one or more of the various embodiments, one or more attack models employed by classification engines may be machine learning models. In some embodiments, such models may be generated (e.g., trained) based on captured network traffic or responses or results of past attacks.


In some embodiments, attack models may be arranged to include one or more heuristics or otherwise ad-hoc conditions to match anomalous activity to a given attack profile. In some embodiments, one or more values in a flow profile may map directly to an attack profile. For example, in some embodiments, anomalous activity that includes attempts to probe a TCP port assigned to a known application (e.g., email server, database server, or the like) may be automatically mapped to an attack profile that is configured for attacks against that specific application.


Also, in one or more of the various embodiments, more than one attack profile may be mapped to anomalous activity. In some embodiments, two or more attack profiles may be deliberately arranged to overlap such as the same anomalous activity may be mapped to more than one attack profiles each with a high confidence score.


At block 1008, in one or more of the various embodiments, NMCs may be arranged to determine one or more response profiles based on the attack profiles. As described above, response profiles may be comprised of data structures that include information that defines or prescribes one or more characteristics of the honeypot trap response to a pending attack.


In one or more of the various embodiments, NMCs may be arranged to employ additional information, such as, flow profiles, user information, network environment information, information regarding authorized applications or activity, or the like, to determine response profiles. In some embodiments, some of the information used for determining response profiles may be provided by other services, including external or third party services.


In one or more of the various embodiments, response profiles may include instructions, rules, workflows, for the like, that drive the provisioning or deployment of honeypot traps directed to one or more attack profiles. In some embodiments, NMCs may be arranged to map response profiles to attack profile using static/fixed maps or real-time determination based on rules, instructions, or the like, provided via configuration information. In some embodiments, NMCs may be arranged to employ machine learning techniques to train or create machine learning models to select or recommend one or more response profiles based on inputs, such as, attack profiles, flow profiles, or the like.


In one or more of the various embodiments, NMCs may be arranged to employ information associated with the current state of the monitored computing environment. In some embodiments, NMCs may combine one or more metrics determined based on network monitoring with one or more performance/utilization metrics provided by other services or processes. For example, in some embodiments, a cloud computing environment may provide APIs for accessing perform or activity information that may be applied to the selection of response profiles.


Also, in some embodiments, one or more response profiles may be comprised of one or more other response profiles (e.g., response sub-profiles) that may be compiled into a single response profile envelope. In one or more of the various embodiments, a response profile may include sub-profiles directed to different kinds of attacks or different phases of the same attack.


Also, in some embodiments, more than one attack profile may be provided. In some embodiments, multiple attack profiles may represent that the classification engine is unable to pin-point a single best attack profile candidate. Or, similarly, in some cases, classification engines may predict that the underlying anomalous activity may employ a variety of attack strategies that may require different responses.


At block 1010, in one or more of the various embodiments, NMCs may be arranged to generate one or more honeypot traps based on the response profiles. In one or more of the various embodiments, the response profiles may include instructions, rules, scripts, or the like, that may be provided via configuration information. Accordingly, in some embodiments, organizations may be enabled to adapt response to their local requirements.


In one or more of the various embodiments, response profiles may include conditional response actions, such that particular actions may be executed if one or more conditions are met. Likewise, in one or more of the various embodiments, response profiles may be arranged to include definitions for one or more honeypot traps, one or more network configurations, or the like.


At block 1012, in one or more of the various embodiments, NMCs may be arranged to deploy the one or more honeypot traps. As described above, one or more response profiles may define the honeypot traps that should be provisioned or deployed. Likewise, in one or more of the various embodiments, response profiles may include one or more network configurations that may be applied.


Next, in one or more of the various embodiments, control may be returned to a calling process.



FIG. 11 illustrates a flowchart of process 1100 for automated preemptive polymorphic deception in accordance with one or more of the various embodiments. After a start block, at block 1102, in one or more of the various embodiments, NMCs may be arranged to detect anomalous network activity based on monitoring network traffic that may be associated with one or more networks. As described above, NMCs may be arranged to monitor the characteristics of network activity to identify anomalous activity.


At block 1104, in one or more of the various embodiments, NMCs may be arranged to deploy one or more honeypot traps based on the initial anomalous network activity. As described above, NMCs may be arranged to provide one or more honeypot traps that may be selected or created based on one or more characteristics of the network traffic that may be associated with the anomalous activity. In some embodiments, the network traffic associated with detected anomalous activity may be represented by one or more flow profiles that may be mapped to one or more response profiles. Accordingly, in some embodiments, the NMCs may employ information or instructions included in the response profiles to deploy one or more honeypot traps.


In one or more of the various embodiments, NMCs may be arranged to deploy two or more honeypot traps that may be considered exploratory in nature. Accordingly, in one or more of the various embodiments, the two or more honeypot traps may be deployed to determine more information about the attacks or attackers. In one or more of the various embodiments, if multiple types of honeypot traps are deployed, observing or measuring the attractiveness of the different types of honeypot traps based on how well they attract the attackers may provide insights into the source, goals, capabilities, sophistication, or the like, of the attackers. For example, if the attackers are attracted to a trap that mimics an employee database rather than a web server, it may indicate that the attackers are looking for employee personal information rather than attempting to deface an organization's website.


At block 1106, in one or more of the various embodiments, NMCs may be arranged to monitor network activity associated with the deployed honeypot traps. In one or more of the various embodiments, monitoring the network activity associated with the deployed honeypot traps enables NMCs to determine if attackers have engaged with the honeypot traps. Further, in some embodiments, because deploying honeypot traps may include providing software defined overlay networks dedicated to trapping attackers, the NMCs may be arranged to monitor activity occurring in the overlay network to learn more about the attackers or the attacks.


At block 1108, in one or more of the various embodiments, NMCs may be arranged to modify one or more of the one or more honeypot traps based on monitored network traffic. In one or more of the various embodiments, because the monitoring of the honeypot traps may enable additional information about a pending attack to be discovered. Accordingly, in some embodiments, NMCs may be arranged to alter the honeypot traps to account for the newly discovered or confirmed information. In some embodiments, altering or modifying honeypot traps may include providing different honeypot traps in additional to previously deployed honeypot traps. Also, in some embodiments, altering or modifying honeypot traps may include modify one or more currently deployed honeypot traps.


In one or more of the various embodiments, modifying honeypot traps may include modifying one or more characteristics of the network configuration that may be associated with one or more honeypot traps. In some embodiments, modifying honeypot traps may include sending commands or messages to one or more applications that may be running on a honeypot trap computer.


In one or more of the various embodiments, modifying honeypot traps may include adding additional honeypot traps based on predicted actions associated with pending attacks. For example, in one or more of the various embodiments, a honeypot trap strategy may include two or more layers that may be adapted to pending attacks. In some embodiments, flow profiles associated with the pending attack may be classified in attack profiles that may be used to determine additional or different response profiles to responds to learned information associated with pending attacks.


In some embodiments, learned information associated with pending attacks may be based on previous attacks. Also, in one or more of the various embodiments, learned information associated with pending attacks may be based on information learned from attacks on other networks. For example, in some embodiments, NMCs may be arranged to employ database that includes flow profiles and response profiles.


At block 1110, in one or more of the various embodiments, optionally, NMCs may be arranged to grade or score one or more response profiles associated with one or more pending attacks. In some embodiments, one or more response profile may be graded based on their effectiveness against various attacks (e.g., attack profiles). In some embodiments, NMCs may be arranged to automatically grade one or more response profiles based on how attacks respond to the honeypot traps deployed accordingly to the one or more response profiles. For example, in some embodiments, if honeypot traps deployed based on response profile are avoided or ignored by attacks, the response profile may be downgraded for the attack profiles or flow profiles that triggered the response profile in the first place. Likewise, in some embodiments, NMCs may be arranged to provide a user-interface that enables users to manual grade or score response profiles.


For example, in some embodiments, NMCs may be arranged to monitor the portions of the network traffic associated with a honeypot trap to determine how many attacks may be attracted to the honeypot trap. Accordingly, in some embodiments, the honeypot trap may be scored based on the number of attracted attacks such that the honeypot trap may be scored higher than one or more honeypot traps that attract fewer attackers and the honeypot may be scored lower than one or more other honeypot traps that attract more attackers.


Note, this block is indicated as being optional because in some embodiments NMCs may be arranged to omitted this step.


Next, in one or more of the various embodiments, control may be returned to a calling process.


It will be understood that each block of the flowchart illustration, and combinations of blocks in the flowchart illustration, can be implemented by computer program instructions. These program instructions may be provided to a processor to produce a machine, such that the instructions, which execute on the processor, create means for implementing the actions specified in the flowchart block or blocks. The computer program instructions may be executed by a processor to cause a series of operational steps to be performed by the processor to produce a computer-implemented process such that the instructions, which execute on the processor to provide steps for implementing the actions specified in the flowchart block or blocks. The computer program instructions may also cause at least some of the operational steps shown in the blocks of the flowchart to be performed in parallel. Moreover, some of the steps may also be performed across more than one processor, such as might arise in a multi-processor computer system. In addition, one or more blocks or combinations of blocks in the flowchart illustration may also be performed concurrently with other blocks or combinations of blocks, or even in a different sequence than illustrated without departing from the scope or spirit of the invention.


Accordingly, blocks of the flowchart illustration support combinations of means for performing the specified actions, combinations of steps for performing the specified actions and program instruction means for performing the specified actions. It will also be understood that each block of the flowchart illustration, and combinations of blocks in the flowchart illustration, can be implemented by special purpose hardware based systems, which perform the specified actions or steps, or combinations of special purpose hardware and computer instructions. The foregoing example should not be construed as limiting or exhaustive, but rather, an illustrative use case to show an implementation of at least one of the various embodiments of the invention.


Further, in one or more embodiments (not shown in the figures), the logic in the illustrative flowcharts may be executed using an embedded logic hardware device instead of a CPU, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof. The embedded logic hardware device may directly execute its embedded logic to perform actions. In one or more embodiments, a microcontroller may be arranged to directly execute its own embedded logic to perform actions and access its own internal memory and its own external Input and Output Interfaces (e.g., hardware pins or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.

Claims
  • 1. A method for monitoring network traffic in one or more networks using one or more network computers, wherein execution of instructions by the one or more network computers perform actions, comprising: classifying one or more anomalous events based on monitored network traffic associated with a plurality of entities in one or more networks and one or more attack models;determining network environment information associated with the one or more anomalous events that are associated with one or more attacks on one or more targets by one or more entities;generating a honeypot trap in the one or more networks based on the classification of the one or more anomalous events, wherein one or more other honeypot traps are generated based on ingress and egress of the monitored network traffic associated with the honeypot trap, and wherein the honeypot trap and the one or more other honeypot traps mimic the one or more of the targets with false information;determining on one or more correlations between one or more metrics for ingress and egress of the monitored network traffic associated with the honeypot trap and the one or more metrics for ingress and egress of the monitored network traffic associated with one or more other honeypot traps, wherein the determination is performed on the ingress and egress of the monitored network traffic outside of the honeypot trap and the one or more other honeypot traps to reduce complexity of honeypot configurations and increase complexity, for one or more attackers, to detect that the honeypot trap and the one or more other honeypot traps are monitored mimics of the one or more targets; andgenerating one or more reports that include information on one or more responses to the one or more attacks.
  • 2. The method of claim 1, wherein the classification further comprises: determining one or more characteristics of the one or more targets, wherein the one or more characteristics include target network addresses, target applications, target users, target user roles, target assets, target data stores, or target file systems; anddetermining that the one or more targets are currently subject to the one or more attacks, wherein the honeypot trap mimics the one or more characteristics of the one or more targets.
  • 3. The method of claim 1, wherein providing the honeypot trap further comprises: deploying the honeypot trap and the one or more modified honeypot traps as separate and isolated instances from the one or more targets in the one or more networks.
  • 4. The method of claim 1, further comprising: scoring the one or more honeypot traps based on an amount of attracted attacks, wherein each honeypot trap is ordered higher than the one or more honeypot traps that attract fewer attackers.
  • 5. The method of claim 1, further comprising: providing one or more secondary honeypot traps that are associated with the honeypot trap based on one or more predicted subsequent anomalous events.
  • 6. The method of claim 1, further comprising: generating the false information based on one or more characteristics of the one or more targets; anddeploying the false information on each honeypot trap.
  • 7. The method of claim 1, further comprising: determining one or more characteristics of the one or more attacks based on monitoring one or more portions of the network traffic associated with each honeypot trap.
  • 8. A system for monitoring network traffic in one or more networks, comprising: one or more network monitoring computers (NMCs), including: a memory that stores at least instructions; andone or more processors that execute instructions that perform actions, including: classifying one or more anomalous events based on monitored network traffic associated with a plurality of entities in one or more networks and one or more attack models;determining network environment information associated with the one or more anomalous events that are associated with one or more attacks on one or more targets by one or more entities;generating a honeypot trap in the one or more networks based on the classification of the one or more anomalous events, wherein one or more other honeypot traps are generated based on ingress and egress of the monitored network traffic associated with the honeypot trap, and wherein the honeypot trap and the one or more other honeypot traps mimic the one or more of the targets with false information;determining on one or more correlations between one or more metrics for ingress and egress of the monitored network traffic associated with the honeypot trap and the one or more metrics for ingress and egress of the monitored network traffic associated with one or more other honeypot traps, wherein the determination is performed on the ingress and egress of the monitored network traffic outside of the honeypot trap and the one or more other honeypot traps to reduce complexity of honeypot configurations and increase complexity, for one or more attackers, to detect that the honeypot trap and the one or more other honeypot traps are monitored mimics of the one or more targets; andgenerating one or more reports that include information on one or more responses to the one or more attacks; andone or more client computers, comprising: a memory that stores at least instructions; andone or more processors that execute instructions that perform actions, including: providing at least a portion of the monitored network traffic.
  • 9. The system of claim 8, wherein the classification further comprises: determining one or more characteristics of the one or more targets, wherein the one or more characteristics include target network addresses, target applications, target users, target user roles, target assets, target data stores, or target file systems; anddetermining that the one or more targets are currently subject to the one or more attacks, wherein the honeypot trap mimics the one or more characteristics of the one or more targets.
  • 10. The system of claim 8, wherein providing the honeypot trap further comprises: deploying the honeypot trap and the one or more modified honeypot traps as separate and isolated instances from the one or more targets in the one or more networks.
  • 11. The system of claim 8, further comprising: scoring the one or more honeypot traps based on an amount of attracted attacks, wherein each honeypot trap is ordered higher than the one or more honeypot traps that attract fewer attackers.
  • 12. The system of claim 8, further comprising: providing one or more secondary honeypot traps that are associated with the honeypot trap based on one or more predicted subsequent anomalous events.
  • 13. The system of claim 8, further comprising: generating false information based on one or more characteristics of the one or more targets; anddeploying the false information on each honeypot trap.
  • 14. The system of claim 8, further comprising: determining one or more characteristics of the one or more attacks based on monitoring one or more portions of the network traffic associated with each honeypot trap.
  • 15. A processor readable non-transitory storage media that includes instructions for monitoring network traffic in one or more networks using one or more network monitoring computers, wherein execution of the instructions by one or more processors for the one or more networking monitoring computers perform actions, comprising: classifying one or more anomalous events based on monitored network traffic associated with a plurality of entities in one or more networks and one or more attack models;determining network environment information associated with the one or more anomalous events that are associated with one or more attacks on one or more targets by one or more entities;generating a honeypot trap in the one or more networks based on the classification of the one or more anomalous events, wherein one or more other honeypot traps are generated based on ingress and egress of the monitored network traffic associated with the honeypot trap, and wherein the honeypot trap and the one or more other honeypot traps mimic the one or more of the targets with false information;determining on one or more correlations between one or more metrics for ingress and egress of the monitored network traffic associated with the honeypot trap and the one or more metrics for ingress and egress of the monitored network traffic associated with one or more other honeypot traps, wherein the determination is performed on the ingress and egress of the monitored network traffic outside of the honeypot trap and the one or more other honeypot traps to reduce complexity of honeypot configurations and increase complexity, for one or more attackers, to detect that the honeypot trap and the one or more other honeypot traps are monitored mimics of the one or more targets; andgenerating one or more reports that include information on one or more responses to the one or more attacks.
  • 16. The processor readable non-transitory storage media of claim 15, wherein the classification further comprises: determining one or more characteristics of the one or more targets, wherein the one or more characteristics include target network addresses, target applications, target users, target user roles, target assets, target data stores, or target file systems; anddetermining that the one or more targets are currently subject to the one or more attacks, wherein the honeypot trap mimics the one or more characteristics of the one or more targets.
  • 17. The processor readable non-transitory storage media of claim 15, wherein providing the honeypot trap further comprises: deploying the honeypot trap and the one or more modified honeypot traps as separate and isolated instances from the one or more targets in the one or more networks.
  • 18. The processor readable non-transitory storage media of claim 15, further comprising: scoring the one or more honeypot traps based on an amount of attracted attacks, wherein each honeypot trap is ordered higher than the one or more honeypot traps that attract fewer attackers.
  • 19. The processor readable non-transitory storage media of claim 15, further comprising: determining one or more characteristics of the one or more attacks based on monitoring one or more portions of the network traffic associated with each honeypot trap.
  • 20. A network monitoring computer (NMC) for monitoring network traffic between one or more computers in a network, comprising: a memory that stores at least instructions; andone or more processors that execute instructions that cause performance of actions, including:classifying one or more anomalous events based on monitored network traffic associated with a plurality of entities in one or more networks and one or more attack models;determining network environment information associated with the one or more anomalous events that are associated with one or more attacks on one or more targets by one or more entities;generating a honeypot trap in the one or more networks based on the classification of the one or more anomalous events, wherein one or more other honeypot traps are generated based on ingress and egress of the monitored network traffic associated with the honeypot trap, and wherein the honeypot trap and the one or more other honeypot traps mimic the one or more of the targets with false information; determining on one or more correlations between one or more metrics for ingress and egress of the monitored network traffic associated with the honeypot trap and the one or more metrics for ingress and egress of the monitored network traffic associated with one or more other honeypot traps, wherein the determination is performed on the ingress and egress of the monitored network traffic outside of the honeypot trap and the one or more other honeypot traps to reduce complexity of honeypot configurations and increase complexity, for one or more attackers, to detect that the honeypot trap and the one or more other honeypot traps are monitored mimics of the one or more targets; andgenerating one or more reports that include information on one or more responses to the one or more attacks.
CROSS-REFERENCE TO RELATED APPLICATIONS

This Utility Patent Application is a Continuation of U.S. patent application Ser. No. 16/718,050 filed on Dec. 17, 2019, now U.S. Pat. No. 11,165,823 issued on Nov. 2, 2021, the benefit of the filing date of which is hereby claimed under 35 U.S.C. § 120 and the contents of which is further incorporated in entirety by reference.

US Referenced Citations (824)
Number Name Date Kind
5027269 Grant et al. Jun 1991 A
5430727 Callon Jul 1995 A
5541995 Normile et al. Jul 1996 A
5548646 Aziz et al. Aug 1996 A
5715464 Crump et al. Feb 1998 A
5787237 Reilly Jul 1998 A
5802599 Cabrera et al. Sep 1998 A
5835726 Shwed et al. Nov 1998 A
5857188 Douglas Jan 1999 A
5928363 Ruvolo Jul 1999 A
6040834 Jain et al. Mar 2000 A
6058429 Ames et al. May 2000 A
6141686 Jackowski et al. Oct 2000 A
6263049 Kuhn Jul 2001 B1
6321338 Porras et al. Nov 2001 B1
6385729 DiGiorgio et al. May 2002 B1
6401150 Reilly Jun 2002 B1
6405250 Lin et al. Jun 2002 B1
6412000 Riddle et al. Jun 2002 B1
6526044 Cookmeyer, II et al. Feb 2003 B1
6560636 Cohen et al. May 2003 B2
6597777 Ho Jul 2003 B1
6636838 Perlman et al. Oct 2003 B1
6704311 Chuah et al. Mar 2004 B1
6704874 Porras et al. Mar 2004 B1
6765909 Sen et al. Jul 2004 B1
6789203 Belissent Sep 2004 B1
6789206 Wierzbicki et al. Sep 2004 B1
6807156 Veres et al. Oct 2004 B1
6807565 Dodrill et al. Oct 2004 B1
6883015 Geen et al. Apr 2005 B1
6901517 Redmore May 2005 B1
6944599 Vogel et al. Sep 2005 B1
6948060 Ramanathan Sep 2005 B1
6968554 Macdonald et al. Nov 2005 B1
6999729 Wandel Feb 2006 B2
7042888 Berggreen May 2006 B2
7047303 Lingafelt et al. May 2006 B2
7089326 Boucher et al. Aug 2006 B2
RE39360 Aziz et al. Oct 2006 E
7133365 Klinker et al. Nov 2006 B2
7143153 Black et al. Nov 2006 B1
7177930 LoPresti Feb 2007 B1
7181769 Keanini et al. Feb 2007 B1
7193968 Kapoor et al. Mar 2007 B1
7222366 Bruton, III et al. May 2007 B2
7313141 Kan et al. Dec 2007 B2
7342897 Nader et al. Mar 2008 B1
7424532 Subbiah Sep 2008 B1
7454499 Cantrell et al. Nov 2008 B2
7457870 Lownsbrough et al. Nov 2008 B1
7474654 Guru Jan 2009 B2
7480292 Busi et al. Jan 2009 B2
7509680 Sallam Mar 2009 B1
7535906 Engbersen et al. May 2009 B2
7543146 Karandikar et al. Jun 2009 B1
7545499 Overbeck et al. Jun 2009 B2
7554983 Muppala Jun 2009 B1
7561517 Klinker et al. Jul 2009 B2
7580356 Mishra et al. Aug 2009 B1
7602731 Jain Oct 2009 B2
7606706 Rubin et al. Oct 2009 B1
7609630 Gobeil Oct 2009 B2
7594273 Keanini et al. Nov 2009 B2
7619988 Shimada et al. Nov 2009 B2
7620986 Jagannathan et al. Nov 2009 B1
7636305 Taylor et al. Dec 2009 B1
7639613 Ghannadian et al. Dec 2009 B1
7644150 Nucci et al. Jan 2010 B1
7660883 Fowlow Feb 2010 B2
7724905 Bleumer et al. May 2010 B2
7739497 Fink et al. Jun 2010 B1
7774456 Lownsbrough et al. Aug 2010 B1
7809829 Kelly et al. Oct 2010 B2
7810151 Guruswamy Oct 2010 B1
7817549 Kasralikar et al. Oct 2010 B1
7849502 Bloch et al. Dec 2010 B1
7864764 Ma et al. Jan 2011 B1
7916652 Lima et al. Mar 2011 B1
7917647 Cooper et al. Mar 2011 B2
7936682 Singh et al. May 2011 B2
7937755 Guruswamy May 2011 B1
7944822 Nucci et al. May 2011 B1
7975139 Coulier Jul 2011 B2
7979555 Rothstein et al. Jul 2011 B2
7979694 Touitou et al. Jul 2011 B2
8040798 Chandra et al. Oct 2011 B2
8079083 Bennett et al. Dec 2011 B1
8102783 Narayanaswamy et al. Jan 2012 B1
8107397 Bagchi et al. Jan 2012 B1
8125908 Rothstein et al. Feb 2012 B2
8145633 Manolis et al. Mar 2012 B1
8185953 Rothstein et al. May 2012 B2
8194542 Väänänen et al. Jun 2012 B2
8332765 Ergan et al. Dec 2012 B2
8352725 O'Toole, Jr. Jan 2013 B1
8402540 Kapoor et al. Mar 2013 B2
8411677 Colloff Apr 2013 B1
8418249 Nucci et al. Apr 2013 B1
8443190 Breton et al. May 2013 B2
8457127 Eastham et al. Jun 2013 B2
8494985 Keralapura et al. Jul 2013 B1
8504456 Griffin et al. Aug 2013 B2
8533254 Whitson, Jr. et al. Sep 2013 B1
8555383 Marhsall et al. Oct 2013 B1
8561177 Aziz et al. Oct 2013 B1
8577817 Keralapura et al. Nov 2013 B1
8578024 Keralapura et al. Nov 2013 B1
8601531 Zolfonoon et al. Dec 2013 B1
8613089 Holloway et al. Dec 2013 B1
8619579 Rothstein et al. Dec 2013 B1
8621615 Zhao Dec 2013 B2
8626912 Rothstein et al. Jan 2014 B1
8627422 Hawkes et al. Jan 2014 B2
8635441 Frenkel et al. Jan 2014 B2
8667151 Mizikovsky et al. Mar 2014 B2
8699357 Deshpande et al. Apr 2014 B2
8707440 Gula et al. Apr 2014 B2
8744894 Christiansen et al. Jun 2014 B2
8782393 Rothstein et al. Jul 2014 B1
8817655 Szabo et al. Aug 2014 B2
8843627 Baldi et al. Sep 2014 B1
8848744 Rothstein et al. Sep 2014 B1
8861397 Kind et al. Oct 2014 B2
8867343 Rothstein et al. Oct 2014 B2
8959643 Invernizzi et al. Feb 2015 B1
8964548 Keralapura et al. Feb 2015 B1
8971196 Degioanni et al. Mar 2015 B2
9003065 Rothstein et al. Apr 2015 B2
9026467 Bammi et al. May 2015 B2
9036493 Degioanni et al. May 2015 B2
9038178 Lin May 2015 B1
9049216 McCanne et al. Jun 2015 B2
9054952 Rothstein et al. Jun 2015 B2
9083740 Ma et al. Jul 2015 B1
9094288 Nucci et al. Jul 2015 B1
9094326 Sundararajan et al. Jul 2015 B2
9152808 Ramalingam et al. Oct 2015 B1
9158604 Christodorescu et al. Oct 2015 B1
9166994 Ward et al. Oct 2015 B2
9176838 Li et al. Nov 2015 B2
9183573 Tseng Nov 2015 B2
9189318 Li et al. Nov 2015 B2
9191288 Rothstein et al. Nov 2015 B2
9191400 Ptasinski et al. Nov 2015 B1
9203865 Linden et al. Dec 2015 B2
9210135 Rothstein et al. Dec 2015 B2
9264288 Arora et al. Feb 2016 B1
9300554 Kosai et al. Mar 2016 B1
9323426 Yang Apr 2016 B2
9338147 Rothstein et al. May 2016 B1
9357410 Nedeltchev et al. May 2016 B2
9367687 Warshenbrot Jun 2016 B1
9369479 Lin Jun 2016 B2
9378361 Yen et al. Jun 2016 B1
9380489 Kotecha et al. Jun 2016 B2
9391866 Martin et al. Jul 2016 B1
9400871 Hewinson Jul 2016 B1
9401925 Guo et al. Jul 2016 B1
9426036 Roy Aug 2016 B1
9430646 Mushtaq et al. Aug 2016 B1
9432430 Klenz Aug 2016 B1
9460299 Weiss et al. Oct 2016 B2
9461875 Groat et al. Oct 2016 B2
9479405 Tongaonkar et al. Oct 2016 B1
9483742 Ahmed Nov 2016 B1
9516053 Muddu et al. Dec 2016 B1
9531736 Torres et al. Dec 2016 B1
9565202 Kindlund et al. Feb 2017 B1
9565203 Bernstein et al. Feb 2017 B2
9584381 Leone Feb 2017 B1
9591015 Amin et al. Mar 2017 B1
9621443 Kosai et al. Apr 2017 B2
9621523 Rothstein et al. Apr 2017 B2
9654485 Neumann May 2017 B1
9654503 Kowalyshyn May 2017 B1
9660879 Rothstein et al. May 2017 B1
9692658 Guo et al. Jun 2017 B2
9705895 Gutzmann Jul 2017 B1
9715820 Boss et al. Jul 2017 B1
9729416 Khanal et al. Aug 2017 B1
9756061 Roeh et al. Sep 2017 B1
9813311 Leone Nov 2017 B1
9860209 Buchanan et al. Jan 2018 B2
9876810 McDougal et al. Jan 2018 B2
9888021 Horesh et al. Feb 2018 B2
9893897 Li et al. Feb 2018 B2
9967292 Higgins et al. May 2018 B1
10009364 Dasgupta et al. Jun 2018 B2
10009793 Wetterwald et al. Jun 2018 B2
10027689 Rathor et al. Jul 2018 B1
10028167 Calin et al. Jul 2018 B2
10033766 Gupta et al. Jul 2018 B2
10037546 Benisch Jul 2018 B1
10038611 Wu et al. Jul 2018 B1
10050982 Guerra et al. Aug 2018 B1
10063434 Khanal et al. Aug 2018 B1
10116679 Wu et al. Oct 2018 B1
10122748 Currie Nov 2018 B1
10176323 Zhang et al. Jan 2019 B2
10198667 Ryan, Jr. et al. Feb 2019 B2
10204211 Hammerle et al. Feb 2019 B2
10237294 Zadeh et al. Mar 2019 B1
10243978 Roeh et al. Mar 2019 B2
10263863 Mukerji et al. Apr 2019 B2
10263883 Kamble Apr 2019 B2
10264003 Wu et al. Apr 2019 B1
10270794 Mukerji et al. Apr 2019 B1
10277618 Wu et al. Apr 2019 B1
10305928 McGrew et al. May 2019 B2
10320749 Sengupta et al. Jun 2019 B2
10321344 Barton et al. Jun 2019 B2
10326676 Driggs et al. Jun 2019 B1
10326741 Rothstein et al. Jun 2019 B2
10332005 Liao et al. Jun 2019 B1
10341206 Hammerle et al. Jul 2019 B1
10348767 Lee et al. Jul 2019 B1
10375155 Cai et al. Aug 2019 B1
10380498 Chaoji et al. Aug 2019 B1
10382296 Khanal et al. Aug 2019 B2
10382303 Khanal et al. Aug 2019 B2
10389574 Wu et al. Aug 2019 B1
10389611 Szabo et al. Aug 2019 B2
10411978 Ball et al. Sep 2019 B1
10411982 Driggs et al. Sep 2019 B1
10412080 Edwards et al. Sep 2019 B1
10419454 El-Moussa et al. Sep 2019 B2
10476673 Higgins et al. Nov 2019 B2
10511499 Mukerji et al. Dec 2019 B2
10536268 Anderson et al. Jan 2020 B2
10536475 McCorkle, Jr. et al. Jan 2020 B1
10554665 Badawy et al. Feb 2020 B1
10581915 Scherman et al. Mar 2020 B2
10587638 Mukerji et al. Mar 2020 B2
10594664 Zaifman et al. Mar 2020 B2
10594709 Wu et al. Mar 2020 B2
10594718 Deaguero et al. Mar 2020 B1
10616084 Hammerle et al. Apr 2020 B2
10673870 Pierce Jun 2020 B2
10728126 Wu et al. Jul 2020 B2
10742530 Wu et al. Aug 2020 B1
10742677 Wu et al. Aug 2020 B1
10778700 Azvine et al. Sep 2020 B2
10783262 Goyal et al. Sep 2020 B2
10805338 Kohout et al. Oct 2020 B2
10841194 Kim et al. Nov 2020 B2
10944769 Singh Mar 2021 B2
10965546 Pignataro et al. Mar 2021 B2
10965702 Higgins et al. Mar 2021 B2
10979282 Wu et al. Apr 2021 B2
10979446 Stevens et al. Apr 2021 B1
10984122 Thomas Apr 2021 B2
10992693 Luo et al. Apr 2021 B2
11012329 Ball et al. May 2021 B2
11055300 Zhang et al. Jul 2021 B2
11057420 McGrew et al. Jul 2021 B2
11093518 Lu et al. Aug 2021 B1
11106442 Hsiao et al. Aug 2021 B1
11157446 Kuruvada et al. Oct 2021 B1
11159549 El-Moussa et al. Oct 2021 B2
11165814 Lee et al. Nov 2021 B2
11165823 Wu et al. Nov 2021 B2
11165831 Higgins et al. Nov 2021 B2
11188550 Haggie et al. Nov 2021 B2
11194901 El-Moussa et al. Dec 2021 B2
11200246 Kharisma et al. Dec 2021 B2
11201876 Kallos et al. Dec 2021 B2
11296967 Rothstein et al. Apr 2022 B1
11310256 Higgins et al. Apr 2022 B2
11323467 Deaguero et al. May 2022 B2
11349861 Costlow et al. May 2022 B1
11388072 Wu et al. Jul 2022 B2
11431744 Mukerji et al. Aug 2022 B2
11438247 Wu et al. Sep 2022 B2
11463299 Wu et al. Oct 2022 B2
11463465 Wu et al. Oct 2022 B2
11463466 Higgins et al. Oct 2022 B2
11496378 Ball et al. Nov 2022 B2
11546153 Higgins et al. Jan 2023 B2
11558413 Higgins et al. Jan 2023 B2
11652714 Wu et al. May 2023 B2
11665207 Higgins et al. May 2023 B2
11706233 Higgins et al. Jul 2023 B2
11843606 Wu et al. Dec 2023 B2
20010054157 Fukumoto Dec 2001 A1
20020023080 Uga et al. Feb 2002 A1
20020024964 Baum et al. Feb 2002 A1
20020035604 Cohen et al. Mar 2002 A1
20020055998 Riddle et al. May 2002 A1
20020065912 Catchpole et al. May 2002 A1
20020078382 Sheikh et al. Jun 2002 A1
20020080720 Pegrum et al. Jun 2002 A1
20020091844 Craft et al. Jul 2002 A1
20020097724 Halme et al. Jul 2002 A1
20020107953 Ontiveros et al. Aug 2002 A1
20020133586 Shanklin et al. Sep 2002 A1
20020133622 Pinto Sep 2002 A1
20020152209 Merugu et al. Oct 2002 A1
20020156880 Mokuya Oct 2002 A1
20020175934 Hand et al. Nov 2002 A1
20020178360 Wenocur et al. Nov 2002 A1
20020184362 Banerjee et al. Dec 2002 A1
20020194483 Wenocur et al. Dec 2002 A1
20020194501 Wenocur et al. Dec 2002 A1
20020199096 Wenocur et al. Dec 2002 A1
20020199098 Davis Dec 2002 A1
20030014628 Freed et al. Jan 2003 A1
20030018891 Hall et al. Jan 2003 A1
20030023733 Lingafelt et al. Jan 2003 A1
20030084279 Campagna May 2003 A1
20030093514 Valdes et al. May 2003 A1
20030131116 Jain et al. Jul 2003 A1
20030133443 Klinker et al. Jul 2003 A1
20030135667 Mann et al. Jul 2003 A1
20030145225 Bruton, III et al. Jul 2003 A1
20030149887 Yadav Aug 2003 A1
20030152094 Colavito et al. Aug 2003 A1
20030156715 Reeds, III et al. Aug 2003 A1
20030188189 Desai et al. Oct 2003 A1
20030204621 Poletto et al. Oct 2003 A1
20030212900 Liu et al. Nov 2003 A1
20030214913 Kan et al. Nov 2003 A1
20030217144 Fu et al. Nov 2003 A1
20030233361 Cady Dec 2003 A1
20040003094 See Jan 2004 A1
20040010714 Stewart Jan 2004 A1
20040010718 Porras et al. Jan 2004 A1
20040047325 Hameleers et al. Mar 2004 A1
20040049699 Griffith et al. Mar 2004 A1
20040073512 Maung Apr 2004 A1
20040088544 Tariq et al. May 2004 A1
20040088557 Malcolm et al. May 2004 A1
20040093414 Orton May 2004 A1
20040093513 Cantrell et al. May 2004 A1
20040146006 Jackson Jul 2004 A1
20040162070 Baral et al. Aug 2004 A1
20040199630 Sarkissian et al. Oct 2004 A1
20040250059 Ramelson et al. Dec 2004 A1
20050015455 Liu Jan 2005 A1
20050015622 Williams et al. Jan 2005 A1
20050044406 Stute Feb 2005 A1
20050050316 Peles Mar 2005 A1
20050055578 Wright et al. Mar 2005 A1
20050060427 Phillips et al. Mar 2005 A1
20050066196 Yagi Mar 2005 A1
20050086255 Schran et al. Apr 2005 A1
20050091341 Knight et al. Apr 2005 A1
20050091357 Krantz et al. Apr 2005 A1
20050100000 Faulkner et al. May 2005 A1
20050111367 Jonathan Chao et al. May 2005 A1
20050125553 Wu et al. Jun 2005 A1
20050125684 Schmidt Jun 2005 A1
20050182833 Duffie, III et al. Aug 2005 A1
20050193245 Hayden et al. Sep 2005 A1
20050201363 Gilchrist et al. Sep 2005 A1
20050207413 Lerner Sep 2005 A1
20050210242 Troxel et al. Sep 2005 A1
20050234920 Rhodes Oct 2005 A1
20050251009 Morita et al. Nov 2005 A1
20050262237 Fulton et al. Nov 2005 A1
20050270975 Meylan et al. Dec 2005 A1
20050271072 Anderson et al. Dec 2005 A1
20060029096 Babbar et al. Feb 2006 A1
20060045016 Dawdy et al. Mar 2006 A1
20060045017 Yamasaki Mar 2006 A1
20060075358 Ahokas Apr 2006 A1
20060085379 Heidloff et al. Apr 2006 A1
20060085526 Gulland Apr 2006 A1
20060101068 Stuhec et al. May 2006 A1
20060106743 Horvitz May 2006 A1
20060114832 Hamilton et al. Jun 2006 A1
20060123477 Raghavan et al. Jun 2006 A1
20060171333 Shimada et al. Aug 2006 A1
20060174343 Duthie et al. Aug 2006 A1
20060184535 Kaluskar et al. Aug 2006 A1
20060188494 Bach et al. Aug 2006 A1
20060191008 Fernando et al. Aug 2006 A1
20060191009 Ito et al. Aug 2006 A1
20060200572 Schcolnik Sep 2006 A1
20060230452 Field Oct 2006 A1
20060230456 Nagabhushan et al. Oct 2006 A1
20060233349 Cooper Oct 2006 A1
20060248407 Adams, Jr. et al. Nov 2006 A1
20070039051 Duthie et al. Feb 2007 A1
20070043861 Baron et al. Feb 2007 A1
20070067841 Yegneswaran et al. Mar 2007 A1
20070077931 Glinka Apr 2007 A1
20070088845 Memon et al. Apr 2007 A1
20070110053 Soni et al. May 2007 A1
20070143852 Keanini et al. Jun 2007 A1
20070153689 Strub et al. Jul 2007 A1
20070156886 Srivastava Jul 2007 A1
20070156919 Potti et al. Jul 2007 A1
20070157306 Elrod et al. Jul 2007 A1
20070169190 Kolton et al. Jul 2007 A1
20070188494 Agutter et al. Aug 2007 A1
20070192863 Kapoor et al. Aug 2007 A1
20070211625 Liu et al. Sep 2007 A1
20070239639 Loughmiller et al. Oct 2007 A1
20070245420 Yong et al. Oct 2007 A1
20070256122 Foo et al. Nov 2007 A1
20070271592 Noda et al. Nov 2007 A1
20080019275 Mudireddy et al. Jan 2008 A1
20080022401 Cameron et al. Jan 2008 A1
20080031141 Lean et al. Feb 2008 A1
20080034424 Overcash et al. Feb 2008 A1
20080034425 Overcash et al. Feb 2008 A1
20080059582 Hartikainen et al. Mar 2008 A1
20080062995 Kaas et al. Mar 2008 A1
20080069002 Savoor et al. Mar 2008 A1
20080103610 Ebrom et al. May 2008 A1
20080130645 Deshpande et al. Jun 2008 A1
20080130659 Polland Jun 2008 A1
20080133517 Kapoor et al. Jun 2008 A1
20080133518 Kapoor et al. Jun 2008 A1
20080134330 Kapoor et al. Jun 2008 A1
20080141275 Borgendale et al. Jun 2008 A1
20080141374 Sidiroglou et al. Jun 2008 A1
20080147818 Sabo Jun 2008 A1
20080162390 Kapoor et al. Jul 2008 A1
20080172416 Ito Jul 2008 A1
20080174343 Cha et al. Jul 2008 A1
20080209045 Rothstein et al. Aug 2008 A1
20080212586 Wang et al. Sep 2008 A1
20080219261 Lin et al. Sep 2008 A1
20080222717 Rothstein et al. Sep 2008 A1
20080225740 Martin et al. Sep 2008 A1
20080232359 Kim et al. Sep 2008 A1
20080279111 Atkins et al. Nov 2008 A1
20080282080 Hyndman et al. Nov 2008 A1
20080294384 Fok et al. Nov 2008 A1
20080307219 Karandikar Dec 2008 A1
20080320297 Sabo et al. Dec 2008 A1
20090010259 Sirotkin Jan 2009 A1
20090034426 Luft et al. Feb 2009 A1
20090063665 Bagepalli et al. Mar 2009 A1
20090089326 Balasubramanian Apr 2009 A1
20090109973 Ilnicki Apr 2009 A1
20090141634 Rothstein et al. Jun 2009 A1
20090168657 Puri et al. Jul 2009 A1
20090187653 Fu et al. Jul 2009 A1
20090204723 Tonsing et al. Aug 2009 A1
20090220080 Herne et al. Sep 2009 A1
20090225675 Baum et al. Sep 2009 A1
20090228330 Karras et al. Sep 2009 A1
20090245083 Hamzeh Oct 2009 A1
20090265344 Etoh et al. Oct 2009 A1
20090268605 Campbell et al. Oct 2009 A1
20090271469 Benco et al. Oct 2009 A1
20090271511 Peracha Oct 2009 A1
20090292954 Jiang et al. Nov 2009 A1
20090296593 Prescott Dec 2009 A1
20090316602 Nandy et al. Dec 2009 A1
20090319773 Frenkel et al. Dec 2009 A1
20090320138 Keanini et al. Dec 2009 A1
20090327695 Molsberry et al. Dec 2009 A1
20090328219 Narayanaswamy Dec 2009 A1
20100027432 Gopalan et al. Feb 2010 A1
20100088670 Paster Apr 2010 A1
20100091770 Ishikawa Apr 2010 A1
20100095367 Narayanaswamy Apr 2010 A1
20100131755 Zhu et al. May 2010 A1
20100135498 Long et al. Jun 2010 A1
20100167713 Hoffman Jul 2010 A1
20100191856 Gupta et al. Jul 2010 A1
20100192225 Ma et al. Jul 2010 A1
20100201573 Lamming Aug 2010 A1
20100226301 Lohmar et al. Sep 2010 A1
20100250918 Tremblay et al. Sep 2010 A1
20100250928 Goto Sep 2010 A1
20100268937 Blom et al. Oct 2010 A1
20100278056 Meloche et al. Nov 2010 A1
20100281539 Burns et al. Nov 2010 A1
20100299158 Siegel Nov 2010 A1
20100316216 Fukushima et al. Dec 2010 A1
20100322248 Ivanov Dec 2010 A1
20100332618 Norton et al. Dec 2010 A1
20110019574 Malomsoky et al. Jan 2011 A1
20110055138 Khanduja et al. Mar 2011 A1
20110073490 Hayamizu et al. Mar 2011 A1
20110098973 Seidman Apr 2011 A1
20110122792 Duffield et al. May 2011 A1
20110126259 Krishnamurthi et al. May 2011 A1
20110126275 Anderson et al. May 2011 A1
20110141913 Clemens et al. Jun 2011 A1
20110150220 Breton et al. Jun 2011 A1
20110173441 Bagepalli et al. Jul 2011 A1
20110173490 Narayanaswamy et al. Jul 2011 A1
20110197276 Dorrendorf et al. Aug 2011 A1
20110231652 Bollay et al. Sep 2011 A1
20110231935 Gula et al. Sep 2011 A1
20110280149 Okada et al. Nov 2011 A1
20110296002 Caram Dec 2011 A1
20110320394 McKeown et al. Dec 2011 A1
20110321160 Mohandas et al. Dec 2011 A1
20120016977 Robertson et al. Jan 2012 A1
20120030731 Bhargava et al. Feb 2012 A1
20120084838 Inforzato et al. Apr 2012 A1
20120130745 Jones May 2012 A1
20120131330 Tönsing et al. May 2012 A1
20120159267 Gyorffy Jun 2012 A1
20120166962 Lunsford Jun 2012 A1
20120176917 Matityahu et al. Jul 2012 A1
20120210385 Cirstea et al. Aug 2012 A1
20120215328 Schmelzer Aug 2012 A1
20120216282 Pappu et al. Aug 2012 A1
20120233311 Parker et al. Sep 2012 A1
20120233694 Baliga et al. Sep 2012 A1
20120243533 Leong Sep 2012 A1
20120266209 Gooding et al. Oct 2012 A1
20120278477 Terrell et al. Nov 2012 A1
20120278625 Narayanan et al. Nov 2012 A1
20120278890 Määttä et al. Nov 2012 A1
20120284791 Miller et al. Nov 2012 A1
20120290711 Upham et al. Nov 2012 A1
20120294305 Rose et al. Nov 2012 A1
20120324585 Beckett, III et al. Dec 2012 A1
20130007296 Mukherjee et al. Jan 2013 A1
20130010600 Jocha et al. Jan 2013 A1
20130010608 Ramachandran et al. Jan 2013 A1
20130041896 Ghani et al. Feb 2013 A1
20130042323 Narayanaswamy et al. Feb 2013 A1
20130054758 Imes et al. Feb 2013 A1
20130061036 Oliver Mar 2013 A1
20130064084 Babbar et al. Mar 2013 A1
20130067034 Degioanni et al. Mar 2013 A1
20130097203 Bhattacharjee et al. Apr 2013 A1
20130103734 Boldyrev et al. Apr 2013 A1
20130111543 Brown et al. May 2013 A1
20130133032 Li et al. May 2013 A1
20130136011 Tardo et al. May 2013 A1
20130166730 Wilkinson Jun 2013 A1
20130176842 Bauchot et al. Jul 2013 A1
20130188645 Mack-Crane Jul 2013 A1
20130198512 Rubin et al. Aug 2013 A1
20130198827 Bhaskaran et al. Aug 2013 A1
20130212297 Varga Aug 2013 A1
20130227259 Kim Aug 2013 A1
20130227689 Pietrowicz et al. Aug 2013 A1
20130232104 Goyal et al. Sep 2013 A1
20130262655 Deschênes et al. Oct 2013 A1
20130283373 Zisapel et al. Oct 2013 A1
20130291107 Marck et al. Oct 2013 A1
20130305357 Ayyagari et al. Nov 2013 A1
20130305392 Bar-El et al. Nov 2013 A1
20130339514 Crank et al. Dec 2013 A1
20130347018 Limp et al. Dec 2013 A1
20140007222 Qureshi et al. Jan 2014 A1
20140013434 Ranum et al. Jan 2014 A1
20140020067 Kim et al. Jan 2014 A1
20140026193 Saxman et al. Jan 2014 A1
20140040451 Agrawal et al. Feb 2014 A1
20140068035 Croy et al. Mar 2014 A1
20140075536 Davis et al. Mar 2014 A1
20140077956 Sampath et al. Mar 2014 A1
20140109168 Ashley et al. Apr 2014 A1
20140149456 Carr et al. May 2014 A1
20140164584 Joe et al. Jun 2014 A1
20140165207 Engel et al. Jun 2014 A1
20140177497 Backholm et al. Jun 2014 A1
20140189093 du Toit et al. Jul 2014 A1
20140195797 du Toit Jul 2014 A1
20140201838 Varsanyi et al. Jul 2014 A1
20140222998 Vasseur et al. Aug 2014 A1
20140223325 Melendez et al. Aug 2014 A1
20140241164 Cociglio et al. Aug 2014 A1
20140242972 Slotznick Aug 2014 A1
20140258511 Sima et al. Sep 2014 A1
20140269276 Rothstein et al. Sep 2014 A1
20140269777 Rothstein et al. Sep 2014 A1
20140280907 Rothstein et al. Sep 2014 A1
20140280908 Rothstein et al. Sep 2014 A1
20140304211 Horvitz Oct 2014 A1
20140304339 Hamilton Oct 2014 A1
20140310392 Ho Oct 2014 A1
20140317288 Krueger et al. Oct 2014 A1
20140344633 Li et al. Nov 2014 A1
20140351415 Harrigan et al. Nov 2014 A1
20150006896 Franck Jan 2015 A1
20150007314 Vaughan Jan 2015 A1
20150007316 Ben-Shalom et al. Jan 2015 A1
20150019867 Rothstein et al. Jan 2015 A1
20150019991 Kristjánsson Jan 2015 A1
20150023168 Kotecha et al. Jan 2015 A1
20150026027 Priess et al. Jan 2015 A1
20150036501 Rothstein et al. Feb 2015 A1
20150039749 Kwan et al. Feb 2015 A1
20150058987 Thure et al. Feb 2015 A1
20150063158 Nedeltchev et al. Mar 2015 A1
20150074258 Ferreira et al. Mar 2015 A1
20150074462 Jacoby Mar 2015 A1
20150089034 Stickle et al. Mar 2015 A1
20150096022 Vincent et al. Apr 2015 A1
20150097683 Sloo et al. Apr 2015 A1
20150100780 Rubin et al. Apr 2015 A1
20150106616 Nix Apr 2015 A1
20150106930 Honda et al. Apr 2015 A1
20150113588 Wing et al. Apr 2015 A1
20150121461 Dulkin et al. Apr 2015 A1
20150134554 Clais et al. May 2015 A1
20150134776 Kruglick May 2015 A1
20150149828 Mukerji et al. May 2015 A1
20150180759 Fallon Jun 2015 A1
20150180890 Ronen et al. Jun 2015 A1
20150188702 Men et al. Jul 2015 A1
20150199229 Amendjian et al. Jul 2015 A1
20150199613 Ruiz et al. Jul 2015 A1
20150227859 Ames, II Aug 2015 A1
20150229661 Balabine et al. Aug 2015 A1
20150242627 Lee et al. Aug 2015 A1
20150249512 Adimatyam et al. Sep 2015 A1
20150254439 Ao et al. Sep 2015 A1
20150269358 Hesketh et al. Sep 2015 A1
20150277802 Oikarinen et al. Oct 2015 A1
20150304350 Lin Oct 2015 A1
20150331771 Conway Nov 2015 A1
20150341379 Lefebvre et al. Nov 2015 A1
20150350167 Djakovic Dec 2015 A1
20150365438 Carver et al. Dec 2015 A1
20160006766 Joo Jan 2016 A1
20160007314 Rezvani et al. Jan 2016 A1
20160026922 Vasseur et al. Jan 2016 A1
20160028755 Vasseur et al. Jan 2016 A1
20160036647 Gonzalez et al. Feb 2016 A1
20160043919 Connelly et al. Feb 2016 A1
20160055335 Herwono et al. Feb 2016 A1
20160056959 Blom et al. Feb 2016 A1
20160080236 Nikolaev et al. Mar 2016 A1
20160093205 Boyer Mar 2016 A1
20160112475 Lawson et al. Apr 2016 A1
20160112521 Lawson et al. Apr 2016 A1
20160119215 Deschênes et al. Apr 2016 A1
20160127401 Chauhan et al. May 2016 A1
20160134659 Reddy et al. May 2016 A1
20160142435 Bernstein et al. May 2016 A1
20160147583 Ben et al. May 2016 A1
20160173288 Li et al. Jun 2016 A1
20160173556 Park et al. Jun 2016 A1
20160182274 Kiesekamp et al. Jun 2016 A1
20160197949 Nyhuis et al. Jul 2016 A1
20160219066 Vasseur et al. Jul 2016 A1
20160226913 Sood et al. Aug 2016 A1
20160241574 Kumar et al. Aug 2016 A1
20160255115 Mital et al. Sep 2016 A1
20160262044 Calin et al. Sep 2016 A1
20160285752 Joshi Sep 2016 A1
20160294870 Banerjee et al. Oct 2016 A1
20160301624 Gonzalez et al. Oct 2016 A1
20160301709 Hassanzadeh et al. Oct 2016 A1
20160308725 Tang et al. Oct 2016 A1
20160315916 Rothstein et al. Oct 2016 A1
20160337312 Buchanan et al. Nov 2016 A1
20160352761 McGrew et al. Dec 2016 A1
20160357964 Mulchandani Dec 2016 A1
20160357967 Mulchandani Dec 2016 A1
20160359872 Yadav et al. Dec 2016 A1
20160359915 Gupta et al. Dec 2016 A1
20160366020 Ramachandran et al. Dec 2016 A1
20160366186 Kamble Dec 2016 A1
20160373414 MacCarthaigh Dec 2016 A1
20160380851 Kosai et al. Dec 2016 A1
20160380885 Jani et al. Dec 2016 A1
20170012836 Tongaonkar et al. Jan 2017 A1
20170041296 Ford et al. Feb 2017 A1
20170048109 Kant et al. Feb 2017 A1
20170070416 Narayanan et al. Mar 2017 A1
20170076206 Lastras-Montano et al. Mar 2017 A1
20170085445 Layman et al. Mar 2017 A1
20170085459 Xia et al. Mar 2017 A1
20170085590 Hsu et al. Mar 2017 A1
20170090906 Reynolds Mar 2017 A1
20170093796 Wang et al. Mar 2017 A1
20170093891 Mitchell Mar 2017 A1
20170093897 Cochin et al. Mar 2017 A1
20170097982 Zhang et al. Apr 2017 A1
20170099196 Barsheshet et al. Apr 2017 A1
20170111272 Liu et al. Apr 2017 A1
20170118092 Dixon et al. Apr 2017 A1
20170123886 Vaideeswaran May 2017 A1
20170126472 Margalit et al. May 2017 A1
20170126709 Baradaran et al. May 2017 A1
20170134937 Miller et al. May 2017 A1
20170195353 Taylor et al. Jul 2017 A1
20170220739 Hammerle et al. Aug 2017 A1
20170228253 Layman et al. Aug 2017 A1
20170230270 Padinhakara et al. Aug 2017 A1
20170230417 Amar et al. Aug 2017 A1
20170270105 Ninan et al. Sep 2017 A1
20170279837 Dasgupta et al. Sep 2017 A1
20170279838 Dasgupta et al. Sep 2017 A1
20170279839 Vasseur et al. Sep 2017 A1
20170288974 Yoshihira et al. Oct 2017 A1
20170288987 Pasupathy et al. Oct 2017 A1
20170289104 Shankar et al. Oct 2017 A1
20170289168 Bar et al. Oct 2017 A1
20170289185 Mandyam Oct 2017 A1
20170289847 Wetterwald et al. Oct 2017 A1
20170310703 Ackerman et al. Oct 2017 A1
20170317941 Eggleston et al. Nov 2017 A1
20170324758 Hart et al. Nov 2017 A1
20170353437 Ayyadevara et al. Dec 2017 A1
20170353477 Faigon et al. Dec 2017 A1
20170364794 Mahkonen et al. Dec 2017 A1
20170366526 Wood et al. Dec 2017 A1
20180004972 Ruggiero et al. Jan 2018 A1
20180007087 Grady et al. Jan 2018 A1
20180013650 Khanal et al. Jan 2018 A1
20180033089 Goldman et al. Feb 2018 A1
20180034783 Rothstein et al. Feb 2018 A1
20180075240 Chen Mar 2018 A1
20180077189 Doppke et al. Mar 2018 A1
20180084011 Joseph et al. Mar 2018 A1
20180089286 Marquardt et al. Mar 2018 A1
20180091391 Turow et al. Mar 2018 A1
20180091413 Richards et al. Mar 2018 A1
20180091534 Dubrovsky et al. Mar 2018 A1
20180103056 Kohout et al. Apr 2018 A1
20180109507 Caldera et al. Apr 2018 A1
20180109557 Yoo et al. Apr 2018 A1
20180115566 Azvine et al. Apr 2018 A1
20180124078 Hajmasan et al. May 2018 A1
20180131675 Sengupta et al. May 2018 A1
20180131711 Chen et al. May 2018 A1
20180137001 Zong et al. May 2018 A1
20180139227 Martin et al. May 2018 A1
20180145995 Roeh et al. May 2018 A1
20180167310 Kamble Jun 2018 A1
20180191755 Monaco et al. Jul 2018 A1
20180198812 Christodorescu et al. Jul 2018 A1
20180219879 Pierce Aug 2018 A1
20180260715 Yan et al. Sep 2018 A1
20180262487 Zaifman et al. Sep 2018 A1
20180276561 Pasternack et al. Sep 2018 A1
20180278419 Higgins et al. Sep 2018 A1
20180324061 Khanal et al. Nov 2018 A1
20180351781 Movsisyan et al. Dec 2018 A1
20180351970 Majumder et al. Dec 2018 A1
20180375882 Kallos et al. Dec 2018 A1
20180375893 Jordan et al. Dec 2018 A1
20190005205 Dargar et al. Jan 2019 A1
20190007283 Kieviet et al. Jan 2019 A1
20190012441 Tuli et al. Jan 2019 A1
20190020669 Glatfelter et al. Jan 2019 A1
20190028357 Kokkula et al. Jan 2019 A1
20190052554 Mukerji et al. Feb 2019 A1
20190052675 Krebs Feb 2019 A1
20190068465 Khanal et al. Feb 2019 A1
20190079979 Chan Mar 2019 A1
20190095478 Tankersley et al. Mar 2019 A1
20190102469 Makovsky et al. Apr 2019 A1
20190121979 Chari et al. Apr 2019 A1
20190124123 Higgins et al. Apr 2019 A1
20190132358 DiValentin May 2019 A1
20190132359 Kraenzel et al. May 2019 A1
20190163678 Bath et al. May 2019 A1
20190171725 Shen et al. Jun 2019 A1
20190196912 Didehban et al. Jun 2019 A1
20190199609 Hammerle et al. Jun 2019 A1
20190230095 McGrew et al. Jul 2019 A1
20190236149 Kuruvada et al. Aug 2019 A1
20190245734 Wu et al. Aug 2019 A1
20190245759 Mukerji et al. Aug 2019 A1
20190245763 Wu et al. Aug 2019 A1
20190245873 Wu et al. Aug 2019 A1
20190253445 Mukerji et al. Aug 2019 A1
20190260764 Humphrey et al. Aug 2019 A1
20190266999 Chandrasekaran et al. Aug 2019 A1
20190303198 Kim et al. Oct 2019 A1
20190318109 Thomas Oct 2019 A1
20190327156 Hammerle et al. Oct 2019 A1
20190340554 Dotan-Cohen et al. Nov 2019 A1
20190372828 Wu et al. Dec 2019 A1
20190372864 Pignataro et al. Dec 2019 A1
20190387005 Zawoad et al. Dec 2019 A1
20200034528 Yang et al. Jan 2020 A1
20200052985 Ball et al. Feb 2020 A1
20200067952 Deaguero et al. Feb 2020 A1
20200076597 Higgins et al. Mar 2020 A1
20200082081 Sarin et al. Mar 2020 A1
20200099703 Singh Mar 2020 A1
20200167349 Marquardt et al. May 2020 A1
20200201850 Haggie et al. Jun 2020 A1
20200220849 Zaifman et al. Jul 2020 A1
20200236131 Vejman et al. Jul 2020 A1
20200287885 Rodniansky Sep 2020 A1
20200287927 Zadeh et al. Sep 2020 A1
20200321087 Willis et al. Oct 2020 A1
20200366691 Pierce Nov 2020 A1
20200382529 Higgins et al. Dec 2020 A1
20200389469 Litichever et al. Dec 2020 A1
20210006589 Kohout et al. Jan 2021 A1
20210012020 Malton et al. Jan 2021 A1
20210037033 Mukerji et al. Feb 2021 A1
20210037043 Lee et al. Feb 2021 A1
20210044608 Deaguero et al. Feb 2021 A1
20210160283 St. Pierre May 2021 A1
20210185087 Wu et al. Jun 2021 A1
20210194781 Wu et al. Jun 2021 A1
20210194908 Wu et al. Jun 2021 A1
20210211466 Sellers Jul 2021 A1
20210218714 Wang et al. Jul 2021 A1
20210250368 Hearty et al. Aug 2021 A1
20210288895 Wu et al. Sep 2021 A1
20210288993 Kraning et al. Sep 2021 A1
20210342337 Lu et al. Nov 2021 A1
20210350276 Ashlock et al. Nov 2021 A1
20210360004 McGrew et al. Nov 2021 A1
20210360011 O'Hara et al. Nov 2021 A1
20220019688 Nelluri et al. Jan 2022 A1
20220021694 Higgins et al. Jan 2022 A1
20220029875 Wu et al. Jan 2022 A1
20220060503 Lee et al. Feb 2022 A1
20220060518 Higgins et al. Feb 2022 A1
20220067177 Chugunov Mar 2022 A1
20220070073 Ball et al. Mar 2022 A1
20220070188 Sheedy et al. Mar 2022 A1
20220094706 Higgins et al. Mar 2022 A1
20220224716 Salji Jul 2022 A1
20220239685 Higgins et al. Jul 2022 A1
20220247771 Higgins et al. Aug 2022 A1
20220345384 Wu et al. Oct 2022 A1
20220407881 Costlow et al. Dec 2022 A1
20230087451 Rothstein et al. Mar 2023 A1
20230319047 Wu et al. Oct 2023 A1
Foreign Referenced Citations (72)
Number Date Country
2003287262 May 2004 AU
2003287262 May 2004 AU
2008328833 Jun 2009 AU
105071987 Nov 2015 CN
105323247 Feb 2016 CN
106170008 Nov 2016 CN
106341375 Jan 2017 CN
107646190 Jan 2018 CN
107667510 Feb 2018 CN
106533665 Aug 2018 CN
109104441 Dec 2018 CN
109542772 Mar 2019 CN
110113349 Aug 2019 CN
107667510 Nov 2020 CN
112085039 Dec 2020 CN
112398876 Feb 2021 CN
107646190 Mar 2021 CN
69533953 Mar 2005 DE
69533953 Apr 2006 DE
0702477 Mar 1996 EP
0702477 Jul 1999 EP
1026867 Aug 2000 EP
0702477 Jan 2005 EP
1579629 Sep 2005 EP
2057576 May 2009 EP
1579629 Nov 2009 EP
2215801 Apr 2011 EP
2057576 Apr 2012 EP
3089424 Nov 2016 EP
3094061 Nov 2016 EP
3113443 Jan 2017 EP
3306890 Apr 2018 EP
3442164 Feb 2019 EP
3477904 May 2019 EP
3794800 Nov 2019 EP
3834376 Feb 2020 EP
3394784 Oct 2020 EP
3272095 Mar 2021 EP
3477904 Nov 2021 EP
4218212 Mar 2022 EP
3794800 Nov 2022 EP
3089424 Jun 2023 EP
3442164 Aug 2023 EP
3834376 Sep 2023 EP
2924552 Jun 2009 FR
2545910 Jul 2017 GB
2545910 Feb 2018 GB
960012819 Apr 1996 KR
100388606 Nov 2003 KR
20140093060 Jul 2014 KR
101662614 Oct 2016 KR
586270 Dec 2011 NZ
2004040423 May 2004 WO
2004040423 May 2004 WO
2008026212 Mar 2008 WO
2008026212 Mar 2008 WO
2009015461 Feb 2009 WO
2009068603 Jun 2009 WO
2015128613 Sep 2015 WO
2016118131 Jul 2016 WO
2016144932 Sep 2016 WO
2016146610 Sep 2016 WO
2016191486 Dec 2016 WO
2017108575 Jun 2017 WO
2017108576 Jun 2017 WO
2018204237 Nov 2018 WO
2019032137 Feb 2019 WO
2019083555 May 2019 WO
2019221911 Nov 2019 WO
2020033005 Feb 2020 WO
2020131740 Jun 2020 WO
2022066910 Mar 2022 WO
Non-Patent Literature Citations (305)
Entry
Office Communication for U.S. Appl. No. 16/243,001 mailed Apr. 3, 2019, 16 Pages.
Office Communication for U.S. Appl. No. 16/391,216 mailed Jul. 8, 2019, 15 Pages.
Office Communication for U.S. Appl. No. 16/391,216 mailed Oct. 24, 2019, 16 Pages.
Office Communication for U.S. Appl. No. 16/424,387 mailed Oct. 18, 2019, 5 Pages.
Office Communication for U.S. Appl. No. 16/442,257 mailed Jul. 16, 2019, 11 Pages.
Office Communication for U.S. Appl. No. 16/989,025 mailed Jun. 8, 2022, 2 Pages.
Office Communication for U.S. Appl. No. 17/337,299 mailed Jun. 15, 2022, 2 Pages.
Office Communication for U.S. Appl. No. 17/483,148 mailed Mar. 2, 2022, 2 Pages.
Office Communication for U.S. Appl. No. 17/712,521 mailed Nov. 13, 2023, 8 Pages.
Office Communication for U.S. Appl. No. 17/712,521 mailed Oct. 11, 2023, 4 Pages.
Office Communication for U.S. Appl. No. 17/826,011 mailed Sep. 14, 2023, 13 Pages.
Postel Jon, “Transmission Control Protocol”, DARPA Internet Program, RFC: 793, Sep. 1981, 91 pages.
Office Communication for U.S. Appl. No. 15/466,248 mailed Apr. 15, 2019, 3 Pages.
Office Communication for U.S. Appl. No. 15/466,248 mailed Feb. 7, 2019, 32 Pages.
Office Communication for U.S. Appl. No. 17/826,011 mailed Dec. 26, 2023, 11 Pages.
Office Communication for U.S. Appl. No. 15/585,887 mailed Jan. 26, 2024, 44 Pages.
Office Communication for U.S. Appl. No. 17/516,063 mailed Feb. 7, 2024, 11 Pages.
Office Communication for U.S. Appl. No. 17/826,011 mailed Feb. 16, 2024, 6 Pages.
Office Communication for U.S. Appl. No. 17/214,555 mailed Mar. 21, 2023, pp. 1-25.
Office Communication for U.S. Appl. No. 17/712,521 mailed Mar. 21, 2023, pp. 1-13.
Office Communication for U.S. Appl. No. 16/989,343 mailed Aug. 17, 2022, pp. 1-5.
Office Communication for U.S. Appl. No. 15/585,887 mailed Sep. 1, 2022, pp. 1-39.
Office Communication for U.S. Appl. No. 17/861,373 mailed Sep. 9, 2022, pp. 1-18.
Office Communication for U.S. Appl. No. 17/318,423 mailed Sep. 13, 2022, pp. 1-15.
Office Communication for U.S. Appl. No. 17/721,514 mailed Sep. 20, 2022, pp. 1-8.
Office Communication for U.S. Appl. No. 16/679,055 mailed Sep. 21, 2022, pp. 1-25.
Office Communication for U.S. Appl. No. 17/318,423 mailed Sep. 22, 2022, pp. 1-2.
Office Communication for U.S. Appl. No. 16/679,055 mailed Sep. 28, 2022, pp. 1-2.
Office Communication for U.S. Appl. No. 17/708,311 mailed Oct. 5, 2022, pp. 1-15.
Office Communication for U.S. Appl. No. 17/515,963 mailed Oct. 7, 2022, pp. 1-27.
Office Communication for U.S. Appl. No. 17/721,514 mailed Oct. 11, 2022, pp. 1-2.
Office Communication for U.S. Appl. No. 17/516,063 mailed Oct. 31, 2022, pp. 1-10.
Office Communication for U.S. Appl. No. 17/516,063 mailed Jul. 31, 2023, pp. 1-3.
Office Communication for U.S. Appl. No. 17/712,521 mailed Aug. 2, 2023, pp. 1-14.
Office Communication for U.S. Appl. No. 17/516,063 mailed Aug. 11, 2023, pp. 1-11.
Office Communication for U.S. Appl. No. 17/516,063 mailed May 19, 2023, pp. 1-10.
Office Communication for U.S. Appl. No. 17/708,311 mailed Jun. 2, 2023, pp. 1-16.
Office Communication for U.S. Appl. No. 15/585,887 mailed Jun. 7, 2023, pp. 1-43.
Berners-Lee et al. “Uniform Resource Identifiers (URI): Generic Syntax” Network Working Group, Request for Comments: 2396, Aug. 1998, 40 pages.
Jim Shaver, “Decrypting TLS browser Traffic with wireshark—The Easy way!”, Accessed on Feb. 3, 2018, 27 pages.
Office Communication for U.S. Appl. No. 15/585,887 mailed Sep. 11, 2023, 5 Pages.
Hamid et al., A Methodology to Develop Dynamic Cost-Centric Risk Impact Metrics, Dec. 2015, International Conference on Developments of E-Systems Engineering, pp. 53-59 (Year: 2015).
Office Communication for European Application No. 16166907.2 mailed on Jan. 20, 2023, 8 Pages.
Office Communication for European Application No. 17210995.1 mailed on Jun. 2, 2021, 8 Pages.
Office Communication for European Patent Application No. 19804040.4 mailed Jun. 23, 2022, 8 Pages.
Office Communication for European Patent Application No. 17210996.9 mailed Mar. 29, 2023, 10 Pages.
Office Communication for European Patent Application No. 19846527.0 mailed Apr. 5, 2023, 9 Pages.
International Preliminary Report on Patentability Chapter I for International Patent Application No. PCT/US2017/068585 mailed May 7, 2020, 8 Pages.
International Preliminary Report on Patentability Chapter I for International Patent Application No. PCT/US2017/068586 mailed Feb. 20, 2020, 11 Pages.
International Preliminary Report on Patentability Chapter I for International Patent Application No. PCT/US2018/030145 mailed Nov. 14, 2019, 8 Pages.
International Preliminary Report on Patentability Chapter I for International Patent Application No. PCT/US2019/018097 mailed Feb. 18, 2021, 8 Pages.
International Preliminary Report on Patentability Chapter I for International Patent Application No. PCT/US2019/030015 mailed Dec. 3, 2020, 5 Pages.
International Preliminary Report on Patentability Chapter I for International Patent Application No. PCT/US2021/051757 mailed Apr. 6, 2023, 7 Pages.
Kristol et al. “HTTP State Management Mechanism”, Network Working Group, Request for Comments: 2109, Feb. 1997, 21 Pages.
Kristol et al. “HTTP State Management Mechanism”, Network Working Group, Request for Comments: 2965, Oct. 2000, 26 Pages.
Office Communication for U.S. Appl. No. 16/525,290 mailed Jul. 28, 2021, 2 Pages.
Office Communication for U.S. Appl. No. 16/048,939 mailed on Apr. 12, 2019, 5 Pages.
Office Communication for U.S. Appl. No. 16/048,939 mailed on Jan. 31, 2019, 7 Pages.
Office Communication for U.S. Appl. No. 17/708,311 mailed on Sep. 13, 2023, 11 pages.
Office Communication for U.S. Appl. No. 11/679,356 mailed Dec. 11, 2009, 23 Pages.
Office Communication for U.S. Appl. No. 11/679,356 mailed Feb. 22, 2010, 3 Pages.
Office Communication for U.S. Appl. No. 11/679,356 mailed Jun. 22, 2009, 21 Pages.
Office Communication for U.S. Appl. No. 11/679,356 mailed Mar. 4, 2011, 8 Pages.
Office Communication for U.S. Appl. No. 11/679,356 mailed Sep. 9, 2010, 27 Pages.
Office Communication for U.S. Appl. No. 14/500,893 mailed Apr. 28, 2015, 6 Pages.
Office Communication for U.S. Appl. No. 14/500,893 mailed Aug. 31, 2015, 7 Pages.
Office Communication for U.S. Appl. No. 15/014,932 mailed Dec. 19, 2018, 2 Pages.
Office Communication for U.S. Appl. No. 15/457,886 mailed Oct. 12, 2018, 3 Pages.
Office Communication for U.S. Appl. No. 15/466,248 mailed Sep. 27, 2018, 3 Pages.
Office Communication for U.S. Appl. No. 15/585,887 mailed Apr. 27, 2018, 25 Pages.
Office Communication for U.S. Appl. No. 15/585,887 mailed Jan. 15, 2019, 6 Pages.
Office Communication for U.S. Appl. No. 15/585,887 mailed Mar. 8, 2018, 6 Pages.
Office Communication for U.S. Appl. No. 15/585,887 mailed Nov. 18, 2019, 9 Pages.
Office Communication for U.S. Appl. No. 15/585,887 mailed Oct. 23, 2018, 27 Pages.
Office Communication for U.S. Appl. No. 15/585,887 mailed Sep. 3, 2019, 29 Pages.
Office Communication for U.S. Appl. No. 15/675,216 mailed Mar. 22, 2018, 8 Pages.
Office Communication for U.S. Appl. No. 15/694,229 mailed Jan. 9, 2019, 11 Pages.
Office Communication for U.S. Appl. No. 15/694,229 mailed Jul. 26, 2018, 16 Pages.
Office Communication for U.S. Appl. No. 15/793,880 mailed Mar. 1, 2018, 9 Pages.
Office Communication for U.S. Appl. No. 15/891,273 mailed Mar. 13, 2019, 6 Pages.
Office Communication for U.S. Appl. No. 15/891,311 mailed Dec. 11, 2018, 4 Pages.
Office Communication for U.S. Appl. No. 15/891,311 mailed Mar. 13, 2019, 2 Pages.
Office Communication for U.S. Appl. No. 15/893,519 mailed Dec. 12, 2018, 4 Pages.
Office Communication for U.S. Appl. No. 15/893,519 mailed Feb. 1, 2019, 21 Pages.
Office Communication for U.S. Appl. No. 15/893,519 mailed May 4, 2018, 10 Pages.
Office Communication for U.S. Appl. No. 15/893,519 mailed Sep. 27, 2018, 17 Pages.
Office Communication for U.S. Appl. No. 16/100,116 mailed Jul. 10, 2019, 4 Pages.
Office Communication for U.S. Appl. No. 16/113,442 mailed Mar. 22, 2019, 9 Pages.
Office Communication for U.S. Appl. No. 16/679,055 mailed Nov. 12, 2021, pp. 1-34.
Office Communication for U.S. Appl. No. 17/483,435 mailed Nov. 30, 2021, pp. 1-21.
Office Communication for U.S. Appl. No. 17/483,148 mailed Dec. 13, 2021, pp. 1-28.
Office Communication for U.S. Appl. No. 16/813,649 mailed Dec. 20, 2021, pp. 1-44.
Office Communication for U.S. Appl. No. 17/226,947 malled Dec. 30, 2021, pp. 1-6.
Office Communication for U.S. Appl. No. 16/820,582 mailed Jan. 14, 2022, pp. 1-13.
Office Communication for U.S. Appl. No. 16/989,025 mailed Jan. 19, 2022, pp. 1-12.
Supplementary European Search Report for European Patent Application No. 19804040.4 mailed Jan. 25, 2022, pp. 1-4.
Office Communication for U.S. Appl. No. 17/351,866 mailed Feb. 9, 2022, pp. 1-9.
International Search Report and Written Opinion for International Patent Application No. PCT/US2021/051757 mailed Jan. 11, 2022, pp. 1-9.
“Kerberos Overview—An Authentication Service for Open Network Systems,” Cisco Systems, Inc., Jan. 19, 2006, https://www.cisco.com/c/en/us/support/docs/security-vpn/kerberos/16087-1.html, Accessed: Feb. 9, 2022, pp. 1-16.
Office Communication for U.S. Appl. No. 17/337,299 mailed Feb. 17, 2022, pp. 1-14.
Office Communication for U.S. Appl. No. 16/679,055 mailed Mar. 2, 2022, pp. 1-35.
Office Communication for U.S. Appl. No. 15/585,887 mailed Mar. 24, 2022, pp. 1-40.
Office Communication for U.S. Appl. No. 17/318,423 mailed Mar. 29, 2022, pp. 1-21.
Office Communication for U.S. Appl. No. 16/989,343 mailed Mar. 29, 2022, pp. 1-5.
Office Communication for U.S. Appl. No. 16/813,649 mailed Apr. 1, 2022, pp. 1-4.
Extended European Search Report for European Patent Application No. 19846527.0 mailed Apr. 4, 2022, pp. 1-9.
Conry-Murray, Andrew, “Security Event Management Gets Specialized,” Network Magazine, CMP Media, vol. 20, Nov. 2005, pp. 1-6.
Office Communication for U.S. Appl. No. 16/679,055 mailed May 11, 2022, pp. 1-3.
Office Communication for U.S. Appl. No. 16/813,649 mailed May 11, 2022, pp. 1-16.
Beckett, David et al., “New Sensing Technique for Detecting Application Layer DDoS Attacks Targeting Back-end Database Resources,” IEEE International Conference on Communications (ICC 2017), May 2017, pp. 1-7.
Office Communication for U.S. Appl. No. 16/989,025 mailed May 23, 2022, pp. 1-14.
Office Communication for U.S. Appl. No. 16/679,055 mailed Jun. 3, 2022, pp. 1-34.
Office Communication for U.S. Appl. No. 17/708,311 mailed Jun. 20, 2022, pp. 1-15.
Office Communication for U.S. Appl. No. 17/722,217 mailed Jun. 29, 2022, pp. 1-23.
Office Communication for U.S. Appl. No. 17/226,947 mailed Jul. 11, 2022, pp. 1-13.
Office Communication for U.S. Appl. No. 17/722,217 mailed Jul. 15, 2022, pp. 1-7.
Office Communication for U.S. Appl. No. 17/721,514 mailed Jul. 21, 2022, pp. 1-7.
Office Communication for U.S. Appl. No. 16/989,343 mailed Aug. 11, 2022, pp. 1-9.
Office Communication for U.S. Appl. No. 17/214,555 mailed Nov. 10, 2022, pp. 1-21.
Office Communication for U.S. Appl. No. 15/585,887 mailed Nov. 21, 2022, pp. 1-6.
Office Communication for U.S. Appl. No. 17/708,311 mailed Dec. 21, 2022, pp. 1-4.
Office Communication for U.S. Appl. No. 15/585,887 mailed Dec. 22, 2022, pp. 1-38.
Office Communication for U.S. Appl. No. 17/861,373 mailed Jan. 11, 2023, pp. 1-10.
Office Communication for U.S. Appl. No. 17/861,373 mailed Jan. 19, 2023, pp. 1-2.
Office Communication for U.S. Appl. No. 17/515,963 mailed Jan. 24, 2023, pp. 1-8.
Office Communication for U.S. Appl. No. 17/515,963 mailed Feb. 1, 2023, pp. 1-2.
Office Communication for U.S. Appl. No. 13/831,673 mailed Sep. 30, 2013, pp. 1-10.
Office Communication for U.S. Appl. No. 13/831,673 mailed Mar. 6, 2014, pp. 1-12.
Office Communication for U.S. Appl. No. 13/831,673 mailed May 22, 2014, pp. 1-5.
Office Communication for U.S. Appl. No. 13/831,626 mailed Sep. 3, 2013, pp. 1-17.
Office Communication for U.S. Appl. No. 13/831,959 mailed Aug. 22, 2013, pp. 1-9.
Handel, Theodore G. et al., “Hiding data in the OSI network model.” In: Anderson R. (eds) Information Hiding. IH 1996. Lecture Notes in Computer Science, vol. 1174. Springer, Berlin, Heidelberg. pp. 23-38.
Office Communication for U.S. Appl. No. 14/500,893 mailed Nov. 20, 2014, pp. 1-15.
Office Communication for U.S. Appl. No. 14/107,580 mailed Mar. 6, 2014, pp. 1-13.
Office Communication for U.S. Appl. No. 14/107,580 mailed Sep. 15, 2014, pp. 1-15.
Office Communication for U.S. Appl. No. 13/831,908 malled Aug. 9, 2013, pp. 1-29.
Office Communication for U.S. Appl. No. 13/831,908 mailed Jan. 13, 2014, pp. 1-31.
Office Communication for U.S. Appl. No. 13/831,908 mailed Apr. 9, 2014, pp. 1-3.
Office Communication for U.S. Appl. No. 13/831,908 mailed Jun. 25, 2014, pp. 1-15.
Office Communication for U.S. Appl. No. 14/518,996 mailed Nov. 20, 2014, pp. 1-41.
Office Communication for U.S. Appl. No. 14/107,631 mailed Feb. 20, 2014, pp. 1-16.
Office Communication for U.S. Appl. No. 14/107,631 mailed Sep. 26, 2014, pp. 1-14.
Office Communication for U.S. Appl. No. 14/107,631 mailed Dec. 30, 2014, pp. 1-12.
Handley, Mark et al., “Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics,” 2011, International Computer Science Institute, pp. 1-17.
Information Sciences Institute, “Internet Protocol Darpa Internet Program Protocol Specification,” Sep. 1981, pp. 1-36.
Fuertes, Juan Antonio Cordero, “Evaluation of OSPF Extensions in MANET Routing,” Paris, 2007, pp. 1-192.
Parsons, Christopher, “Moving Across the Internet: Code-Bodies, Code-Corpses, and Network Architecture,” May 9, 2010, pp. 1-20.
Zander, Sebastian et al., “Covert Channels and Countermeasures in Computer Network Protocols,” Dec. 2007, pp. 1-7.
Office Communication for U.S. Appl. No. 14/107,580 mailed Mar. 17, 2015, pp. 1-5.
Lin, Mark, “An Overview of Session Hijacking at the Network and Application Levels,” Jan. 18, 2005, pp. 1-16.
U.S. Appl. No. 11/683,643, filed Mar. 8, 2007, pp. 1-48.
U.S. Appl. No. 11/679,356, filed Feb. 27, 2007, pp. 1-45.
Office Communication for U.S. Appl. No. 12/326,672 mailed Jun. 9, 2010, pp. 1-9.
Office Communication for U.S. Appl. No. 12/326,672 mailed Dec. 23, 2010, pp. 1-15.
Office Communication for U.S. Appl. No. 12/326,672 mailed Jun. 22, 2011, pp. 1-16.
Office Communication for U.S. Appl. No. 12/326,672 mailed Oct. 24, 2011, pp. 1-9.
Office Communication for U.S. Appl. No. 11/683,643 mailed Apr. 28, 2010, pp. 1-35.
Office Communication for U.S. Appl. No. 11/683,643 mailed Oct. 14, 2010, pp. 1-43.
Office Communication for U.S. Appl. No. 11/683,643 mailed Aug. 25, 2011, pp. 1-43.
Office Communication for U.S. Appl. No. 11/683,643 mailed Jan. 23, 2012, pp. 1-22.
Office Communication for U.S. Appl. No. 15/014,932 mailed Jun. 10, 2016, pp. 1-20.
Office Communication for U.S. Appl. No. 15/207,213 mailed Oct. 25, 2016, pp. 1-18.
Office Communication for U.S. Appl. No. 15/014,932 mailed Dec. 14, 2016, pp. 1-26.
Digital Imaging and Communications in Medicine (DICOM), Part 6: Data Dictionary, PS 3.6-2011. 2011, http:/dicom.nema.org/Dicom/2011 /11_06pu.pdf, pp. 1-216.
Health Level Seven, Version 2.6, Appendix A. Nov. 2007, https://www.hl7.org/special/committees/vocab/V26_Appendix_A.pdf, pp. 1-255.
Office Communication for U.S. Appl. No. 15/207,213 mailed Feb. 23, 2017, pp. 1-24.
Office Communication for U.S. Appl. No. 15/014,932 mailed March 3, 2017, pp. 1-6.
Office Communication for U.S. Appl. No. 15/207,213 mailed May 8, 2017, pp. 1-6.
Office Communication for U.S. Appl. No. 15/207,213 mailed Jun. 1, 2017, pp. 1-24.
Office Communication for U.S. Appl. No. 15/014,932 mailed Aug. 1, 2017, pp. 1-27.
Office Communication for U.S. Appl. No. 15/690,135 mailed Jan. 18, 2018, pp. 1-6.
Office Communication for U.S. Appl. No. 15/891,311 mailed Apr. 23, 2018, pp. 1-18.
Office Communication for U.S. Appl. No. 15/892,327 mailed Apr. 23, 2018, pp. 1-6.
Office Communication for U.S. Appl. No. 15/014,932 mailed May 15, 2018, pp. 1-23.
Office Communication for U.S. Appl. No. 15/891,273 mailed Jun. 19, 2018, pp. 1-20.
Office Communication for U.S. Appl. No. 15/014,932 mailed Jul. 16, 2018, pp. 1-4.
Office Communication for U.S. Appl. No. 15/690,135 mailed May 22, 2018, pp. 1-7.
Office Communication for U.S. Appl. No. 15/984,197 mailed Aug. 31, 2018, pp. 1-25.
Office Communication for U.S. Appl. No. 15/891,311 mailed Sep. 24, 2018, pp. 1-14.
Office Communication for U.S. Appl. No. 16/048,939 mailed Sep. 19, 2018, pp. 1-9.
Office Communication for U.S. Appl. No. 16/113,442 mailed Nov. 6, 2018, pp. 1-10.
Office Communication for U.S. Appl. No. 16/100,116 mailed Nov. 15, 2018, pp. 1-7.
Office Communication for U.S. Appl. No. 15/014,932 mailed Nov. 23, 2018, pp. 1-10.
Office Communication for U.S. Appl. No. 16/107,509 mailed Oct. 26, 2018, pp. 1-26.
Office Communication for U.S. Appl. No. 15/891,273 mailed Jan. 15, 2019, pp. 1-23.
Office Communication for U.S. Appl. No. 15/891,311 mailed Jan. 29, 2019, pp. 1-8.
Office Communication for U.S. Appl. No. 16/174,051 mailed Jan. 29, 2019, pp. 1-21.
Office Communication for U.S. Appl. No. 15/671,060 mailed May 8, 2019, pp. 1-19.
Office Communication for U.S. Appl. No. 16/113,442 mailed Jun. 5, 2019, pp. 1-8.
Office Communication for U.S. Appl. No. 15/891,273 mailed May 28, 2019, pp. 1-14.
Office Communication for U.S. Appl. No. 16/107,509 mailed Apr. 1, 2019, pp. 1-21.
Office Communication for U.S. Appl. No. 16/048,939 mailed Jun. 20, 2019, pp. 1-8.
Office Communication for U.S. Appl. No. 16/100,116 mailed May 30, 2019, pp. 1-5.
Office Communication for U.S. Appl. No. 16/384,574 mailed May 31, 2019, pp. 1-12.
Office Communication for U.S. Appl. No. 16/107,509 mailed Jun. 14, 2019, pp. 1-5.
Office Communication for U.S. Appl. No. 16/107,509 mailed Aug. 21, 2019, pp. 1-25.
Office Communication for U.S. Appl. No. 16/384,574 mailed Oct. 8, 2019, pp. 1-13.
Office Communication for U.S. Appl. No. 16/543,243 mailed Sep. 27, 2019, pp. 1-24.
Office Communication for U.S. Appl. No. 16/048,939 mailed Dec. 5, 2019, pp. 1-9.
Office Communication for U.S. Appl. No. 16/565,109 mailed Nov. 27, 2019, pp. 1-18.
Office Communication for U.S. Appl. No. 16/525,290 mailed Oct. 31, 2019, pp. 1-9.
Office Communication for U.S. Appl. No. 16/532,275 mailed Oct. 24, 2019, pp. 1-29.
Office Communication for U.S. Appl. No. 16/560,886 mailed Dec. 6, 2019, pp. 1-17.
Office Communication for U.S. Appl. No. 14/500,893 mailed Feb. 18, 2015, pp. 1-11.
Office Communication for U.S. Appl. No. 14/518,996 mailed Apr. 20, 2015, pp. 1-37.
Office Communication for U.S. Appl. No. 14/500,893 mailed Jun. 15, 2015, pp. 1-12.
Office Communication for U.S. Appl. No. 14/518,996 mailed Jul. 21, 2015, pp. 1-17.
Office Communication for U.S. Appl. No. 14/695,690 mailed Sep. 9, 2015, pp. 1-41.
Office Communication for U.S. Appl. No. 14/695,690 mailed Feb. 24, 2016, pp. 1-11.
Office Communication for U.S. Appl. No. 15/150,354 mailed Jul. 5, 2016, pp. 1-18.
Mozilla Developer Network, “NSS Key Log Format,” https://developer.mozilla.org/en-US/docs/Mozilla/Projects/NSS/Key_Log_Format, Jan. 8, 2010, p. 1.
Extended European Search Report for European Patent Application No. 16166907.2 mailed Sep. 30, 2016, pp. 1-7.
Office Communication for U.S. Appl. No. 15/150,354 mailed Feb. 8, 2017, pp. 1-8.
Office Communication for U.S. Appl. No. 15/466,248 mailed Jun. 5, 2017, pp. 1-30.
Office Communication for U.S. Appl. No. 15/466,248 mailed Oct. 3, 2017, pp. 1-34.
Office Communication for U.S. Appl. No. 15/457,886 mailed Jan. 5, 2018, pp. 1-11.
Office Communication for U.S. Appl. No. 15/466,248 mailed Jan. 11, 2018, pp. 1-2.
Examination Report for European Patent Application No. 16166907.2 mailed Mar. 9, 2018, pp. 1-4.
Shaver, Jim, “Decrypting TLS Browser Traffic with Wireshark the easy way”, https://jimshaver.net/2015/02/11/decrypting-tls-browser-traffic-with-wireshark-the-easy-way/, Feb. 11, 2015, pp. 1-30.
Office Communication for U.S. Appl. No. 15/466,248 mailed Mar. 8, 2018, pp. 1-34.
Office Communication for U.S. Appl. No. 15/457,886 mailed Jul. 18, 2018, pp. 1-11.
Office Communication for U.S. Appl. No. 15/466,248 mailed Jul. 11, 2018, pp. 1-31.
International Search Report and Written Opinion for International Patent Application No. PCT/US2017/068585 mailed Jul. 4, 2018, pp. 1-11.
Extended European Search Report for European Patent Application No. 17210995.1 mailed Jul. 6, 2018, pp. 1-11.
Office Communication for U.S. Appl. No. 15/466,248 mailed Oct. 18, 2018, pp. 1-31.
Office Communication for U.S. Appl. No. 15/457,886 mailed Mar. 20, 2019, pp. 1-9.
Office Communication for U.S. Appl. No. 15/466,248 mailed May 16, 2019, pp. 1-33.
Office Communication for U.S. Appl. No. 15/466,248 mailed Sep. 10, 2019, pp. 1-27.
Office Communication for U.S. Appl. No. 15/971,843 mailed Oct. 22, 2019, pp. 1-15.
Office Communication for U.S. Appl. No. 14/750,905 mailed Sep. 22, 2015, pp. 1-12.
Office Communication for U.S. Appl. No. 14/750,905 mailed Jan. 19, 2016, pp. 1-5.
Office Communication for U.S. Appl. No. 15/082,925 mailed Sep. 13, 2016, pp. 1-7.
Office Communication for U.S. Appl. No. 15/289,760 mailed Dec. 12, 2016, pp. 1-12.
Office Communication for U.S. Appl. No. 15/219,016 mailed Nov. 22, 2016, pp. 1-12.
Office Communication for U.S. Appl. No. 15/356,381 mailed Jan. 6, 2017, pp. 1-57.
Office Communication for U.S. Appl. No. 15/082,925 mailed Feb. 1, 2017, pp. 1-6.
Office Communication for U.S. Appl. No. 15/219,016 mailed Mar. 16, 2017, pp. 1-9.
Office Communication for U.S. Appl. No. 15/443,868 mailed Apr. 27, 2017, pp. 1-7.
Office Communication for U.S. Appl. No. 15/585,887 mailed Jun. 27, 2017, pp. 1-24.
Office Communication for U.S. Appl. No. 15/356,381 mailed Jul. 3, 2017, pp. 1-21.
Office Communication for U.S. Appl. No. 15/675,216 mailed Jun. 7, 2018, pp. 1-4.
Office Communication for U.S. Appl. No. 15/443,868 mailed Aug. 11, 2017, pp. 1-11.
Office Communication for U.S. Appl. No. 15/675,216 mailed Nov. 20, 2017, pp. 1-7.
Office Communication for U.S. Appl. No. 15/585,887 mailed Nov. 28, 2017, pp. 1-23.
International Search Report and Written Opinion for International Patent Application No. PCT/US2018/030145 mailed Aug. 10, 2018, pp. 1-12.
Svoboda, Jakub, “Network Traffic Analysis with Deep Packet Inspection Method,” Masaryk University, Faculty of Informatics, Master's Thesis, 2014, pp. 1-74.
International Search Report and Written Opinion for International Patent Application No. PCT/US2017/068586 mailed Aug. 9, 2018, pp. 1-14.
Extended European Search Report for European Patent Application No. 17210996.9 mailed Jun. 13, 2018, pp. 1-7.
Office Communication for U.S. Appl. No. 15/855,769 mailed Feb. 5, 2019, pp. 1-10.
Office Communication for U.S. Appl. No. 15/855,769 mailed May 1, 2019, pp. 1-7.
Office Communication for U.S. Appl. No. 16/459,472 mailed Aug. 14, 2019, pp. 1-15.
Office Communication for U.S. Appl. No. 15/585,887 mailed Mar. 20, 2019, pp. 1-26.
Office Communication for U.S. Appl. No. 15/675,216 mailed Aug. 28, 2018, pp. 1-14.
Office Communication for U.S. Appl. No. 15/675,216 mailed Jan. 29, 2019, pp. 1-8.
Office Communication for U.S. Appl. No. 16/384,697 mailed May 30, 2019, pp. 1-12.
Office Communication for U.S. Appl. No. 16/384,574 mailed Jan. 13, 2020, pp. 1-9.
Office Communication for U.S. Appl. No. 16/107,509 mailed Jan. 23, 2020, pp. 1-12.
Office Communication for U.S. Appl. No. 15/585,887 mailed Jan. 22, 2020, pp. 1-28.
Office Communication for U.S. Appl. No. 16/384,697 mailed Oct. 17, 2019, pp. 1-8.
Office Communication for U.S. Appl. No. 16/459,472 mailed Feb. 3, 2020, pp. 1-7.
Office Communication for U.S. Appl. No. 16/679,055 mailed Feb. 14, 2020, pp. 1-32.
Office Communication for U.S. Appl. No. 16/048.939 mailed Feb. 18, 2020, pp. 1-6.
Office Communication for U.S. Appl. No. 16/424,387 mailed Feb. 24, 2020, pp. 1-15.
Office Communication for U.S. Appl. No. 16/718,050 mailed Feb. 27, 2020, pp. 1-21.
Wade, Susan Marie, ““Scada Honeynets: The attractiveness of honeypots as critical infrastructure security tools for the detection and analysis of advanced threats”” (2011). Graduate Theses and Dissertations. 12138. https://lib.dr.iastate.edu/etd/12138, pp. 1-67.
Office Communication for U.S. Appl. No. 16/525,290 mailed Mar. 12, 2020, pp. 1-10.
Office Communication for U.S. Appl. No. 15/971,843 mailed Mar. 26, 2020, pp. 1-14.
Office Communication for U.S. Appl. No. 16/048,939 mailed Mar. 26, 2020, pp. 1-6.
Office Communication for U.S. Appl. No. 16/543,243 mailed Apr. 7, 2020, pp. 1-22.
Office Communication for U.S. Appl. No. 16/532,275 mailed Apr. 20, 2020, pp. 1-8.
Office Communication for U.S. Appl. No. 16/560,886 mailed Apr. 22, 2020, pp. 1-10.
Office Communication for U.S. Appl. No. 16/565,109 mailed May 8, 2020, pp. 1-19.
Examination Report for European Patent Application No. 16166907.2 mailed Dec. 19, 2019, pp. 1-6.
Examination Report for European Patent Application No. 17210996.9 mailed May 27, 2020, pp. 1-3.
Office Communication for U.S. Appl. No. 15/585,887 mailed Aug. 28, 2020, pp. 1-30.
Office Communication for U.S. Appl. No. 16/679,055 mailed Sep. 4, 2020, pp. 1-5.
Office Communication for U.S. Appl. No. 16/718,050 mailed Sep. 4, 2020, pp. 1-23.
Office Communication for U.S. Appl. No. 16/525,290 mailed Sep. 23, 2020, pp. 1-10.
International Search Report and Written Opinion for International Patent Application No. PCT/US2019/030015 mailed Aug. 7, 2019, pp. 1-6.
International Search Report and Written Opinion for International Patent Application No. PCT/US2019/018097 mailed May 28, 2019, pp. 1-9.
Office Communication for U.S. Appl. No. 15/971,843 mailed Oct. 27, 2020, pp. 1-11.
Office Communication for U.S. Appl. No. 16/424,387 mailed Nov. 24, 2020, pp. 1-23.
Office Communication for U.S. Appl. No. 16/543,243 mailed Dec. 16, 2020, pp. 1-13.
Office Communication for U.S. Appl. No. 16/565,109 mailed Jan. 19, 2021, pp. 1-9.
Office Communication for U.S. Appl. No. 16/813,649 mailed Feb. 24, 2021, pp. 1-7.
Office Communication for U.S. Appl. No. 16/679,055 mailed Mar. 16, 2021, pp. 1-33.
Office Communication for U.S. Appl. No. 15/585,887 mailed Mar. 26, 2021, pp. 1-31.
Office Communication for U.S. Appl. No. 16/525,290 mailed Mar. 31, 2021, pp. 1-11.
Office Communication for U.S. Appl. No. 15/971,843 mailed May 5, 2021, pp. 1-9.
Office Communication for U.S. Appl. No. 16/820,582 mailed May 10, 2021, pp. 1-24.
Office Communication for U.S. Appl. No. 16/525,290 mailed Jun. 15, 2021, pp. 1-4.
Examination Report for European Patent Application No. 17210996.9 mailed May 21, 2021, pp. 1-6.
Office Communication for U.S. Appl. No. 16/525,290 mailed Jul. 9, 2021, pp. 1-7.
Office Communication for U.S. Appl. No. 16/679,055 mailed Jul. 26, 2021, pp. 1-34.
Office Communication for U.S. Appl. No. 16/718,050 mailed Jul. 27, 2021, pp. 1-23.
Office Communication for U.S. Appl. No. 15/971,843 mailed Jul. 28, 2021, pp. 1-9.
Office Communication for U.S. Appl. No. 15/585,887 mailed Aug. 17, 2021, pp. 1-41.
Office Communication for U.S. Appl. No. 16/820,582 mailed Sep. 27, 2021, pp. 1-25.
Office Communication for U.S. Appl. No. 16/679,055 mailed Oct. 12, 2021, pp. 1-3.
Office Communication for U.S. Appl. No. 17/351,866 mailed Oct. 18, 2021, pp. 1-12.
Office Communication for U.S. Appl. No. 17/337,299 mailed Oct. 21, 2021, pp. 1-34.
Office Communication for U.S. Appl. No. 15/585,887 mailed Nov. 2, 2021, pp. 1-4.
Office Communication for U.S. Appl. No. 17/226,947 mailed Dec. 30, 2021, pp. 1-6.
Office Communication for U.S. Appl. No. 13/831,908 mailed Aug. 9, 2013, pp. 1-29.
Office Communication for U.S. Appl. No. 15/014,932 mailed Mar. 3, 2017, pp. 1-6.
Related Publications (1)
Number Date Country
20220053022 A1 Feb 2022 US
Continuations (1)
Number Date Country
Parent 16718050 Dec 2019 US
Child 17516529 US