Aspects described herein generally relate to computer hardware and software, and network security, cyber security, and associated cyber defense. In particular, one or more aspects of the disclosure generally relate to computer hardware and software for efficient logging of cyber threat incidents that adaptively minimizes usage of computer network resources for logging while maximizing the logs' informational value for cyber analysis and cyber defense applications. The efficient, adaptive logging may mitigate some Denial-of-Service (DoS) attacks on cyber defense applications and systems.
TCP/IP network security is becoming increasingly important as the information age continues to unfold. Network threats and associated attacks may take a variety of forms (e.g., unauthorized requests or data transfers, viruses, malware, large volumes of traffic designed to overwhelm resources, and the like).
To counter these threats/attacks, various cyber defense methodologies and systems have been developed and deployed. An important component of cyber defense is packet-filtering network appliances that apply sets of packet filtering rules to in-transit Layer 3 Internet Protocol (L3/IP) packets and determine whether to allow/forward each packet toward its destination or block/drop the packet. These network appliances are often inserted inline into links located at the boundaries between a private network (such as an enterprise network) and the public Internet and are configured with a set of packet filtering rules, or a policy, that is designed to protect or otherwise secure the private network in some way. For example, early-generation network firewalls are typically configured with packet filtering rules that enforce a private network's access control policies, such as which Internet services (e.g., well-known ports associated with Internet hosts) that internal hosts are allowed to access, and conversely which internal resources can be accessed by which (unsolicited) Internet hosts. For another example, current-generation packet-filtering network appliances include threat intelligence gateways (TIGs), which may be configured with packet filtering rules with packet matching criteria that correspond to the network addresses, e.g., IP addresses, 5-tuple values, domain names, URIs, and the like, of cyber threats that have been identified by cyber threat intelligence (CTI) providers.
In addition to the block or allow action on matching packets, the packet filtering rules applied by these network appliances may also include actions such as a “log”, or “packet-log”, directive to log matching packets, which may be executed by the appliances' packet-filtering application logic. In the cyber security context, the resultant logs may be the basis/input for cyber analysis applications operated by cyberanalysts that may process the logs in order to determine, for example, the current cyber defense posture and current cyber threat situational awareness, as well as to determine protective, defensive, and/or remedial actions to improve defenses. A packet log may include, for example: information contained in the packet (e.g., header field values, TCP flag values, payload size, etc.); environmental information such as time-of-day and date, direction, identifier and location of the network appliance that observed/filtered the packet, ingress and egress network interfaces, etc.; matching rule information such as the block or allow action, matching criteria (which may correspond to CTI), metadata associated with the matching rule (e.g., CTI provider identifier, CTI feed identifier, etc.); and the like.
It may be the case that the size of the packet log (e.g., measured in bytes) may approach or even exceed the size of the packet. When there are many (threat) packets being logged, for example, during some port scan attacks, DDoS attacks, large file transfers (e.g. malware downloads, exfiltrations, etc.), and the like, then the computer and network resources (processing, storage, bandwidth, etc.) consumed by the packet logs may be excessive or even overwhelming. This excessive/overwhelming consumption of resources may adversely affect the performance of the network appliances, networks, cyber analysis applications and associated platforms, security operations centers (SOCs) hosting the applications, the (human and machine) cyberanalysis resources at the SOCs who may be operating the applications, etc., that may comprise a cyber defense system.
In order to reduce resource usage/consumption but without decreasing informational value for cyberanalysis applications and cyberanalysts, the packet logs for the multiple packets comprising the same bi-directional flow (which may be characterized as packets with the same combination of source and destination IP address values and port values and same protocol value, i.e., the 5-tuple) may be aggregated or synthesized into a single log for the flow. To minimize system-wide resource consumption, this aggregation/synthesis operation may be performed by the network appliance. Thus, instead of multiple packet logs, the single corresponding flow log may be the input to cyberanalysis applications. Furthermore, the packet filtering rules (and associated logic executed by the network appliance) may include a “flow-log” directive that signals the application logic executed by the network appliance to map a matching packet's log information into a corresponding flow log. A flow log may significantly reduce resource consumption by, for example, including only one copy of certain information that is common across all of the packets in the flow, such as the 5-tuple values, and aggregating/synthesizing other information, such as the packets' application-layer payload sizes, into a single value for the flow. In the cyber context, the transformation of multiple packets' logs into a single flow log may be done in a way that reduces resource consumption (e.g., by reducing log file sizes) but does not decrease—and may even increase—the flow log's informational value for cyber analysis applications compared to the informational value of the corresponding multiple packet logs.
However, given at least these factors: (a) the ever-increasing size and ever-changing characteristics of the present Internet threat; (b) the growth of CTI and increased usage of CTI and TIGs to protect networks; and (c) the trend for SOCs to increase operational efficiencies by defending more and larger networks with relatively fewer human and machine cyberanalyst resources, then even flow logging may not be sufficient to prevent cyber defense resources from being overwhelmed, thereby compromising cyber defense. For example, a single cyber threat/attack incident on a single private network may be composed of many (e.g., hundreds of thousands) different flows occurring at a high rate (e.g., hundreds or even thousands of flows per second) and may last for several minutes, which may generate a corresponding number of packet and/or flow logs at a high rate that may overwhelm resources, thereby compromising cyber defenses. Similarly, packet capture functions may overwhelm resources during such incidents. In this context, an incident that causes cyber defense resources to be overwhelmed by logs and captures may be viewed as a denial-of-service (DoS) attack on the cyber defense system.
Thus, there is a need for methods and systems that will significantly reduce resource consumption for processing logs, without necessarily reducing the logs' informational value for cyber analysis and defense applications.
The following presents a simplified summary in order to provide a basic understanding of some aspects of the disclosure. It is intended neither to identify key or critical elements of the disclosure nor to delineate the scope of the disclosure. The following summary merely presents some concepts of the disclosure in a simplified form as a prelude to the description below.
Methods, devices, systems, and/or computer-readable media storing executable instructions disclosed herein by way of example may provide efficient and adaptive cyber threat/attack logging components of network protection systems (e.g., enterprise network protection systems) and associated cyber defense systems. Network protection systems may include packet-filtering network appliances that may be configured with packet filtering rules and associated logic that may (1) detect in-transit packets that correspond to Internet threats, (2) log the threats at the granularity of each single packet and/or of single flows associated with the packets, and (3) capture the packets, i.e., store a copy of each packet. The appliances may send (e.g., immediately) the logs to cyber analysis applications that may be hosted in security operations centers (SOCs), where cyberanalyst humans and/or computing systems may analyze the logs to determine protective, defensive, and/or remedial actions. Some Internet threats/attacks, or incidents, however, may be composed of many different flows occurring at a high rate, which may generate many packet logs and/or flow logs and packet captures in a relatively short time interval that may overwhelm cyber defense system resources, including the cyberanalyst resources that may be located at the SOC, thereby compromising the associated cyber defense system.
The present disclosure also describes example methods, systems, apparatuses, and computer-readable media storing executable instructions that may produce an incident log (e.g., a single incident log) for an incident that may be composed of many different flows and packets, wherein the single incident log may (a) be smaller by one or more orders of magnitude than the corresponding collection of flow logs and/or packet logs that would otherwise be produced, but (b) have similar or possibly more informational value for cyber analysis applications, which may be operated by (human and/or machine) cyberanalysts. Furthermore, the logging mode to be utilized, for example a packet logging mode, a flow logging mode, or an incident logging mode, may be automatically selected or adapted to the current threat/attack environment, which may achieve an objective of minimizing cyber defense resource consumption by logging while simultaneously increasing or even maximizing the informational value of logs for cyberanalysts and associated cyber analysis applications. Similarly, a packet capture mode may be automatically selected or adapted to the current threat/attack environment by, for example, switching between capturing full packets and turning off packet capture or capturing only a portion of each packet in order to reduce resource consumption but without necessarily losing informational value for cyberanalysis.
Packet filtering rules may include directives for incident logging that, upon such a rule being applicable to (e.g., matching) an (in-transit) packet, may signal the network appliance's logic to incorporate the associated log-related information into the incident log or incident logs of one or more incidents that may be associated with the packet. Incident logging may be performed by the network appliance in order to reduce or even minimize resource consumption by the logging component of the associated cyber defense system and thereby potentially mitigate any resource overloading issues that may compromise the cyber defense system. Network appliances may include logic for automatically and efficiently: detecting, managing, and logging incidents; determining the one or more incidents to which a rule-matching packet and/or associated flow belongs; incorporating the log-related information of each rule-matching packet into the log or logs of one or more incidents; and/or distributing the incident logs to cyber analysis applications, which may be hosted by one or more SOCs. Network appliances may similarly include logic for automatically and efficiently turning off packet capture or reducing the portion of packets that may be captured. Cyber threat intelligence (CTI), which may be supplied by CTI provider (CTIP) organizations, may be used to increase or even maximize the efficiency and performance of the incident logging system and associated cyber defense system.
Some aspects as described herein are directed to methods and apparatuses such as a packet-filtering device that may be configured to perform the methods, such as by executing stored computer-readable instructions. For example, one such method may comprise receiving, by a packet-filtering device, a plurality of packet-filtering rules. The plurality of packet-filtering rules may have been determined based on a plurality of threat indicators that was determined based on cyber intelligence reports from a plurality of cyber threat intelligence providers. The method may further comprise logging, by the packet-filtering device and to produce flow log data (for example, a plurality of flow logs), a plurality of flows associated with a plurality of packets that each correspond to (for example, match) at least one of the plurality of packet-filtering rules. The method may further comprise sending, by the packet-filtering device, the flow log data. The method may further comprise logging, by the packet-filtering device and based on a flow logging rate exceeding a threshold flow logging rate, an incident associated with at least some of the plurality of flows. The method may further comprise sending, by the packet-filtering device, incident log data (for example, an incident log) indicating the incident.
Another example of such a method may comprise receiving, by a packet-filtering device, a plurality of packet-filtering rules. The plurality of packet-filtering rules may have been determined based on a plurality of threat indicators that was determined based on cyber intelligence reports from a plurality of cyber threat intelligence providers. The method may further comprise logging, by the packet-filtering device and based on at least one of the plurality of packet-filtering rules, a plurality of packets (for example, in a plurality of packet logs). The method may further comprise determining a plurality of different flows associated with the plurality of logged packets. The method may further comprise determining an incident associated with the plurality of different flows. The method may further comprise sending, by the packet-filtering device, an indication of the incident (for example, an incident log).
Yet another example of such a method may comprise receiving, by a packet-filtering device, a plurality of packet-filtering rules. The plurality of packet-filtering rules may have been determined based on a plurality of threat indicators that was determined based on cyber intelligence reports from a plurality of cyber threat intelligence providers. The method may further comprise logging, by the packet-filtering device (for example, in a plurality of flow logs), a plurality of flows associated with a plurality of received packets that each correspond to at least one of the plurality of packet-filtering rules. The method may further comprise determining a flow logging rate at which the plurality of flows are logged. The method may further comprise determining, based on the flow logging rate, that the plurality of flows are associated with an incident. The method may further comprise logging, by the packet-filtering device, the incident (for example, in an incident log). The method may further comprise sending, by the packet-filtering device, incident log data (for example, at least a portion of the incident log) associated with the incident.
The present disclosure is pointed out with particularity in the appended claims. Features of the disclosure will become more apparent upon a review of this disclosure in its entirety, including the drawing figures provided herewith.
Some features herein are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings, in which like reference numerals refer to similar elements, and wherein:
In the following description of various illustrative embodiments, reference is made to the accompanying drawings, which form a part hereof, and in which is shown, by way of illustration, various embodiments in which aspects of the disclosure may be practiced. It is to be understood that other embodiments may be utilized, and structural and functional modifications may be made, without departing from the scope of the disclosure. In addition, reference is made to particular applications, protocols, and embodiments in which aspects of the disclosure may be practiced. It is to be understood that other applications, protocols, and embodiments may be utilized, and structural and functional modifications may be made, without departing from the scope of the disclosure. It is to be understood that although the descriptions, figures, and examples may reference certain protocols such as the IPv4 protocol, the IPv6 protocol and other protocols may be similarly utilized.
Various connections between elements are discussed in the following description. These connections are general and, unless specified otherwise, may be direct or indirect, wired or wireless, physical or logical (e.g., virtual or software-defined), in any combination. In this respect, the specification is not intended to be limiting.
An important component of cyber defense is the use of packet-filtering devices or systems (also generally referred to herein as network appliances) that apply sets of packet filtering rules to in-transit Layer 3 (L3) packets and determine whether to allow/forward each packet toward its destination or block/drop the packet, i.e., to determine the packet's disposition. These network appliances may be inserted inline into links located at the boundary between a private network, such as an enterprise network, and the public Internet and may be configured with a set of packet filtering rules that is designed to protect or otherwise secure the private network in some way. Accordingly, the set of packet filtering rules defines a (network security) policy, and the network appliance enforces the policy.
For example, early-generation network firewalls and edge routers may be configured with packet filtering rules that enforce a private network's access control policies, such as which Internet services that internal hosts are allowed to access, and conversely which internal resources and services can be accessed by which (unsolicited) Internet hosts. The Internet services and internal resources and services may be identified by their IP addresses, Transmission Control Protocol/User Datagram Protocol (TCP/UDP) ports, and/or protocol types; accordingly, the packet filtering rules' matching criteria are often the packets' 5-tuple values, i.e., the (L3) source and/or destination IP address values, and/or (L4) source and/or destination port values, and/or (L3) protocol value.
For another example, intrusion detection systems (IDSs), intrusion prevention systems (IPSs), and next-generation firewalls may be configured with rules such as packet filtering rules, pattern matching rules, and/or signature matching rules that may enforce policies by inspecting packets' application-layer information, inspecting application-layer messages and files that may be segmented across multiple packets, and tracking network traffic patterns and behaviors.
For yet another example, and referring to
During operation, communications via the Internet 110 may occur between hosts connected to the private networks 102, 104, . . . 108 (which may be protected by TIGs 120 enforcing network protection policies) and hosts connected to the networks 130, 132, . . . 138 (which may be associated with threats). The threat hosts may be associated with threat indicators that may be known to CTIPs 140. Accordingly, the TIGs 120 may be enforcing policies that include packet-filtering rules derived from the threat indicators, for example, packet-filtering rules with matching criteria that correspond to the threat indicators.
When a (in-transit) packet ingresses a TIG 120 and the TIG 120 determines that the packet satisfies (e.g., matches) a rule with directives, such as “log”, “flow-log”, “capture”, etc., the TIG 120 may execute logic (e.g., implemented in the form of executable instructions, hardware, and/or firmware) associated with the directives. The matching packet may be an input to the logic. A (packet) log directive “log” and/or flow-log directive “flow-log” may cause the TIG logic to produce a log of the packet and/or of the associated flow (e.g., characterized by or identified with some combination or sub-combination of the packet's 5-tuple values) that may contain: information included in or otherwise derived from the packet, for example, values of header fields at each layer (e.g., 5-tuple information from L3 and L4), packet size, message content, message size, etc.; environmental information (not included in the packet), for example, packet observation time, ingress and egress interfaces, TIG identifier, TIG location, TIG operator/administrator, etc.; matching rule values, for example, disposition (e.g., block, allow), the matching criteria (e.g., the threat indicator(s)), metadata (e.g., the CTIP identifier, CTIP feed identifier, rule identifier, associated threat/attack type, etc.). For a flow log, in addition to the information in an associated packet log, information such as a flow identifier, flow direction, number of packets in the flow, number of bytes or other amount of data in the flow, TCP flags, connection state(s), start and end times, etc., may be included. Similarly, a packet capture directive “capture”, or “pcap”, may cause the TIG logic to copy the packet and store the copy in a packet capture file. Captured packets and their associated flows, for example, may be retrieved from storage (e.g., by cyberanalysts) in order to investigate/analyze an observed threat. Packet captures may be stored locally at the associated TIG 120 or on-premises by storage resources associated with the network associated with the TIG 120. Packet captures may be retrieved (e.g., by cyberanalysts) on an as-needed basis and often with permission of the organization that operates the associated network.
A TIG 120 may send the packet logs and/or flow logs to one or more Security Operations Centers (SOCs) 160. At a SOC, human and/or machine cyberanalysts may operate cyberanalysis applications that may ingest the logs, perform threat risk analysis, and determine possible remedial actions to improve network defenses. The cyberanalysis applications may be hosted by Security Information and Event Monitoring (STEM) application platforms that are designed to ingest, store, and process log files.
There are some threats/attacks, however, that may cause a TIG 120 to generate large volumes of packet logs and/or flow logs and/or packet captures in a relatively short time interval. When such threats/attacks occur, local TIG computer resources, such as processing, memory, storage, and bandwidth, may be overwhelmed by the flood of logs and captures, which may cause not only loss of information but also loss of network protection. The logs may be sent via the Internet 110 to one or more SOCs 160, which may consume relatively large amounts of network bandwidth, especially at bottlenecks such as Internet access links, where packets may be dropped due to, for example, buffer overflows. Packet drops may cause TCP re-sends, which may further exacerbate network bandwidth consumption issues. At a SOC, the sudden flood of logs may similarly cause SOC computer resources to be overwhelmed, which similarly may cause loss of information and network protection. Furthermore, human and/or machine cyberanalysts at the SOC who are operating cyberanalysis applications similarly may be overwhelmed by the flood of logs, which may further compromise network protections and cyber defense. In this context, an incident that causes cyber defense system resources to be overwhelmed, and thereby compromise cyber defense, may be viewed as a denial-of-service (DoS) attack on the cyber defense system/service.
The threats/attacks (also referred to herein as incidents) that may cause these floods of logs, captures, and associated DoS attacks on cyber defense systems may be broadly characterized as being composed of many different flows that occur within a relatively short time interval, wherein the packets composing the flows will match or otherwise satisfy packet-filtering rules with log, flow-log, and capture directives that are applied by network appliances such as the TIGs 120. For example, port scan attacks, portsweep attacks, and various DDoS attacks may generate such floods. For example, a typical port scan attack may originate from the network THRT-NTWK-1130, and from one or more hosts connected to network 130 with IPv4 addresses associated with the same /24 subnet (i.e., a contiguous block of 256 IPv4 addresses). The attack may target the private network PVT-NTWK-1102, which may have a /24 block of public IPv4 addresses assigned to it by an Internet Service Provider (ISP). The operators of network PVT-NTWK-1102 may have a network firewall/NAT (not shown in
A typical port scan attack on a single private network may generate hundreds of thousands of different flows (e.g., flows with different 5-tuple values) in a short time interval and at a very high rate (e.g., hundreds, or even thousands, of flows per second), which may result in a TIG or other network appliance generating a corresponding amount and rate of flow logs and packet captures. The corresponding flow logs and packet captures may result in multiple megabytes/second of log data and capture data. Because a typical port scan may last for several minutes, this may result in multiple gigabytes of log data and capture data for the single incident associated with a single location (the location of the TIG or other network appliance). Because many enterprises may operate several private networks, where each network may be protected by a TIG or other network appliance, and because malicious actors often simultaneously target most or all of an enterprise's networks, the incident may generate tens or even hundreds of gigabytes of flow log data and packet capture data over the duration of the port scan attack. Some distributed Denial-of-Service (DDoS) attacks, which may share some characteristics of port scan attacks, may generate a similar volume and rate of flow log data and capture data but may be sustained for hours, days, weeks, months, or even years.
Note that the threats/attacks described above in reference to
A purpose of the logs may be to immediately provide threat situational awareness to cyberanalysts at a SOC so that they may, for example: investigate/analyze the threat; make an attack/risk determination; and identify and execute remedial actions and/or protective actions and/or defensive actions. For incidents such as the exemplary port scan attacks noted above, the cyberanalysts may only require a relatively small set of data in order to protect/defend the network(s) vs. the relatively large set of data that (flow) logging may generate for such incidents. To effectively defend/protect the network, a cyberanalyst may only need to know, for example: the threat indicator(s) associated with the incident, e.g., the subnet(s) addresses (which may be efficiently represented in CIDR notation) of the originating threat hosts; the subnet(s) addresses of the target network; the network appliance/TIG identifier; the quantity of individual flows comprising the incident; the quantity of different ports that have been scanned; the start time and end time (or most recent reporting time) of the incident; flow rate(s) (e.g., average and maximum rates); the quantity of (TCP) connections that were made and which IP addresses and ports allowed connections; the identities of the CTIP(s) and CTI feed(s) that supplied the indicator(s) for the packet-filtering rule(s) that matched the events; and/or attack direction, i.e., inbound or outbound or both. Any of this data may be included in a single incident log, which may be smaller (e.g., when measured in bytes) by orders of magnitude than the collection of packet logs and/or flow logs generated by the incident. With such an incident log, a cyberanalyst may be able to protect/defend the network by, for example: investigating/analyzing the incident by accessing the associated CTIP(s)'s threat intelligence report(s) associated with the threat indicator(s), which may report the type, behavior, and goal of the attack, the attack attribution (e.g., malicious actor(s) behind the attack), etc.; determining if the network has vulnerabilities that have been or may be compromised, e.g., by analyzing the connections data; and determining remedial actions and/or protective actions and/or defensive actions, e.g., update the policy enforced by the network appliance or TIG with blocking packet-filtering rules with matching criteria corresponding to the indicators, report vulnerabilities and possible compromises to the administrators of the network associated with the network appliance or TIG, etc. Similarly, packet captures for every packet and associated flow that compose such incidents may not be necessary for cyberanalysis or may not be a significant factor in making cyberanalytic determinations. It may often be the case, for example where a port scan attack sends many TCP SYN packets to discover open connections, that no packet captures or only a small set of packet captures are needed for effective cyberanalysis.
In addition to port scan attacks, other types of attacks, e.g., portsweep attacks, DDoS attacks, etc., that may be characterized as being composed of many different flows (i.e., different bi-directional 5-tuple value combinations) occurring at a relatively high rate, may be similarly represented by incident logs that may be much smaller than the corresponding packet logs and/or flow logs. Although incident logs for different types of attacks may need some different information that characterizes the attack and that further assists cyberanalysts with protecting/defending the network, there are some characteristics and (efficiently represented) associated information that may be common across incident logs, for example any of the following:
Each of the above common characteristics may have efficient representations of the associated information. These efficient representations may compress the associated information in such a way that the incident log size is reduced while not necessarily compromising cyberanalysts' ability to protect/defend the associated network. These efficient representations may vary, depending on, for example, the type of attack and/or other factors. For example, for a typical port scan attack, the threat indicators for the attack sources are often a small set of IP addresses from the same subnet (e.g., the same /24 subnet address) or even a single IP address, in which case the set of threat indicators may be efficiently represented using a single subnet address in CIDR notation without losing informational value for cyberanalysis, or cyberanalytical value, when compared to an enumeration of each IP address. Alternatively, if the set of IP addresses is small, the IP addresses may be listed directly. In any case, the cyberanalytical value, which may be measured as a function of information entropy, of these efficient representations of the attack sources/threat indicators in an incident log may be (much) higher (in the information entropy context) than the cyberanalytical value of the attack sources data contained in the corresponding flow logs, which may contain many thousands of copies of the attack sources/threat indicators. Whereas, for example, for a typical portsweep attack, the threat indicators may be many IP addresses that may be widely distributed across the Internet, in which case the set of many threat indicators may be efficiently represented using the few CTIP(s) identifier(s) and CTI feed identifier(s) associated with the many indicators without losing/lowering cyberanalytical value when compared to a listing of each IP address/threat indicator associated with the attack. Note, however, that for some portsweep attacks, the threat indicator(s) may be only one IP address or for example a small set of IP addresses from the same subnet address.
For another example of efficient representations that may depend on the type of attack, for a port scan attack, there may be many different ports that are scanned, in which case an efficient representation with high cyberanalytical value may be a single number representing the quantity of different ports scanned. Whereas for a portsweep attack, for example, there may be only one (well-known) port that is swept/scanned across the public IP addresses of the target/victim, in which case a single port value is an efficient representation with high cyberanalytical value (compared to the many copies of the port value contained in the corresponding flow logs).
Incident logging may be implemented by augmenting packet filtering rules' syntax with an “incident-log” directive and adding associated incident logging logic to the TIG or other packet-filtering network appliance that applies the rules to (in-transit) packets. Furthermore, an “auto-log” directive may be implemented that automatically (e.g., adaptively) selects the logging mode—such as packet logging, flow logging, and/or incident logging modes—that may reduce or even minimize resource consumption while increasing or even maximizing cyberanalytical value. The “auto-log” directive's logic may adaptively select a logging mode (e.g., an optimal logging mode) based on a combination of factors that may include, for example: (a) the current logging mode in effect (e.g., packet logging, flow logging, or incident logging); (b) the current packet's association with a threat/attack and the threat/attack's type; (c) cyberanalytical value; (d) resource consumption; and/or (e) threat awareness lag, i.e. the time interval between the observation/filtering time of a packet associated with a threat indicator and the time when the associated packet, flow, or incident log may be forwarded by the TIG (toward, for example, a host operating a cyberanalysis application, where the log may function as an alert/signal to a potential threat/attack, and/or to other TIG logic modules). In general, the threat awareness lag for packet logging may be minimal because a packet log can be created and forwarded at packet observation time; whereas the threat awareness lag for flow logging may be larger than that for packet logging because a flow log may not be forwarded until multiple associated packets/packet logs have been observed and incorporated into the flow log and/or a significant non-zero amount of time has elapsed since the most recent packet observation; and similarly, the threat awareness lag for incident logging may be larger than that for flow logging because an incident log may not be forwarded until multiple associated flows/flow logs have been observed and incorporated into the incident log and/or a significant non-zero amount of time has elapsed since the most recent flow log was incorporated into the incident log.
For example, when a packet matches or otherwise satisfies a rule with an auto-log directive, the auto-log logic, which may currently be in flow logging mode, may determine that the packet and associated flow are part of a (recently launched) multi-event, high-rate incident, and that transitioning to the incident logging mode would jointly optimize resource usage and cyberanalytical value. Furthermore, because the determination to transition to incident logging mode may have been based at least in part on the flow logging rate crossing a threshold (at least two flows associated with the attack may have been forwarded to a threat-awareness cyberanalysis application), then the application running the logic may be already aware of the threat associated with the incident and thus threat awareness lag time of incident logging may not be a factor. Later, when the incident/attack has stopped for some specific (e.g., predetermined) period of time and accordingly the rule has not matched or otherwise satisfied a packet for that period of time, then the next packet that matches or otherwise satisfies the rule may cause the auto-log logic to transition from incident logging mode to flow logging mode or packet logging mode. Another potential benefit of the auto-log directive is that when a packet filtering rule and associated policy are being created, the human or machine that is creating the packet filtering rule may not need to select a single (fixed) logging mode and thereby risk pre-selecting a logging mode that may be inefficient during operation and cannot be changed readily, for example, the change may be only be made by manually modifying the policy in response to the incident, which may be effectuated too slowly or even after the incident has completed.
Similarly, an “auto-capture” directive may be associated with a packet-filtering rule that may automatically and adaptively stop capturing packets or capture only a portion of the packets, for example the first 150 bytes of an IPv4 packet, during such incidents. The “auto-capture” logic may be coupled with the “auto-log” logic so that when the logging mode transitions, for example, from flow logging to incident logging, then packet capture may, for example, halt capturing or reduce the captured portion of the packets; and conversely, when the logging mode transitions from incident logging to flow logging, then full packet capture may resume. Accordingly, the auto-capture logic may support, and selectively and automatically switch between, modes such as “full-capture”, “partial-capture”, and “no-capture” of packets.
Although there are no required formal standards for packet filtering rule syntax and semantics, packet-filtering network appliances typically support packet filtering rules that generally conform to this high-level, exemplary, representative schema: <disposition> <directives> <matching-criteria>; <metadata>, where: <disposition> is one of block/deny/drop or allow/pass/forward a packet that matches the rule; the <matching-criteria> correspond to Internet-layer (L3), transport-layer (L4), and/or application-layer header field values, such as some combination of source and destination IP addresses, source and destination ports, protocol, domain names, and/or URIs; and <metadata> is information associated with the rule that may be used to inform applications about the packet and/or rule, for example, the metadata may be included in an associated log that may be processed by a network situational awareness application. The <directives> may be information (such as commands, flags, etc.) that direct the operating application logic of the packet-filtering network appliance to process a matching packet according to the logic associated with the directive. For example, this logic may be additional packet-processing actions applied to a matching packet (e.g., signaled by directives such as “log”, “flow-log”, “capture”, “mirror”, “re-direct”, etc.), whether or not to apply (e.g., conditionally apply) the rule upon packet ingress (“in”) or upon packet egress (“out”) or both (“in out”), whether or not to continue applying (e.g., conditionally continue applying) subsequent rules in the policy to the matching packet (“continue” or “quick”), or associating the rule with specific interfaces of the packet-filtering appliance, etc. For example, a rule “allow quick dst_port=80” will forward any (matching) packets destined for the well-known port 80 (HTTP service), in either direction (i.e., toward an Internet web/HTTP server or toward an internal, public-facing web/HTTP server), and will stop searching for more rules in the policy that match the current packet; whereas a rule “block log dst_port=23” will drop any (matching) packets destined for the well-known port 23 (Telnet service) in either direction and will log the packet. The latter exemplary rule often may be used in practice because: (a) the Telnet remote login service is considered to be insecure, and thus any packets associated with Telnet should be dropped; and (b) the resultant logs may be used to inform network security applications and administrators about which internal hosts/users are potentially compromising security by trying to use Telnet instead of, for example, well-secured SSH for remote logins, and also which Internet hosts/malicious actors are trying to find network vulnerabilities, for example, open Telnet ports, that may be exploited.
One approach to cyber defense is to filter packets associated with Internet threats, which are Internet hosts and/or resources managed by the Internet hosts that are associated with malicious activity. These threats may be researched and identified by cyber threat intelligence (CTI) provider organizations, which may publish CTI reports on the threats. The CTI reports may include threat indicators, which may identify network addresses such as in the form of IP addresses, 5-tuples, domain names, uniform resource identifiers (URIs), and/or the like, of specific Internet hosts and/or resources managed by specific Internet hosts that may be participating in malicious activity. As described above in reference to
Regardless of disposition, the rules comprising CTI-based policies may include logging directives because the logs may be used by cyber analysis applications and associated cyber defense systems to identify threats/attacks and then to take actions to protect/defend the associated networks from the threats/attacks. The rules may also include packet capture directives to potentially assist with cyberanalyses. The TIG logic to execute logging directives may be efficient with respect to time and/or space complexity so that the TIG can process in-transit packets at line rate without significant, or any, performance degradation (e.g., without incurring latencies that may cause packet drops due to buffer overflows). The logic for “log” (i.e., packet logging) and “flow-log” directives may have efficient implementations because, for example, the log information may be efficiently collected using constant time (i.e., O(1)) algorithms that access structured information in the packet being filtered, the local environment, and/or the matching rule. For example, packet logging logic may access the packet's L3, L4, and/or application-layer packet header values, which are located in fixed positions or in efficiently computed positions (e.g., by using offsets). Similarly, environmental information (e.g., packet observation/filtering time) and rule metadata (e.g., CTIP name/identifier) may be efficiently accessed. Flow logging logic may use similar logic as packet logging but that is used for tracking and logging all of the packets in the bi-directional flow associated with the current filtered packet. Flow tracking logic may be efficiently implemented. For example, packets in the same bi-directional flow may be identified by the byte and/or bit string that may be efficiently computed as the concatenation of two or more fields in each packet, such as a concatenation of: (a) the bitwise XOR of the L3 source IP address and destination IP address (32 bits), (b) the bitwise XOR of the L4 source port and destination port (32 bits), and (c) protocol type (16 bits). The resultant string may be considered a direction-normalized flow character for the packet (as well as for the flow); i.e., every packet associated with the same bi-directional flow has the same (direction-normalized) flow character. The resultant string/flow character may be efficiently hashed using any of various known hash methods or any other hash method, and the resultant hash may be used as an index into a flow tracking table (which may have collision avoidance logic). The length of the resultant hash may correspond to the size of the flow tracking table; for example, the 80-bit flow character may be hashed to a 20-bit string, which may be used as an index into a flow tracking table with 2{circumflex over ( )}20=over 1 million possible entries, i.e., a flow tracking table that may track up to about 1 million flows simultaneously. Each entry in the flow tracking table (see, e.g., flow tracking table 602 in
Flow logging logic may also include logic for determining when to forward and/or emit a flow log toward an application and/or toward incident logging logic. Whereas a packet log may be forwarded/emitted immediately upon packet observation/filtering because, for example, the packet log may not include or otherwise depend upon information associated with other packets, a flow log may not be forwarded/emitted immediately after each update of the flow log by an associated packet log. Instead, a flow log may be forwarded/emitted depending on some combination of, for example, the following factors:
Referring to
In Step 2-1, an in-transit packet matches or otherwise satisfies a TIG-enforced packet-filtering rule with a “flow-log” directive or with an “auto-log” directive.
In Step 2-2, if the in-transit packet matches or otherwise satisfies the packet-filtering rule of Step 2-1 (YES/TRUE branch), then the TIG's 120 logic may compute a packet log 601 (
In Step 2-3, the TIG's 120 logic may compute a hash of the packet's (direction-normalized) flow character. The hash may index into a flow tracking table 602.
In Step 2-4, the TIG 120 may check if there is an existing entry, e.g., a flow log 603 or an entry (e.g., a flow) in a flow log 603, indexed by the flow tracking table 602. If so (YES/TRUE branch), then in Step 2-6 the TIG 120 may update the flow log 603 with the information in the packet log 601 and update the parameters that may be used to cause auto-log transitions from packet logging to flow logging or vice versa; similarly, the TIG 120 may update the parameters that may be used for auto-capture, where the parameters may include a parameter with a value that indicates the type of auto-capture mode, such as one value for no capture mode, a second value for partial capture mode, and a third value for full capture mode. If no existing entry is found (NO/FALSE branch), then in Step 2-5 the TIG 120 may create a new entry, e.g., a flow log that is derived from the packet log 601, and set the auto-log mode to a predetermined value (where the value indicates the type of auto-log mode), such as an initial or default value (e.g., one of packet logging, flow logging, or incident logging mode); similarly, the TIG 120 may set the auto-capture mode to a predetermined value (where the value indicates the type of auto-capture mode), such as an initial or default value (e.g., a no capture, partial capture, or full capture mode).
In Step 2-7, the TIG may update one or more parameters associated with forwarding flow logs 603. If the matching rule referenced in Step 2-1 includes a “log” directive, e.g., a packet log directive, and/or if the current auto-log mode is packet logging, then the TIG 120 may forward the packet log toward the SOC(s) 160 associated with the TIG 120. If the matching rule referenced in Step 2-1 includes a “capture” directive, e.g., a packet capture directive, and/or if the current auto-capture mode is “full-capture” or “partial-capture”, then the TIG 120 may copy the packet accordingly and store it in an associated packet capture file. This step (Step 2-7), Step 2-5, and/or Step 2-6 may also include changing auto-log and/or auto-capture modes. The parameters and/or mode may be updated based on one or more packet, flow, and/or incident measurements, and/or based on the filtering rules and/or other rules that define when auto-log parameters and mode, and/or auto-capture parameters and/or mode, are to be changed, and to what values they are to be changed to. Various example conditions have been described herein for determining when and whether parameters and modes should be changed. For example, TIG 120 may, based on a determination that the flow logging rate is high (for instance, the flow logging rate has exceeded a threshold flow logging rate, which may be predetermined), change the auto-log parameters and/or mode to incident logging mode, and/or to change the auto-capture parameters to cause TIG 120 to be in a different auto-capture mode.
In Step 2-8, if the matching rule referenced in Step 2-1 includes a “flow-log” directive and/or if the current auto-log mode is flow logging, and if the flow-log forwarding criteria has been met, then the TIG 120 may forward the flow log 603 toward the SOC(s) 160 associated with the TIG 120 that observed the packet in Step 2-1 and toward the incident tracking logic of that TIG 120 that observed the packet; else (e.g., where the logging mode is incident logging), if the flow-log forwarding criteria has been met, then the TIG 120 may forward the flow log 603 toward the incident tracking logic and not toward the SOC(s) 160 associated with the TIG 120.
In the cyber context, the terms “flow” and “flow log” may often correspond to the terms “event” and “event log”. A communication between two endpoint hosts that may be associated with a threat may be called an event. A log of an end-to-end communication event, or event log, between two endpoint hosts that may be associated with a threat may provide high cyberanalytical value for cyber analysis applications. Because an end-to-end communication event is often segmented into multiple flows—for example, when a communication passes through an intermediate device (such as a firewall or NAT) that changes the 5-tuple values, an event log may be an aggregation/synthesis of the logs of two or more flows that compose the end-to-end communication event. Thus, an event log may reduce resource consumption but without decreasing, and possibly increasing, cyberanalytical value compared to the cyberanalytical value of the multiple flow logs.
Note that event logging may imply that each segment, e.g., each unique 5-tuple flow, that is part of an end-to-end communication event is observable and/or that the flow log of each segment is available for aggregation/synthesis. In some scenarios, the end-to-end communication event may be composed of only one flow/segment, i.e., there are no intermediate devices in the communication path that change the 5-tuple, in which case the event log and the flow log may be equivalent. In other scenarios, only one or some of the segments/flows of an event may be observable; and/or similarly, only one or some of the flow logs may be available. Event logging logic may also need to determine which segments/flows and/or flow logs are components of the same communications events in order to synthesize an event log for a multi-segment/multi-flow communication event. In any case, the term “event log” as used herein may, in context, refer to any of these scenarios. As such, herein the terms “event log” and “flow log”, as well as “event” and “flow”, may be used interchangeably in context. Similarly, references to “flow” and “flow log” of the present disclosure may equivalently be references to “event” and “event log”.
For example, referring to
Whereas the currently observed and filtered packet and/or associated packet log may contain or be associated with the information needed to determine the flow associated with the packet (for example, the 5-tuple information that may characterize a flow), this may not be the case for the threat/attack incident that the packet may be associated with, particularly when the incident may be characterized as being composed of multiple different flows occurring at a relatively high rate. Thus, determining the incident(s) associated with the packet and managing the associated incident logging may require the additional logic and data structures of the present disclosure.
Consider an efficient incident tracking data structure, for example, a linked list implemented as an (efficient) Least Recently Used (LRU) cache, for managing incidents and associated incident logs. Each entry, or element, in the incident tracking list may be an incident log and associated incident identifier/characterization information for each separate incident observed by the associated TIG. Accordingly, each entry/element/incident in the list may be uniquely characterized by a “key” value that may be derived from information contained in a flow log so that when a flow log is forwarded to the incident tracking logic, for example as in Step 2-8 discussed above, then the flow log may be associated with an entry in an incident list. For example, the (many) different flows composing a port scan attack often originate from a small collection of hosts with IPv4 addresses from the same (small) subnet address, for example, from the same /24 subnet address or even from the same /32 subnet address (i.e., a single host/IP address). Thus, an incident that is a port scan attack may be uniquely characterized by a key value that may be, for example, the /24 subnet address of the source IP addresses associated with the flows composing the attack. Therefore, when the incident tracking logic receives a flow log, the logic may compute the key (e.g., the /24 subnet address of the flow), and then search a port scan attack incident list for an entry with the same key. If an entry is found, then the flow log may be incorporated into the associated incident log. If an entry is not found, then a new entry (i.e., a new incident to track) may be inserted into the list and populated with a (new) incident log that is derived from the current flow log.
Note that for cyberanalytic purposes, the key value for a flow log and associated incident for port scan attacks may be, for example, a combination of a subnet address and the identifier/name of the CTI Provider associated with the flow log and/or the identifier/name of the CTI feed associated with the flow log.
Whereas a subnet address for the originating Internet hosts may uniquely characterize an incident that is a port scan attack and may serve as an effective key (or component of a key) for an associated port scan incident tracking list, for other types of attacks, for example a portsweep attack, a different characterization and associated key may be needed to uniquely identify/characterize the associated incident. Accordingly, a separate or different incident tracking list may be used to manage portsweep attack incidents vs. the incident tracking list for managing port scan attacks described above. In general, for each type of incident that may be uniquely characterized using different criteria and thus a different type of key, a separate incident tracking list for each incident type may be used.
For example, in a typical portsweep attack, the attacker may scan a single port, for example the well-known port 1433 (SQL Server), on many, most, or all (public) IP addresses of the target/victim network to see if a specific service, for example SQL Server, is open/available on an Internet-addressable host connected to the target network. Thus, an incident that may be a portsweep attack may be uniquely characterized by a key value that is composed of, for example, the single (well-known) port value associated with the many different flows composing the portsweep attack. Therefore, when the incident tracking logic receives a flow log, the logic may compute the key for a portsweep incident (e.g., the destination port value associated with the flow, which for cyberanalytic purposes may be combined with the identifier/name of the CTI Provider associated with the flow log and/or the identifier/name of the CTI feed associated with the flow log) and then search a portsweep attack incident list for an entry with the same key. If an entry is found, then the flow log may be incorporated into the associated incident log. If an entry is not found, then a new entry (i.e., a new portsweep incident) may be inserted into the list and populated with a (new) incident log that is derived from the current flow log.
Similar to the forwarding criteria for flow logging, each entry in an incident tracking list may be associated with one or more forwarding criteria that determines under what conditions the associated incident log is forwarded toward, for example, the SOC(s) that may be associated with the TIG 120. Because incident logging may be expected to massively reduce resources consumed by logging associated with incidents that are composed of many different flows occurring at a relatively high rate, the forwarding criteria may be based on a combination of aspects such as quantity of flows, (estimated or otherwise determined) rate of flows, time/reporting intervals (e.g., forwarding the current incident log every 30 seconds during the incident lifetime), current logging mode, transitions to different modes, threat awareness lag, cyberanalytical value, and/or the like, that may be associated with the incident, its initiation time, and/or the current time. To reduce resource consumption compared to the corresponding flow logging, in general an incident log may be forwarded after multiple associated flows have occurred since the incident's start time and/or since the most recent forwarding of the incident log. Also, the rate of flow logs may be used by auto-logging logic to transition between logging modes. For example, if the current mode is flow logging and the rate of flow logs exceeds a (configurable, e.g., predetermined) threshold value, then the logging mode may transition to incident logging; conversely, if the current mode is incident logging and the rate of flow logs drops below a (configurable, e.g., predetermined) threshold value (which may or may not be the same threshold value for measuring when the rate of flows exceeds a threshold), then the logging mode may transition to flow logging. Auto-capture logic may be coupled with logging mode transitions such that, for example, when the logging mode transitions from flow logging to incident logging, then packet capture halts (“no-capture” mode); conversely, when the logging mode transitions from incident logging to flow logging, then packet capture may resume in “partial-capture” or “full-capture” mode.
Because of the bursty nature of network traffic, the potentially high rate of flows, a desire to reduce or even minimize compute resource consumption, and the usefulness of estimating or otherwise determining rates for each entry in each incident tracking list managed by the incident tracking logic, it may be advantageous that the estimated or otherwise determined rate computation be efficient, accurate, and robust to bursty behavior. The rate computation logic may monitor and continually estimate or otherwise determine the current average time interval between flow logs associated with an incident, or inversely may monitor and continually estimate the rate that flow logs are received. Those average intervals or rates may be estimated or otherwise determined, for example, based on an exponentially weighted moving average (EWMA) method, or based on an exponential smoothing method. Exponential smoothing is time and space efficient because each update to the estimate after each flow log has been received requires only a constant-time computation (typically two multiplications and one addition), and typically only three values need be stored at any time (for each managed incident, i.e., for each incident in each incident list). Note that an exponential smoothing method may be used similarly to compute packet rates when, for example, computing forwarding criteria for flow logging.
Referring to
Step 3-1: A flow log 603 (
Step 3-2: For each incident list 604 of a plurality of potential incident lists:
Step 3-3: Each incident list 604 may have one or more entries indexed by an (usually different) incident key. For the current incident list 604, the TIG 120 may compute an incident-specific key from the flow log.
Step 3-4: The TIG 120 may search the current incident list for an entry (corresponding to an incident) with an incident key that matches the flow log key that was determined in Step 3-3. If a match is found, then in Step 3-4T the TIG 120 may incorporate the flow log 603 from Step 3-1 into the incident list 604; else, in Step 3-4F the TIG 120 may insert a new entry (corresponding to a new incident) in the current incident list 604 corresponding to an incident log 605 derived from the flow log 603 and with the incident key for that new entry set to the incident-specific key that was determined in Step 3-3.
Step 3-5: The TIG 120 may update the incident log 605 forwarding parameters, auto-log parameters and/or mode, and/or auto-capture parameters and/or mode, which may include changing auto-log and/or auto-capture modes. The parameters and/or mode may be updated based on one or more packet, flow, and/or incident measurements, and/or based on the filtering rules and/or other rules that define when auto-log parameters and mode, and/or auto-capture parameters and/or mode, are to be changed, and to what values they are to be changed to. Various example conditions have been described herein for determining when and whether parameters and modes should be changed. For example, TIG 120 may, based on a determination that the flow logging rate is low (for instance, the flow logging rate has dropped below a threshold flow logging rate, which may be predetermined), change the auto-log parameters and/or mode to flow logging mode, and/or to change the auto-capture parameters to cause TIG 120 to be in a different auto-capture mode.
Step 3-6: Determine if the current incident log 605 should be forwarded, for example, sent to the SOC(s) associated with this TIG. For example, the incident log 605 may be associated with a rule (which may be part of or in addition to the filtering rules) that the incident log 605 is emitted periodically, such as every thirty seconds or any other time period. If so, then if an “incident-log” directive is in effect or the current “auto-log” mode parameter indicates “incident logging”, then forward the incident log 605. Return to Step 3-2 to process next incident list 604 (if any).
Any of the elements described herein or illustrated in any of the figures, such as any of TIGs 120, may be partially or fully implemented using one or more computing devices. Hardware elements of an example computing device 400, which may be used to implement any of the other elements described herein, are shown in
As explained above, computing device 400 may be embodied, for example, as a packet-filtering device such as a TIG (e.g., any of TIGs 120). An example block diagram of such a packet-filtering device 500, which may be located at a boundary 502 of a network such as network 102 (or, for example, networks 104 or 108) is shown in
Packet-filtering device 500 may be configured to receive a policy (such as the filtering rules described herein) from one or more security policy management servers (e.g., SPMS(s) 150, shown in
Policy 518 may include one or more filtering rules, and the configuration of packet filter 512 may be based on one or more of the rules included in policy 518. For example, policy 518 may include one or more rules specifying that packets having specified information should be forwarded to operator 520, that packets having different specified information should be forwarded to operator 522, and that all other packets should be forwarded to operator 524. Operators 520, 522, and/or 524 may be configured to perform one or more functions on packets they receive from packet filter 512. For example, one or more of operators 520, 522, and/or 524 may be configured to forward packets received from packet filter 512 into network 102, forward packets received from packet filter 512 to an IPsec stack (not illustrated) having an IPsec security association corresponding to the packets, or drop packets received from packet filter 512. In some embodiments, one or more of operators 520, 522, and/or 524 may be configured to drop packets by sending the packets to a local “infinite sink” (e.g., the/dev/null device file in a UNIX/LINUX system).
Also, one or more of operators 520, 522, and/or 524 may be configured to trigger any of the packet logging, flow logging, and/or incident logging functions described herein, based on one or more filtering rules set forth in policy 518. For example, if one or more packets are determined by operator 522 to match or otherwise satisfy one or more rules, then operator 522 may send information to processor(s) 504 indicating this (e.g., indicating which rule(s) are satisfied, and/or indicating logging parameters that should be used). In turn, processor(s) 504 may initiate, adapt, and/or terminate an appropriate type of logging. Any of the packet logs, flow logs, incident logs, and/or lists, tables, and/or indices associated with these as described herein (such as those shown in
In general, the functions and steps described herein may be embodied in computer-usable data or computer-executable instructions, such as in one or more program modules, executed by one or more computing devices (e.g., computers or other data-processing devices such as computing device 400 or packet-filtering device 500) to perform one or more functions described herein. Generally, program modules may include routines, programs, objects, components, data structures, and/or other elements that perform particular tasks or implement particular abstract data types when executed by one or more processors of one or more computing devices. The computer-executable instructions may be stored on a computer-readable medium such as a hard disk, optical disk, removable storage media, and/or solid-state or other memory such as RAM, etc. (e.g., storage 402 or memory 506). As will be appreciated, the functionality of the program modules may be combined or distributed as desired. In addition, the functionality may be embodied in whole or in part in firmware or hardware equivalents, such as integrated circuits, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGA), and the like. Particular data structures may be used to more effectively implement one or more aspects of the disclosure, and such data structures are contemplated to be within the scope of computer-executable instructions and computer-usable data described herein.
Non-limiting examples of concepts described in the present disclosure are set forth in the following numbered clauses:
Although not required, one of ordinary skill in the art will appreciate that various aspects described herein may be embodied as a method, system, apparatus, or one or more computer-readable media storing computer-executable instructions that, when executed by one or more processors of a computing device, cause the computing device to perform steps as disclosed herein. Accordingly, aspects may take the form of an entirely hardware embodiment, an entirely software embodiment, an entirely firmware embodiment, an entirely virtual embodiment, or an embodiment combining software, hardware, virtualized, and/or firmware aspects in any combination.
As described herein, the various methods and acts may be operative across one or more physically separate or integrated computing devices (which together may form a computing device) and networks. The functionality may be distributed in any manner or may be located in a single physical computing device or virtual version of a computing device (e.g., a server, client computer, a user device, a virtual environment, or the like).
Aspects of the disclosure have been described in terms of illustrative embodiments thereof. Numerous other embodiments, modifications, and variations within the scope and spirit of the appended claims will occur to persons of ordinary skill in the art from a review of this disclosure. For example, one of ordinary skill in the art will appreciate that the steps illustrated in the illustrative figures may be performed in other than the recited order and that one or more illustrated steps may be optional.
This application is a continuation of U.S. patent application Ser. No. 17/838,478, filed Jun. 13, 2022, which is a continuation of U.S. patent application Ser. No. 17/380,519, filed Jul. 20, 2021, which claims priority to U.S. provisional patent application Ser. No. 63/106,166, filed Oct. 27, 2020, all of which are hereby incorporated by reference as to their entireties.
Number | Name | Date | Kind |
---|---|---|---|
5226141 | Esbensen | Jul 1993 | A |
6098172 | Coss et al. | Aug 2000 | A |
6147976 | Shand et al. | Nov 2000 | A |
6226372 | Beebe et al. | May 2001 | B1 |
6279113 | Vaidya | Aug 2001 | B1 |
6317837 | Kenworthy | Nov 2001 | B1 |
6484261 | Wiegel | Nov 2002 | B1 |
6611875 | Chopra et al. | Aug 2003 | B1 |
6662235 | Callis et al. | Dec 2003 | B1 |
6678835 | Shah et al. | Jan 2004 | B1 |
6826694 | Dutta et al. | Nov 2004 | B1 |
6907042 | Oguchi | Jun 2005 | B1 |
6971028 | Lyle et al. | Nov 2005 | B1 |
7089581 | Nagai et al. | Aug 2006 | B1 |
7095716 | Ke et al. | Aug 2006 | B1 |
7107613 | Chen et al. | Sep 2006 | B1 |
7143438 | Coss et al. | Nov 2006 | B1 |
7152240 | Green et al. | Dec 2006 | B1 |
7185368 | Copeland, III | Feb 2007 | B2 |
7215637 | Ferguson et al. | May 2007 | B1 |
7225269 | Watanabe | May 2007 | B2 |
7227842 | Ji et al. | Jun 2007 | B1 |
7237267 | Rayes et al. | Jun 2007 | B2 |
7254114 | Turner et al. | Aug 2007 | B1 |
7263099 | Woo et al. | Aug 2007 | B1 |
7296288 | Hill et al. | Nov 2007 | B1 |
7299353 | Le Pennec et al. | Nov 2007 | B2 |
7320022 | Hayter et al. | Jan 2008 | B2 |
7331061 | Ramsey et al. | Feb 2008 | B1 |
7478429 | Lyon | Jan 2009 | B2 |
7499412 | Matityahu et al. | Mar 2009 | B2 |
7539186 | Aerrabotu et al. | May 2009 | B2 |
7594270 | Church et al. | Sep 2009 | B2 |
7610621 | Turley et al. | Oct 2009 | B2 |
7684400 | Govindarajan et al. | Mar 2010 | B2 |
7710885 | Ilnicki et al. | May 2010 | B2 |
7721084 | Salminen et al. | May 2010 | B2 |
7792775 | Matsuda | Sep 2010 | B2 |
7814158 | Malik | Oct 2010 | B2 |
7814546 | Strayer et al. | Oct 2010 | B1 |
7818794 | Wittman | Oct 2010 | B2 |
7849502 | Bloch et al. | Dec 2010 | B1 |
7913303 | Rouland et al. | Mar 2011 | B1 |
7954143 | Aaron | May 2011 | B2 |
8004994 | Darisi et al. | Aug 2011 | B1 |
8009566 | Zuk et al. | Aug 2011 | B2 |
8037517 | Fulp et al. | Oct 2011 | B2 |
8042149 | Judge | Oct 2011 | B2 |
8042167 | Fulp et al. | Oct 2011 | B2 |
8117655 | Spielman | Feb 2012 | B2 |
8156206 | Kiley et al. | Apr 2012 | B2 |
8176561 | Hurst et al. | May 2012 | B1 |
8219675 | Ivershen | Jul 2012 | B2 |
8271645 | Rajan et al. | Sep 2012 | B2 |
8306994 | Kenworthy | Nov 2012 | B2 |
8307029 | Davis et al. | Nov 2012 | B2 |
8331234 | Newton et al. | Dec 2012 | B1 |
8413238 | Sutton | Apr 2013 | B1 |
8422391 | Zhu | Apr 2013 | B2 |
8495725 | Ahn | Jul 2013 | B2 |
8510821 | Brandwine et al. | Aug 2013 | B1 |
8726379 | Stiansen et al. | May 2014 | B1 |
8806638 | Mani | Aug 2014 | B1 |
8832832 | Visbal | Sep 2014 | B1 |
8839417 | Jordan | Sep 2014 | B1 |
8856926 | Narayanaswamy et al. | Oct 2014 | B2 |
8918838 | Baldonado | Dec 2014 | B1 |
8935785 | Pandrangi | Jan 2015 | B2 |
9094445 | Moore et al. | Jul 2015 | B2 |
9124552 | Moore | Sep 2015 | B2 |
9137205 | Rogers et al. | Sep 2015 | B2 |
9154446 | Gemelli et al. | Oct 2015 | B2 |
9160713 | Moore | Oct 2015 | B2 |
9172627 | Kjendal et al. | Oct 2015 | B2 |
9185127 | Neou et al. | Nov 2015 | B2 |
9342691 | Maestas | May 2016 | B2 |
9392003 | Amsler | Jul 2016 | B2 |
9413722 | Ahn et al. | Aug 2016 | B1 |
9419942 | Buruganahalli et al. | Aug 2016 | B1 |
9503529 | Li et al. | Nov 2016 | B2 |
9531672 | Li et al. | Dec 2016 | B1 |
9634911 | Meloche | Apr 2017 | B2 |
9686193 | Moore | Jun 2017 | B2 |
10205733 | Park et al. | Feb 2019 | B1 |
20010039579 | Trcka et al. | Nov 2001 | A1 |
20010039624 | Kellum | Nov 2001 | A1 |
20020016858 | Sawada et al. | Feb 2002 | A1 |
20020038339 | Xu | Mar 2002 | A1 |
20020049899 | Kenworthy | Apr 2002 | A1 |
20020083345 | Halliday et al. | Jun 2002 | A1 |
20020112188 | Syvanne | Aug 2002 | A1 |
20020152209 | Merugu et al. | Oct 2002 | A1 |
20020164962 | Mankins et al. | Nov 2002 | A1 |
20020165949 | Na et al. | Nov 2002 | A1 |
20020186683 | Buck et al. | Dec 2002 | A1 |
20020198981 | Corl et al. | Dec 2002 | A1 |
20030005122 | Freimuth et al. | Jan 2003 | A1 |
20030014665 | Anderson et al. | Jan 2003 | A1 |
20030018591 | Komisky | Jan 2003 | A1 |
20030035370 | Brustoloni | Feb 2003 | A1 |
20030051026 | Carter et al. | Mar 2003 | A1 |
20030088787 | Egevang | May 2003 | A1 |
20030097590 | Syvanne | May 2003 | A1 |
20030105976 | Copeland | Jun 2003 | A1 |
20030120622 | Nurmela et al. | Jun 2003 | A1 |
20030123456 | Denz et al. | Jul 2003 | A1 |
20030142681 | Chen et al. | Jul 2003 | A1 |
20030145225 | Bruton et al. | Jul 2003 | A1 |
20030154297 | Suzuki et al. | Aug 2003 | A1 |
20030154399 | Zuk et al. | Aug 2003 | A1 |
20030188192 | Tang et al. | Oct 2003 | A1 |
20030212900 | Liu et al. | Nov 2003 | A1 |
20030220940 | Futoransky et al. | Nov 2003 | A1 |
20040010712 | Hui et al. | Jan 2004 | A1 |
20040015719 | Lee et al. | Jan 2004 | A1 |
20040015905 | Huima | Jan 2004 | A1 |
20040073655 | Kan et al. | Apr 2004 | A1 |
20040088542 | Daude et al. | May 2004 | A1 |
20040093513 | Cantrell et al. | May 2004 | A1 |
20040098511 | Lin et al. | May 2004 | A1 |
20040114518 | MacFaden et al. | Jun 2004 | A1 |
20040123220 | Johnson et al. | Jun 2004 | A1 |
20040131056 | Dark | Jul 2004 | A1 |
20040148520 | Talpade et al. | Jul 2004 | A1 |
20040151155 | Jouppi | Aug 2004 | A1 |
20040172529 | Culbert | Sep 2004 | A1 |
20040172557 | Nakae et al. | Sep 2004 | A1 |
20040177139 | Schuba et al. | Sep 2004 | A1 |
20040193943 | Angelino et al. | Sep 2004 | A1 |
20040199629 | Bomer et al. | Oct 2004 | A1 |
20040205360 | Norton et al. | Oct 2004 | A1 |
20040250124 | Chesla et al. | Dec 2004 | A1 |
20050010765 | Swander et al. | Jan 2005 | A1 |
20050024189 | Weber | Feb 2005 | A1 |
20050071650 | Jo et al. | Mar 2005 | A1 |
20050076227 | Kang et al. | Apr 2005 | A1 |
20050108557 | Kayo et al. | May 2005 | A1 |
20050114704 | Swander | May 2005 | A1 |
20050117576 | McDysan et al. | Jun 2005 | A1 |
20050125697 | Tahara | Jun 2005 | A1 |
20050138204 | Iyer et al. | Jun 2005 | A1 |
20050138353 | Spies et al. | Jun 2005 | A1 |
20050141537 | Kumar et al. | Jun 2005 | A1 |
20050183140 | Goddard | Aug 2005 | A1 |
20050193429 | Demopoulos | Sep 2005 | A1 |
20050229246 | Rajagopal et al. | Oct 2005 | A1 |
20050249214 | Peng | Nov 2005 | A1 |
20050251570 | Heasman et al. | Nov 2005 | A1 |
20050257264 | Stolfo et al. | Nov 2005 | A1 |
20050283823 | Okajo et al. | Dec 2005 | A1 |
20050286522 | Paddon et al. | Dec 2005 | A1 |
20060031928 | Conley et al. | Feb 2006 | A1 |
20060048142 | Roese et al. | Mar 2006 | A1 |
20060053491 | Khuti et al. | Mar 2006 | A1 |
20060070122 | Bellovin | Mar 2006 | A1 |
20060080733 | Khosmood et al. | Apr 2006 | A1 |
20060085849 | Culbert | Apr 2006 | A1 |
20060104202 | Reiner | May 2006 | A1 |
20060114899 | Toumura et al. | Jun 2006 | A1 |
20060133377 | Jain | Jun 2006 | A1 |
20060136987 | Okuda | Jun 2006 | A1 |
20060137009 | Chesla | Jun 2006 | A1 |
20060146879 | Anthias et al. | Jul 2006 | A1 |
20060159028 | Curran-Gray et al. | Jul 2006 | A1 |
20060195896 | Fulp et al. | Aug 2006 | A1 |
20060212572 | Afek et al. | Sep 2006 | A1 |
20060248580 | Fulp et al. | Nov 2006 | A1 |
20060262798 | Joshi et al. | Nov 2006 | A1 |
20070056038 | Lok | Mar 2007 | A1 |
20070083924 | Lu | Apr 2007 | A1 |
20070097976 | Wood et al. | May 2007 | A1 |
20070118894 | Bhatia | May 2007 | A1 |
20070211644 | Ottamalika et al. | Sep 2007 | A1 |
20070240208 | Yu et al. | Oct 2007 | A1 |
20070291789 | Kutt et al. | Dec 2007 | A1 |
20080005795 | Acharya et al. | Jan 2008 | A1 |
20080028467 | Kommareddy et al. | Jan 2008 | A1 |
20080043739 | Suh et al. | Feb 2008 | A1 |
20080072307 | Maes | Mar 2008 | A1 |
20080077705 | Li et al. | Mar 2008 | A1 |
20080080493 | Weintraub et al. | Apr 2008 | A1 |
20080086435 | Chesla | Apr 2008 | A1 |
20080101234 | Nakil et al. | May 2008 | A1 |
20080163333 | Kasralikar | Jul 2008 | A1 |
20080201772 | Mondaeev et al. | Aug 2008 | A1 |
20080229415 | Kapoor et al. | Sep 2008 | A1 |
20080235755 | Blaisdell et al. | Sep 2008 | A1 |
20080279196 | Friskney et al. | Nov 2008 | A1 |
20080301765 | Nicol et al. | Dec 2008 | A1 |
20080313738 | Enderby | Dec 2008 | A1 |
20080320116 | Briggs | Dec 2008 | A1 |
20090028160 | Eswaran et al. | Jan 2009 | A1 |
20090103524 | Mantripragada et al. | Apr 2009 | A1 |
20090138938 | Harrison et al. | May 2009 | A1 |
20090150972 | Moon et al. | Jun 2009 | A1 |
20090172800 | Wool | Jul 2009 | A1 |
20090222877 | Diehl et al. | Sep 2009 | A1 |
20090240698 | Shukla et al. | Sep 2009 | A1 |
20090249482 | Sarathy | Oct 2009 | A1 |
20090262723 | Pelletier et al. | Oct 2009 | A1 |
20090262741 | Jungck et al. | Oct 2009 | A1 |
20090300759 | Wang et al. | Dec 2009 | A1 |
20090328219 | Narayanaswamy | Dec 2009 | A1 |
20100011433 | Harrison et al. | Jan 2010 | A1 |
20100011434 | Kay | Jan 2010 | A1 |
20100082811 | Van Der Merwe et al. | Apr 2010 | A1 |
20100095367 | Narayanaswamy | Apr 2010 | A1 |
20100107240 | Thaler et al. | Apr 2010 | A1 |
20100115621 | Staniford et al. | May 2010 | A1 |
20100132027 | Ou | May 2010 | A1 |
20100195503 | Raleigh | Aug 2010 | A1 |
20100199346 | Ling et al. | Aug 2010 | A1 |
20100202299 | Strayer et al. | Aug 2010 | A1 |
20100211678 | McDysan et al. | Aug 2010 | A1 |
20100232445 | Bellovin | Sep 2010 | A1 |
20100242098 | Kenworthy | Sep 2010 | A1 |
20100268799 | Maestas | Oct 2010 | A1 |
20100296441 | Barkan | Nov 2010 | A1 |
20100303240 | Beachem et al. | Dec 2010 | A1 |
20110055916 | Ahn | Mar 2011 | A1 |
20110055923 | Thomas | Mar 2011 | A1 |
20110088092 | Nguyen et al. | Apr 2011 | A1 |
20110141900 | Jayawardena et al. | Jun 2011 | A1 |
20110185055 | Nappier et al. | Jul 2011 | A1 |
20110214157 | Korsunsky et al. | Sep 2011 | A1 |
20110270956 | McDysan et al. | Nov 2011 | A1 |
20110277034 | Hanson | Nov 2011 | A1 |
20120023576 | Sorensen et al. | Jan 2012 | A1 |
20120084866 | Stolfo | Apr 2012 | A1 |
20120106354 | Pleshek et al. | May 2012 | A1 |
20120113987 | Riddoch et al. | May 2012 | A1 |
20120240135 | Risbood et al. | Sep 2012 | A1 |
20120240185 | Kapoor et al. | Sep 2012 | A1 |
20120264443 | Ng et al. | Oct 2012 | A1 |
20120314617 | Erichsen et al. | Dec 2012 | A1 |
20120331543 | Bostrom et al. | Dec 2012 | A1 |
20130047020 | Hershko et al. | Feb 2013 | A1 |
20130055373 | Beacham et al. | Feb 2013 | A1 |
20130059527 | Hasesaka et al. | Mar 2013 | A1 |
20130061294 | Kenworthy | Mar 2013 | A1 |
20130104236 | Ray et al. | Apr 2013 | A1 |
20130117852 | Stute | May 2013 | A1 |
20130139236 | Rubinstein et al. | May 2013 | A1 |
20130212680 | Winn et al. | Aug 2013 | A1 |
20130254766 | Zuo et al. | Sep 2013 | A1 |
20130262655 | Desch nes et al. | Oct 2013 | A1 |
20130291100 | Ganapathy et al. | Oct 2013 | A1 |
20130305311 | Puttaswamy Naga et al. | Nov 2013 | A1 |
20140075510 | Sonoda et al. | Mar 2014 | A1 |
20140082204 | Shankar et al. | Mar 2014 | A1 |
20140082730 | Vashist et al. | Mar 2014 | A1 |
20140115654 | Rogers et al. | Apr 2014 | A1 |
20140150051 | Bharali et al. | May 2014 | A1 |
20140201123 | Ahn et al. | Jul 2014 | A1 |
20140208420 | Mraz | Jul 2014 | A1 |
20140215561 | Roberson et al. | Jul 2014 | A1 |
20140215574 | Erb et al. | Jul 2014 | A1 |
20140259170 | Amsler | Sep 2014 | A1 |
20140280778 | Paxton | Sep 2014 | A1 |
20140281030 | Cui et al. | Sep 2014 | A1 |
20140283004 | Moore | Sep 2014 | A1 |
20140283030 | Moore et al. | Sep 2014 | A1 |
20140317397 | Martini | Oct 2014 | A1 |
20140337613 | Martini | Nov 2014 | A1 |
20140366132 | Stiansen et al. | Dec 2014 | A1 |
20150033336 | Wang et al. | Jan 2015 | A1 |
20150106930 | Honda et al. | Apr 2015 | A1 |
20150128274 | Giokas | May 2015 | A1 |
20150135325 | Stevens et al. | May 2015 | A1 |
20150207809 | Macaulay | Jul 2015 | A1 |
20150237012 | Moore | Aug 2015 | A1 |
20150244734 | Olson et al. | Aug 2015 | A1 |
20150256431 | Buchanan et al. | Sep 2015 | A1 |
20150304354 | Rogers et al. | Oct 2015 | A1 |
20150334125 | Bartos et al. | Nov 2015 | A1 |
20150341389 | Kurakami | Nov 2015 | A1 |
20150350229 | Mitchell | Dec 2015 | A1 |
20150372977 | Yin | Dec 2015 | A1 |
20150373043 | Wang et al. | Dec 2015 | A1 |
20160020968 | Aumann et al. | Jan 2016 | A1 |
20160028751 | Cruz Mota et al. | Jan 2016 | A1 |
20160065611 | Fakeri-Tabrizi et al. | Mar 2016 | A1 |
20160112443 | Grossman et al. | Apr 2016 | A1 |
20160119365 | Barel | Apr 2016 | A1 |
20160191558 | Davison | Jun 2016 | A1 |
20160205069 | Blocher et al. | Jul 2016 | A1 |
20160219065 | Dasgupta et al. | Jul 2016 | A1 |
20160285706 | Rao | Sep 2016 | A1 |
20160294870 | Banerjee et al. | Oct 2016 | A1 |
20160308894 | Ahn et al. | Oct 2016 | A1 |
20160366099 | Jordan | Dec 2016 | A1 |
20170223046 | Singh | Aug 2017 | A1 |
20170272469 | Kraemer et al. | Sep 2017 | A1 |
20170324709 | Ahn et al. | Nov 2017 | A1 |
20180288074 | Thayer et al. | Oct 2018 | A1 |
20190373052 | Pollitt et al. | Dec 2019 | A1 |
20210067538 | Mishra | Mar 2021 | A1 |
20210226865 | Gupta | Jul 2021 | A1 |
Number | Date | Country |
---|---|---|
2005328336 | Sep 2011 | AU |
2006230171 | Jun 2012 | AU |
2600236 | Oct 2006 | CA |
1006701 | Jun 2000 | EP |
1313290 | May 2003 | EP |
1484884 | Dec 2004 | EP |
1677484 | Jul 2006 | EP |
2385676 | Nov 2011 | EP |
2482522 | Aug 2012 | EP |
2498442 | Sep 2012 | EP |
1864226 | May 2013 | EP |
20010079361 | Aug 2001 | KR |
2005046145 | May 2005 | WO |
2006093557 | Sep 2006 | WO |
2006105093 | Oct 2006 | WO |
2007109541 | Sep 2007 | WO |
2011038420 | Mar 2011 | WO |
2012146265 | Nov 2012 | WO |
2016196683 | Dec 2016 | WO |
Entry |
---|
Sourcefire 3D System User Guide, Version 4.10, Mar. 16, 2011, 2123 pages. |
Nichols, et al., “Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers,” Network Working Group RFC 2474, Dec. 1998, 20 pages. |
Perkins, “IP Encapsulation with IP,” Network Working Group RFC 2003, Oct. 1996, 14 pages. |
Blake, et al., “An Architecture for Differentiated Services,” Network Working Group RFC 2475, Dec. 1998, 36 pages. |
Cisco ACNS Software Configuration Guide for Centrally Managed Deployments, Release 5.5 (“ACNS Guide”), 2006, 944 pages. |
Ylonen, et al.,“The Secure Shell (SSH) Transport Layer Protocol,” SSH Communication Security Corp, Network Working Group RFC 4253, Jan. 2006, 32 pages. |
Ingate Firewall/SIParator® SIP Security Best Practice (“Ingate”), published Sep. 2, 2008, 15 pages. |
Bradner, “The Internet Standards Process—Revision 3,” Network Working Group RFC 2026, Oct. 1996, 36 pages. |
J. Frahim, et al., “Cisco ASA: All-in-One Firewall, IPS, and VPN Adaptive Security Appliance,” Cisco Press 2006, first printed Oct. 2005, 54 pages. |
Golnabi, et al., “Analysis of Firewall Policy Rules Using Data Mining Techniques,” 2006 IEEE, pp. 305-315. |
C. Fellin, et al., “Preventing Mistraining of Anomaly-Based IDSs through Ensemble Systems,” 2014 IEEE 10th World Congress on Services, (2014) pp. 66-69. |
Feb. 22, 2022—(EP) Communication with Extended European Search Report—App 21197561.01. |
“Control Plane Policing Implementation Best Practices”; Cisco Systems; Mar. 13, 2013; <https://web.archive.org/web/20130313135143/http:www.cisco.com/web/about/security/intelligence/coppwp_gs.html>. |
Reumann, John; “Adaptive Packet Filters”; IEEE, 2001, Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI. |
Greenwald, Michael; “Designing an Academic Firewall: Policy, Practice, and Experience with SURF”; IEEE, Proceedings of SNDSS, 1996. |
Mizuno et al., A New Remote Configurable Firewall System for Home-use Gateways, Jan. 2005. Second IEEE Consumer Communications and Networking Conference, pp. 599-601. |
Moore, S, “SBIR Case Study: Centripetal Networks: How CNI Leveraged DHS S&T SBIR Funding to Launch a Successful Cyber Security Company,” 2012 Principal Investigators' Meeting, Cyber Security Division, Oct. 10, 2014. |
Kindervag, et al. “Build Security Into Your Network's DNA: The Zero Trust Network Architecture,” Forrester Research Inc.; Nov. 5, 2010, pp. 1-26. |
Palo Alto Networks; “Designing a Zero Trust Network With Next-Generation Firewalls”; pp. 1-10; last viewed on Oct. 21, 2012. |
Fulp, Errin: “CV: Errin Fulp,” XP002618346, www.cs.wfu.edu/fulp/ewfPub.html, pp. 1-5 (Copyright 2010). |
Acharya et al., “OPTWALL: A Hierarchical Traffic-Aware Firewall,” Department of Computer Science, Telecommunications Program, University of Pittsburgh, pp. 1-11 (2007). |
Tarsa et al., “Balancing Trie-Based Policy representations for Network Firewalls,” Department of Computer Science, Wake Forest University, pp. 1-6 (2006). |
Fulp, “Trie-Based Policy Representations for Network Firewalls,” Proceedings of the IEEE International Symposium on Computer Communications (2005). |
E. Fulp, “Optimization of Network Firewall Policies Using Ordered Sets and Directed Acyclical Graphs”, Technical Report, Computer Scient Department, Wake Forest University, Jan. 2004. |
E. Fulp et al., “Network Firewall Policy Tries”, Technical Report, Computer Science Department, Wake Forest University, 2004. |
E. Al-Shaer et al., “Modeling and Management of Firewall Policies”, IEEE Transactions on Network and Service Management, 1(1): 2004. |
E.W. Fulp, “Firewall Architectures for High Speed Networks”, U.S. Department of Energy Grant Application, Funded Sep. 2003. |
E. Al-Shaer et al., “Firewall Policy Advisor for Anomaly Discovery and Rule Editing”, Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2003. |
V.P. Ranganath, “A Set-Based Approach to Packet Classification”, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, 889-894, 2003. |
M. Christiansen et al., “Using IDDs for Packet Filtering,” Technical Report, BRICS, Oct. 2002. |
Lee et al., “Development Framework for Firewall Processors,” IEEE, pp. 352-355 (2002). |
L. Qui et al., “Fast Firewall Implementations for Software and Hardware-Based Routers”, Proceedings of ACM Sigmetrics, Jun. 2001. |
D. Eppstein et al., “Internet Packet Filter Management and Rectangle Geometry”, Proceedings of the Symposium on Discrete Algorithms, 827-835, 2001. |
E. Fulp, “Preventing Denial of Service Attacks on Quality of Service”, Proceedings of the 2001 DARPA Information Survivability Conference and Exposition II, 2001. |
S. Goddard et al., “An Unavailability Analysis of Firewall Sandwich Configurations”, Proceedings of the 6th IEEE Symposium on High Assurance Systems Engineering, 2001. |
G.V. Rooij, “Real Stateful TCP Packet Filtering in IP Filter”, Proceedings of the 10th USENIX Security Symposium, 2001. |
P. Warkhede et al., “Fast Packet Classification for Two-Dimensional Conflict-Free Filters”, Proceedings of IEEE INFOCOM, 1434-1443, 2001. |
D. Decasper et al., “Router Plugins: A Software Architecture for Next-Generation Routers”, IEEE/ACM Transactions on Networking, 8(1): Feb. 2000. |
A. Feldmann et al., “Tradeoffs for Packet Classification”, Proceedings of the IEEE INFOCOM, 397-413, 2000. |
X. Gan et al., “LSMAC vs. LSNAT: Scalable Cluster-based Web servers”, Journal of Networks, Software Tools, and Applications, 3(3): 175-185, 2000. |
A. Hari et al., “Detecting and Resolving Packet Filter Conflicts”, Proceedings of IEEE INFOCOM, 1203-1212, 2000. |
O. Paul et al., “A full Bandwidth ATM Firewall”, Proceedings of the 6th European Symposium on Research in Computer Security ESORICS'2000, 2000. |
J. Xu et al., “Design and Evaluation of a High-Performance ATM Firewall Switch and Its Applications”, IEEE Journal on Selected Areas in Communications, 17(6): 1190-1200, Jun. 1999. |
C. Benecke, “A Parallel Packet Screen for High Speed Networks”, Proceedings of the 15th Annual Computer Security Applications Conference, 1999. |
R. Funke et al., “Performance Evaluation of Firewalls in Gigabit-Networks”, Proceedings of the Symposium on Performance Evaluation of Computer and Telecommunication Systems, 1999. |
S. Suri et al., “Packet Filtering in High Speed Networks”, Proceedings of the Symposium on Discrete Algorithms, 969-970, 1999. |
J. Ellermann et al., “Firewalls for ATM Networks”, Proceedings of INFOSEC'COM, 1998. |
V. Srinivasan et al., “Fast and Scalable Layer Four Switching”, Proceedings of ACM SIGCOMM, 191-202, 1998. |
M. Degermark et al., “Small Forwarding Tables for Fast Routing Lookups”, Proceedings of ACM SIGCOMM, 4-13, 1997. |
S,M. Bellovin et al., “Network Firewalls”, IEEE Communications Magazine, 50-57, 1994. |
W.E. Leland et al., “On the Self-Similar Nature of Ethernet Traffic”, IEEE Transactions on Networking, 2(1); 15, 1994. |
G. Brightwell et al., “Counting Linear Extensions is #P-Complete”, Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, 1991. |
M. Al-Suwaiyel et al., “Algorithms for Trie Compaction”, ACM Transactions on Database Systems, 9(2): 243-263, Jun. 1984. |
D. Comer, “Analysis of a Heuristic for Full Trie Minimization”, ACM Transactions on Database Systems, 6(3): 513-537, Sep. 1981. |
R.L. Graham et al., “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey”, Annals of Discrete Mathematics, 5:287-326, 1979. |
E.L. Lawler, “Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints”, Annals of Discrete Mathematics, 2: 75-90, 1978. |
J.K. Lenstra et al., “Complexity of Scheduling Under Precedence Constraints”, Operations Research, 26(1): 22-35, 1978. |
R. Rivest, “On Self-Organizing Sequential Search Heuristics”, Communications of the ACM, 19(2): 1976. |
W.E. Smith, “Various Optimizers for Single-Stage Productions”, Naval Research Logistics Quarterly, 3: 59-66, 1956. |
Bellion, “High Performance Packet Classification”, http://www.hipac.org (Publication Date Unknown). |
Singh, Rajeev et al. “Detecting and Reducing the Denial of Service attacks in WLANs”, Dec. 2011, World Congress on Information and Communication TEchnologies, pp. 968-973. |
Chen, et al, “Research on the Anomaly Discovering Algorithm of the Packet Filtering Rule Sets,” Sep. 2010, First International Confererence on Pervasive Computing, Signal Processing and Applications, pp. 362-366. |
Ylonen, et al, “The Secure Shell (SSH) Transport Layer Protocol,” SSH Communication Security Corp, Newtork Working Group RFC 4253, Jan. 2006, 32 pages. |
Anonymous: “The Distribution of Malicious Domains,” The DomainTools Report, 2016 Edition, Mar. 9, 2016 (Mar. 9, 2016), pp. 1-11, XP055502306, Retrieved from: https://www.domaintools.com/resources/white-papers/the-domaintools-report-the-distribution-of-malicious-domains. |
“Cisco ACNS Softward Configuration Guide for Centrally Managed Deployments,” Release 5.5. Text Part No. OL-9136-01, Cisco Systems, Inc., 2006, 944 pages. |
Blake, et al., “An Architecture for Differentiated Services,” also known as the Diffserv architecture, as defined in RFC 2475, Network Working Group, Dec. 1998, 36 pages. |
“Examining SSL-encrypted Communications: Netronome SSL InspectorTM Solution Overview,” Jan. 1, 2008, XP055036015, retrieved from <http://www.infosecurityproductsguide.com/technology/2008/Netronome_Examining_SSL-encrypted_Communications.pdf>, 8 pages. |
Apr. 28, 2021—U.S. Non-Final Office Action—U.S. Appl. No. 15/382,806. |
Valdes, et al., “Probabilistic Alert Correlation,” 2001, downloaded from <<http://citeseerx.ist.psu.edu/viewdoc/download?doi-10.1.1.15.3371&rep=rep1&type=pdf>> (Year: 2001), pp. 54-68. |
Number | Date | Country | |
---|---|---|---|
20230095306 A1 | Mar 2023 | US |
Number | Date | Country | |
---|---|---|---|
63106166 | Oct 2020 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 17838478 | Jun 2022 | US |
Child | 18075121 | US | |
Parent | 17380519 | Jul 2021 | US |
Child | 17838478 | US |