System and method for distributed cluster configuration monitoring and management

Information

  • Patent Grant
  • 11228491
  • Patent Number
    11,228,491
  • Date Filed
    Thursday, June 28, 2018
    6 years ago
  • Date Issued
    Tuesday, January 18, 2022
    2 years ago
Abstract
A cyber-threat detection system that maintains consistency in local configurations of one or more computing nodes forming a cluster for cyber-threat detection is described. The system features a distributed data store for storage of at least a reference configuration and a management engine deployed within each computing node, including the first computing node and configured to obtain data associated with the reference configuration from the distributed data store, From such data, the management engine is configured to detect when the shared local configuration is non-compliant with the reference configuration, and upload information associated with the non-compliant shared local configuration into the distributed data store. Upon notification, the security administrator may initiate administrative controls to allow the non-compliant shared local configuration or modify the shared local configuration to be compliant with the reference configuration.
Description
FIELD

Embodiments of the disclosure relate to the field of cybersecurity and distributed computing. More specifically, one embodiment of the disclosure relates to a scalable, cyber-threat detection system managed to reduce operational errors caused by node misconfiguration and enhance cluster scalability.


GENERAL BACKGROUND

Network devices provide useful and necessary services that assist individuals in business and in their everyday lives. Given the growing dependence on these services, increased security measures have been undertaken to protect these network devices against cybersecurity attacks (hereinafter, “cyberattacks”). These cyberattacks may involve an attempt to gain access to content stored on one or more network devices for illicit (i.e., unauthorized) purposes or an attempt to adversely influence the operability of a network device. For instance, the cyberattack may be designed to alter functionality of a network device (e.g., ransomware), steal sensitive information or intellectual property, or harm information technology or other infrastructure.


One type of security measure that is growing in popularity involves the deployment of compute clusters. A “compute cluster” (hereinafter, referred to as “cluster”) is a scalable cyber-threat detection architecture that includes multiple computing nodes that collectively perform analytics on received objects (e.g., data extracted from network traffic, files, etc.) to determine if these objects are malicious or non-malicious. Stated differently, the computing nodes are configured to analyze the received objects and determine whether such objects are part of a cyberattack (e.g., a likelihood of the object being associated with a cyberattack greater than a prescribed threshold). An example of a cluster is described in detail in U.S. patent application Ser. No. 15/283,128 entitled “Cluster Configuration Within A Scalable Malware Detection System,” filed Sep. 30, 2016, the entire contents of which are incorporated by reference herein.


Clusters are central to large scale computing and cloud computing. However, for a cluster deployment, each computing node within a cluster is subject to operational errors caused by (i) third party disruptive activities (e.g., cyberattack), (ii) hardware or software failures, or (iii) misconfiguration that may be caused by a failed installation or an errand reconfiguration of a computing node, a failed or accidental software update, or the like. These operational errors may lead to inconsistent behavior of the cluster, and thus, depending on which computing node is handling an analysis of an object, the cluster may provide unreliable or inconsistent analytic results.


In some conventional implementations, cyber-threat detection systems are configured with a centralized cluster management system that periodically communicates directly with each computing node to detect operational errors and prevent unreliable cluster operability caused by configuration mishaps. However, the use of a centralized management system limits scalability, as throughput issues arise as the number of computing nodes within the cluster increase. Additionally, conventional cyber-threat detection systems typically require the configuration and/or reconfiguration of computer nodes in a cluster to be performed through direct communications with the central cluster management system, limiting cluster management to a single point of failure.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the invention are illustrated by way of example and not by way of limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:



FIG. 1 is a block diagram of an exemplary embodiment of a cluster-based cyber-threat detection system including a configuration management framework.



FIG. 2 is a block diagram of an exemplary embodiment of a computing node of a cluster forming part of the cyber-threat detection system.



FIG. 3 is a block diagram of an exemplary embodiment of the management system operating with the configuration management framework deployed in the cyber-threat detection system.



FIG. 4 is a logical representation of an exemplary embodiment of the cyber-threat detection system including the configuration management framework of FIG. 1.



FIG. 5 is a logical representation of an exemplary embodiment of the configuration management framework provided by a cluster of the cyber-threat detection system of FIG. 1.



FIG. 6A is a block diagram of a first exemplary embodiment of the cluster formation scheme directed to removal of a requesting computing node from a cluster.



FIG. 6B is a block diagram of a second exemplary embodiment of the cluster formation scheme directed to removal of a computing node based on an initiated command by a different computing node.



FIG. 7 is a flow diagram of the operations conducted by the configuration management framework of FIG. 1.





DETAILED DESCRIPTION
I. Overview

Embodiments of the present disclosure generally relate to a distributed, configuration management framework that relies on interoperating management engines deployed within the computing nodes of the cluster to reduce operational errors, increase scalability, and ease cluster management. The operability of each computing node is based, at least in part, on its local configuration; namely, information stored within the computing node that is directed to properties (e.g., settings, parameters, permissions, etc.) that control operability of the computing node. The local configuration may include (i) “shared local configuration,” namely one or more portions of the local configuration data each directed to a different functionality that is commonly shared by computing nodes operating within the same cluster; and (ii) “private local configuration,” namely a portion of the local configuration data that is specific to the particular computing node (e.g., common properties). Besides the information associated with the common properties described above, the shared local configuration may further include metadata directed to the properties, such as the monitoring method of the properties, configuration values assigned to different properties, and the method utilized in modifying the configuration values.


The configuration management framework reduces operational errors that may be experienced by the cyber-threat detection system through the installation of a management engine into each computing node capable of forming and/or joining with a cluster. Each management engine within a computing node is configured to periodically or aperiodically analyze the shared local configuration for that computing node and detect when the shared local configuration is non-compliant with a reference (or golden) configuration. Non-compliance may be detected when information (e.g., configuration values, etc.) within the shared local configuration (hereinafter, “shared local configuration data”) is inconsistent with corresponding information within the reference configuration (hereinafter, “reference configuration data”). This level of inconsistency may be absolute without allowing any discrepancies between the shared local configuration and the reference data may allow certain tolerances (e.g., allowable prescribed differences) that may be set based on property type.


It is contemplated, however, as another embodiment, that the level of inconsistency between shared local configuration data and the reference data may allow certain tolerances (e.g., the tolerance may be dependent on property type), and thus, a difference in configuration data may not be deemed “inconsistent.” However, it is further contemplated that a difference in other properties (e.g., certain permissions) maintained in the shared local configuration and the reference configuration may lead to a non-compliance finding.


As described below, both the shared local configuration and the reference configuration are changeable, so the description may referred to certain states of the configurations as “current” or “next” shared local (or reference) configurations based on their current or modified (next) state.


Representing the current shared local configuration expected for each of the computing nodes within the same cluster, the reference configuration may include (i) a set (one or more) of properties of the computing node to be monitored (e.g., what logic for threat detection analytics is enabled or disabled, Operating System “OS” type, etc.); (ii) the method by which the properties are monitored (e.g., read/write monitoring, read only monitoring, etc.); (iii) the value assigned to each property (e.g., integer value, string value, etc.); and/or (iv) the method for modifying the configuration value assigned to each of the properties (e.g., call, function, Application Programming Interface “API”, etc.). Herein, the reference configuration may be stored in a distributed (shared) data store and may be configurable. For one embodiment, the distributed data store may be memory contained within each computing node collectively operating as the distributed data store (e.g., each computing node contains a portion of the data in the distributed data store but the distributed data store appears via a user interface as a single storage). For another embodiment, the distributed data store may be a separate, addressable memory that is shared between or segmented and allocated to the computing nodes forming a cluster.


More specifically, according to one embodiment of the disclosure, each management engine is adapted to (i) monitor the shared local configuration of its computing node, (ii) identify whether any shared local configuration data is non-compliant (e.g., inconsistent) with corresponding reference configuration data, and (iii) report the detected non-compliance being a configuration violation for a particular cluster. In some cases, the configuration violation, caused by a deviation from the reference configuration, would result in a false positive or false negative verdict (determination) or increased latency in detection of a cyberattack.


The reporting of the configuration violation may be accomplished by the management engine uploading the non-compliant, shared local configuration data (or metadata representing the non-compliant, shared local configuration data) into the distributed data store of the particular cluster. More specifically, according to one embodiment of the disclosure, a management engine of a computing node operating as a configuration lead node (e.g., the first computing node to join the cluster or otherwise an automatically elect or determined node of the cluster) generates an inconsistency report directed to its own configuration compliance or non-compliance with the reference configuration (e.g., node health) as well as to configuration inconsistencies for the entire cluster realized by aggregating the shared local configuration data for all of the computing nodes. Each management engine of the other computing nodes generates an inconsistency report for itself (e.g., node health). The configuration lead node makes the cluster-wide inconsistency report available to the management system, which makes the inconsistency report available to a security administrator.


Using a predefined API (hereinafter, “cluster management API”), the management system may conduct a polling operation to retrieve cluster status information (e.g., name, health, size, etc.) along with status information for the computing nodes within the particular cluster (e.g., node name, node health, network address of the node, etc.). The status information for the non-compliant computing node may identify a configuration violation and provide an IT administrator (e.g., a security administrator) with access to the non-compliant, shared local configuration data via an administrative portal (pulling data). Alternatively, upon detecting a configuration violation, the management system initiates transmission of the non-compliant, shared local configuration data via the portal (pushing data). Herein, the security administrator may be an analyst or an automated system that relies on preconfigured rule sets, machine learning models, or other artificial intelligence schemes (e.g., artificial neural networks, etc.) to determine how to handle a configuration violation through rule enforcement, remediation using repair instructions to return the shared local configuration back to a prior state that is in compliance with the reference configuration, leave the cluster, or the like.


The configuration management framework further reduces operational errors by at least management engine for the first computing node (serving as the configuration lead node) being adapted to (i) acquire shared local configurations for other computing nodes within the cluster, (ii) identify whether the shared local configuration of another computing node (e.g., a second computing node) is non-compliant with (e.g., differs from) the reference configuration, and (iii) report detected non-compliance by the second computing node. The reporting of non-compliance by the second computing node may be accomplished as described above, namely the first computing node uploading the detected, non-compliant shared local configuration data for the second computing node (or metadata representing the non-compliant shared local configuration data) into the distributed data store. This non-compliant, shared local configuration data (or representative metadata) may be appended to the shared local configuration data stored within the distributed data store. Access to the non-compliant shared local configuration data (or representative metadata) is made available to the security administrator via a push or pull data delivery scheme, as described above.


Responsive to determining that the shared local configuration is non-compliant, the first computing node may execute repair instructions that returns the shared local configuration back to a prior state that is in compliance with the reference configuration. Alternatively, in other cases, the first computing node may issue a leave command to remove itself from the cluster. The issuance of the leave command may depend on the degree of non-compliance and/or the non-compliant properties.


It is noted that, rather than the first computing node requesting removal of itself or another computing node, the management system may issue commands for such removal and change the listing of computing nodes forming the cluster to account for misconfigured computing nodes. Also, in some cases, the misconfiguration may be due to a security breach where the computing node goes rogue (misconfigured) and removal of an untrusted computing node is desired for the health of the cluster and the enterprise network as a whole.


The distributed, configuration management framework enhances scalability of the cluster by the management engines using a cascading, “multicast” communication scheme. One type of “multicast” communication scheme relies a Gossip communication protocol. In lieu of relying on a single point (e.g., a centralized management system) in managing configurations for each computing node within a cluster, the distributed, configuration management framework disseminates messages between neighboring computing nodes. This multicast communication scheme allows the security administrator, via the management system, to upload intended updates and/or modifications to the reference configuration within the distributed data store. Alternatively, the reference configuration updates may be detected computing nodes including logic that monitors for changes in internal services provided by a computing node (e.g., local configuration changes after successful testing at a computing node, etc.) and any intended changes in service may cause an update to the reference configuration within the distributed data store. Thereafter, the updating of the reference configuration may cause other computing nodes, over time, to detect that their shared local configuration is non-compliant and modify their shared local configuration accordingly.


II. Terminology

In the following description, certain terminology is used to describe features of the invention. In certain situations, terms “logic,” “engine,” “component” and “client” may be representative of hardware, firmware and/or software that is configured to perform one or more functions. As hardware, logic (or engine or component or client) may include circuitry having data processing or storage functionality. Examples of such circuitry may include, but are not limited or restricted to a processor such as a microprocessor, one or more processor cores, a programmable gate array, a microcontroller, an application specific integrated circuit, a digital signal processor (DSP), field-programmable gate array (FPGA), wireless receiver, transmitter and/or transceiver circuitry, combinatorial logic, or any other hardware element with data processing capability. The circuitry may include memory operating as non-persistent or persistent storage.


Logic (or engine or component or client) may be software in the form of one or more software modules. The software modules may be executable code in the form of an executable application, an API, a subroutine, a function, a procedure, an applet, a servlet, a routine, source code, object code, a shared library/dynamic load library, or one or more instructions. These software modules may be stored in any type of a suitable non-transitory storage medium, or transitory storage medium (e.g., electrical, optical, acoustical or other form of propagated signals such as carrier waves, infrared signals, or digital signals). Examples of non-transitory storage medium may include, but are not limited or restricted to a programmable circuit; a semiconductor memory; non-persistent storage such as volatile memory (e.g., any type of random access memory “RAM”); persistent storage such as non-volatile memory (e.g., read-only memory “ROM”, power-backed RAM, flash memory, phase-change memory, etc.), a solid-state drive, hard disk drive, an optical disc drive, or a portable memory device. As firmware, the executable code is stored in persistent storage.


A “network device” generally refers to either a physical electronic device featuring data processing and/or network connection functionality or a virtual electronic device being software that virtualizes certain functionality of the physical network device. Examples of a network device may include, but are not limited or restricted to, a server, a mobile phone, a computer, a standalone cybersecurity appliance, a network adapter, an industrial controller, an intermediary communication device (e.g., router, firewall, etc.), a virtual machine, or any other virtualized resource.


The term “object” generally relates to content having a logical structure or organization that enables it to be classified during threat analysis. The content may include an executable (e.g., an application, program, code segment, a script, dynamic link library “dll” or any file in a format that can be directly executed by a computer such as a file with an “.exe” extension, etc.), a non-executable (e.g., a storage file; any document such as a Portable Document Format “PDF” document; a word processing document such as Word® document; an electronic mail “email” message, web page, etc.), or simply a collection of related data. The object may be retrieved from information in transit (e.g., a plurality of packets) or information at rest (e.g., data bytes from a storage medium).


The terms “message” generally refers to information placed in a prescribed format and transmitted in accordance with a suitable delivery protocol or information provided to (or made available from) a logical data structure such as a prescribed API in order to perform a prescribed operation. Examples of a delivery protocol include, but are not limited or restricted to Gossip protocol, User Datagram Protocol (UDP); or the like. Hence, each message may be in the form of one or more packets, frame, instruction such as a command, or any other series of bits having the prescribed, structured format.


The term “computerized” generally represents that any corresponding operations are conducted by hardware in combination with software and/or firmware. In certain instances, the terms “compare,” comparing,” “comparison,” or other tenses thereof generally mean determining if a match (e.g., identical or a prescribed level of correlation) is achieved.


The term “transmission medium” generally refers to a physical or logical communication link (or path) between two or more network devices. For instance, as a physical communication path, wired interconnects in the form of electrical wiring, optical fiber, cable, or bus trace may be used. For a wireless interconnect, wireless transmitter/receiver logic supporting infrared or radio frequency (RF) transmissions may be used.


Finally, the terms “or” and “and/or” as used herein are to be interpreted as inclusive or meaning any one or any combination. As an example, “A, B or C” or “A, B and/or C” mean “any of the following: A; B; C; A and B; A and C; B and C; A, B and C.” An exception to this definition will occur only when a combination of elements, functions, steps or acts are in some way inherently mutually exclusive.


As this invention is susceptible to embodiments of many different forms, it is intended that the present disclosure is to be considered as an example of the principles of the invention and not intended to limit the invention to the specific embodiments shown and described.


III. Distributed, Configuration Management Framework

Referring to FIG. 1, an exemplary block diagram of a cyber-threat detection system 100 is shown. The threat detection system 100 includes one or more computing nodes 1101-110M (M≥1), each computing node 1101, . . . , or 110M is communicatively coupled to a management system 120. As shown as an illustrative example, selected subsets of the computing nodes 1101-1106 may be grouped to form one or more clusters 1301-130N (M≥N≥1, e.g., N=2), where each of the clusters 1301-1302 performs threat detection analytics on objects received for analysis. The threat detection analytics may be used to determine the likelihood (e.g., probability) of a received object 140 being malicious and/or part of a cyberattack based on behavioral analyses of the received object 140 (or of components processing the received object 140) during execution of the received object 140 and/or analyses of the content of the received object 140 without execution of the received object.


More specifically, according to one embodiment of the disclosure, a “computing node” (e.g., any of the computing node 1101-1106) may be implemented as a physical network device (e.g., server, computer, etc.) configured to analyze received objects 140 and determine whether the received objects 140 are part of a cyberattack. Alternatively, the computing node may be implemented as a virtual network device (e.g., software adapted to perform the functionality of the computing node), or a combination thereof. To analyze a received object 140, one of the computing nodes 1101-1104 (e.g., the first computing node 1101) within a selected cluster (e.g., first cluster 1301) is selected for conducting an in-depth analysis of the received object 140 based on a variety of factors—processing capability of an object analysis engine 2501 (see FIG. 2) deployed within the first computing node 1101 (described below) and/or software profile of the first computing node 1101 for example. Otherwise, such processing may be handled by a different computing node 1102-1104 within the cluster 1301.


As an illustrative example, the first cluster 1301 is formed to include a first plurality of computing nodes 1101-1104 while a second cluster 1302 is formed to include a second plurality of computing nodes 1105-1106. Besides threat analytics, each computing node within a cluster (e.g., cluster 1301) may subscribe to a configuration service supported by the configuration management framework (hereinafter, “configuration management service”) to monitor and maintain the local configuration of these computing nodes. For clarity sake, the following description may focus on the architecture and operations of one of the computing node 1101-1106 within a corresponding cluster that subscribes to the configuration management service, such as the first computing node 1101 within the first cluster 1301 for example, when describing the formation of the cluster and management of the computing node configurations within a cluster. It is contemplated, however, that the other computing nodes 1102-1106 may feature the same or substantially similar architecture as the first computing node 1101 and perform similar operations to support the cluster services (e.g., object analytics, etc.) offered by their cluster 1301 or 1302.


Referring now to FIG. 2, each of the first plurality of computing nodes 1101-1104 forming the cluster 1301, such as computing node 1101 for example, may include one or more processors 2051, one or more interfaces 2101 and a memory 2201 communicatively coupled together by one or more transmission mediums 230. The interface(s) 2101 may operate as a network interface configured to receive the object 140 as well as communications from the management system 120, as described below. The computing nodes 1101-1104 may be deployed as physical network devices, although any or all of first plurality of computing nodes 1101-1104 forming the cluster 1301 may be virtualized and implemented as software modules that communicate with each other via a selected communication protocol.


For this illustrative example, the memory 2201 may include a management engine 2401, an object analysis engine 2501, a local configuration 2601, a reference (or golden) configuration 270, and/or credentials 280 to access a predefined API (hereinafter, “cluster management API 290). The cluster management API 290 is structured to receive executable commands to form a cluster (create cluster) or destroy the formation of a cluster (delete cluster).


Herein, the local configuration 2601 includes information associated with the setting, monitoring and/or modifying of properties that control operability of the first computing node 1101. The local configuration 2601 features (i) shared local configuration 2621 representing one or more portions of configuration data directed to different functionality that is commonly shared by computing nodes operating within the same cluster 1301 and (ii) private local configuration 2641 representing configuration information that is specific to the particular computing node. The shared local configuration 2621 is stored within a portion 222 of the memory 2201 with shared access by any of the computing nodes 1101-1104 as well as the management system 120. This shared memory 222 operates as part of a “distributed data store,” where the logical representation of the shared access is illustrated in FIG. 1. The shared local configuration 2621 is monitored by the management engine 2401 for non-compliance with the reference configuration 270, which is the expected configuration for each of the computing nodes 1101-1104 within the cluster 1301.


As further shown in FIG. 2, the object analysis engine 2501 for illustrative purposes includes logic that is capable of conducting an in-depth analysis of the received object 140 for cyber-security threats. For example, the object analysis engine 2501 may include one or more virtual machines (hereinafter, “VM(s)” 255). Each of the VM(s) 255 may be provisioned with different guest image bundles that include a plurality of software profiles as represented by a different type of operating system (OS), a different type and/or version of application program. Hence, the operability of computing node 1101, in particular the object analysis engine 2501 deployed therein, is at least partially based on its local configuration 2601.


Referring to both FIGS. 1-2, the management engine 2401, when executed, is capable of evaluating whether the shared local configuration 2621 is compliant (e.g., consistent) with the reference configuration 270. It is noted that, for the newly formed cluster 1301, the shared local configuration 2621, being a portion of the local configuration 2601 of the first computing node 1101, may initially operate as the reference configuration 270 for the cluster 1301. During operation, the shared local configuration 2621 and the reference configuration 270 may be altered.


Also, the management engine 2401 is capable of evaluating, potentially through an automatically elected, configuration lead node, whether shared local configurations 2622-2624 of other computing nodes 1102-1104 within its cluster 1301 are compliant with the reference configuration 270. Compliance between the shared local configurations 2621-2624 and the reference configuration 270 improves correlation between results produced from object analysis engines 2501-2504 within the computing nodes 1101-1104 on identical or similar received objects 140. The management engine 2401 is further responsible for inter-operations with one or more “neighboring” computing (e.g., nodes 1102-1103), as described below.


Referring back to FIG. 1, focusing on the operations of the first cluster 1301 for clarity sake, the computing nodes 1101-1104 within the first cluster 1301 may be located within the same sub-network (not routing between nodes). As shown, the computing nodes 1101-1104 may be positioned at various locations on a transmission medium 152 that is part of a network 150 (e.g., connected at various ingress points on a wired network or positioned at various locations for receipt of wireless transmissions) and receive objects included within traffic propagating over the transmission medium 152. The “traffic” may include an electrical transmission of certain objects, such as files, email messages, executables, or the like. For instance, each computing nodes 1101, . . . , or 1104 may be implemented either as a standalone network device, as logic implemented within a network device, logic integrated into a firewall, or as software running on a network device.


More specifically, according to one embodiment of the disclosure, the first computing node 1101 may be implemented as a network device (or installed within a network device) that is coupled to the transmission medium 152 directly (not shown) or is communicatively coupled with the transmission medium 152 via an interface 154 operating as a data capturing device. According to this embodiment, the data capturing device 154 is configured to receive the incoming data and subsequently process the incoming data, as described below. For instance, the data capturing device 154 may operate as a network tap (in some embodiments with mirroring capability) that provides at least one or more objects (or copies thereof) extracted from data traffic propagating over the transmission medium 152. Alternatively, although not shown, the first computing node 1101 may be configured to receive files or other objects automatically (or on command), accessed from a storage system.


As further shown in FIGS. 1-2, the computing nodes 1101-1104 may be positioned in close proximity, perhaps within a server farm or facility. As described above, it is contemplated that any or all of clusters 1301-130N (e.g., first cluster 1301 and/or second cluster 1302) may be virtualized and implemented as software, where the computing nodes 1101-1104 are software modules that communicate with each other via any selected communication protocol (e.g., Gossip or other UDP-based protocol, etc.). For this virtualized deployment, one or more of the computing nodes within a cluster (e.g., the first computing node 1101 within the first cluster 1301) may be implemented entirely as software for uploading into a network device and operating in cooperation with an operating system running on the network device. For this implementation, a software-based computing node is configured to operate in a manner that is substantially similar or identical to a hardware-based computing node.


Additionally according to this embodiment of the disclosure, with respect to the first cluster 1301, each of the computing nodes 1101-1104 is communicatively coupled to a distributed data store 170. The distributed data store 170 may be deployed as a separate data store to store at least the shared local configuration 2621-2624 and the reference configuration 270, which are accessible by the computing nodes 1101-1104. Alternatively, as shown, the distributed data store 170 may be provided as a collection of synchronized memories within the computing nodes 1101-1104 (e.g., data stores that collectively form distributed data store 170). Hence, the portion of memory (data store 222 may be configured to individually store the shared local configuration 2621 for computing node 1101 along with the reference configuration 270. The other synchronized data stores may be configured to individually store their corresponding shared local configurations 2622-2624 for computing nodes 1102-1104 along with the reference configuration 270.


Referring still to FIG. 1, the management system 120 assists in formation of each clusters 1301, . . . , or 130N (e.g., cluster 1301), and after such formation, the management system 120 initiates operations to confirm shared local configuration consistency between the computing nodes 1101-1104. Also, the management system 120 maintains communications with the cluster 1301 in support of cluster-based services. Stated differently, after formation of the cluster 1301, the management system 120 is configured to discontinue communications with the computing nodes 1101-1104 on a per node basis; instead, the management system 120 communicates with the cluster 1301 on a per cluster basis.


Referring now to FIG. 3, the management system 120 may include one or more processors 300, one or more interfaces 310 and a memory 320, which are communicatively coupled together by one or more transmission mediums 330. The management system 120 may be deployed as a type of physical network device, although the management system 120 may be virtualized and implemented as software modules that communicate with one or more clusters (e.g., cluster 1301 and 1302) via a selected communication protocol.


For this illustrative example, the interface(s) 310 may operate as a network interface configured to access one or more distributed data stores (e.g., distributed data store 170) maintained within the clusters (e.g., clusters 1301-1302) managed by the management system 120. The processor 300 is a multi-purpose, processing component as described above, which is configured to execute logic, such as a cluster formation engine 340 and a management client engine 350 for example, stored within non-transitory storage medium operating as the memory 320. Herein, the memory 320 may further store cluster-based information related to how to access a particular cluster, such a data store including a listing 360 of computing node addresses associated with a particular cluster and credentials 280 to access the cluster management API 290 (hereinafter, “API credentials” 280″).


Referring to FIGS. 1-3, the cluster formation engine 340 is responsible for assisting in the formation of clusters, as described below. According to one embodiment of the disclosure, the cluster formation engine 340 receives a request for cluster creation from an authorized user via an administrative portal 370. The cluster creation request may include the API credentials 280, which may be subsequently stored within the management system 120 as shown above. Upon receipt of the cluster creation request via the administrative portal 370, the cluster formation engine 340 may initiate commands 380 to the cluster management API 290 to form and/or modify the computing node composition of the clusters 1301-1302.


The management client engine 350 is adapted to acquire configuration status (e.g., presence of any metadata identifying non-compliance of a shared local configuration with the reference configuration) from the distributed data stores maintained within the managed cluster(s). In particular, according to one embodiment of the disclosure, the management client engine 350 is responsible for periodically or aperiodically polling the distributed data stores (e.g., distributed data store 170 of FIG. 1) for configuration status. During this polling operation, responsive to detecting a configuration violation, the management client engine 350 provides a security administrator with access to data representative of the non-compliant configuration parameter(s) via the administrative portal 370 (pulling data). Alternatively, responsive to detecting a configuration violation, the management client engine 350 may initiate transmissions of data (e.g., alert or report) identifying the configuration violation (e.g., cluster ID, computing node name and/or IP address, inconsistent configuration parameters, etc.) to the security administrator via the administrative portal 370 (pushing data).


As an optional function, the management client engine 350 may attempt to remediate non-compliance. As an illustrative example, upon detecting the shared local configuration 2621 of the first computing node 1101 is non-compliant with the reference configuration 270, the management client engine 350 may retrieve repair instructions (not shown) from the distributed data store 170. Thereafter, the management client engine 350 may execute the repair instructions to overwrite the non-compliant data and return the shared local configuration 2621 into compliance with the reference configuration 270.


Additionally, the management client engine 350 is adapted to initiate updates to the reference configuration 270 of FIGS. 1-2 within a supported cluster (e.g., reference configuration 270 within the cluster 1301). Such updates would cause each of the computing nodes 1101-1104 within the cluster 1301 to update its shared local configuration 2621-2624, respectively. More specifically, upon updating the reference configuration 270, such as changing a setting, permission or a parameter (e.g., cluster ID, computing node, IP address, etc.), the management engines 2401-2404 for each of the computing nodes 1101-1104, during their periodic or aperiodic evaluation, would detect that the shared local configurations 2621-2624 for the computing nodes 1101-1104 are non-compliant with the reference configuration 270. Depending on the remediation procedure selected, the management engines 2401-2404 may alter the local configuration services to adjust their setting, permission or parameter to be consistent with the updates in the reference configuration 270. Alternatively, the management engines 2401-2404 may prompt the non-compliant computing nodes 1101-1104 to leave the cluster 1301, as described below and illustrated in FIGS. 6A-6B.


Although not illustrated in detail, some or all of the logic forming the management system 120 may be located at an enterprise's premises (e.g., located as any part of the enterprise's network infrastructure whether located at a single facility utilized by the enterprise or at a plurality of facilities). As an alternative embodiment, some or all of the management system 120 may be located outside the enterprise's network infrastructure, generally referred to as public or private cloud-based services that may be hosted by a cybersecurity provider or another entity separate from the enterprise (service customer). Obtaining a high degree of deployment flexibility, embodiments of the management system 120 may also feature a “hybrid” solution, where some logic associated with the management system 120 may be located on premises and other logic of the management system 120 may operate as a cloud-based service. This deployment may be utilized to satisfy data privacy requirements that may differ based on access, use and storage of sensitive information (e.g., personally identifiable information “PII”) requirement for different geographical locations.


IV. Cluster Configuration Management

Referring to FIG. 4, a logical representation of an exemplary embodiment of a configuration management framework 400 deployed within the cyber-threat detection system 100 of FIG. 1 is shown. Herein, a plurality of clusters 1301-130N may be configured in accordance with the distributed, configuration management framework 400. As shown, for this embodiment of the disclosure, the configuration management framework 400 includes a management service 410 for a first cluster 1301 and another management service 412 for a second cluster 1302, management engines 2401-2404 deployed within corresponding computing nodes 1101-1104, and a management client engine 350 (e.g., virtual or physical logic) deployed within the management system 120 or deployed within each of the multiple management systems as shown (hereinafter, “management system(s) 1201-120K,” where K≥1).


According to one embodiment of the disclosure, the configuration management framework 400 is designed so each computing node 1101-1104 monitors and maintains compliance (e.g., consistency) between its shared local configuration 2621-2624 and the reference (golden) configuration 270. Each shared local configuration 2621-2624 partially controls operability of its computing nodes 1101-1104, and the reference configuration 270 represented the expected configuration for each of the computing nodes within the same cluster. Additionally, the configuration management framework 400 further controls interoperability of the computing nodes 1101-1104 by propagating modifications to the configuration data through each of the shared location configurations 2621-2624 in response to updating the reference configuration 270 for example.


More specifically, the management service 410 supports communications between the computing nodes 1101-1104 and one or more management system(s) 1201-120K in accordance with a selected messaging protocol. Similarly, management service 412 supports communications between the computing nodes within a second cluster 1302 and one or more management system(s) 1201-120K. As shown, the management service 410 may utilize the distributed data store 170, where changes made to the reference configuration 270 maintained within the distributed data store 170 may cause such changes to be propagated to the computing nodes 1101-1104 being part of the configuration management framework 400, although some of the computing nodes belonging to the cluster 1301 (not shown) may operate separately and their local configuration is not monitored.


As an illustrative example, in some situations, the first computing device 1101 may initiate a request to modify the reference configuration 270. This request may be initiated upon completion of a successful testing phase of a modified shared local configuration 2621, which has been permitted to be non-compliant with the reference configuration 270. Once the request has been authenticated (e.g., message relayed to a security administrator via the management system 120 to modify the reference configuration 270 has been approved), the first computing device 1101 modifies the reference configuration 270. The modification of the reference configuration 270 may be accomplished by overwriting a portion of the reference configuration 270 with the inconsistent configuration parameters or by overwriting the entire reference configuration 270 with the modified shared local configuration 2621 for example.


Upon completing the modification of the reference configuration 270, the shared local configurations 2622-2624 of the computing nodes 1102-1104 are now non-compliant (e.g., inconsistent) with the modified reference configuration 270. As a result, given that the computing nodes 1102-1104 subscribe to the configuration management service, the modification of the reference configuration 270 prompts corresponding changes to the shared local configurations 2622-2624 of the computing nodes 1102-1104 to be made in order to remain compliant.


Additionally, each computing node 1101 . . . 1104 includes a management engine 2401 . . . 2404 being logic that monitors for compliance between the reference configuration 270 and each of the shared local configuration 2621-2624 maintained on the computing nodes 1101 . . . 1104. Upon detecting non-compliance between a shared local configuration (e.g., shared local configuration 2622) and the reference configuration 270 for example, the management engine (e.g., management engine 2402) updates that shared local configuration 2622 stored within the distribution data store 170 by including the differences between the shared local configurations 2622 and the reference configuration 270.


Periodically or aperiodically, at least one of the management system(s) 1201-120K polls the distributed data store 170 (or a configuration lead node) for the current state of one of more of the computing nodes 1101-1104 to uncover differences between any of the shared local configurations 2621-2624 and the reference configuration 270. Upon detecting non-compliance by any of the shared local configurations 2621-2624, the management system(s) 1201-120K may generate a display accessible to a security administrator that identifies the non-compliance and allows the security administrator to initiate administrative controls that (i) temporarily ignore the non-compliance, (ii) prompt the reference configuration 270 to alter the non-compliant shared local configurations 2621 . . . and/or 2624, or (iii) cause one of the computing nodes 1101-1104 (e.g., computing node 1104) to initiate a leave command in efforts to remove the non-compliant, shared local configuration from the cluster 1301. This enables greater flexibility in more detailed analysis of the content.


Furthermore, upon receipt of data for updating the local configuration for each of the computing nodes 1101-1104 (hereinafter, “local configuration update”) to be shared between computing nodes within the cluster 1301, a management engine for the receiving computing node (e.g., management engine 2402 of the computing node 1102) propagates the data to its neighboring computing nodes (e.g., computing nodes 1101 and 1103. The “neighboring” computing nodes may be determined based, at least in part, on network coordinates or round-trip time with other computing nodes within the cluster. A “round-trip time” is a measured delay between transmission of a signal and return of a response signal from a responding computing node. A predetermined number of computing nodes with the lowest round-trip latency are considered to be the neighboring computing nodes for a particular computing node. The exchange occurs in an iterative manner, where the neighboring computing nodes may propagate the local configuration update.


Referring now to FIG. 5, a logical representation of an exemplary embodiment of communications among components of the configuration management (system) framework 700 deployed within the cluster 1301 of FIG. 1 is shown. Herein, the cluster 1301 includes the computing nodes 1101-1104 with the distributed data store 170. As shown, the distributed data store 170 maintains the shared local configurations 2621-2624 for each of the computing nodes 1101-1104 and the reference configuration 270. Additionally, each of the management engines 2401-2404 within the computing nodes 1101-1104 periodically or aperiodically evaluates whether its shared local configuration 2621-2624 is compliant with the reference configuration 270. This evaluation is described below and operations of the management engine 2401 of the first computing node 1101 are illustrated in the logical representation of FIG. 5, although the management engines 2402-2404 associated with the computing nodes 1102-1104 within the cluster 1301 would perform similar operations concurrently with or at least independent from the configuration management described below.


As shown, the management engine 2401 of the first computing node 1101 includes a management controller 500, a distributed data store (DDS) client 510, and one or more local management clients 5201-520R (R≥1) that are designed to access configuration data from corresponding local management services 5301-530R. More specifically, the local management services 5301-530R are services running on the first computing node 1101 that directed to operability of the first computing node 1101. Stated differently, each of the local management services 5301-530R may maintain (store) shared local configuration data in different forms: plain text file, relational database, customized database such as an operating system management database. For each type of the configuration form, the management system 120 uses a client to read, write, or receive notification about changes to configuration data. Read operations are being used by the client to monitor changes of the configuration values. For instance, a first local management service 5301 may be directed to database management being performed by the first computing node 1101 while a second local management service 5308 may be directed to file management being performed by the first computing node 1101.


According to one embodiment of the disclosure, each of these management services 5301-530R provides an API 5401-540R from which the corresponding local management clients 5201-520R may monitor for changes in shared local configuration data associated with these services. Upon detecting any changes in the shared local configuration data, such as a change to shared local configuration data associated with the first management services 5301 for example (hereinafter, “changed configuration data 550”), the local management clients 5201 provides the changed configuration data 550 to the management controller 500. For instance, the local management client 5201 may temporarily store the changed configuration data 550 until read by the management controller 500 during a polling operation. Alternatively, the local management client 5201 may “push” the changed configuration data 550 to the management controller 500. Herein, the initial configuration file 555 includes descriptions that identifies what properties of the shared local configuration (formed by local management services 5301-530R) and/or the reference configuration 270 should be monitored.


The management controller 500 compares the changed configuration data 550 to a portion of the reference configuration 270, which is received from the distributed data store 170 via the DDS client 510. In the event that the changed configuration data 550 is inconsistent with the portion of the reference configuration 270, rendering the shared local configuration data 2621 non-compliant with the reference configuration 270, the management controller 500 may be configured to address this non-compliance in accordance with any number of configuration enforcement schemes. For instance, according to one embodiment of the disclosure, the management controller 500 may be configured to automatically return the shared local configuration data 2621 back to its prior state upon detecting that it is non-compliant with the current reference configuration 270. Alternatively, the management controller 500 may mark the first computing node 1101 as not healthy, so the node 1101 will not be used for processing, or the node 1101 could be detached from the cluster.


Alternatively, the management controller 500 may be configured to perform operations a security administrator to address the configuration violation, which may include providing recommendations or reporting on remedial actions via an administrative portal or transmitted alert. Herein, the management controller 500 may generate representative data 560 of the non-compliance and upload the representative data 560 for storage with the shared local configuration data 2621 in the distributed data store 170. Upon monitoring the distributed data store 170, the management system 120 detects a change in the shared local configuration data 2621 (i.e., the addition of the representative data 560) and reports the configuration violation to a security administrator that determines how to proceed. The security administrator may return a message instructing the management system 120 to signal the management controller 500 to (i) ignore the inconsistent shared local configuration data 2621 for now, (ii) return the changed configuration data 550 back to its prior state in compliance with the reference configuration 270, or (iii) alter the reference configuration 270 with the changed configuration data 550.


According to another embodiment of the disclosure, the management system 120 may alter the reference configuration 270. The DDS client 510 is configured to monitor the distributed data store 170, notably the reference configuration 270, for changes. Upon detecting changes in data associated with the reference configuration 270 (hereinafter, “changed reference configuration data 570”), the DDS client 5101 provides the changed reference configuration data 570 to the management controller 500. For instance, the DDS client 510 may temporarily store the changed reference configuration data 570 until read by the management controller 500 during a polling operation. Alternatively, the DDS client 5101 may “push” the changed reference configuration data 570 to the management controller 500.


The management controller 500 compares the changed reference configuration data 570 to the shared local configuration data 2621, which is gathered from the local management service 5301-530R by the local management clients 5201-520R. Upon detecting that the shared local configuration data 2621 is non-compliant with the reference configuration 270, the management controller 500 may be configured to alter the shared local configuration data 2621 to be consistent with the reference configuration 270 as one type of remedial action (remediation). Another remedial action, where ease and/or timeliness in dealing with the misconfiguration of a computing node is a primary concern, may cause the computing node to leave the cluster, as illustrated in FIGS. 6A-6B. Removal of the computing node may be initiate by command (while the computing node is healthy or addressing a misconfigured computing node) or upon request of the misconfigured computing node.


Referring now to FIG. 6A, a block diagram of an exemplary embodiment of the cluster formation in which a particular computing node (e.g., first computing node 1101) leaves the cluster 1301 is shown. For this embodiment, to leave the cluster 1301, the first computing node 1101 may issue a leave command 600 to the cluster management API 290, which may be provided by another computing node within the cluster 1301 (e.g., second computing node 1102) operating as a proxy to cluster-wide services provided by the cluster 1301. The issuance of the leave command 600 by the first computing node 1101 may be based on non-compliance (e.g., inconsistency) between the shared local configuration 2621 of the first computing node 1101 and the reference configuration 270, where the shared local configuration 2621 may requires immediate removal or more in-depth analysis before being placed into compliance with the reference configuration 270 (e.g., more requisite time needed than allotted to cure non-compliance, potential tampering of the provisioning of the first computing node 1101, etc.). As a result, in response to the leave command 600 from the first computing node 1101, the cluster management API 290 will remove the IP address of the first computing node 1101 from its listing of computing nodes forming the first cluster 1301 and the first computing node 1101 will cause removal of the shared local configuration data 2621 from the distributed data store 170.


Referring now to FIG. 6B, a block diagram of an exemplary embodiment of the cluster formation controlled by the first computing node 1101, operating as the configuration lead node, in causing another computing node (e.g., third computing node 1103) to leave the cluster 1301 is shown. As described, each computing node (e.g., computing node 1101) may acquire the shared local configurations 2622, 2623 and 2624 associated with each corresponding computing node 1102, 1103, and 1104 within its cluster 1301. As a result, the first computing node 1101 is able to (i) identify non-compliance (e.g., inconsistency) between configuration data associated with a shared local configuration 2622, 2623 or 2624 (e.g., shared local configuration 2623) and configuration data of the reference configuration 270. In some cases, the uncovered non-compliance may signify that the third computing node 1103 is non-responsive (e.g., failed), which may cause the first computing node 1301 may generate the leave command 620. Unlike the leave command 600 of FIG. 6A, the leave command 620 would identify the third computing node 1103 as the entity to be removed from the cluster 1301.


As a result, in response to the leave command 620 from the first computing node 1101, the cluster management API 290 will remove the IP address of the third computing node 1103 from its listing of computing nodes forming the first cluster 1301 and the first computing node 1101 will cause removal of the shared local configuration data 2623 of the third computing node 1103 from the distributed data store 170.


Referring to FIG. 7, a flow diagram of the operations conducted by the configuration management system of FIG. 5 is shown. Herein, one or more computing nodes within a cluster subscribes to or operates in conjunction with a configuration management service (item 700). Each of the computing nodes (e.g., management service engine within) monitors for a change in the reference configuration (items 710 and 715). Responsive to detection of an authorized change in the reference configuration, each of the computing nodes determines whether its shared local configuration is compliant with the reference configuration (items 720-725). Such a determination may involve a management controller within each computing node comparing configuration data within the reference configuration to corresponding configuration data within its shared local configuration. For each computing node, if the shared local configuration is non-compliant (e.g., inconsistent) with the reference configuration, the management controller modifies the shared local configuration to be compliant with the reference configuration (item 730). If the shared local configuration is compliant with the reference configuration, the configuration management analysis ends (item 740).


Additionally, or in the alternative, each of the computing nodes monitors for changes in its corresponding shared local configuration (items 750-755). Responsive to detection of a change in the shared local configuration within one of the computing nodes (hereinafter, “detecting computing node”), the management controller within the detecting computing node compares the configuration data within the shared local configuration to corresponding configuration data within the reference configuration (items 760-765). If the shared local configuration is non-compliant with the reference configuration, the management controller stores the inconsistent configuration data into the distributed data store to be accessed by the management system (item 770).


Thereafter, if the change to the shared local configuration is authorized, the management controller may receive instructions to (i) ignore alteration of the changed shared local configuration data at this time or (ii) alter the reference configuration with the changed shared local configuration data (items 780, 782, 784). If the change is unauthorized or no update to the reference configuration is desired, the management controller of the non-compliant computing node may receive instructions to alter the shared local configuration data and return the changed shared local configuration data back to its prior state and in compliance with the reference configuration (item 790). If the shared local configuration is in compliance with the reference configuration, the configuration management analysis ends (item 795).


In the foregoing description, the invention is described with reference to specific exemplary embodiments thereof. However, it will be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims.

Claims
  • 1. A computing node deployed within a cluster including a data store maintaining at least a reference configuration representing an expected configuration for each computing node within the cluster, the computing node comprising: one or more processors;a memory communicatively coupled to the one or more processors, the memory comprises a first client that, when executed by the one or more processors, is configured to obtain data associated with the reference configuration,a second client that, when executed by the one or more processors, is configured to obtain data associated with a shared local configuration for the computing node maintained within a first local management service via an application programming interface (API) provided by the first local management service, wherein the data associated with the shared local configuration corresponds to a first portion of local configuration data that is associated with functionality commonly shared by a plurality of computing nodes forming the cluster and is separate from private local configuration data, the private local configuration data, corresponding to a second portion of the local configuration data, pertains to functionality specific to the computing node, the plurality of computing nodes comprises the computing node, anda management controller that, when executed by the one or more processors, is configured to detect when the shared local configuration is non-compliant with the reference configuration and notify an administrator upon detecting that the shared local configuration is non-compliant with the reference configuration,wherein the shared local configuration is non-compliant with the reference configuration when a difference between data associated with a property maintained as part of the shared local configuration and the data associated with a property maintained as part of the reference configuration exceeds a tolerance based on the property type.
  • 2. The computing node of claim 1, wherein the first client is configured to monitor the data store for changes to the reference configuration and the second client is configured to monitor for changes to the shared local configuration.
  • 3. The computing node of claim 2, wherein the data associated with the reference configuration is obtained from the data store.
  • 4. The computing node of claim 2, wherein the management controller is configured to notify the administrator upon detecting that a portion of the data associated with the shared local configuration is non-compliant with a corresponding portion of the data associated with the reference configuration by at least uploading the portion of the data associated with the shared local configuration into the data store for subsequent access and analysis by the administrator.
  • 5. The computing node of claim 2, wherein the second client, when executed by the one or more processors, obtains the data associated with the shared local configuration from one or more local management services running on the computing node.
  • 6. The computing node of claim 5, wherein the second client, being a local management client, accesses the API provided by the first local management service of the one or more local management services to obtain a portion of the data associated with the shared local configuration to analyze for inconsistencies with a corresponding portion of the data associated with the reference configuration.
  • 7. The computing node of claim 1, wherein the first client monitors for changes in the reference configuration stored within the data store and the second client monitors for changes in the local management services running on the computing node.
  • 8. The computing node of claim 1, wherein the first client, when executed by the one or more processors, is further configured to obtain data associated with shared local configurations associated with a second computing node different than the computing node.
  • 9. The computing node of claim 8, wherein the management controller, when executed by the one or more processors, is further configured to detect when the shared local configuration of the second computing node is non-compliant with the reference configuration and notify the administrator upon detecting that the shared local configuration of the second computing node is non-compliant with the reference configuration.
  • 10. The computing node of claim 1, wherein the tolerance allows for prescribed differences between data associated with the property maintained as part of the shared local configuration and the data associated with the property maintained as part of the reference configuration.
  • 11. A system for maintaining node configuration consistency throughout a cluster configured for cyber-threat detection, the system comprising: a data store for storage of at least data associated with a reference configuration;a management system communicatively coupled to the data store; andone or more computing nodes communicatively coupled to the data store, the one or more computing nodes including a first computing node that comprises a management engine configured to (i) obtain the data associated with the reference configuration from the data store, (ii) obtain a first portion of shared local configuration data for the first computing node maintained within a first local management service via an application programming interface (API) provided by the first local management service, (iii) detect when the first portion of the shared local configuration data is non-compliant with the data associated with the reference configuration, and (iv) upload information associated with the non-compliant data associated with the first portion of the shared local configuration data into the data store, wherein the first computing node is configured to remove itself from the cluster based on the first portion of the shared local configuration data being non-compliant with the data associated with the reference configuration.
  • 12. The system of claim 11, wherein the first computing node maintains local configuration data including the shared local configuration data being a first portion of the local configuration data associated with functionality shared by the one or more computing nodes and a second portion of the local configuration data associated functionality specific to a particular computing node of the one or more computing nodes, andthe management system further to provide the first computing node with administrative controls to modify the shared local configuration data to be compliant with the data associated with the reference configuration.
  • 13. The system of claim 11, wherein the first computing node maintains local configuration data including the shared local configuration data being a first portion of the local configuration data associated with functionality shared by the one or more computing nodes and a second portion of the local configuration data associated functionality specific to a particular computing node of the one or more computing nodes, andthe management engine of the first computing node to monitor the data store for changes to the data associated with the reference configuration and to monitor for changes to the shared local configuration data.
  • 14. The system of claim 13, wherein the management engine of the first computing node is configured to notify the administrator upon detecting that the first portion of the shared local configuration data is non-compliant with the data associated with the reference configuration by at least uploading the first portion of the shared local configuration data into the data store for subsequent access and analysis by the administrator.
  • 15. The system of claim 11, wherein the management engine of the first computing node to monitor for changes in the data associated with the reference configuration stored within the data store and monitor for changes in local management services, including the first local management service, running on the first computing node.
  • 16. The system of claim 11, wherein the management engine of the first computing node is further configured to obtain a second portion of the data associated with shared local configuration data associated with a second computing node different than the first computing node.
  • 17. The system of claim 11, wherein the management engine to detect when the shared local configuration data is non-compliant with the data associated with the reference configuration when data associated with a property maintained as part of the shared local configuration data is different than the data associated with a property maintained as part of the reference configuration.
  • 18. The system of claim 11, wherein the management system is deployed as a cloud service in which the shared local configuration data being the first portion of the local configuration data associated with functionality shared by the one or more computing nodes with access to the cloud service.
  • 19. The system of claim 18, wherein the one or more computing nodes are deployed within a public cloud including the management system operating as the cloud service.
  • 20. The system of claim 11, wherein the first computing node, upon detecting a configuration violation in which the shared local configuration data is non-compliant with the data associated with the reference configuration, uploading the information by making the shared local configuration data available to the administrator via a portal.
  • 21. The system of claim 20, wherein the configuration violation is handled by an automated system relying on preconfigured rule sets, one or more machine learning models, or an artificial neural network.
  • 22. The system of claim 20, wherein the configuration violation is through a remediation using repair instructions to return the shared local configuration back to a prior state that is in compliance with the reference configuration.
  • 23. The system of claim 20, wherein the particular computing node corresponds to the first computing node.
  • 24. A computerized method for monitoring local configurations of computing nodes forming a cluster including a plurality of computing nodes that are configured to collectively perform cyber-threat detection analytics on received objects to determine if the received objects are malicious or non-malicious, the computerized method comprising: obtaining data associated with a reference configuration;obtaining data associated with a shared local configuration for a computing node of the plurality of computing modes forming the cluster, wherein (i) the data associated with the shared local configuration is maintained within a first local management service accessible via an application programming interface (API) provided by the first local management service and (ii) the shared local configuration corresponds to a first portion of local configuration data associated with functionality shared by the plurality of computing nodes including the computing node while a private local configuration corresponding to a second portion of the local configuration data pertains to functionality specific to the computing node,detecting when the shared local configuration is non-compliant with the reference configuration; andnotifying an administrator upon detecting that the shared local configuration is non-compliant with the reference configuration.
  • 25. The computerized method of claim 24, wherein the computing node is configured to monitor for changes to the shared local configuration and obtain the data associated with the shared local configuration and the data associated with the reference configuration responsive to a change to the shared local configuration.
  • 26. The computerized method of claim 25, wherein the data associated with the reference configuration is obtained from the data store.
  • 27. The computerized method of claim 24, wherein the notifying of the administrator upon detecting that a portion of the data associated with the shared local configuration is non-compliant with a corresponding portion of the data associated with the reference configuration by at least uploading the portion of the data associated with the shared local configuration into a data store for subsequent access and analysis by the administrator.
  • 28. The computerized method of claim 24, wherein the detecting whether the shared local configuration is non-compliant with the reference configuration is conducted within a public cloud network.
  • 29. The computerized method of claim 28, wherein the obtaining of the data associated with the shared local configuration for the computing node of the cluster further comprising obtaining shared local configuration from each of the plurality of computer nodes of the cluster other than the computing node, wherein the shared local configuration corresponds to data associated with functionality shared by the plurality of computing nodes operating in the public cloud network.
  • 30. The computerized method of claim 28, wherein the obtaining of the data associated with the shared local configuration for the computing node of the cluster further comprising obtaining shared local configuration from each of the plurality of computer nodes of the cluster other than the computing node, wherein the shared local configuration corresponds to data associated with functionality shared by the plurality of computing nodes accessing the management system deployed within the public cloud network.
  • 31. The computerized method of claim 24, wherein the notifying of the administrator, upon detecting a configuration violation in which the shared local configuration is non-compliant, comprises providing access to the shared local configuration via a portal.
  • 32. The computerized method of claim 31, wherein the configuration violation is handled by an automated system relying on preconfigured rule sets, one or more machine learning models, or an artificial neural network.
  • 33. The system of claim 31, wherein the configuration violation is handled through a remediation using repair instructions to return the shared local configuration back to a prior state that is in compliance with the reference configuration.
US Referenced Citations (720)
Number Name Date Kind
4292580 Ott et al. Sep 1981 A
5175732 Hendel et al. Dec 1992 A
5319776 Hile et al. Jun 1994 A
5440723 Arnold et al. Aug 1995 A
5490249 Miller Feb 1996 A
5657473 Killean et al. Aug 1997 A
5802277 Cowlard Sep 1998 A
5842002 Schnurer et al. Nov 1998 A
5960170 Chen et al. Sep 1999 A
5978917 Chi Nov 1999 A
5983348 Ji Nov 1999 A
6088803 Tso et al. Jul 2000 A
6092194 Touboul Jul 2000 A
6094677 Capek et al. Jul 2000 A
6108799 Boulay et al. Aug 2000 A
6154844 Touboul et al. Nov 2000 A
6269330 Cidon et al. Jul 2001 B1
6272641 Ji Aug 2001 B1
6279113 Vaidya Aug 2001 B1
6298445 Shostack et al. Oct 2001 B1
6357008 Nachenberg Mar 2002 B1
6424627 Sorhaug et al. Jul 2002 B1
6442696 Wray et al. Aug 2002 B1
6484315 Ziese Nov 2002 B1
6487666 Shanklin et al. Nov 2002 B1
6493756 O'Brien et al. Dec 2002 B1
6550012 Villa et al. Apr 2003 B1
6775657 Baker Aug 2004 B1
6831893 Ben Nun et al. Dec 2004 B1
6832367 Choi et al. Dec 2004 B1
6895550 Kanchirayappa et al. May 2005 B2
6898632 Gordy et al. May 2005 B2
6907396 Muttik et al. Jun 2005 B1
6941348 Petry et al. Sep 2005 B2
6971097 Wallman Nov 2005 B1
6981279 Arnold et al. Dec 2005 B1
7007107 Ivchenko et al. Feb 2006 B1
7028179 Anderson et al. Apr 2006 B2
7043757 Hoefelmeyer et al. May 2006 B2
7058822 Edery et al. Jun 2006 B2
7069316 Gryaznov Jun 2006 B1
7080407 Zhao et al. Jul 2006 B1
7080408 Pak et al. Jul 2006 B1
7093002 Wolff et al. Aug 2006 B2
7093239 van der Made Aug 2006 B1
7096498 Judge Aug 2006 B2
7100201 Izatt Aug 2006 B2
7107617 Hursey et al. Sep 2006 B2
7159149 Spiegel et al. Jan 2007 B2
7213260 Judge May 2007 B2
7231667 Jordan Jun 2007 B2
7240364 Branscomb et al. Jul 2007 B1
7240368 Roesch et al. Jul 2007 B1
7243371 Kasper et al. Jul 2007 B1
7249175 Donaldson Jul 2007 B1
7287278 Liang Oct 2007 B2
7308716 Danford et al. Dec 2007 B2
7328453 Merkle, Jr. et al. Feb 2008 B2
7346486 Ivancic et al. Mar 2008 B2
7356736 Natvig Apr 2008 B2
7386888 Liang et al. Jun 2008 B2
7392542 Bucher Jun 2008 B2
7418729 Szor Aug 2008 B2
7428300 Drew et al. Sep 2008 B1
7441272 Durham et al. Oct 2008 B2
7448084 Apap et al. Nov 2008 B1
7458098 Judge et al. Nov 2008 B2
7464404 Carpenter et al. Dec 2008 B2
7464407 Nakae et al. Dec 2008 B2
7467408 O'Toole, Jr. Dec 2008 B1
7478428 Thomlinson Jan 2009 B1
7480773 Reed Jan 2009 B1
7487543 Arnold et al. Feb 2009 B2
7496960 Chen et al. Feb 2009 B1
7496961 Zimmer et al. Feb 2009 B2
7519990 Xie Apr 2009 B1
7523493 Liang et al. Apr 2009 B2
7530104 Thrower et al. May 2009 B1
7540025 Tzadikario May 2009 B2
7546638 Anderson et al. Jun 2009 B2
7565550 Liang et al. Jul 2009 B2
7568233 Szor et al. Jul 2009 B1
7584455 Ball Sep 2009 B2
7603715 Costa et al. Oct 2009 B2
7607171 Marsden et al. Oct 2009 B1
7639714 Stolfo et al. Dec 2009 B2
7644441 Schmid et al. Jan 2010 B2
7657419 van der Made Feb 2010 B2
7676841 Sobchuk et al. Mar 2010 B2
7698548 Shelest et al. Apr 2010 B2
7707633 Danford et al. Apr 2010 B2
7712136 Sprosts et al. May 2010 B2
7730011 Deninger et al. Jun 2010 B1
7739740 Nachenberg et al. Jun 2010 B1
7779463 Stolfo et al. Aug 2010 B2
7784097 Stolfo et al. Aug 2010 B1
7832008 Kraemer Nov 2010 B1
7836502 Zhao et al. Nov 2010 B1
7849506 Dansey et al. Dec 2010 B1
7854007 Sprosts et al. Dec 2010 B2
7869073 Oshima Jan 2011 B2
7877803 Enstone et al. Jan 2011 B2
7904959 Sidiroglou et al. Mar 2011 B2
7908660 Bahl Mar 2011 B2
7930738 Petersen Apr 2011 B1
7937387 Frazier et al. May 2011 B2
7937761 Bennett May 2011 B1
7949849 Lowe et al. May 2011 B2
7996556 Raghavan et al. Aug 2011 B2
7996836 McCorkendale et al. Aug 2011 B1
7996904 Chiueh et al. Aug 2011 B1
7996905 Arnold et al. Aug 2011 B2
8006305 Aziz Aug 2011 B2
8010667 Zhang et al. Aug 2011 B2
8020206 Hubbard et al. Sep 2011 B2
8028338 Schneider et al. Sep 2011 B1
8042184 Batenin Oct 2011 B1
8045094 Teragawa Oct 2011 B2
8045458 Alperovitch et al. Oct 2011 B2
8064438 Croak Nov 2011 B1
8069484 McMillan et al. Nov 2011 B2
8087086 Lai et al. Dec 2011 B1
8171553 Aziz et al. May 2012 B2
8176049 Deninger et al. May 2012 B2
8176480 Spertus May 2012 B1
8201246 Wu et al. Jun 2012 B1
8204984 Aziz et al. Jun 2012 B1
8214905 Doukhvalov et al. Jul 2012 B1
8220055 Kennedy Jul 2012 B1
8225288 Miller et al. Jul 2012 B2
8225373 Kraemer Jul 2012 B2
8233882 Rogel Jul 2012 B2
8234640 Fitzgerald et al. Jul 2012 B1
8234709 Viljoen et al. Jul 2012 B2
8239944 Nachenberg et al. Aug 2012 B1
8260914 Ranjan Sep 2012 B1
8266091 Gubin et al. Sep 2012 B1
8286251 Eker et al. Oct 2012 B2
8291499 Aziz et al. Oct 2012 B2
8307435 Mann et al. Nov 2012 B1
8307443 Wang et al. Nov 2012 B2
8312545 Fuvell et al. Nov 2012 B2
8321936 Green et al. Nov 2012 B1
8321941 Tuvell et al. Nov 2012 B2
8332571 Edwards, Sr. Dec 2012 B1
8365286 Poston Jan 2013 B2
8365297 Parshin et al. Jan 2013 B1
8370938 Daswani et al. Feb 2013 B1
8370939 Zaitsev et al. Feb 2013 B2
8375444 Aziz et al. Feb 2013 B2
8381299 Stolfo et al. Feb 2013 B2
8402529 Green et al. Mar 2013 B1
8464340 Ahn et al. Jun 2013 B2
8479174 Chiriac Jul 2013 B2
8479276 Vaystikh et al. Jul 2013 B1
8479291 Bodke Jul 2013 B1
8510827 Leake et al. Aug 2013 B1
8510828 Guo et al. Aug 2013 B1
8510842 Amit et al. Aug 2013 B2
8516478 Edwards et al. Aug 2013 B1
8516590 Ranadive et al. Aug 2013 B1
8516593 Aziz Aug 2013 B2
8522348 Chen et al. Aug 2013 B2
8528086 Aziz Sep 2013 B1
8533824 Hutton et al. Sep 2013 B2
8539582 Aziz et al. Sep 2013 B1
8549638 Aziz Oct 2013 B2
8555391 Demir et al. Oct 2013 B1
8561177 Aziz et al. Oct 2013 B1
8566476 Shiffer et al. Oct 2013 B2
8566946 Aziz et al. Oct 2013 B1
8584094 Dadhia et al. Nov 2013 B2
8584234 Sobel et al. Nov 2013 B1
8584239 Aziz et al. Nov 2013 B2
8595834 Xie et al. Nov 2013 B2
8627476 Satish et al. Jan 2014 B1
8635696 Aziz Jan 2014 B1
8682054 Xue et al. Mar 2014 B2
8682812 Ranjan Mar 2014 B1
8689333 Aziz Apr 2014 B2
8695096 Zhang Apr 2014 B1
8713631 Pavlyushchik Apr 2014 B1
8713681 Silberman et al. Apr 2014 B2
8726392 McCorkendale et al. May 2014 B1
8739280 Chess et al. May 2014 B2
8776229 Aziz Jul 2014 B1
8782792 Bodke Jul 2014 B1
8789172 Stolfo et al. Jul 2014 B2
8789178 Kejriwal et al. Jul 2014 B2
8793278 Frazier et al. Jul 2014 B2
8793787 Ismael et al. Jul 2014 B2
8805947 Kuzkin et al. Aug 2014 B1
8806647 Daswani et al. Aug 2014 B1
8832829 Manni et al. Sep 2014 B2
8850570 Ramzan Sep 2014 B1
8850571 Staniford et al. Sep 2014 B2
8881234 Narasimhan et al. Nov 2014 B2
8881271 Butler, II Nov 2014 B2
8881282 Aziz et al. Nov 2014 B1
8898788 Aziz et al. Nov 2014 B1
8935779 Manni et al. Jan 2015 B2
8949257 Shiffer et al. Feb 2015 B2
8984638 Aziz et al. Mar 2015 B1
8990939 Staniford et al. Mar 2015 B2
8990944 Singh et al. Mar 2015 B1
8997219 Staniford et al. Mar 2015 B2
9009822 Ismael et al. Apr 2015 B1
9009823 Ismael et al. Apr 2015 B1
9027135 Aziz May 2015 B1
9071638 Aziz et al. Jun 2015 B1
9104867 Thioux et al. Aug 2015 B1
9106630 Frazier et al. Aug 2015 B2
9106694 Aziz et al. Aug 2015 B2
9118715 Staniford et al. Aug 2015 B2
9159035 Ismael et al. Oct 2015 B1
9171160 Vincent et al. Oct 2015 B2
9176843 Ismael et al. Nov 2015 B1
9189627 Islam Nov 2015 B1
9195829 Goradia et al. Nov 2015 B1
9197664 Aziz et al. Nov 2015 B1
9223972 Vincent et al. Dec 2015 B1
9225740 Ismael et al. Dec 2015 B1
9241010 Bennett et al. Jan 2016 B1
9251343 Vincent et al. Feb 2016 B1
9262635 Paithane et al. Feb 2016 B2
9268936 Butler Feb 2016 B2
9275229 LeMasters Mar 2016 B2
9282109 Aziz et al. Mar 2016 B1
9292686 Ismael et al. Mar 2016 B2
9294501 Mesdaq et al. Mar 2016 B2
9300686 Pidathala et al. Mar 2016 B2
9306960 Aziz Apr 2016 B1
9306974 Aziz et al. Apr 2016 B1
9311479 Manni et al. Apr 2016 B1
9355247 Thioux et al. May 2016 B1
9356944 Aziz May 2016 B1
9363280 Rivlin et al. Jun 2016 B1
9367681 Ismael et al. Jun 2016 B1
9378461 Chatterjee Jun 2016 B1
9398028 Karandikar et al. Jul 2016 B1
9413781 Cunningham et al. Aug 2016 B2
9426071 Caldejon et al. Aug 2016 B1
9430646 Mushtaq et al. Aug 2016 B1
9432389 Khalid et al. Aug 2016 B1
9438613 Paithane et al. Sep 2016 B1
9438622 Staniford et al. Sep 2016 B1
9438623 Thioux et al. Sep 2016 B1
9459901 Jung et al. Oct 2016 B2
9467460 Otvagin et al. Oct 2016 B1
9483644 Paithane et al. Nov 2016 B1
9495180 Ismael Nov 2016 B2
9497213 Thompson et al. Nov 2016 B2
9507935 Ismael et al. Nov 2016 B2
9516057 Aziz Dec 2016 B2
9519782 Aziz et al. Dec 2016 B2
9536091 Paithane et al. Jan 2017 B2
9537972 Edwards et al. Jan 2017 B1
9560059 Islam Jan 2017 B1
9565202 Kindlund et al. Feb 2017 B1
9591015 Amin et al. Mar 2017 B1
9591020 Aziz Mar 2017 B1
9594904 Jain et al. Mar 2017 B1
9594905 Ismael et al. Mar 2017 B1
9594912 Thioux et al. Mar 2017 B1
9609007 Rivlin et al. Mar 2017 B1
9626509 Khalid et al. Apr 2017 B1
9628498 Aziz et al. Apr 2017 B1
9628507 Haq et al. Apr 2017 B2
9633134 Ross Apr 2017 B2
9635039 Islam et al. Apr 2017 B1
9641546 Manni et al. May 2017 B1
9654485 Neumann May 2017 B1
9661009 Karandikar et al. May 2017 B1
9661018 Aziz May 2017 B1
9674298 Edwards et al. Jun 2017 B1
9680862 Ismael et al. Jun 2017 B2
9690606 Ha et al. Jun 2017 B1
9690933 Singh et al. Jun 2017 B1
9690935 Shiffer et al. Jun 2017 B2
9690936 Malik et al. Jun 2017 B1
9736179 Ismael Aug 2017 B2
9740857 Ismael et al. Aug 2017 B2
9747446 Pidathala et al. Aug 2017 B1
9756074 Aziz et al. Sep 2017 B2
9773112 Rathor et al. Sep 2017 B1
9781144 Otvagin et al. Oct 2017 B1
9787700 Amin et al. Oct 2017 B1
9787706 Otvagin et al. Oct 2017 B1
9792196 Ismael et al. Oct 2017 B1
9824209 Ismael et al. Nov 2017 B1
9824211 Wilson Nov 2017 B2
9824216 Khalid et al. Nov 2017 B1
9825976 Gomez et al. Nov 2017 B1
9825989 Mehra et al. Nov 2017 B1
9838408 Karandikar et al. Dec 2017 B1
9838411 Aziz Dec 2017 B1
9838416 Aziz Dec 2017 B1
9838417 Khalid et al. Dec 2017 B1
9846776 Paithane et al. Dec 2017 B1
9876701 Caldejon et al. Jan 2018 B1
9888016 Amin et al. Feb 2018 B1
9888019 Pidathala et al. Feb 2018 B1
9910988 Vincent et al. Mar 2018 B1
9912644 Cunningham Mar 2018 B2
9912681 Ismael et al. Mar 2018 B1
9912684 Aziz et al. Mar 2018 B1
9912691 Mesdaq et al. Mar 2018 B2
9912698 Thioux et al. Mar 2018 B1
9916440 Paithane et al. Mar 2018 B1
9921978 Chan et al. Mar 2018 B1
9934376 Ismael Apr 2018 B1
9934381 Kindlund et al. Apr 2018 B1
9946568 Ismael et al. Apr 2018 B1
9954890 Staniford et al. Apr 2018 B1
9973531 Thioux May 2018 B1
10002252 Ismael et al. Jun 2018 B2
10019338 Goradia et al. Jul 2018 B1
10019573 Silberman et al. Jul 2018 B2
10025691 Ismael et al. Jul 2018 B1
10025927 Khalid et al. Jul 2018 B1
10027689 Rathor et al. Jul 2018 B1
10027690 Aziz et al. Jul 2018 B2
10027696 Rivlin et al. Jul 2018 B1
10033747 Paithane et al. Jul 2018 B1
10033748 Cunningham et al. Jul 2018 B1
10033753 Islam et al. Jul 2018 B1
10033759 Kabra et al. Jul 2018 B1
10050998 Singh Aug 2018 B1
10068091 Aziz et al. Sep 2018 B1
10075455 Zafar et al. Sep 2018 B2
10083302 Paithane et al. Sep 2018 B1
10084813 Eyada Sep 2018 B2
10089461 Ha et al. Oct 2018 B1
10097573 Aziz Oct 2018 B1
10104102 Neumann Oct 2018 B1
10108446 Steinberg et al. Oct 2018 B1
10121000 Rivlin et al. Nov 2018 B1
10122746 Manni et al. Nov 2018 B1
10133863 Bu et al. Nov 2018 B2
10133866 Kumar et al. Nov 2018 B1
10146810 Shiffer et al. Dec 2018 B2
10148693 Singh et al. Dec 2018 B2
10165000 Aziz et al. Dec 2018 B1
10169585 Pilipenko et al. Jan 2019 B1
10176321 Abbasi et al. Jan 2019 B2
10181029 Ismael et al. Jan 2019 B1
10191861 Steinberg et al. Jan 2019 B1
10192052 Singh et al. Jan 2019 B1
10198574 Thioux et al. Feb 2019 B1
10200384 Mushtaq et al. Feb 2019 B1
10210329 Malik et al. Feb 2019 B1
10216927 Steinberg Feb 2019 B1
10218740 Mesdaq et al. Feb 2019 B1
10242185 Goradia Mar 2019 B1
20010005889 Albrecht Jun 2001 A1
20010047326 Broadbent et al. Nov 2001 A1
20020018903 Kokubo et al. Feb 2002 A1
20020038430 Edwards et al. Mar 2002 A1
20020091819 Melchione et al. Jul 2002 A1
20020095607 Lin-Hendel Jul 2002 A1
20020116627 Tarbotton et al. Aug 2002 A1
20020144156 Copeland Oct 2002 A1
20020162015 Tang Oct 2002 A1
20020166063 Lachman et al. Nov 2002 A1
20020169952 DiSanto et al. Nov 2002 A1
20020184528 Shevenell et al. Dec 2002 A1
20020188887 Largman et al. Dec 2002 A1
20020194490 Halperin et al. Dec 2002 A1
20030021728 Sharpe et al. Jan 2003 A1
20030074578 Ford et al. Apr 2003 A1
20030084318 Schertz May 2003 A1
20030101381 Mateev et al. May 2003 A1
20030115483 Liang Jun 2003 A1
20030188190 Aaron et al. Oct 2003 A1
20030191957 Hypponen et al. Oct 2003 A1
20030200460 Morota et al. Oct 2003 A1
20030212902 van der Made Nov 2003 A1
20030229801 Kouznetsov et al. Dec 2003 A1
20030237000 Denton et al. Dec 2003 A1
20040003323 Bennett et al. Jan 2004 A1
20040006473 Mills et al. Jan 2004 A1
20040015712 Szor Jan 2004 A1
20040019832 Arnold et al. Jan 2004 A1
20040047356 Bauer Mar 2004 A1
20040083408 Spiegel et al. Apr 2004 A1
20040088581 Brawn et al. May 2004 A1
20040093513 Cantrell et al. May 2004 A1
20040111531 Staniford et al. Jun 2004 A1
20040117478 Triulzi et al. Jun 2004 A1
20040117624 Brandt et al. Jun 2004 A1
20040128355 Chao et al. Jul 2004 A1
20040165588 Pandya Aug 2004 A1
20040236963 Danford et al. Nov 2004 A1
20040243349 Greifeneder et al. Dec 2004 A1
20040249911 Alkhatib et al. Dec 2004 A1
20040249916 Graves Dec 2004 A1
20040255161 Cavanaugh Dec 2004 A1
20040268147 Wiederin et al. Dec 2004 A1
20050005159 Oliphant Jan 2005 A1
20050021740 Bar et al. Jan 2005 A1
20050033960 Vialen et al. Feb 2005 A1
20050033989 Poletto et al. Feb 2005 A1
20050050148 Mohammadioun et al. Mar 2005 A1
20050086523 Zimmer et al. Apr 2005 A1
20050091513 Mitomo et al. Apr 2005 A1
20050091533 Omote et al. Apr 2005 A1
20050091652 Ross et al. Apr 2005 A1
20050108562 Khazan et al. May 2005 A1
20050114663 Cornell et al. May 2005 A1
20050125195 Brendel Jun 2005 A1
20050149726 Joshi et al. Jul 2005 A1
20050157662 Bingham et al. Jul 2005 A1
20050183143 Anderholm et al. Aug 2005 A1
20050201297 Peikari Sep 2005 A1
20050210533 Copeland et al. Sep 2005 A1
20050238005 Chen et al. Oct 2005 A1
20050240781 Gassoway Oct 2005 A1
20050262562 Gassoway Nov 2005 A1
20050265331 Stolfo Dec 2005 A1
20050283839 Cowburn Dec 2005 A1
20060010495 Cohen et al. Jan 2006 A1
20060015416 Hoffman et al. Jan 2006 A1
20060015715 Anderson Jan 2006 A1
20060015747 Van de Ven Jan 2006 A1
20060021029 Brickell et al. Jan 2006 A1
20060021054 Costa et al. Jan 2006 A1
20060031476 Mathes et al. Feb 2006 A1
20060047665 Neil Mar 2006 A1
20060070130 Costea et al. Mar 2006 A1
20060075496 Carpenter et al. Apr 2006 A1
20060095968 Portolani et al. May 2006 A1
20060101516 Sudaharan et al. May 2006 A1
20060101517 Banzhof et al. May 2006 A1
20060117385 Mester et al. Jun 2006 A1
20060123477 Raghavan et al. Jun 2006 A1
20060143709 Brooks et al. Jun 2006 A1
20060150249 Gassen et al. Jul 2006 A1
20060161983 Cothrell et al. Jul 2006 A1
20060161987 Levy-Yurista Jul 2006 A1
20060161989 Reshef et al. Jul 2006 A1
20060164199 Gilde et al. Jul 2006 A1
20060173992 Weber et al. Aug 2006 A1
20060179147 Tran et al. Aug 2006 A1
20060184632 Marino et al. Aug 2006 A1
20060191010 Benjamin Aug 2006 A1
20060221956 Narayan et al. Oct 2006 A1
20060236393 Kramer et al. Oct 2006 A1
20060242709 Seinfeld et al. Oct 2006 A1
20060248519 Jaeger et al. Nov 2006 A1
20060248582 Panjwani et al. Nov 2006 A1
20060251104 Koga Nov 2006 A1
20060288417 Bookbinder et al. Dec 2006 A1
20070006288 Mayfield et al. Jan 2007 A1
20070006313 Porras et al. Jan 2007 A1
20070011174 Takaragi et al. Jan 2007 A1
20070016951 Piccard et al. Jan 2007 A1
20070019286 Kikuchi Jan 2007 A1
20070033645 Jones Feb 2007 A1
20070038943 FitzGerald et al. Feb 2007 A1
20070064689 Shin et al. Mar 2007 A1
20070074169 Chess et al. Mar 2007 A1
20070094730 Bhikkaji et al. Apr 2007 A1
20070101435 Konanka et al. May 2007 A1
20070128855 Cho et al. Jun 2007 A1
20070142030 Sinha et al. Jun 2007 A1
20070143827 Nicodemus et al. Jun 2007 A1
20070156895 Vuong Jul 2007 A1
20070157180 Tillmann et al. Jul 2007 A1
20070157306 Elrod et al. Jul 2007 A1
20070168988 Eisner et al. Jul 2007 A1
20070171824 Ruello et al. Jul 2007 A1
20070174915 Gribble et al. Jul 2007 A1
20070192500 Lum Aug 2007 A1
20070192858 Lum Aug 2007 A1
20070198275 Malden et al. Aug 2007 A1
20070208822 Wang et al. Sep 2007 A1
20070220607 Sprosts et al. Sep 2007 A1
20070240218 Tuvell et al. Oct 2007 A1
20070240219 Tuvell et al. Oct 2007 A1
20070240220 Tuvell et al. Oct 2007 A1
20070240222 Tuvell et al. Oct 2007 A1
20070250930 Aziz et al. Oct 2007 A1
20070256132 Oliphant Nov 2007 A2
20070271446 Nakamura Nov 2007 A1
20080005782 Aziz Jan 2008 A1
20080018122 Zierler et al. Jan 2008 A1
20080028463 Dagon et al. Jan 2008 A1
20080040710 Chiriac Feb 2008 A1
20080046781 Childs et al. Feb 2008 A1
20080066179 Liu Mar 2008 A1
20080072326 Danford et al. Mar 2008 A1
20080077793 Tan et al. Mar 2008 A1
20080080518 Hoeflin et al. Apr 2008 A1
20080086720 Lekel Apr 2008 A1
20080098476 Syversen Apr 2008 A1
20080120722 Sima et al. May 2008 A1
20080134178 Fitzgerald et al. Jun 2008 A1
20080134334 Kim et al. Jun 2008 A1
20080141376 Clausen et al. Jun 2008 A1
20080184367 McMillan et al. Jul 2008 A1
20080184373 Traut et al. Jul 2008 A1
20080189787 Arnold et al. Aug 2008 A1
20080201778 Guo et al. Aug 2008 A1
20080209557 Herley et al. Aug 2008 A1
20080215742 Goldszmidt et al. Sep 2008 A1
20080222729 Chen et al. Sep 2008 A1
20080263665 Ma et al. Oct 2008 A1
20080295172 Bohacek Nov 2008 A1
20080301810 Lehane et al. Dec 2008 A1
20080307524 Singh et al. Dec 2008 A1
20080313738 Enderby Dec 2008 A1
20080320594 Jiang Dec 2008 A1
20090003317 Kasralikar et al. Jan 2009 A1
20090007100 Field et al. Jan 2009 A1
20090013408 Schipka Jan 2009 A1
20090031423 Liu et al. Jan 2009 A1
20090036111 Danford et al. Feb 2009 A1
20090037835 Goldman Feb 2009 A1
20090044024 Oberheide et al. Feb 2009 A1
20090044274 Budko et al. Feb 2009 A1
20090064332 Porras et al. Mar 2009 A1
20090077666 Chen et al. Mar 2009 A1
20090083369 Marmor Mar 2009 A1
20090083855 Apap et al. Mar 2009 A1
20090089879 Wang et al. Apr 2009 A1
20090094697 Provos et al. Apr 2009 A1
20090113425 Ports et al. Apr 2009 A1
20090125976 Wassermann et al. May 2009 A1
20090126015 Monastyrsky et al. May 2009 A1
20090126016 Sobko et al. May 2009 A1
20090133125 Choi et al. May 2009 A1
20090144823 Lamastra et al. Jun 2009 A1
20090158430 Borders Jun 2009 A1
20090172815 Gu et al. Jul 2009 A1
20090187992 Poston Jul 2009 A1
20090193293 Stolfo et al. Jul 2009 A1
20090198651 Shiffer et al. Aug 2009 A1
20090198670 Shiffer et al. Aug 2009 A1
20090198689 Frazier et al. Aug 2009 A1
20090199274 Frazier et al. Aug 2009 A1
20090199296 Xie et al. Aug 2009 A1
20090228233 Anderson et al. Sep 2009 A1
20090241187 Troyansky Sep 2009 A1
20090241190 Todd et al. Sep 2009 A1
20090265692 Godefroid et al. Oct 2009 A1
20090271867 Zhang Oct 2009 A1
20090300415 Zhang et al. Dec 2009 A1
20090300761 Park et al. Dec 2009 A1
20090328185 Berg et al. Dec 2009 A1
20090328221 Blumfield et al. Dec 2009 A1
20100005146 Drako et al. Jan 2010 A1
20100011205 McKenna Jan 2010 A1
20100017546 Poo et al. Jan 2010 A1
20100030996 Butler, II Feb 2010 A1
20100031353 Thomas et al. Feb 2010 A1
20100037314 Perdisci et al. Feb 2010 A1
20100043073 Kuwamura Feb 2010 A1
20100054278 Stolfo et al. Mar 2010 A1
20100058474 Hicks Mar 2010 A1
20100064044 Nonoyama Mar 2010 A1
20100077481 Polyakov et al. Mar 2010 A1
20100083376 Pereira et al. Apr 2010 A1
20100115621 Staniford et al. May 2010 A1
20100132038 Zaitsev May 2010 A1
20100154056 Smith et al. Jun 2010 A1
20100180344 Malyshev et al. Jul 2010 A1
20100192223 Ismael et al. Jul 2010 A1
20100220863 Dupaquis et al. Sep 2010 A1
20100235831 Dittmer Sep 2010 A1
20100251104 Massand Sep 2010 A1
20100281102 Chinta et al. Nov 2010 A1
20100281541 Stolfo et al. Nov 2010 A1
20100281542 Stolfo et al. Nov 2010 A1
20100287260 Peterson et al. Nov 2010 A1
20100299754 Amit et al. Nov 2010 A1
20100306173 Frank Dec 2010 A1
20110004737 Greenebaum Jan 2011 A1
20110025504 Lyon et al. Feb 2011 A1
20110041179 Ståhlberg Feb 2011 A1
20110047594 Mahaffey et al. Feb 2011 A1
20110047620 Mahaffey et al. Feb 2011 A1
20110055907 Narasimhan et al. Mar 2011 A1
20110066876 Shannon Mar 2011 A1
20110078794 Manni et al. Mar 2011 A1
20110093951 Aziz Apr 2011 A1
20110099620 Stavrou et al. Apr 2011 A1
20110099633 Aziz Apr 2011 A1
20110099635 Silberman et al. Apr 2011 A1
20110113231 Kaminsky May 2011 A1
20110145918 Jung et al. Jun 2011 A1
20110145920 Mahaffey et al. Jun 2011 A1
20110145934 Abramovici et al. Jun 2011 A1
20110167493 Song et al. Jul 2011 A1
20110167494 Bowen et al. Jul 2011 A1
20110173213 Frazier et al. Jul 2011 A1
20110173460 Ito et al. Jul 2011 A1
20110219449 St. Neitzel et al. Sep 2011 A1
20110219450 McDougal et al. Sep 2011 A1
20110225624 Sawhney et al. Sep 2011 A1
20110225655 Niemela et al. Sep 2011 A1
20110247072 Staniford et al. Oct 2011 A1
20110265182 Peinado et al. Oct 2011 A1
20110289582 Kejriwal et al. Nov 2011 A1
20110302587 Nishikawa et al. Dec 2011 A1
20110307954 Melnik et al. Dec 2011 A1
20110307955 Kaplan et al. Dec 2011 A1
20110307956 Yermakov et al. Dec 2011 A1
20110314546 Aziz et al. Dec 2011 A1
20120005318 Beaty Jan 2012 A1
20120023593 Puder et al. Jan 2012 A1
20120054869 Yen et al. Mar 2012 A1
20120066698 Yanoo Mar 2012 A1
20120079596 Thomas et al. Mar 2012 A1
20120084859 Radinsky et al. Apr 2012 A1
20120096553 Srivastava et al. Apr 2012 A1
20120110667 Zubrilin et al. May 2012 A1
20120117652 Manni et al. May 2012 A1
20120121154 Xue et al. May 2012 A1
20120124426 Maybee et al. May 2012 A1
20120174186 Aziz et al. Jul 2012 A1
20120174196 Bhogavilli et al. Jul 2012 A1
20120174218 McCoy et al. Jul 2012 A1
20120198279 Schroeder Aug 2012 A1
20120210423 Friedrichs et al. Aug 2012 A1
20120222121 Staniford et al. Aug 2012 A1
20120255015 Sahita et al. Oct 2012 A1
20120255017 Sallam Oct 2012 A1
20120260342 Dube et al. Oct 2012 A1
20120266244 Green et al. Oct 2012 A1
20120278886 Luna Nov 2012 A1
20120297489 Dequevy Nov 2012 A1
20120330801 McDougal et al. Dec 2012 A1
20120331553 Aziz et al. Dec 2012 A1
20130014259 Gribble et al. Jan 2013 A1
20130036472 Aziz Feb 2013 A1
20130047257 Aziz Feb 2013 A1
20130074185 McDougal et al. Mar 2013 A1
20130086684 Mohler Apr 2013 A1
20130097699 Balupar et al. Apr 2013 A1
20130097706 Titonis et al. Apr 2013 A1
20130111587 Goel et al. May 2013 A1
20130117852 Stute May 2013 A1
20130117855 Kim et al. May 2013 A1
20130139264 Brinkley et al. May 2013 A1
20130160125 Likhachev et al. Jun 2013 A1
20130160127 Jeong et al. Jun 2013 A1
20130160130 Mendelev et al. Jun 2013 A1
20130160131 Madou et al. Jun 2013 A1
20130167236 Sick Jun 2013 A1
20130174214 Duncan Jul 2013 A1
20130185789 Hagiwara et al. Jul 2013 A1
20130185795 Winn et al. Jul 2013 A1
20130185798 Saunders et al. Jul 2013 A1
20130191915 Antonakakis et al. Jul 2013 A1
20130196649 Paddon et al. Aug 2013 A1
20130227691 Aziz et al. Aug 2013 A1
20130246370 Bartram et al. Sep 2013 A1
20130247186 LeMasters Sep 2013 A1
20130263260 Mahaffey et al. Oct 2013 A1
20130291109 Staniford et al. Oct 2013 A1
20130298243 Kumar et al. Nov 2013 A1
20130318038 Shiffer et al. Nov 2013 A1
20130318073 Shiffer et al. Nov 2013 A1
20130325791 Shiffer et al. Dec 2013 A1
20130325792 Shiffer et al. Dec 2013 A1
20130325871 Shiffer et al. Dec 2013 A1
20130325872 Shiffer et al. Dec 2013 A1
20140032875 Butler Jan 2014 A1
20140053260 Gupta et al. Feb 2014 A1
20140053261 Gupta et al. Feb 2014 A1
20140130158 Wang et al. May 2014 A1
20140137180 Lukacs et al. May 2014 A1
20140169762 Ryu Jun 2014 A1
20140179360 Jackson et al. Jun 2014 A1
20140181131 Ross Jun 2014 A1
20140189687 Jung et al. Jul 2014 A1
20140189866 Shiffer et al. Jul 2014 A1
20140189882 Jung et al. Jul 2014 A1
20140237600 Silberman et al. Aug 2014 A1
20140280245 Wilson Sep 2014 A1
20140283037 Sikorski et al. Sep 2014 A1
20140283063 Thompson et al. Sep 2014 A1
20140328204 Klotsche et al. Nov 2014 A1
20140337836 Ismael Nov 2014 A1
20140344926 Cunningham et al. Nov 2014 A1
20140351205 Fennell Nov 2014 A1
20140351935 Shao et al. Nov 2014 A1
20140380473 Bu et al. Dec 2014 A1
20140380474 Paithane et al. Dec 2014 A1
20150007312 Pidathala et al. Jan 2015 A1
20150095630 Cote Apr 2015 A1
20150096022 Vincent et al. Apr 2015 A1
20150096023 Mesdaq et al. Apr 2015 A1
20150096024 Haq et al. Apr 2015 A1
20150096025 Ismael Apr 2015 A1
20150180886 Staniford et al. Jun 2015 A1
20150186645 Aziz et al. Jul 2015 A1
20150199513 Ismael et al. Jul 2015 A1
20150199531 Ismael et al. Jul 2015 A1
20150199532 Ismael et al. Jul 2015 A1
20150220735 Paithane et al. Aug 2015 A1
20150372980 Eyada Dec 2015 A1
20160004869 Ismael et al. Jan 2016 A1
20160006756 Ismael et al. Jan 2016 A1
20160044000 Cunningham Feb 2016 A1
20160080204 Mishra Mar 2016 A1
20160127393 Aziz et al. May 2016 A1
20160191547 Zafar et al. Jun 2016 A1
20160191550 Ismael et al. Jun 2016 A1
20160197951 Lietz Jul 2016 A1
20160261612 Mesdaq et al. Sep 2016 A1
20160285914 Singh et al. Sep 2016 A1
20160301703 Aziz Oct 2016 A1
20160335110 Paithane et al. Nov 2016 A1
20170083703 Abbasi et al. Mar 2017 A1
20180013770 Ismael Jan 2018 A1
20180048660 Paithane et al. Feb 2018 A1
20180121316 Ismael et al. May 2018 A1
20180124072 Hamdi May 2018 A1
20180288077 Siddiqui et al. Oct 2018 A1
Foreign Referenced Citations (11)
Number Date Country
2439806 Jan 2008 GB
2490431 Oct 2012 GB
0206928 Jan 2002 WO
0223805 Mar 2002 WO
2007117636 Oct 2007 WO
2008041950 Apr 2008 WO
2011084431 Jul 2011 WO
2011112348 Sep 2011 WO
2012075336 Jun 2012 WO
2012145066 Oct 2012 WO
2013067505 May 2013 WO
Non-Patent Literature Citations (57)
Entry
Venezia, Paul, “NetDetector Captures Intrusions”, InfoWorld Issue 27, (“Venezia”), (Jul. 14, 2003).
Vladimir Getov: “Security as a Service in Smart Clouds—Opportunities and Concerns”, Computer Software and Applications Conference (COMPSAC), 2012 IEEE 36th Annual, IEEE, Jul. 16, 2012 (Jul. 16, 2012).
Wahid et al., Characterising the Evolution in Scanning Activity of Suspicious Hosts, Oct. 2009, Third International Conference on Network and System Security, pp. 344-350.
Whyte, et al., “DNS-Based Detection of Scanning Works in an Enterprise Network”, Proceedings of the 12th Annual Network and Distributed System Security Symposium, (Feb. 2005), 15 pages.
Williamson, Matthew M., “Throttling Viruses: Restricting Propagation to Defeat Malicious Mobile Code”, ACSAC Conference, Las Vegas, NV, USA, (Dec. 2002), pp. 1-9.
Yuhei Kawakoya et al.: “Memory behavior-based automatic malware unpacking in stealth debugging environment”, Malicious and Unwanted Software (Malware), 2010 5th International Conference on, IEEE, Piscataway, NJ, USA, Oct. 19, 2010, pp. 39-46, XP031833827, ISBN:978-1-4244-8-9353-1.
Zhang et al., The Effects of Threading, Infection Time, and Multiple-Attacker Collaboration on Malware Propagation, Sep. 2009, IEEE 28th International Symposium on Reliable Distributed Systems, pp. 73-82.
“Mining Specification of Malicious Behavior”—Jha et al., UCSB, Sep. 2007 https://www.cs.ucsb.edu/.about.chris/research/doc/esec07.sub.-mining.pdf-.
“Network Security: NetDetector—Network Intrusion Forensic System (NIFS) Whitepaper”, (“NetDetector Whitepaper”), (2003).
“When Virtual is Better Than Real”, lEEEXplore Digital Library, available at, http://ieeexplore.ieee.org/xpl/articleDetails.isp?reload=true&arnumbe- r=990073, (Dec. 7, 2013).
Abdullah, et al., Visualizing Network Data for Intrusion Detection, 2005 IEEE Workshop on Information Assurance and Security, pp. 100-108.
Adetoye, Adedayo , et al., “Network Intrusion Detection & Response System”, (“Adetoye”), (Sep. 2003).
Apostolopoulos, George; hassapis, Constantinos; “V-eM: A cluster of Virtual Machines for Robust, Detailed, and High-Performance Network Emulation”, 14th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Sep. 11-14, 2006, pp. 117-126.
Aura, Tuomas, “Scanning electronic documents for personally identifiable information”, Proceedings of the 5th ACM workshop on Privacy in electronic society. ACM, 2006.
Baecher, “The Nepenthes Platform: An Efficient Approach to collect Malware”, Springer-verlag Berlin Heidelberg, (2006), pp. 165-184.
Bayer, et al., “Dynamic Analysis of Malicious Code”, J Comput Virol, Springer-Verlag, France., (2006), pp. 67-77.
Boubalos, Chris , “extracting syslog data out of raw pcap dumps, seclists.org, Honeypots mailing list archives”, available at http://seclists.org/honeypots/2003/q2/319 (“Boubalos”), (Jun. 5, 2003).
Chaudet, C. , et al., “Optimal Positioning of Active and Passive Monitoring Devices”, International Conference on Emerging Networking Experiments and Technologies, Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, CoNEXT '05, Toulousse, France, (Oct. 2005), pp. 71-82.
Chen, P. M. and Noble, B. D., “When Virtual is Better Than Real, Department of Electrical Engineering and Computer Science”, University of Michigan (“Chen”) (2001).
Cisco “Intrusion Prevention for the Cisco ASA 5500-x Series” Data Sheet (2012).
Cohen, M.I. , “PyFlag—An advanced network forensic framework”, Digital investigation 5, Elsevier, (2008), pp. S112-S120.
Costa, M. , et al., “Vigilante: End-to-End Containment of Internet Worms”, SOSP '05, Association for Computing Machinery, Inc., Brighton U.K , (Oct. 23-26, 2005).
Didier Stevens, “Malicious PDF Documents Explained”, Security & Privacy, IEEE, IEEE Service Center, Los Alamitos, CA, US, vol. 9, No. 1, Jan. 1, 2011, pp. 80-82, XP011329453, ISSN: 1540-7993, DOI: 10 1109/MSP.2011.14.
Distler, “Malware Analysis: An Introduction”, SANS Institute InfoSec Reading Room, SANS Institute, (2007).
Dunlap, George W. , et al., “ReVirt: Enabling Intrusion Analysis through Virtual-Machine Logging and Replay”, Proceeding of the 5th Symposium on Operating Systems Design and Implementation, USENIX Association, (“Dunlap”), (Dec. 9, 2002).
FireEye Malware Analysis & Exchange Network, Malware Protection System, FireEye Inc., 2010.
FireEye Malware Analysis, Modern Malware Forensics, FireEye Inc., 2010.
FireEye v.6.0 Security Target, pp. 1-35, Version 1.1, FireEye Inc., May 2011.
Goel, et al., Reconstructing System State for Intrusion Analysis, Apr. 2008 SIGOPS Operating Systems Review, vol. 42 Issue 3, pp. 21-28.
Gregg Keizer: “Microsoft's HoneyMonkeys Show Patching Windows Works”, Aug. 8, 2005, XP055143386, Retrieved from the Internet: URL:http://www.informationweek.com/microsofts-honeymonkeys-show-patching-windows-works/d/d-id/1035069? [retrieved on Jun. 1, 2016].
Heng Yin et al, Panorama: Capturing System-Wide Information Flow for Malware Detection and Analysis, Research Showcase @ CMU, Carnegie Mellon University, 2007.
Hiroshi Shinotsuka, Malware Authors Using New Techniques to Evade Automated Threat Analysis Systems, Oct. 26, 2012, http://www.symantec.com/connect/blogs/, pp. 1-4.
Idika et al., A-Survey-of-Malware-Detection-Techniques, Feb. 2, 2007, Department of Computer Science, Purdue University.
Isohara, Takamasa, Keisuke Takemori, and Ayumu Kubota. “Kernel-based behavior analysis for android malware detection.” Computational intelligence and Security (CIS), 2011 Seventh International Conference on. IEEE, 2011.
Kaeo, Merike , “Designing Network Security”, (“Kaeo”), (Nov. 2003).
Kevin A Roundy et al: “Hybrid Analysis and Control of Malware”, Sep. 15, 2010, Recent Advances in Intrusion Detection, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 317-338, XP019150454 ISBN:978-3-642-15511-6.
Khaled Salah et al: “Using Cloud Computing to Implement a Security Overlay Network”, Security & Privacy, IEEE, IEEE Service Center, Los Alamitos, CA, US, vol. 11, No. 1, Jan. 1, 2013 (Jan. 1, 2013).
Kim, H. , et al., “Autograph: Toward Automated, Distributed Worm Signature Detection”, Proceedings of the 13th Usenix Security Symposium (Security 2004), San Diego, (Aug. 2004), pp. 271-286.
King, Samuel T., et al., “Operating System Support for Virtual Machines”, (“King”), (2003).
Kreibich, C. , et al., “Honeycomb-Creating Intrusion Detection Signatures Using Honeypots”, 2nd Workshop on Hot Topics in Networks (HotNets-11), Boston, USA, (2003).
Kristoff, J. , “Botnets, Detection and Mitigation: DNS-Based Techniques”, NU Security Day, (2005), 23 pages.
Lastline Labs, The Threat of Evasive Malware, Feb. 25, 2013, Lastline Labs, pp. 1-8.
Li et al., A VMM-Based System Call Interposition Framework for Program Monitoring, Dec. 2010, IEEE 16th International Conference on Parallel and Distributed Systems, pp. 706-711.
Lindorfer, Martina, Clemens Kolbitsch, and Paolo Milani Comparetti. “Detecting environment-sensitive malware.” Recent Advances in Intrusion Detection. Springer Berlin Heidelberg, 2011.
Marchette, David J., “Computer Intrusion Detection and Network Monitoring: A Statistical Viewpoint”, (“Marchette”), (2001).
Moore, D. , et al., “Internet Quarantine: Requirements for Containing Self-Propagating Code”, INFOCOM, vol. 3, (Mar. 30-Apr. 3, 2003), pp. 1901-1910.
Morales, Jose A., et al., ““Analyzing and exploiting network behaviors of malware.””, Security and Privacy in Communication Networks. Springer Berlin Heidelberg, 2010. 20-34.
Mori, Detecting Unknown Computer Viruses, 2004, Springer-Verlag Berlin Heidelberg.
Natvig, Kurt , “SANDBOXII: Internet”, Virus Bulletin Conference, (“Natvig”), (Sep. 2002).
NetBIOS Working Group. Protocol Standard fora NetBIOS Service on a TCP/UDP transport: Concepts and Methods. STD 19, RFC 1001, Mar. 1987.
Newsome, J. , et al., “Dynamic Taint Analysis for Automatic Detection, Analysis, and Signature Generation of Exploits on Commodity Software”, In Proceedings of the 12th Annual Network and Distributed System Security, Symposium (NDSS '05), (Feb. 2005).
Nojiri, D. , et al., “Cooperation Response Strategies for Large Scale Attack Mitigation”, DARPA Information Survivability Conference and Exposition, vol. 1, (Apr. 22-24, 2003), pp. 293-302.
Oberheide et al., CloudAV.sub.-N-Version Antivirus in the Network Cloud, 17th USENIX Security Symposium USENIX Security '08 Jul. 28-Aug. 1, 2008 San Jose, CA.
Reiner Sailer, Enriquillo Valdez, Trent Jaeger, Roonald Perez, Leendert van Doorn, John Linwood Griffin, Stefan Berger., sHype: Secure Hypervisor Appraoch to Trusted Virtualized Systems (Feb. 2, 2005) (“Sailer”).
Silicon Defense, “Worm Containment in the Internal Network”, (Mar. 2003), pp. 1-25.
Singh, S. , et al., “Automated Worm Fingerprinting”, Proceedings of the ACM/USENIX Symposium on Operating System Design and Implementation, San Francisco, California, (Dec. 2004).
Thomas H. Ptacek, and Timothy N. Newsham , “Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection”, Secure Networks, (“Ptacek”), (Jan. 1998).