Patent Grant
11546153
The present invention relates generally to network monitoring, and more particularly, but not exclusively, to monitoring network traffic in a distributed network environment.
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 and/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 four to seven, 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 agent running on the client or server. In virtual environments, port mirroring may be performed on a virtual switch that is incorporated within the hypervisor.
In some instances, a proxy is actively arranged between two endpoints, such as a client device and a server device. The proxy intercepts each packet sent by each endpoint and optionally transforms and forwards the payload to the other endpoint. Proxies often enable a variety of additional services such as load balancing, caching, content filtering, and access control. In some instances, the proxy may operate as a network monitor. In other instances, the proxy may forward a copy of the packets to a separate network monitor.
In some networks, packet capture devices may be installed. Packet capture devices may be arranged to capture and store network packets for subsequent analysis. However, the sheer amount of data communicated over networks may result in a prohibitively high number of network packets. Accordingly, packets and/or portions of packets may be selectively captured to reduce data storage requirements. In addition, as information technology infrastructure becomes more complex and more dynamic, there may be numerous packet types and formats for the various different types of network protocols and applications that may be carried on modern networks that it difficult for effective network packet capture. Thus, it is with respect to these considerations and others that the present invention has been made.
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:
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 innovations 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. Also, throughout the specification and the claims, the use of “when” and “responsive to” do not imply that associated resultant actions are required to occur immediately or within a particular time period. Instead they are used herein to indicate actions that may occur or be performed in response to one or more conditions being met, 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, JavaScript, Ruby, VBScript, Microsoft .NET™ languages such as C#, and/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 at least one 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 at least one 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 terms “tuple” and “tuple information” refer 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.
As used herein, the terms “network monitor”, “network monitoring computer”, or “NMC” refer to an engine (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 at least one embodiment, 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, 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 and/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 and/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 at least one of the various embodiments, NMCs and/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.
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 “key information” refers to cryptographic keys or other secrets that may be associated with a secure communication session. The key information may vary depending on the cipher suites or cryptographic applications that may be used for secure communication. If encrypted network packets are provided with its corresponding key information, an application may be enabled to decrypt the encrypted packets. Key information may include pre-master secrets, master secrets, session key material, or the like, or combination thereof.
As used herein the “correlation information” refers to information that may be used to correlate key information with particular flows, sessions, or connections, or the like. Correlation information may include various values that may be associated with a flow, such as, tuple information, client/server random numbers, handshake hashes, date-time information, timestamps, or the like, or combination thereof. Generally, correlation information may be information that a NMC may determine or observe without using the key information or decrypting the encrypted network traffic. Correlation information is stored in a key escrow with its corresponding key information.
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 to capturing packets on a network. In one or more of the various embodiments, network monitoring computers (NMCs) may be arranged to passively monitor networks used by various computers or computing devices. In some embodiments, NMCs may be arranged to capture monitored network traffic. Selecting which network traffic to capture may be determined based on configuration information or policy rules.
In one or more of the various embodiments, the network traffic may be secured using a variety of security methods, including encryption. Accordingly, the NMC may be arranged to monitor the secure communication sessions to obtain key information, correlation information, or the like, to enable the NMC to decrypt the network traffic.
In one or more of the various embodiments, key information used by secure session communication sessions may be generated on a per session basis and arranged to ensure that only the participants in the secure communication session may be enabled to generate the keys necessary for decrypting the network traffic associated with the secure sessions. Accordingly, key information may be stored in the key escrow and correlated with correlation information associated with the network traffic that comprises a secure communication session. In some embodiments, the NMC may be arranged to decrypt secure traffic in real-time. In other cases, an NMC may be arranged to capture network traffic for later decryption.
In one or more of the various embodiments, communication over a network between one or more computers may be monitored using one or more network monitoring computers (NMCs). In one or more of the various embodiments, a plurality of network packets that are communicated between the one or more computers may be captured such that, the plurality of captured network packets may be stored in a data store.
In one or more of the various embodiments, if the one or more NMCs identify a secure communication session established between two of the one or more computers, the NMCs may be arranged to obtain key information that corresponds to the secure communication session such that the key information includes a session key that may be provided by a key provider. In one or more of the various embodiments, the correlation information may be collected that may be associated with the secure communication session. In some embodiments, the correlation information may include tuple information associated with the secure communication session. And, in one or more of the various embodiments, the key information and the correlation information may be stored in a key escrow with the key information indexed in the key escrow based on the correlation information.
In one or more of the various embodiments, if a query is provided to the key escrow, the query may be employed to provide a result set that may include query result correlation information and query result key information. Also, one or more captured network packets may be provided from the data store based on the query result correlation information. And, in one or more of the various embodiments, the one or more captured network packets may be decrypted based on the query result key information.
In one or more of the various embodiments, the key provider may be a secret sharing engine executing on one or more of the two computers, or a network hardware security module.
In one or more of the various embodiments, the correlation information may include an encrypted pre-master secret, Diffie-Hellman public information, a secure socket layer (SSL) session identifier, one or more tuples, one or more client-server random values, or one or more digest values comprised of one or more fields or payload values of one or more network packets comprising the secure communication session.
In one or more of the various embodiments, the correlation information, may further include, other information based on one or more network packets that may be associated with one or more handshake messages used to establish the secure communication session. In some embodiments, the correlation information may also include tuple information for a network connection flow that may correspond to the secure communication session based on there being an association of one or more portions of the correlation information and one or more portions of the key information.
In one or more of the various embodiments, one or more previously captured network packets associated with one or more secure communication sessions may be provided. In some embodiments, key information associated with the one or more previously captured network packets may be provided based on the correlation information that may be associated with the one or more previously captured network packets. And, in one or more of the various embodiments, the one or more previously captured network packets may be decrypted using the key information.
In one or more of the various embodiments, if network packets associated with the key information and the correlation information may be absent from the data store, the key information and the correlation information may be discarded from the key escrow. For example, network packets may be overwritten or expire from the data store. In some embodiments, this may be occur due to storage constraints or according to policy. Similarly, in some embodiments, there may be a policy to purge key information or correlation information after a period of time.
Illustrated Operating Environment
At least one embodiment of client computers 102-105 is described in more detail below in conjunction with
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 and/or send content between another computer. The client application may include a capability to send and/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, application server computer 117, 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, application server computer 117, 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, or the like, to network monitoring computer 118. Also, client computers may be arranged to enable users to display reports, interactive user-interfaces, and/or results provided by network monitoring computer 118.
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 Mobile 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, application server computer 117, 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, and/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 of an 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 and/or application server computer 117 is described in more detail below in conjunction with
One embodiment of network monitoring computer 118 is described in more detail below in conjunction with
Although
Illustrative Client Computer
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 to measuring and/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 and/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 such as Global System 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 (NIC).
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 and/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 and/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 and/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 and/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, and/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 and/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 and/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 at least one 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 and/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 Piconet 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 at least one 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), HTMLS, and the like.
Memory 204 may include RAM, ROM, and/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/UEFI 208 (Basic Input/Output System or Unified Extensible Firmware Interface) 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 Apple Inc's iOS, 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 and/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 and/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, and/or otherwise process instructions and data. Applications 220 may include, for example, crypto provider 222, secret sharing engine 224, other client applications 226, web browser 227, 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 and/or network monitoring computers.
Secret sharing engine 224 may be a process or service that is arranged to communicate one or more cryptographic secrets, key information, or the like, to one or more NMCs, such as, NMC 116. Further, in at least one of the various embodiments, secret sharing engine 224 may be arranged to be a plug-in of browser 227. Also, in at least one of the various embodiments, secret sharing engine 224 may be embedded into cryptographic provider and/or a plug-in associated with cryptographic provider 222. Also, in some embodiments, secret sharing engine 224 may be arranged to communicate one or more cryptographic secrets, key information, or the like, to a key escrow.
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 in addition to or instead of one or more CPUs, such as, an Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), Programmable Array Logics (PALs), or the like, or combination thereof. The one or more 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 in addition to or instead of one or more CPUs. In at least one embodiment, the one or more microcontrollers may directly execute their own embedded logic to perform actions and access its own internal memory and its own external Input and Output Interfaces (e.g., hardware pins and/or wireless transceivers) to perform actions as a System On a Chip (SOC), or the like.
Illustrative Network Computer
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 and/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. 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
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 and/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 and/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 at least one 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.
Memory 304 may include Random Access Memory (RAM), Read-Only Memory (ROM), and/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 BIOS/UEFI 308 (Basic Input/Output System or Unified Extensible Firmware Interface) 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 Inc.'s, macOS® operating system. The operating system may include, or interface with a Java virtual machine module that enables control of hardware components and/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 and/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 410 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, capture database 312, protocol information 316, or the like. Capture database 312 may be a data store that contains one or more records, logs, events, network packets, network packet portions, or the like, produced during monitoring of the networks. And, protocol information 316 may store various rules and/or configuration information related to one or more network communication protocols that may be employed, or the like.
Applications 320 may include computer executable instructions which, when executed by network computer 300, transmit, receive, and/or otherwise process messages (e.g., SMS, Multimedia Messaging Service (MMS), Instant Message (IM), email, and/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, databases, web services, and so forth. Applications 320 may include network monitoring engine 322 packet capture engine 324, crypto provider 326, or secret sharing engine 327 that perform actions further described below. In at least one of the various embodiments, one or more of the engines may be implemented as modules and/or components of another engine. Further, in at least one of the various embodiments, engines or applications may be implemented as operating system extensions, modules, plugins, or the like.
Secret sharing engine 327 may be a process or service that is arranged to communicate one or more cryptographic secrets, key information, or the like, to one or more NMCs, such as, NMC 116. Further, in at least one of the various embodiments, secret sharing engine 327 may be arranged to be a plug-in of a web browser or other engine or application. Also, in at least one of the various embodiments, secret sharing engine 327 may be embedded into cryptographic provider and/or a plug-in associated with cryptographic provider 326. Also, in some embodiments, secret sharing engine 327 may be arranged to communicate one or more cryptographic secrets, key information, or the like, to a key escrow.
Furthermore, in at least one of the various embodiments, network monitoring engine 322, packet capture engine 324, crypto provider 326, or secret sharing engine 327 may be operative in a cloud-based computing environment. In at least one of the various embodiments, these engines, and others, that comprise the management platform may be executing within virtual machines and/or virtual servers that may be managed in a cloud-based based computing environment. In at least one of the various embodiments, in this context the engines 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 at least one of the various embodiments, virtual machines and/or virtual servers dedicated to network monitoring engine 322, packet capture engine 324, crypto provider 326, or secret sharing engine 327 may be provisioned and de-commissioned automatically.
Also, in at least one of the various embodiments, network monitoring engine 322, packet capture engine 324, crypto provider 326, or secret sharing engine 327, 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.
Further, network computer 300 may also comprise hardware security module (HSM) 360 for providing additional tamper resistant safeguards for generating, storing and/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, and/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 in addition to or instead of one or more CPUs, such as, an Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), Programmable Array Logics (PALs), or the like, or combination thereof. The one or more embedded logic hardware devices may directly execute embedded logic to perform actions. Also, in one or more embodiments (not shown in the figures), network computer 300 may include one or more hardware microcontrollers in addition to or instead of one or more CPUs. In at least one embodiment, the one or more microcontrollers may directly execute their own embedded logic to perform actions and access its own internal memory and its own external Input and Output Interfaces (e.g., hardware pins and/or wireless transceivers) to perform actions as a System On a Chip (SOC), or the like.
Illustrative Logical System Architecture
NMC 408 may be arranged to receive network traffic 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, 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.
In at least one of the various embodiments, NMCs, such as, NMC 408 may be arranged to capture data from some or all observed network flows. In modern network environments some or more all of the network traffic may be encrypted. Accordingly, NMC 408 may be arranged to capture encrypted packets and endpoint keying information such that they may be decrypted in real-time for real-time monitoring. In some embodiments, NMC 408 may be arranged to correlate keying information with previously captured encrypted packets to support off-line decryption of captured encrypted packets.
In at least one of the various embodiments, an NMC, such as, NMC 408 may be arranged to passively observe both directions of network flows. Accordingly, an NMC may be arranged to observe the network conversation between different endpoints in the monitored network. In some embodiments, NMCs may be arranged to monitor both directions of a transaction based traffic between endpoints. Accordingly, in at least one of the various embodiments, NMCs may be arranged to identify network flows that may be using request/response protocols.
As described above, in at least one of the various embodiments, NMCs may be arranged to monitor network flows to observe or record various metrics associated with the flow traffic. In some embodiments, metrics, such as, traffic rate, changes in traffic rate, latency, traffic volume, or the like, or combination thereof, may be employed to identify turns. Further, since the NMC has access to the wire traffic, it has access to the entire OSI layer stack. Accordingly, metrics collected at lower layers may be correlated with information from higher layers to characterize network traffic and identify turns.
Further, in some embodiments, NMCs may be arranged to recognize and understand various well-known application level protocols, such as, HTTP, SMTP, FTP, DNS, POP3, IMAP, or the like. Accordingly, in at least one of the various embodiments, NMCs may observe communication between clients and servers and use rules to identify if interesting or actionable traffic may be occurring.
Further, in at least one of the various embodiments, NMCs may be arranged to discover network applications, such as, databases, media servers (e.g., video streaming, music streaming, or the like), video conferencing/chatting, VOIP applications, web servers, or the like. Thus, in some embodiments, NMCs may be arranged to monitor the traffic of network flows in the context of the particular applications.
In at least one of the various embodiments, NMCs may be arranged to employ various conditions, rules, pattern matching, heuristics, or the like, or combination thereof, implemented using scripts, compiled computer languages, ASICs, FGPAs, PALs, or the like, or combination thereof. In some embodiments, NMCs may be arranged include one or more conditions, rules, pattern matching, heuristics, or the like, that may be arranged to identify protocols, applications, turns, or the like, for various known network protocols, application protocols, network applications, or the like. Also, in at least one of the various embodiments, NMCs may be arranged to enable users to install additional custom/specialized conditions, rules, pattern matching, heuristics, or the like, to identify other protocols, applications, network applications, or the like.
In at least one of the various embodiments, client computer 502 may be a computer that has one or more applications that may be arranged to securely communicate with application server computer 504 over network path 514. Secure communication may be comprised of one or more cryptographically secure network communication protocols, including, SSL/TLS, SSH, IPsec, or the like, or combination thereof. For example, in some embodiments, client computer 502 may be hosting a web browser that is securely accessing a website that is served by a web server running on application server computer 504. Another non-limiting example, may include client computer 502 accessing an application running on application server computer 504 over a virtual private network. As described above, NMC 506 may be arranged to passively monitor the network packets passing through network path 514. Accordingly, NMC 506 may be arranged to monitor the network traffic comprising communication between client computer 502 and application server computer 504.
In at least one of the various embodiments, application server computer 504 may employ a network hardware security module, such as, HSM 508 to provide one or more cryptographic services that may be employed to perform secure communication with client computer 502. For example, HSM 508 may generate and/or store cryptographic keys used (including session keys) for establishing secure communication with client computer 502.
In at least one of the various embodiments, client applications and server applications running on client computers, such as, client computer 502 and/or server computers, such as, server computer 504 may be arranged to employ one or more cryptographic protocols to provide secure communication between them over networks, including network path 514. Various secure communication protocols, such as SSL/TLS may define handshake protocols, authentication protocols, key exchange protocols, or the like, or combination thereof, that implement the secure communication between the clients and servers. Accordingly, in at least one of the various embodiments, the cryptographic protocols may include using one or more session keys to encrypt and/or decrypt the communication traffic. Thus, in at least one of the various embodiments, if a secure communication session is established between a server and a client, an NMC, such as, NMC 506 may require a session key to decrypt the encrypted network packets that may be communicated over the secure communication channel. For example, if a client application running on client computer 502 establishes a secure communication session with a server application running on server computer 504, NMC 506 may require a session key to decrypt the secure network traffic to perform monitoring and analysis based on the contents of the packets in comprising the secure network traffic.
In some cases, NMC 506 may be able to derive and/or generate a session key by passively monitoring the handshake information that may be exchanged between the client and server computer. However, for other cases, the client and server may employ a handshake protocol that cryptographically prevents NMC 506 from being able to obtain or generate a session key using information gather by passive monitoring. For example, if the client and server employ an ephemeral Diffie-Hellman key exchange, it may be impossible for NMC 506 to observe and/or capture the information that may be required to generate the session key using just passive monitoring. Also, in at least one of the various embodiments, other well-known and/or custom perfect forward secrecy (PFS) variants for key exchange may also prevent NMC 506 from obtaining or deriving a session key just by using passive monitoring.
In some embodiments, where NMC 506 is unable to obtain or derive a session key using passive monitoring, one or more of client computer 502, server computer 504, or hardware security module 508, may be arranged to provide and/or communicate session key information for a given secure communication session to NMC 506. In such cases, if a secure communication session may be established, a key provider may provide the appropriate session key information to an NMC, such as NMC 506.
In at least one of the various embodiments, NMC 506 may be arranged to request the session key once it has observed and determined that the cryptographic handshake between the client and server has finished. In at least one of the various embodiments, key providers may be arranged to communicate (e.g., push) session key information to an NMC after the secure communication session has been established.
In at least one of the various embodiments, there may be a time gap between when a client and server established as secure communication session and when the NMC is provided a session key. Accordingly, in at least one of the various embodiments, NMCs may be arranged to buffer the secure communication traffic until a session key for the secure communication channel is provided. If a session key is provided to the NMC, the NMC may first decrypt the buffered encrypted data and then decrypt the secure communication on the fly as it is received by the NMC.
In at least one of the various embodiments, if the secure communication traffic may be decrypted by a NMC, such as, NMC 506, it may perform one or more monitoring and/or analysis actions based on the decrypted contents of the secure communication.
In one or more of the various embodiments, a NMC, such as NMC 506 may be arranged to capture packets for storing in a packet capture data store, such as packet capture data store 510. In some embodiments encrypted packets may be captured and stored. Likewise, in some embodiments, un-encrypted packets may be captured by NMC 506 and stored in packet capture data store 510.
In one or more of the various embodiments, key escrow 516 may be a data store arranged to store cryptographic key, cryptographic key information, or the like. In one or more of the various embodiments, secret sharing engines, such as secret sharing engine 222 or secret sharing engine 327 may be arranged to intercept and share the cryptographic key, the cryptographic key information, or the like. The secret sharing engines may be arranged to store the cryptographic information in key escrow 512. In one or more of the various embodiments, the cryptographic information stored in key escrow may be used to decrypt captured encrypted packets at a later time.
In one or more of the various embodiments, the secret sharing engines may be arranged to communicate with a NMC to enable correlation information to be associated with the cryptographic key information. For example, NMC 508 may be arranged to obtain key information from the secret sharing engine. Accordingly, NMC 508 may determine the correlation information that correlates the communication session with the key information. Thus, in this example, NMC 506 may store the key information with the relevant correlation information in the key escrow 512.
In one or more of the various embodiments, a secret sharing engine may be arranged to determine the correlation information on its own. Accordingly, in some embodiments, the secret sharing engine may store the correlation information and the key information in a key escrow such as key escrow 512.
In one or more of the various embodiments, NMCs, such as NMC 506 may be arranged the decrypt monitored packets before they are stored in packet capture data store 510. Also, in other embodiments, NMCs, such as NMC 506 may be arranged to decrypt some or all of the packets in real-time to enable network management policies to be applied based on the content of the packets. Accordingly, in some embodiments, after monitoring tasks are completed, the decrypted version of the packets may be discarded and the encrypted versions may be stored in the packet capture data store.
In one or more of the various embodiments, some or all of the key information may be provided to NMC 506 in-band or otherwise included in network traffic communicated over network path 514. In some embodiments, the secret sharing engines residing on the computers participating in the secure communication session (e.g., client computer 502, application server computer 504, or the like) may be arranged to include in-band key information that includes some or all of the key information in one or more fields or one or more packets of the secure communication session. In some embodiments, the in-band key information may be included in the network flow(s) (e.g., network path 514) comprising the secure communication session that is monitored by NMC 506. Accordingly, in some embodiments, the key information may be provided to NMC 506 during the secure handshake or other phases of the secure communication session.
In one or more of the various embodiments, NMC 506 may be arranged to detect and identify the in-band key information and extract the actual key information. In one or more of the various embodiments, the in-band key information may be encrypted using a private key/cipher that is known to the secret sharing engines and NMC 506 and unknown to other applications involved in the secure communication session.
In some embodiments, a secret sharing engine on client computer 502 may encrypt and add the in-band key information to the secure session traffic. Thus, in some embodiments, if NMC 506 receives the in-band key information it may decrypt it for use as described herein. Also, in some embodiments, NMC 506 may be arranged to strip the in-band key information from the secure session traffic rather than forwarding it to application server computer 504.
For example, in one or more of the various embodiments, the secrets sharing engine on client computer 502 may be arranged to provide a special purpose TLS record packet that includes the encrypted in-band key information over network path 514. Then, for this example, if NMC 506 detects the special purpose TLS record packet, the in-band key information may be obtained and the special purpose TLS record packet may be removed from the secure session traffic and discarded rather than forwarding it to application server computer 504. As used herein the terms client, or client computer, refer to programs and/or computers that may initiate a request for services from a server computer. Likewise, the terms server, or server computer, refer to programs and/or computers that may respond to a request for services from a client computer. For clarity, clients and servers are described separately, but one of ordinary skill in the art will appreciate that a given computer or program may sometimes operate as a server and other times operate as a client depending on whether it is requesting services or responding to requests for services.
In one or more of the various embodiments, secret sharing engine 604 may be disposed logically between applications 602 and operating system 606. Accordingly, secret sharing engine 604 may be arranged to passively intercept network traffic to discover cryptographic secrets, including session keys that may be employed by computer 600 to communicate with other computers.
Secret sharing engine 604 may be a process or service that is arranged to communicate one or more cryptographic secrets, key information, or the like, to one or more NMCs, such as, NMC 116 over network path 610. Further, in at least one of the various embodiments, secret sharing engine 604 may be arranged to be a plug-in of a web browser or other application. Also, in at least one of the various embodiments, secret sharing engine 604 may be embedded into cryptographic provider and/or a plug-in associated with a cryptographic provider, such as cryptographic provider 326. Also, in some embodiments, secret sharing engine 604 may be arranged to communicate one or more cryptographic secrets, key information, or the like, to a key escrow.
In one or more of the various embodiments, secret sharing engines, such as secret sharing engine 604, secret sharing engine 224, secret sharing engine 327, or the like, may be arranged to provide system library interfaces that mimic standard interfaces such that client applications that expect the standard interface may be operate without modification.
In one or more of the various embodiments, a secret sharing engine may be arranged to integrate with network service pipelined sequence facility that is supported by the operation system or system libraries. For example, some operating system may be enable authorized programs (e.g., kernel level services) to be inserted into a network communication process.
In one or more of the various embodiments, a secret sharing engine may be arranged to enable client application to explicitly make calls to the secret sharing engine. Accordingly, in one or more of the various embodiments, the client application may expressly control or direct the sharing of cryptographic secrets.
In at least one of the various embodiments, some or all of the information represented by table 700 may be stored as with in capture data store 312, key escrow 314, or the like, on a network computer, such as network computer 300. In some embodiments, table 700 may be stored in the working memory of a NMC and used during real-time decryption of packets as they are captured.
In at least one of the various embodiments, column 702 of table 700 may contain a value that corresponds to a particular network connection, network flow, communication channel, or the like. The NMC may be arranged to index or otherwise identify each network flow that it is monitoring. In at least one of the various embodiments, column 704 may include a cryptographic session key that is associated with a network flow. The session key may correspond to a secure communication session that is occurring on/over the network flow. In at least one of the various embodiments, column 706 may include one or more types of correlation information that may be associated with a network flow. The correlation information value may be used in part to determine which network flow a provided session key corresponds to. As described in more detail below, a key provide may provide correlation information with a session key. Accordingly, the NMC may compare the correlation information provided with the session key to the correlation information captured and/or generated by the NMC. If a match of the correlation information it found, the session key may be associated with the corresponding network flow. And, in some embodiments, column 708 may contain one or more fields of additional data that may be associated with a network flow. Column 708 represents additional information and/or metrics that may be captured and/or associated with a given network flow.
In one or more of the various embodiments, a flow identifier may be based on the flow tuple information associated with a network flow or network connection. In some embodiments, a flow identifier may be generated by using a hash of some or all of the tuple information for a flow. For example, Flow ID=hashFunction(Source IP, Destination ID, port value, . . . ) modulo RangeMax.
Generalized Operations
At block 804, in one or more of the various embodiments, one or more network peers may establish a secure communication session. In one or more of the various embodiments, NMCs may be arranged to recognize one or more network traffic patterns or network traffic content that indicate computers on a monitored network are establishing a secure communication session. In one or more of the various embodiments, various well-known secure communication protocols or cipher suites may include one or more recognizable traffic patterns or content that may indicate a secure handshake process used to establish a secure session.
In one or more of the various embodiments, the NMC may be arranged to employ configuration information or rules that may be defined to identify various secure communication methods. For example, the NMC may be configured to monitor network traffic between computers to recognize the patterns indicating a secure session handshake.
At decision block 806, in one or more of the various embodiments, if the NMC is configured to capture the network traffic that may be associated with the secure session, control may flow to block 808; otherwise, control may be returned to a calling process.
At block 808, in one or more of the various embodiments, key information (or other secrets) associated with the secure session may be provided to a key escrow. In one or more of the various embodiments, the NMC may be arranged to identify key information used in the establishment of the secure communication session. In one or more of the various embodiments, the NMC may be arranged to monitor the network traffic comprising both directions of a secure handshake. Accordingly, in some embodiments, the NMC may collect key information that may be available. Also, in some embodiments, important key information may be obscured or otherwise unavailable to computers other than those participating in the session. Thus, in one or more of the various embodiments, secret sharing engines or services residing on the computers participating in the secure communication session may be arranged to obtain some or all of the key information and provide it the NMC or a key escrow.
In one or more of the various embodiments, some or all of the key information may be provided to the NMC in-band or otherwise included in network traffic that comprises the secure communication session. In some embodiments, the secret sharing engines residing on the computers participating in the secure communication session may be arranged to include in-band key information that includes some or all of the key information in one or more fields or one or more packets. In some embodiments, the in-band key information may be included in the network flow(s) comprising the secure communication sessions monitored by the NMC. Accordingly, the key information may be communicated to the NMC during the secure handshake or other phases of the secure communication session.
In one or more of the various embodiments, the NMC may be arranged to detect and identify the in-band key information and extract the actual key information. In one or more of the various embodiments, the in-band key information may be encrypted using a private key/cipher that is known to the secret sharing engines and the NMC and unknown to other application or computers participating in the secure communication session.
In some embodiments, the secret sharing engine may encrypt and add the in-band key information to the secure session traffic. Thus, in some embodiments, if the NMC receives the in-band key information it may decrypt the key information for use as described herein. Also, in some embodiments, the NMC may be arranged to strip the in-band key information from the secure session traffic rather than forwarding it to the server. At block 810, in one or more of the various embodiments, the NMC may capture packets associated with the secure session. In one or more of the various embodiments, the NMC may be arranged to store the captured packets in a data store at the NMC or a remotely located data store.
In one or more of the various embodiments, the NMC may be arranged to discard captured packets rather storing them. Accordingly, in one or more of the various embodiments, the NMC may be arranged to analyze the captured packets and then discard some or all of the packets.
At block 812, in one or more of the various embodiments, the NMC may be arranged correlate captured traffic with the key information. In one or more of the various embodiments, correlation information may be generated based on the captured network traffic. Correlation information may include information describing the network traffic as well as portions of the information used during the establishment of the secure communication session. In one or more of the various embodiments, the NMC may be arranged to employ the correlation information to correlate captured network traffic with its corresponding key information.
In one or more of the various embodiments, the correlation information and key information may be stored in the key escrow that may be arranged to be responsive to queries that include query parameters based on fields of the correlation information or key information.
At block 814, in one or more of the various embodiments, optionally, the NMC may be arranged to decrypt the captured network packets. In one or more of the various embodiments, the NMC may be arranged to decrypt the secure traffic to inspect the content of the packets. Accordingly, the NMC may be arranged to apply one or more rules or policies to the secure session based on an analysis of the decrypted packets.
In one or more of the various embodiments, the NMC may be arranged to store the decrypted packets in a data store making them available to other systems or applications for further analysis.
In some embodiments, this block may be considered optional because the NMC may be configured to store the captured packets without decrypting them.
Accordingly, in some embodiments, the client and server may initiate a handshake process for establishing a secure communication session based on their configuration. In at least one of the various embodiments, the purpose of the handshake may be to enable the client and server to agree on one or more cryptographic features to employ, such as, authentication methods, key exchange methods, key sizes, cipher methods, or the like, or combination thereof.
In at least one of the various embodiments, if the client and server can determine/negotiate a set of common features to employ for secure communication, those features may be used to establish a secure communication channel. The contents of handshake messages and their sequence may vary depending on the communication protocols being employed by the client and server. In at least one of the various embodiments, the secure communication protocol that is used may be determined by the applications running on the client computer and the server computer.
At block 904, in at least one of the various embodiments, a network monitoring computer (NMC) arranged to the monitor the network being used by the client and server may begin monitoring the network traffic associated with the client and server. In at least one of the various embodiments, secure communication protocols may define handshake protocols that are observable on the network by the NMC. For example, one or more packets or fields in the packets, such as header information or header fields in the network traffic exchanged during handshaking may be unencrypted, enabling the NMC to determine that hand shaking may be occurring between the client and server. In some embodiments, the NMC may determine that handshaking is occurring even to though it is unable to obtain cryptographic information, such as, exchanged keys, secrets, or the like, from the handshake messages.
At block 906, in at least one of the various embodiments, at some point, the client and server may complete the handshake procedure and begin communicating encrypted network packets over the secure communication. In at least one of the various embodiments, the NMC monitoring the network may be arranged to observe that the handshake may be finished based one or more observable changes in the communication between the client and server. For example, the secure communication protocol TLS packets include a Content Type field that may be used to distinguish between handshake records and data traffic records (application records). Other secure communication protocols may employ different yet similar methods that may indicate if a handshake has completed.
Further, in at least one of the various embodiments, the NMC may identify additional features of the network traffic that may indicate if a handshake is in process. For example, the NMC may monitor the timing of messages exchanged between the client and server to determine if a handshake is occurring.
At block 908, in at least one of the various embodiments, the NMC may begin buffering the secure communication traffic between the client and server. In at least one of the various embodiments, the NMC may be arranged to continuously buffer network packets associated with monitored sessions using a ring-buffer or similar buffering architecture. The NMC may buffer a portion of the secure communication traffic until such time that it may be enabled to decrypt it. The amount of traffic that may be buffered may depend on the amount of available buffer memory and one or more configuration values that may allocate buffer sizes within the NMC.
At decision block 910, in at least one of the various embodiments, if the NMC obtains the session key corresponding to the secure communication session between the client and the server, control may flow to block 912; otherwise, control may loop back to block 908.
In at least one of the various embodiments, the session key generated during the handshake portion of the communication between the client and the server may be provided to the NMC to enable it to decrypt the secure communication for monitoring. In at least one of the various embodiments, the session key may be provided by a secret sharing engine, such as, the client computer secret sharing engine 222 or, network computer secret sharing engine 327, or a hardware security module.
In at least one of the various embodiments, a secret sharing engine or service running on the client computer may provide the session key to the NMC over a network. For example, a client such as a web browser running on the client computer may be arranged to provide a session key used for secure communication with a web server (e.g., a website secured using SSL/TLS) to the NMC. In other embodiments, the networking/cryptographic facilities of the client computer may be arranged to provide the session key to the NMC. In some embodiments, the session key may be provided by a library, plug-in, extension, or the like, or combination thereof, used by a client application, a client service, a client process, or the like, running on the client computer.
Similarly, in at least one of the various embodiments, a secret sharing engine or service running on the server computer may provide the session key to the NMC over a network. For example, a server such as a web server running on the server computer may be arranged to provide a session key used for secure communication between a web server and a web browser running on a client computer. In other embodiments, the networking/cryptographic facilities of the server computer may be arranged to provide the session key to the NMC. In some embodiments, the session key may be provided by a secret sharing engine implemented as a library, plug-in, extension, or the like, or combination thereof, used by a server application, a server service, a server process, or the like, running on the server computer.
In at least one of the various embodiments, a hardware security module and/or a network hardware module may be arranged to provide the session key to the NMC for use in decrypting the secure communication traffic. In at least one of the various embodiments, the HSM may be arranged to communicate the session key to the NMC over a network.
At block 912, in at least one of the various embodiments, the NMC may be arranged to provide session key information and flow correlation information to a key escrow service.
Next, control may be returned a calling process.
In one or more of the various embodiments, queries may be provided using a standard query language such as, SQL, SQL-like languages, or the like. In other embodiments, the query may be comprised one or more expressions that may include logic operators, arithmetic operators, date-time functions, grouping functions, sorting functions, or the like, or combination thereof.
In one or more of the various embodiments, the query may include expressions that test for one or more value correlation information values that may be associated with the key information. For example, if the correlation information includes flow tuple information, the query may include one or more expressions to search for key information associated with a particular source/destination network address, port, time-of-day, or the like, or combination thereof, such as “ . . . source_address=10.0.0.1 . . . ”
In some embodiments, the correlation information may include a tag or identifier that indicates an network application associated with the flow or flows that are correlated with the key information. Accordingly, in one or more of the various embodiments, the query may include expressions that compare or test for an application identifier. For example, in some embodiments, the query may include an expression to provide key information correlated with flows associated with a database application, such as, “ . . . application_tag=database . . . ”
At decision block 1004, in one or more of the various embodiments, if escrow access policies allow access to the requested packets, control may flow to block 1006; otherwise, control may be returned to a calling process. In one or more of the various embodiments, one or more access policies may be applied to determine if the query is eligible for processing. Access policies may associated one or more access control lists with key information or the flows they may be associated with. In one or more of the various embodiments, access policies may be defined in terms of correlation information associated with key information. For example, an access list that includes a white-list of users may be associated with correlation information such as, source/destination address, source/destination ports, applications, time-of-day, or the like. Thus, in some embodiments, different users may be associated with separate access lists that enable them access to key information based on their business unit.
In one or more of the various embodiments, other security measures may be implemented besides or in addition to access lists, such as, passwords, multi-factor authorization, or the like. One of ordinary skill in the art will appreciate that the access policies for the key escrow may employ one or more standard or well-known security measures as well as custom processes defined in the policies themselves.
At block 1006, in one or more of the various embodiments, one or more packets responsive the query may be provided. The query may be compiled and executed to identify the packets and key information responsive to the query.
In one or more of the various embodiments, the correlation information matching or responsive to the query may be identified. From the identified correlation information the network traffic (e.g., packets) and its key information may be determined. For example, if the query included an expression such as “SELECT . . . WHERE source_address=10.0.1.2 AND destination_address=10.0.1.10 AND timestamp BETWEEN 1484354909 AND 1484398109 . . . ”, the key escrow would provide or identify key information and network packets associated with correlation information matching the expressions. Accordingly, in this example, key information associated with flows originating from IP address 10.0.1.2 that are sent to IP address 10.0.1.10 during the time range of January 14 @ 12:48 a.m. (UTC) and January 14 @ 12:48 p.m. may be identified based on their correlation information and the query parameters.
In one or more of the various embodiments, query results may include correlation information and the corresponding key information. In one or more of the various embodiments, the key information may be included directly in the result sets of the query. In some embodiments, the NMC may obtain the key information for another location or service, such as from a hardware security module or other secure storage device.
In one or more of the various embodiments, the NMC may be arranged to associate sets or collections of encrypted packets with their corresponding key information. In some embodiments, this may include associating the encrypted packets for a session with the key information the same session. In one or more of the various embodiments, the NMC may be arranged to organize key information and corresponding encrypted packets into a single file, data structure, or the like. For example, the NMC may be arranged to employ a file format that stores the key information in header/meta-fields, and the encrypted packets in the body of the file. In some embodiments, the additional meta-data such as packet demarcation tags, or the like, may be included. In some embodiments, the NMC may employ configuration information that includes rules or definition defining the format that the key information and network packets may be provided.
At decision block 1008, in one or more of the various embodiments, if the provided packets are encrypted control may flow to block 1010; otherwise, control may flow to block 1014. In one or more of the various embodiments, some captured network traffic may be unencrypted. Accordingly, in some embodiments, correlation information for such network traffic may be used to identify unencrypted packets. In some embodiments, providing the unencrypted packets may provide additional context that may be useful to analyze the encrypted traffic that is responsive to the query. Note, in one or more of the various embodiments, queries may include one or more expressions that expressly exclude unencrypted traffic from query results.
In one or more of the various embodiments, because unencrypted packets do not need to be decrypted using the key information, the unencrypted packets may be passed to application that provided the query. In one or more of the various embodiments, query result sets may include a mix of unencrypted packets and encrypted packets.
At block 1010, in one or more of the various embodiments, optionally, the NMC may be arranged to decrypt the encrypted packets using the key information provided by the key escrow. In one or more of the various embodiments, the NMC may employ the key information to decrypt the encrypted packets. In some embodiments, the NMC may omit the decryption step deferring to other applications or services to perform the decryption. In one or more of the various embodiments, the NMC may be arranged to select whether to decrypt encrypted packets based on configuration information or policy rules, or the like. For example, in some embodiments, the query results may be intended to be stored in another archive while other captured packets or key information may be discarded after a defined time.
In one or more of the various embodiments, this block is indicated as being optional because in some embodiments the encrypted packets may be decrypted while in other embodiments, the encrypted packets may be provided to another application or service.
At block 1012, in one or more of the various embodiments, the decrypted packets may be provided to the requesting application or requesting service. In one or more of the various embodiments, the decrypted packets may be provided to an application that provided the query. In one or more of the various embodiments, the query may be provided to an application or service that consumes the decrypted packets. In some embodiments, the applications that provide the query may be separate from the consuming applications.
In one or more of the various embodiments, the decrypted packets may be provided to a data store remote from the NMC and otherwise accessible to users or applications. Also, in some embodiments, the decrypted packets may be provided absent the key information or correlation information. Accordingly, in some embodiments, the ultimate consumers of the decrypted packets may be kept unware that the packets were encrypted.
Alternatively, in some embodiments, the key information or correlation information, or both, may be provided along with the decrypted packets. In one or more of the various embodiments, the NMC may employ configuration or policy rules (e.g., similar to access policies) to determine where to send the decrypted packets or if to include key information or correlation information.
Also, in some embodiments, the key information and the associated encrypted packets may be provided to the requesting application or application service. In some embodiments, this may enable the requesting application or requesting service to decrypt the encrypted packets on their own.
Next, in some 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 one or more processors to produce a machine, such that the instructions, which execute on the one or more processors, create means for implementing the actions specified in the flowchart block or blocks. The computer program instructions may be executed by the one or more processors to cause a series of operational steps to be performed by the one or more processors to produce a computer-implemented process such that the instructions, which execute on the one or more processors 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 and/or concurrently by the one or more processors and/or one or more computers. Moreover, some of the steps may also be performed across more than one processor or computer. 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 and/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 one or more embedded logic hardware devices instead of one or more CPUs, such as, an Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), Programmable Array Logic chips (PALs), or the like, or combination thereof. The embedded one or more logic hardware devices may directly execute their embedded logic to perform actions. In at least one embodiment, one or more microcontrollers may be arranged as system-on-a-chip (SOCs) to directly execute their own locally embedded logic to perform actions and access their own internal memory and their own external Input and Output Interfaces (e.g., hardware pins and/or wireless transceivers) to perform actions described herein.
This Utility Patent Application is a Continuation of U.S. patent application Ser. No. 15/466,248 filed on Mar. 22, 2017, now U.S. Pat. No. 10,476,673 issued on Nov. 12, 2019, the benefit of which is claimed under 35 U.S.C. § 120, and the contents of which is further incorporated in entirety by reference.
| 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 7594273 | Keanini et al. | Sep 2009 | B2 |
| 7602731 | Jain | Oct 2009 | B2 |
| 7606706 | Rubin et al. | Oct 2009 | B1 |
| 7609630 | Gobeil | Oct 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 |
| 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 |
| 8185953 | Rothstein et al. | May 2012 | B2 |
| 8194542 | Väänänen et al. | Jun 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 |
| 8533254 | Whitson, Jr. et al. | Sep 2013 | B1 |
| 8555383 | Marshall 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 |
| 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 |
| 8959643 | Invernizzi et al. | Feb 2015 | B1 |
| 8964548 | Keralapura et al. | Feb 2015 | B1 |
| 8971196 | Degioanni et al. | Mar 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 |
| 9083740 | Ma et al. | Jul 2015 | B1 |
| 9094288 | Nucci et al. | Jul 2015 | B1 |
| 9094326 | Sundararajan et al. | Jul 2015 | B2 |
| 9158604 | Christodorescu et al. | Oct 2015 | B1 |
| 9176838 | Li et al. | Nov 2015 | B2 |
| 9183573 | Tseng | Nov 2015 | B2 |
| 9189318 | Li et al. | Nov 2015 | B2 |
| 9191400 | Ptasinski et al. | Nov 2015 | B1 |
| 9203865 | Linden et al. | Dec 2015 | B2 |
| 9264288 | Arora et al. | Feb 2016 | B1 |
| 9338147 | Rothstein et al. | May 2016 | B1 |
| 9357410 | Nedeltchev et al. | May 2016 | B2 |
| 9369479 | Lin | Jun 2016 | B2 |
| 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 | Dec 2016 | B1 |
| 9531736 | Torres et al. | Dec 2016 | B1 |
| 9565202 | Kindlund et al. | Feb 2017 | B1 |
| 9565203 | Bernstein et al. | Feb 2017 | B2 |
| 9591015 | Amin et al. | Mar 2017 | B1 |
| 9621523 | Rothstein et al. | Apr 2017 | B2 |
| 9654503 | Kowalyshyn | May 2017 | B1 |
| 9660879 | Rothstein et al. | May 2017 | B1 |
| 9692658 | Guo et al. | Jun 2017 | B2 |
| 9715820 | Boss et al. | Jul 2017 | B1 |
| 9729416 | Khanal et al. | Aug 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 |
| 10038611 | Wu et al. | Jul 2018 | B1 |
| 10050982 | Guerra | Aug 2018 | B1 |
| 10063434 | Khanal | Aug 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 |
| 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 |
| 10332005 | Liao et al. | Jun 2019 | B1 |
| 10348767 | Lee et al. | Jul 2019 | B1 |
| 10375155 | Cai et al. | Aug 2019 | B1 |
| 10380498 | Chaoji et al. | Aug 2019 | B1 |
| 10389574 | Wu et al. | Aug 2019 | B1 |
| 10411978 | Ball et al. | Sep 2019 | B1 |
| 10412080 | Edwards et al. | Sep 2019 | B1 |
| 10419454 | El-Moussa et al. | Sep 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 |
| 10594664 | Zaifman et al. | Mar 2020 | B2 |
| 10594718 | Deaguero et al. | Mar 2020 | B1 |
| 10728126 | Wu et al. | Jul 2020 | B2 |
| 10742677 | Wu et al. | Aug 2020 | B1 |
| 10778700 | Azvine et al. | Sep 2020 | B2 |
| 10805338 | Kohout et al. | Oct 2020 | B2 |
| 10841194 | Kim et al. | Nov 2020 | B2 |
| 10944769 | Singh | Mar 2021 | B2 |
| 10992693 | Luo et al. | Apr 2021 | B2 |
| 11057420 | McGrew et al. | Jul 2021 | B2 |
| 11159549 | El-Moussa et al. | Oct 2021 | B2 |
| 11194901 | El-Moussa et al. | Dec 2021 | B2 |
| 11201876 | Kallos et al. | Dec 2021 | B2 |
| 11310256 | Higgins et al. | Apr 2022 | B2 |
| 11388072 | Wu et al. | Jul 2022 | 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 |
| 20030204621 | Poletto et al. | Oct 2003 | A1 |
| 20030212900 | Liu et al. | Nov 2003 | A1 |
| 20030214913 | Kan et al. | Nov 2003 | A1 |
| 20030217144 | Fu | Nov 2003 | A1 |
| 20030233361 | Cady | Dec 2003 | A1 |
| 20040003094 | See | 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 | Lil | Jan 2005 | A1 |
| 20050015622 | Williams et al. | Jan 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 et al. | Aug 2005 | A1 |
| 20050193245 | Hayden et al. | Sep 2005 | A1 |
| 20050201363 | Gilchrist et al. | Sep 2005 | A1 |
| 20050210242 | Troxel et al. | Sep 2005 | A1 |
| 20050234920 | Rhodes | Oct 2005 | A1 |
| 20050251009 | Morita | Nov 2005 | A1 |
| 20050262237 | Fulton et al. | Nov 2005 | A1 |
| 20050270975 | Meylan 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 |
| 20060085526 | Gulland | Apr 2006 | A1 |
| 20060101068 | Stuhec et al. | May 2006 | A1 |
| 20060106743 | Horvitz | May 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 |
| 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 |
| 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 | Hartikanen et al. | Mar 2008 | A1 |
| 20080062995 | Kaas | 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 |
| 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 |
| 20090168657 | Puri et al. | Jul 2009 | A1 |
| 20090187653 | Fu et al. | Jul 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 |
| 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 | Feb 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 | Malornsoky et al. | Jan 2011 | A1 |
| 20110055138 | Khanduja et al. | Mar 2011 | A1 |
| 20110073490 | Hayamizu et al. | Mar 2011 | A1 |
| 20110122792 | Duffield et al. | May 2011 | A1 |
| 20110126259 | Krishnamurthi et al. | May 2011 | A1 |
| 20110126275 | Anderson et al. | May 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 |
| 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 | Tonsing et al. | May 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 |
| 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 |
| 20130042323 | Narayanaswamy | 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 | 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 |
| 20130232104 | Goyal et al. | Sep 2013 | A1 |
| 20130262655 | Deschenes 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 |
| 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 |
| 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 |
| 20140269777 | Rothstein | 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 | Nov 2014 | A1 |
| 20150006896 | Franck | Jan 2015 | A1 |
| 20150007314 | Vaughan | Jan 2015 | A1 |
| 20150007316 | Ben-Shalom et al. | Jan 2015 | A1 |
| 20150023168 | Kotecha et al. | Jan 2015 | A1 |
| 20150026027 | Priess et al. | Jan 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 20160119215 | Deschenes 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 20180007087 | Grady et al. | Jan 2018 | A1 |
| 20180013650 | Khanal et al. | Jan 2018 | A1 |
| 20180033089 | Goldman et al. | Feb 2018 | A1 |
| 20180075240 | Chen | Mar 2018 | A1 |
| 20180084011 | Joseph 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 |
| 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 |
| 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 |
| 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 |
| 20190028357 | Kokkula et al. | Jan 2019 | A1 |
| 20190052554 | Mukerji et al. | Feb 2019 | A1 |
| 20190052675 | Krebs | Feb 2019 | A1 |
| 20190068465 | Khanai 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 |
| 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 |
| 20190230095 | McGrew et al. | Jul 2019 | A1 |
| 20190236149 | Kuruvada et al. | Aug 2019 | A1 |
| 20190245734 | Wu et al. | Aug 2019 | A1 |
| 20190245763 | Wu et al. | Aug 2019 | A1 |
| 20190266999 | Chandrasekaran et al. | Aug 2019 | A1 |
| 20190303198 | Kim et al. | Oct 2019 | A1 |
| 20190340554 | Dotan-Cohen et al. | Nov 2019 | A1 |
| 20190372828 | Wu et al. | Dec 2019 | A1 |
| 20200034528 | Yang et al. | Jan 2020 | A1 |
| 20200067952 | Deaguero et al. | Feb 2020 | A1 |
| 20200082081 | Sarin et al. | Mar 2020 | A1 |
| 20200099703 | Singh | Mar 2020 | A1 |
| 20200220849 | Zaifman et al. | Jul 2020 | A1 |
| 20200236131 | Vejman et al. | Jul 2020 | A1 |
| 20200287885 | Rodniansky | Sep 2020 | A1 |
| 20200389469 | Litichever et al. | Dec 2020 | A1 |
| 20210006589 | Kohout et al. | Jan 2021 | A1 |
| 20210185087 | Wu et al. | Jun 2021 | A1 |
| 20210250368 | Hearty et al. | Aug 2021 | A1 |
| 20210288993 | Kraning et al. | Sep 2021 | A1 |
| 20210360004 | McGrew et al. | Nov 2021 | A1 |
| 20210360011 | O'Hara et al. | Nov 2021 | A1 |
| 20220019688 | Nelluri et al. | Jan 2022 | A1 |
| 20220224716 | Salji | Jul 2022 | A1 |
| Number | Date | Country |
|---|---|---|
| 2003287262 | May 2004 | AU |
| 2008328833 | Jun 2009 | AU |
| 105071987 | Nov 2015 | CN |
| 105323247 | Feb 2016 | CN |
| 106170008 | Nov 2016 | CN |
| 107646190 | Jan 2018 | CN |
| 107667510 | Feb 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 | 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 | Feb 2016 | EP |
| 3089424 | Nov 2016 | EP |
| 3094061 | Nov 2016 | EP |
| 3113443 | Jan 2017 | EP |
| 3113443 | Apr 2017 | EP |
| 3306890 | Apr 2018 | EP |
| 3394784 | Oct 2020 | EP |
| 3272095 | Mar 2021 | EP |
| 2924552 | Jun 2009 | FR |
| 2545910 | Jul 2017 | GB |
| 2545910 | Feb 2018 | GB |
| 960012819 | Apr 1996 | KR |
| 100388606 | Nov 2003 | KR |
| 1020140093060 | 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 |
| 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 |
| Entry |
|---|
| Official Communication for U.S. Appl. No. 15/892,327 dated Apr. 23, 2018, pp. 1-54. |
| Official Communication for U.S. Appl. No. 15/891,311 dated Apr. 23, 2018, pp. 1-73. |
| Official Communication for U.S. Appl. No. 15/690,135 dated Jan. 18, 2018, pp. 1-23. |
| Official Communication for U.S. Appl. No. 15/014,932 dated Aug. 1, 2017, pp. 1-31. |
| Official Communication for U.S. Appl. No. 14/107,580 dated Sep. 15, 2014, pp. 1-22. |
| Official Communication for U.S. Appl. No. 15/014,932 dated Mar. 3, 2017, pp. 1-17. |
| Official Communication for U.S. Appl. No. 15/207,213 dated Feb. 23, 2017, pp. 1-24. |
| Official Communication for U.S. Appl. No. 15/207,213 dated May 8, 2017, pp. 1-7. |
| Official Communication for U.S. Appl. No. 15/207,213 dated Jun. 1, 2017, pp. 1-72. |
| Health Level Seven, Version 2.6, Appendix A. Nov. 2007, https://www.hl7.org/special/committees/vocab/V26_Appendix_A.pdf, p. 1-216. |
| Official Communication for U.S. Appl. No. 15/207,213 dated Oct. 25, 2016, pp. 1-56. |
| Official Communication for U.S. Appl. No. 11/683,643 dated Jan. 23, 2012, pp. 1-43. |
| Official Communication for U.S. Appl. No. 11/683,643 dated Aug. 25, 2011, pp. 1-54. |
| Official Communication for U.S. Appl. No. 11/683,643 dated Apr. 28, 2010, pp. 1-44. |
| Official Communication for U.S. Appl. No. 12/326,672 dated Oct. 24, 2011, pp. 1-46. |
| Official Communication for U.S. Appl. No. 12/326,672 dated Jun. 22, 2011, pp. 1-31. |
| Official Communication for U.S. Appl. No. 12/326,672 dated Dec. 23, 2010, pp. 1-19. |
| Official Communication for U.S. Appl. No. 12/326,672 dated Jun. 9, 2010, pp. 1-14. |
| U.S. Appl. No. 11/679,356, filed Feb. 27, 2007. |
| U.S. Appl. No. 11/683,643, filed Mar. 8, 2007. |
| Lin, Mark, “An Overview of Session Hijacking at the Network and Application Levels,” Jan. 18, 2005, pp. 1-16. |
| Official Communication for U.S. Appl. No. 14/107,580 dated Mar. 17, 2015, pp. 1-25. |
| Office Communication for U.S. Appl. No. 15/014,932 dated May 15, 2018, pp. 1-32. |
| Office Communication for U.S. Appl. No. 15/891,273 dated Jun. 19, 2018, pp. 1-35. |
| Office Communication for U.S. Appl. No. 15/014,932 dated Jul. 16, 2018, pp. 1-17. |
| Office Communication for U.S. Appl. No. 15/690,135 dated May 22, 2018, pp. 1-16. |
| Office Communication for U.S. Appl. No. 15/984,197 dated Aug. 31, 2018, pp. 1-72. |
| Official Communication for U.S. Appl. No. 16/048,939 dated Sep. 19, 2018, pp. 1-40. |
| Official Communication for U.S. Appl. No. 15/891,311 dated Sep. 24, 2018, pp. 1-31. |
| Official Communication for U.S. Appl. No. 16/113,442 dated Nov. 6, 2018, pp. 1-56. |
| Official Communication for U.S. Appl. No. 15/014,932 dated Nov. 23, 2018, pp. 1-50. |
| Official Communication for U.S. Appl. No. 16/100,116 dated Nov. 15, 2018, pp. 1-54. |
| Official Communication for U.S. Appl. No. 15/891,273 dated Jan. 15, 2019, pp. 1-47. |
| Official Communication for U.S. Appl. No. 15/891,311 dated Jan. 29, 2019, pp. 1-30. |
| Official Communication for U.S. Appl. No. 16/174,051 dated Jan. 29, 2019, pp. 1-96. |
| Official Communication for U.S. Appl. No. 16/107,509 dated Oct. 26, 2018, pp. 1-44. |
| Official Communication for U.S. Appl. No. 16/107,509 dated Apr. 1, 2019, pp. 1-72. |
| Official Communication for U.S. Appl. No. 16/048,939 dated Jun. 20, 2019, pp. 1-14. |
| Official Communication for U.S. Appl. No. 16/100,116 dated May 30, 2019, pp. 1-23. |
| Official Communication for U.S. Appl. No. 16/107,509 dated Jun. 14, 2019, pp. 1-6. |
| Official Communication for U.S. Appl. No. 16/384,574 dated May 31, 2019, pp. 1-44. |
| Official Communication for U.S. Appl. No. 16/107,509 dated Aug. 21, 2019, pp. 1-54. |
| Office Communication for U.S. Appl. No. 16/384,574 dated Oct. 8, 2019, pp. 1-60. |
| Office Communication for U.S. Appl. No. 16/543,243 dated Sep. 27, 2019, pp. 1-45. |
| Office Communication for U.S. Appl. No. 16/048,939 dated Dec. 5, 2019, pp. 1-15. |
| Office Communication for U.S. Appl. No. 16/565,109 dated Nov. 27, 2019, pp. 1-31. |
| Office Communication for U.S. Appl. No. 16/525,290 dated Oct. 31, 2019, pp. 1-17. |
| Office Communication for U.S. Appl. No. 16/532,275 dated Oct. 24, 2019, pp. 1-42. |
| Office Communication for U.S. Appl. No. 16/560,886 dated Dec. 6, 2019, pp. 1-45. |
| Office Communication for U.S. Appl. No. 14/500,893 dated Feb. 18, 2015, pp. 1-13. |
| Office Communication for U.S. Appl. No. 14/695,690 dated Feb. 24, 2016, pp. 1-32. |
| European Search Report for European Application No. 16166907.2 dated Sep. 14, 2016, pp. 1-7. |
| European Exam Report for European Application No. 16166907.2 dated Mar. 9, 2018, pp. 1-4. |
| Office Communication for U.S. Appl. No. 14/750,905 dated Sep. 22, 2015, pp. 1-18. |
| Office Communication for U.S. Appl. No. 14/750,905 dated Jan. 19, 2016, pp. 1-16. |
| Office Communication for U.S. Appl. No. 15/082,925 dated Sep. 13, 2016, pp. 1-8. |
| Office Communication for U.S. Appl. No. 15/289,760 dated Dec. 12, 2016, pp. 1-21. |
| Office Communication for U.S. Appl. No. 15/219,016 dated Nov. 22, 2016, pp. 1-13. |
| Office Communication for U.S. Appl. No. 15/356,381 dated Jan. 6, 2017, pp. 1-66. |
| Office Communication for U.S. Appl. No. 15/082,925 dated Feb. 1, 2017, pp. 1-16. |
| Office Communication for U.S. Appl. No. 15/219,016 dated Mar. 16, 2017, pp. 1-13. |
| Office Communication for U.S. Appl. No. 15/443,868 dated Apr. 27, 2017, pp. 1-14. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Jun. 27, 2017, pp. 1-54. |
| Office Communication for U.S. Appl. No. 15/356,381 dated Jul. 3, 2017, pp. 1-49. |
| Office Communication for U.S. Appl. No. 15/675,216 dated Jun. 7, 2018, pp. 1-5. |
| Office Communication for U.S. Appl. No. 15/443,868 dated Aug. 11, 2017, pp. 1-21. |
| Office Communication for U.S. Appl. No. 15/675,216 dated Nov. 20, 2017, pp. 1-10. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Nov. 28, 2017, pp. 1-29. |
| International Search Report and Written Opinion for PCT/US2018/030145 dated Aug. 10, 2018, pp. 1-12. |
| Svoboda, “Network Traffic Analysis with Deep Packet Inspection Method,” Fac. Informatics Masaryk Univ., No. Master's Thesis, 2014, pp. 1-148. |
| International Search Report and Written Opinion for PCT/US2017/068585 dated Jul. 4, 2018, pp. 1-11. |
| European Search Report for European Application No. 17210995 dated Jun. 28, 2018, pp. 1-11. |
| Office Communication for U.S. Appl. No. 15/855,769 dated Feb. 5, 2019, pp. 1-21. |
| Office Communication for U.S. Appl. No. 15/855,769 dated May 1, 2019, pp. 1-20. |
| Office Communication for U.S. Appl. No. 16/459,472 dated Aug. 14, 2019, pp. 1-24. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Mar. 20, 2019, pp. 1-35. |
| Office Communication for U.S. Appl. No. 15/675,216 dated Aug. 28, 2018, pp. 1-21. |
| Office Communication for U.S. Appl. No. 15/675,216 dated Jan. 29, 2019, pp. 1-18. |
| Office Communication for U.S. Appl. No. 16/384,697 dated May 30, 2019, pp. 1-17. |
| Office Communication for U.S. Appl. No. 16/384,574 dated Jan. 13, 2020, pp. 1-23. |
| Office Communication for U.S. Appl. No. 16/107,509 dated Jan. 23, 2020, pp. 1-39. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Jan. 22, 2020, pp. 1-34. |
| Office Communication for U.S. Appl. No. 16/384,697 dated Oct. 17, 2019, pp. 1-33. |
| Official Communication for U.S. Appl. No. 15/971,843 dated Oct. 22, 2019, pp. 1-29. |
| Official Communication for U.S. Appl. No. 15/457,886 dated Jan. 5, 2018, pp. 1-11. |
| Official Communication and Search Report for European Patent Application No. 16166907.2 dated Mar. 8, 2018, pp. 1-4. |
| Shever, “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. |
| Official Communication and Search Report for European Patent Application No. 17210995.1 dated Jul. 6, 2018, pp. 1-11. |
| International Search Report and Written Opinion for International Patent Application No. PCT/US2017/068585 dated Jul. 4, 2018, pp. 1-9. |
| Official Communication for U.S. Appl. No. 15/457,886 dated Jul. 18, 2018, pp. 1-14. |
| Official Communication for U.S. Appl. No. 13/831,673 dated Sep. 30, 2013, pp. 1-10. |
| Official Communication for U.S. Appl. No. 13/831,673 dated Mar. 6, 2014, pp. 1-12. |
| Official Communication for U.S. Appl. No. 13/831,673 dated May 22, 2014, pp. 1-5. |
| Official Communication for U.S. Appl. No. 14/107,580 dated Mar. 6, 2014, pp. 1-13. |
| Official Communication for U.S. Appl. No. 13/831,908 dated Jun. 25, 2014, pp. 1-15. |
| Official Communication for U.S. Appl. No. 14/500,893 dated Nov. 20, 2014, pp. 1-15. |
| Official Communication for U.S. Appl. No. 13/831,908 dated Apr. 9, 2014, pp. 1-3. |
| Official Communication for U.S. Appl. No. 13/831,908 dated Aug. 9, 2013, pp. 1-29. |
| Official Communication for U.S. Appl. No. 13/831,908 dated Jan. 13, 2014, pp. 1-31. |
| Official Communication for U.S. Appl. No. 13/831,959 dated Aug. 22, 2013, pp. 1-9. |
| Handel et al. “Hiding Data in the OSI Network Model,” Los Alamos, New Mexico, 1996, pp. 1-16. |
| Official Communication for U.S. Appl. No. 14/107,631 dated Feb. 20, 2014, pp. 1-16. |
| Official Communication for U.S. Appl. No. 14/107,631 dated Sep. 26, 2014, pp. 1-14. |
| Official Communication for U.S. Appl. No. 14/107,580 dated Sep. 15, 2014, pp. 1-15. |
| Official Communication for U.S. Appl. No. 14/500,893 dated Feb. 18, 2015, pp. 1-11. |
| Official Communication for U.S. Appl. No. 14/107,631 dated Dec. 30, 2014, pp. 1-12. |
| Official Communication for U.S. Appl. No. 13/831,626 dated Sep. 3, 2013, pp. 1-17. |
| Handley 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, “Evaluation of OSPF Extensions in MANET Routing,” Paris, 2007, pp. 1-192. |
| Parsons, “Moving Across the Internet: Code-Bodies, Code-Corpses, and Network Architecture,” May 9, 2010, pp. 1-20. |
| Zander et al., “Covert Channels and Countermeasures in Computer Network Protocols,” Dec. 2007, pp. 1-7. |
| Official Communication for U.S. Appl. No. 14/518,996 dated Apr. 20, 2015, pp. 1-37. |
| Official Communication for U.S. Appl. No. 14/500,893 dated Jun. 15, 2015, pp. 1-12. |
| Official Communication for U.S. Appl. No. 14/518,996 dated Jul. 21, 2015, pp. 1-17. |
| Official Communication for U.S. Appl. No. 14/518,996 dated Nov. 20, 2014, pp. 1-41. |
| Official Communication for U.S. Appl. No. 14/695,690 dated Feb. 24, 2016, pp. 1-11. |
| Official Communication for U.S. Appl. No. 14/695,690 dated Sep. 9, 2015, pp. 1-41. |
| Mozilla Developer Network, “NSS Key Log Format,” https://developer.mozilla.org/en-US/docs/Mozilla/Projects/NSS/Key_Log_Format, Jan. 8, 2010, pp. 1-1. |
| Official Communication for U.S. Appl. No. 15/150,354 dated Jul. 5, 2016, pp. 1-18. |
| Official Communication for U.S. Appl. No. 15/150,354 dated Feb. 8, 2017, pp. 1-8. |
| Communication and Search Report for European Patent Application No. 16166907.2 dated Sep. 30, 2016, pp. 1-7. |
| Official Communication for U.S. Appl. No. 15/457,886 dated Mar. 20, 2019, pp. 1-9. |
| Official Communication for U.S. Appl. No. 15/466,248 dated Jun. 5, 2017, pp. 1-90. |
| Official Communication for U.S. Appl. No. 15/466,248 dated Oct. 3, 2017, pp. 1-91. |
| Official Communication for U.S. Appl. No. 15/466,248 dated Jan. 11, 2018, pp. 1-4. |
| Official Communication for U.S. Appl. No. 15/466,248 dated Mar. 8, 2018, pp. 1-108. |
| Official Communication for U.S. Appl. No. 15/466,248 dated Jul. 11, 2018, pp. 1-299. |
| Official Communication for U.S. Appl. No. 15/466,248 dated Oct. 18, 2018, pp. 1-303. |
| Official Communication for U.S. Appl. No. 15/466,248 dated May 16, 2019, pp. 1-305. |
| Official Communication for U.S. Appl. No. 15/466,248 dated Sep. 10, 2019, pp. 1-39. |
| Official Communication for U.S. Appl. No. 16/459,472 dated Feb. 3, 2020, pp. 1-18. |
| Official Communication for U.S. Appl. No. 16/048,939 dated Feb. 18, 2020, pp. 1-6. |
| Official Communication for U.S. Appl. No. 16/424,387 dated Feb. 24, 2020, pp. 1-15. |
| Official Communication for U.S. Appl. No. 16/718,050 dated Feb. 27, 2020, pp. 1-34. |
| 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. 11/683,643 dated Oct. 14, 2010, pp. 1-43. |
| Office Communication for U.S. Appl. No. 15/014,932 dated Jun. 10, 2016, pp. 1-20. |
| Office Communication for U.S. Appl. No. 15/014,932 dated 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. |
| Office Communication for U.S. Appl. No. 15/671,060 dated May 8, 2019, pp. 1-19. |
| Office Communication for U.S. Appl. No. 16/113,442 dated Jun. 5, 2019, pp. 1-8. |
| Office Communication for U.S. Appl. No. 15/891,273 dated May 28, 2019, pp. 1-14. |
| International Search Report and Written Opinion for International Patent Application No. PCT/US2017/068586 dated Aug. 9, 2018, pp. 1-14. |
| Extended European Search Report for European Patent Application No. 17210996.9 dated Jun. 13, 2018, pp. 1-7. |
| Office Communication for U.S. Appl. No. 16/525,290 dated Mar. 12, 2020, pp. 1-10. |
| Office Communication for U.S. Appl. No. 15/971,843 dated Mar. 26, 2020, pp. 1-14. |
| Office Communication for U.S. Appl. No. 16/048,939 dated Mar. 26, 2020, pp. 1-6. |
| Office Communication for U.S. Appl. No. 16/543,243 dated Apr. 7, 2020, pp. 1-22. |
| Office Communication for U.S. Appl. No. 16/532,275 dated Apr. 20, 2020, pp. 1-8. |
| Office Communication for U.S. Appl. No. 16/560,886 dated Apr. 22, 2020, pp. 1-10. |
| Office Communication for U.S. Appl. No. 16/565,109 dated May 8, 2020, pp. 1-19. |
| Examination Report for European Patent Application No. 16166907.2 dated Dec. 19, 2019, pp. 1-6. |
| Examination Report for European Patent Application No. 17210996.9 dated May 27, 2020, pp. 1-3. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Aug. 28, 2020, pp. 1-30. |
| Office Communication for U.S. Appl. No. 16/718,050 dated Sep. 4, 2020, pp. 1-23. |
| Office Communication for U.S. Appl. No. 16/525,290 dated Sep. 23, 2020, pp. 1-10. |
| International Search Report and Written Opinion for International Patent Application No. PCT/US2019/030015 dated Aug. 7, 2019, pp. 1-6. |
| International Search Report and Written Opinion for International Patent Application No. PCT/US2019/018097 dated May 28, 2019, pp. 1-9. |
| Office Communication for U.S. Appl. No. 15/971,843 dated Oct. 27, 2020, pp. 1-11. |
| Office Communication for U.S. Appl. No. 16/424,387 dated Nov. 24, 2020, pp. 1-23. |
| Office Communication for U.S. Appl. No. 16/543,243 dated Dec. 16, 2020, pp. 1-13. |
| Office Communication for U.S. Appl. No. 16/565,109 dated Jan. 19, 2021, pp. 1-9. |
| Office Communication for U.S. Appl. No. 16/813,649 dated Feb. 24, 2021, pp. 1-7. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Mar. 26, 2021, pp. 1-31. |
| Office Communication for U.S. Appl. No. 16/525,290 dated Mar. 31, 2021, pp. 1-11. |
| Office Communication for U.S. Appl. No. 15/971,843 dated May 5, 2021, pp. 1-9. |
| Office Communication for U.S. Appl. No. 16/820,582 dated May 10, 2021, pp. 1-24. |
| Office Communication for U.S. Appl. No. 16/525,290 dated Jun. 15, 2021, pp. 1-4. |
| Office Communication for U.S. Appl. No. 17/483,435 dated Nov. 30, 2021, pp. 1-21. |
| Office Communication for U.S. Appl. No. 17/483,148 dated Dec. 13, 2021, pp. 1-28. |
| Office Communication for U.S. Appl. No. 16/813,649 dated Dec. 20, 2021, pp. 1-44. |
| Office Communication for U.S. Appl. No. 17/226,947 dated Dec. 30, 2021, pp. 1-6. |
| Office Communication for U.S. Appl. No. 16/820,582 dated Jan. 14, 2022, pp. 1-13. |
| Office Communication for U.S. Appl. No. 16/989,025 dated Jan. 19, 2022, pp. 1-12. |
| Supplementary European Search Report for European Patent Application No. 19804040.4 dated Jan. 25, 2022, pp. 1-4. |
| Office Communication for U.S. Appl. No. 17/351,866 dated Feb. 9, 2022, pp. 1-9. |
| International Search Report and Written Opinion for International Patent Application No. PCT/US2021/051757 dated 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. 15/585,887 dated Mar. 24, 2022, pp. 1-40. |
| Office Communication for U.S. Appl. No. 17/318,423 dated Mar. 29, 2022, pp. 1-21. |
| Office Communication for U.S. Appl. No. 16/989,343 dated Mar. 29, 2022, pp. 1-5. |
| Office Communication for U.S. Appl. No. 16/813,649 dated Apr. 1, 2022, pp. 1-4. |
| Extended European Search Report for European Patent Application No. 19846527.0 dated 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/813,649 dated 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 dated May 23, 2022, pp. 1-14. |
| Examination Report for European Patent Application No. 17210996.9 dated May 21, 2021, pp. 1-6. |
| Office Communication for U.S. Appl. No. 16/525,290 dated Jul. 9, 2021, pp. 1-7. |
| Office Communication for U.S. Appl. No. 16/718,050 dated Jul. 27, 2021, pp. 1-23. |
| Office Communication for U.S. Appl. No. 15/971,843 dated Jul. 28, 2021, pp. 1-9. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Aug. 17, 2021, pp. 1-41. |
| Office Communication for U.S. Appl. No. 16/820,582 dated Sep. 27, 2021, pp. 1-25. |
| Office Communication for U.S. Appl. No. 17/351,866 dated Oct. 18, 2021, pp. 1-12. |
| Office Communication for U.S. Appl. No. 17/337,299 dated Oct. 21, 2021, pp. 1-34. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Nov. 2, 2021, pp. 1-4. |
| Office Communication for U.S. Appl. No. 17/337,299 dated Feb. 17, 2022, pp. 1-14. |
| Office Communication for U.S. Appl. No. 17/708,311 dated Jun. 20, 2022, pp. 1-15. |
| Office Communication for U.S. Appl. No. 17/722,217 dated Jun. 29, 2022, pp. 1-23. |
| Office Communication for U.S. Appl. No. 17/226,947 dated Jul. 11, 2022, pp. 1-13. |
| Office Communication for U.S. Appl. No. 17/722,217 dated Jul. 15, 2022, pp. 1-7. |
| Office Communication for U.S. Appl. No. 17/721,514 dated Jul. 21, 2022, pp. 1-7. |
| Office Communication for U.S. Appl. No. 16/989,343 dated Aug. 11, 2022, pp. 1-9. |
| Office Communication for U.S. Appl. No. 16/989,343 dated Aug. 17, 2022, pp. 1-5. |
| Office Communication for U.S. Appl. No. 15/585,887 dated Sep. 1, 2022, pp. 1-39. |
| Office Communication for U.S. Appl. No. 17/861,373 dated Sep. 9, 2022, pp. 1-18. |
| Number | Date | Country | |
|---|---|---|---|
| 20200076597 A1 | Mar 2020 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15466248 | Mar 2017 | US |
| Child | 16679055 | US |
