Generate a communication graph using an application dependency mapping (ADM) pipeline

Information

  • Patent Grant
  • 11405291
  • Patent Number
    11,405,291
  • Date Filed
    Thursday, May 12, 2016
    8 years ago
  • Date Issued
    Tuesday, August 2, 2022
    a year ago
Abstract
This disclosure generally relates to a method and system for generating a communication graph of a network using an application dependency mapping (ADM) pipeline. In one aspect of the disclosure, the method comprises receiving network data (e.g., flow data and process information at each node) from a plurality of sensors associated with a plurality of nodes of the network, determining a plurality of vectors and an initial graph of the plurality of nodes based upon the network data, determining similarities between the plurality of vectors, clustering the plurality of vectors into a plurality of clustered vectors based upon the similarities between the plurality of vectors, and generating a communication graph of the network system based upon the plurality of clustered vectors.
Description
TECHNICAL FIELD

The disclosure relates generally to computer networks. More specifically, the present technology relates to a method and system for generating communication graph in a network.


BACKGROUND

A modern computer network comprises a large amount of highly distributed nodes and data. The highly distributed data can be very difficult to be collected and analyzed. Network information is typically collected and analyzed based upon historic data. Building policies in a network based upon network information is often labor intensive and can become prohibitive when there are frequent changes in the network or frequent demands in building new policies.


It remains a challenge to build near real-time communication graph such that a user or network administrator can respond to potential threats, improve business operations, have a better network experience, or maximize network stability and performance at a lowest possible cost.





BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific examples thereof which are illustrated in the appended drawings. Understanding that these drawings depict only examples of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:



FIG. 1A and FIG. 1B illustrate schematic block diagrams of an application dependency mapping (ADM) system, according to some examples;



FIG. 2 illustrates an example of an ADM system adopting a leaf-spine architecture, according to some examples;



FIG. 3 is a flow diagram illustrating an example of a process to generate a communication graph using an ADM pipeline, according to some examples; and



FIGS. 4A and 4B illustrate a computing platform of a computing device, according to some examples.





DESCRIPTION OF EXAMPLES

Various examples of the present technology are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without departing from the spirit and scope of the present technology.


Overview

Aspects of the present technology relate to techniques that enable generating a communication graph of a network using an application dependency mapping (ADM) pipeline. By collecting flow data and process information at each node of the network, the present technology can generate a near real-time communication graph using the ADM pipeline. In this disclose, the term “node” is used interchangeably with endpoint, machine, or virtual machine (VM).


In accordance with one aspect of the present disclosure, a computer-implemented method is provided to generate a communication graph of a network using an ADM pipeline. The method comprises receiving network data (e.g., flow data and process information at each node) from a plurality of sensors associated with a plurality of nodes of the network, determining a plurality of vectors and an initial graph of the plurality of nodes based upon the network data, determining similarities between the plurality of vectors, clustering the plurality of vectors into a plurality of clustered vectors based upon the similarities between the plurality of vectors, and generating a communication graph of the network system based upon the plurality of clustered vectors. The communication graph can provide visibility into the network and make it possible to efficiently build application profiles in the network.


In some examples, a method of generating a communication graph of a network system further comprises defining a policy of the network based upon generated communication graph, presenting the policy to a user of the network system, collecting feedback (e.g., granularity of clustering the plurality of vectors in the network) from the user, and re-generating the communication graph and policies of the network system based upon the user feedback. Some aspects of the present technology further enable the policy to be enforced in the network system. For example, a network communication between two nodes can be prohibited if the network communication is not specifically included in the policies.


In some examples, flow data and process information at each node of a plurality of nodes of a network are collected and summarized into flow summaries on a regular basis (e.g., daily). Data, such as the flow summaries, side information, server load balancing (SLB), route tags, and a plurality of clustered vectors generated in a previous run of ADM pipeline, can be used as an input data to a new ADM pipeline run. Using the flow summaries rather than raw flow data and processing information at each node may substantially reduce processing capacity and time needed to generate a new ADM pipeline run. Some examples of the present technology may further reduce processing capacity and time needed to generate an ADM pipeline run by partitioning nodes of the plurality of nodes into external and internal subnets, processing node vectors (i.e., feature reduction, term frequency-inverse document frequency (tfidf), and normalization), and preserving certain information for a next run or recycling data from a previous ADM pipeline run.


In some examples, a plurality of nodes of a network can be clustered into a plurality of clustered vectors based at least upon a communication pattern and processes running on each node of the plurality of nodes. Some aspects of the present technology can determine similarity scores between any two nodes of the plurality of nodes. The plurality of clustered vectors can be determined based at least upon the similarity scores between nodes of the plurality of nodes.


Some examples of the present technology provide a user interface (UI) for a user of a network to view generated clustered vectors, edit a specific cluster vector (i.e., add or remove a node), modify input parameters to cluster a plurality of nodes in the network, and start a new ADM pipeline run. The UI may provide an option for the user to generate or name a new workspace, select nodes/sensors in an ADM pipeline run, choose input parameters for the ADM pipeline run, and finalize and export a defined policy. The input parameters may include, but are not limited to, time granularity (e.g., a range of time that flow data and process information is to be analyzed), nodes to be included in the ADM pipeline run, side information (e.g., routs/subnets, load balancer information), and clustering granularity. After the new ADM pipeline run is completed, some examples may further provide statistics (e.g., a number of nodes in generated communication graph), a summary of each cluster vector's node members and server/client ports, a summary of changes between two ADM pipeline runs, options to edit each of the plurality of cluster vectors (e.g., add or remove a node to or from a specific cluster vector), add or edit name description for each of the plurality of cluster vectors, or approve the plurality of cluster vectors), application profiles of the plurality of nodes, and an option to start a new ADM pipeline run.


According to some examples, the present technology further enables a system comprising: one or more processors, and memory including instructions that, upon being executed by the one or more processors, cause the system to receive network data from a plurality of sensors associated with a plurality of nodes of a network, determine a plurality of vectors and an initial graph of the plurality of nodes based upon the network data, determine similarities between the plurality of vectors, clustering the plurality of vectors into a plurality of clustered vectors based upon the similarities between the plurality of vectors, and generate a communication graph of the network system based upon the plurality of clustered vectors.


In accordance with another aspect of the present disclosure, a non-transitory computer-readable storage medium storing instructions is provided, the instructions which, when executed by a processor, cause the processor to perform operations comprising, receiving network data (e.g., flow data and process information at each node) from a plurality of sensors associated with a plurality of nodes of a network, determining a plurality of vectors and an initial graph of the plurality of nodes based upon the network data, determining similarities between the plurality of vectors, clustering the plurality of vectors into a plurality of clustered vectors based upon the similarities between the plurality of vectors, and generating a communication graph of the network system based upon the plurality of clustered vectors.


Although many of the examples herein are described with reference to the application dependency mapping and discovery, it should be understood that these are only examples and the present technology is not limited in this regard. Rather, any other network information applications may be realized. Additionally, even though the present disclosure uses a sensor as a data-collecting device, the present technology is applicable to other controller or device that is capable of review, record and report network communication data between various end groups.


Additional features and advantages of the disclosure will be set forth in the description which follows, and, in part, will be obvious from the description, or can be learned by practice of the herein disclosed principles. The features and advantages of the disclosure can be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. These and other features of the disclosure will become more fully apparent from the following description and appended claims, or can be learned by the practice of the principles set forth herein.


DETAILED DESCRIPTION


FIG. 1A illustrates a schematic block diagram of an application dependency mapping system (ADM) 100A, according to some examples. The ADM system 100A can include, for example, a configuration/image imaginer 102, sensors 104, collectors 122, analytics module 124, ADM policy engine 126, user input module 127 and presentation module 128. It should be appreciated that the system topology in FIG. 1A is an example system, and any numbers of computing devices such as sensors, collectors, and network components may be included in the system of FIG. 1A.


The configuration/image manager 102 can configure and manage sensors 104. For example, when a new virtual machine is instantiated or when an existing virtual machine is migrated, the configuration/image manager 102 can provision and configure a new sensor on the virtual machine. According to some examples, the configuration/image manager 102 can monitor the physical status or heathy of the sensors 104. For example, the configuration/image manager 102 may request status updates or initiate tests. According to some examples, the configuration/image manager 102 can also manage and provisions virtual machines.


According to some examples, the configuration/image manager 102 can verify and validate the sensors 104. For example, the sensors 104 can be associated with a unique ID. The unique ID can be generated using a one-way hash function of its basic input/output system (BIOS) universally unique identifier (UUID) and a secret key stored on the configuration and image manager 102. The unique ID can be a large number that is difficult for an imposter sensor to guess. According to some examples, the configuration/image manager 102 can keep the sensors 104 up to date by monitoring versions of software installed on the sensors 104, applying patches, and installing new versions if necessary. In some examples, the configuration/image manager 102 can get the update of the software installed on the sensors 104 from a local source or automatically from a remote source via Internet.


The sensors 104 can be associated with each node or component of a data center (e.g., virtual machine, hypervisor, slice, blade, switch, router, gateway, etc.). Sensors 104 can monitor communications to and from the nodes of the data center, report environmental data related to the nodes (e.g., node IDs, statuses, etc.), and perform suitable actions related to the nodes (e.g., shut down a process, block ports, redirect traffic, etc.). The sensors 104 can send their records over a high-bandwidth connection to the collectors 122 for storage.


In this example, the sensors 104 can be software codes (e.g., running on virtual machine 106, container 112, or hypervisor 108), an application-specific integrated circuit (e.g., ASIC 110, a component of a switch, gateway, router, or standalone packet monitor), or an independent unit (e.g., a device connected to a switch's monitoring port or a device connected in series along a main trunk of a datacenter). For clarity and simplicity in this description, the term “component” is used to denote a component of the network (i.e., a process, module, slice, blade, hypervisor, machine, switch, router, gateway, etc.). It should be understood that various software and hardware configurations can be used as the sensors 104. The sensors 104 can be lightweight, minimally impeding normal traffic and compute resources in a datacenter. The software sensors 104 can “sniff” packets being sent over its host network interface card (NIC) or individual processes can be configured to report traffic to the sensors 104.


According to some examples, the sensors 104 reside on every virtual machine, hypervisor, switch, etc. This layered sensor structure allows for granular packet statistics and data collection at each hop of data transmission. In some examples, the sensors 104 are not installed in certain places. For example, in a shared hosting environment, customers may have exclusive control of VMs, thus preventing network administrators from installing a sensor on those client-specific VMs.


As the sensors 104 capture communication data, they can continuously send network flow data to collectors 122. The network flow data can relate to a packet, collection of packets, flow, group of flows, open ports, port knocks, etc. The network flow data can also include other details such as the VM bios ID, sensor ID, associated process ID, associated process name, process user name, sensor private key, geo-location of sensor, environmental details, etc. The network flow data can comprise data describing communications on all layers of the OSI model. For example, the network flow data can include Ethernet signal strength, source/destination MAC address, source/destination IP address, protocol, port number, encryption data, requesting process, a sample packet, etc.


In some examples, the sensors 104 can preprocess network flow data before sending. For example, the sensors 104 can remove extraneous or duplicative data or create a summary of the data (e.g., latency, packets and bytes sent per traffic flow, flagging abnormal activity, etc.). According to some examples, the sensors 104 are configured to selectively capture certain types of connection information while disregarding the rest. Further, to avoid capturing every packet and overwhelming the system, the sensors 104 can be configured to capture only a representative sample of packets (e.g., every 1,000th packet). According to some examples, the sensors 104 can generate aggregate or summarized network flow data that has been subjected to processing, rendering the network flow data light-weighted for subsequent transmitting and processing.


According to some examples, the sensors 104 can perform various actions with regard to the associated network component. For example, a sensor installed on a VM can close, quarantine, restart, or throttle a process executing on the VM. The sensors 104 can create and enforce policies (e.g., block access to ports, protocols, or addresses). According to some examples, the sensors 104 can perform such actions autonomously or perform the actions based upon external instructions.


The sensors 104 can send network flow data to one or more collectors 122. The one or more collectors 122 can comprise a primary collector and a secondary collector, or substantially identical collectors. In some examples, each of the sensors 104 is not assigned any specific collector. A sensor can determine an optimal collector through a discovery process. The sensor may change an optimal collector to report to when network environment changes, for example, when a determined optimal collector fails or when the sensor is migrated to a new location that is close to a different collector. According to some examples, a sensor may send different network flow data to different collectors. For example, the sensor can send a first report related to one type of process to a first collector, and send a second report related to a different type of process to a second collector.


The collectors 122 can be any type of storage medium that serves as a repository for the data recorded by the sensors 104. According to some examples, the collectors 122 are directly connected to the top of rack (TOR) switch; alternatively, the collectors 122 can be located near the end of row or elsewhere on or off premises. The placement of the collectors 122 can be optimized according to various priorities such as network capacity, cost, and system responsiveness. According to some examples, data storage of the collectors 122 is located in an in-memory database such as dash DB by IBM™. This approach can benefit from rapid random access speeds that typically are required for analytics software. Alternatively, the collectors 122 can utilize solid state drives, disk drives, magnetic tape drives, or a combination of the foregoing in consideration of cost, responsiveness, and size requirements. The collectors 122 can utilize various database structures such as a normalized relational database or NoSQL database.


According to some examples, the collectors 122 serve as network storage for application dependency mapping system 100A. Additionally, the collectors 122 can organize, summarize, and preprocess the collected data. For example, the collectors 122 can tabulate or summarize how often packets with certain sizes or types are transmitted from different virtual machines. The collectors 122 can also characterize traffic flows going to and from various network components or nodes. According to some examples, the collectors 122 can match packets based on sequence numbers, thus identifying traffic flows as well as connection links.


According to some examples, the collectors 122 can flag anomalous data. To avoid keeping all network data indefinitely, the collectors 122 can regularly replace detailed network flow data with consolidated summaries. Hence, the collectors 122 can retain a complete dataset describing network flow and process information over a certain period of time (e.g., the past minute), a smaller dataset describing network flow and process information over a previous period of time (e.g., the previous minute), and progressively consolidated network flow and process data over a broader period of time (e.g., hour, day, week, month, or year). By organizing, summarizing, and preprocessing the data, the collectors 122 can help the ADM system 100A scale efficiently. Although the collectors 122 are generally herein referred to as a plural noun, a single machine or cluster of machines are contemplated to be sufficient, especially for smaller datacenters. In some examples, the collectors 122 can serve as sensors 104 as well.


According to some examples, in addition to data from the sensors 104, the collectors 122 can receive other types of data. For example, the collectors 122 can receive out-of-band data 114 that includes, for example, geolocation data 116, IP watch lists 118, and WhoIs data 120. Additional out-of-band data can include power status, temperature data, etc.


The configuration/image manager 102 can configure and manage the sensors 104. When a new virtual machine is instantiated or when an existing one is migrated, the configuration and image manager 102 can provision and configure a new sensor on the machine. In some examples configuration and image manager 102 can monitor health of the sensors 104. For example, the configuration and image manager 102 may request status updates or initiate tests. In some examples, the configuration and image manager 102 may also manage and provision virtual machines.


The analytics module 124 can accomplish various tasks in its analysis, some of which are herein disclosed. By processing data stored in various collectors 122, the analytics module 124 can automatically generate an application dependency map (e.g., a communication graph), which depicts physical and logical dependencies of the application components, as well as the dependencies between components of the underlying infrastructure resources. The application dependency map can be used to determine, for example, communication paths between nodes and TCP ports used for communication, as well as the processes executing on the nodes. This map can be instructive when the analytics module 124 attempts to determine a root cause of a failure (because a failure of one component can cascade and cause failure of its dependent components) or when the analytics module 124 attempts to predict what will happen if a component is taken offline. Additionally, the analytics module 124 can associate expected latency and bandwidth with corresponding edges of an application dependency map.


For example, if a component A routinely sends data to a component B, but the component B never sends data to the component A, then the analytics module 124 can determine that the component B is dependent on the component A. On the other hand, the component A is likely not dependent on component B. If, however, the component B also sends data to the component A, then they are likely interdependent. These components can be processes, virtual machines, hypervisors, VLANs, etc. Once the analytics module 124 has determined component dependencies, it can then form an application dependency map that represents an application network topology.


Similarly, based upon data provided from the sensors 104, the analytics module 124 can determine relationships between interdependent applications, the analytics module 124 can determine what type of devices exist on the network (brand and model of switches, gateways, machines, etc.), where they are physically located (e.g., latitude and longitude, building, datacenter, room, row, rack, machine, etc.), how they are interconnected (10 Gb Ethernet, fiber-optic, etc.), and what the strength of each connection is (bandwidth, latency, etc.). Automatically determined network topology can be used to integrate the ADM system 100A within an established datacenter. Furthermore, the analytics module 124 can detect changes of a network topology.


In some examples, the analytics module 124 can establish patterns and norms for component behavior. Based upon the patterns and norms, the analytics module 124 can determine that certain processes (when functioning normally) only send a certain amount of traffic to a certain VM using a certain set of ports. The analytics module 124 can establish these norms by analyzing individual components or by analyzing data coming from similar components (e.g., VMs with similar configurations). Similarly, the analytics module 124 can determine expectations for network operations. For example, it can determine the expected latency between two components, the expected throughput of a component, response time of a component, typical packet sizes, traffic flow signatures, etc. In some examples, the analytics module 124 can combine its dependency map with pattern analysis to create reaction expectations. For example, if traffic increases with one component, other components may predictably increase traffic in response (or latency, compute time, etc.).


According to some examples, the analytics module 124 uses machine learning techniques to identify which patterns are policy-compliant or unwanted or harmful. For example, a network administrator can indicate network states corresponding to an attack and network states corresponding to normal operation. The analytics module 124 can then analyze the data to determine which patterns most correlate with the network being in a complaint or non-compliant state. According to some examples, the network can operate within a trusted environment for a time so that the analytics module 124 can establish baseline normalcy. According to some examples, the analytics module 124 contains a database of norms and expectations for various components. This database can incorporate data from sources external to the network. The analytics module 124 can then create network security policies for how components can interact. According to some examples, when policies are determined external to the system 100A, the analytics module 124 can detect the policies and incorporate them into this framework. The network security policies can be automatically modified by a server system or manually tweaked by a network administrator. For example, network security policies can be dynamically changed and be conditional on events. These policies can be enforced on the components. The ADM policy engine 126 can maintain these network security policies and receive user input to change the policies.


The ADM policy engine 126 can configure the analytics module 124 to establish what network security policies exist or should be maintained. For example, the ADM policy engine 126 may specify that certain machines should not intercommunicate or that certain ports are restricted. A network policy controller can set the parameters of the ADM policy engine 126. According to some examples, the ADM policy engine 126 is accessible via the presentation module 128.


In some example, the analytics module 124 and the ADM policy engine 126 can be combined or integrated into an ADM analytics and policy engine 100B, as illustrated in FIG. 1B. The ADM analytics and policy engine 100B is configured to provide functions and services of the analytics module 124 and the ADM policy engine 126, discussed herein.


According to some examples, the analytics module 124 can determine similarity scores for the nodes, which indicate similarity levels among the plurality of nodes. The presentation module 128 can display the similarity scores on a user interface. Further, the system can generate node clusters based on the similarity levels of the node, e.g. nodes sharing a high similarity score (e.g., higher than a selected threshold) are associated with one node cluster.


In some examples, the presentation module 128 can comprise a serving layer 129 and a user interface (UI) 130 that is operable to display, for example, information related to the application dependency map. The aggregate network flow data, analyzed by the analytics module 124, may not be in a human-readable form or may be too large for an administrator to navigate. The presentation module 128 can take the network flow data generated by the analytics module 124 and further summarize, filter, and organize the network flow data as well as create intuitive presentations of the network flow data.


The serving layer 129 can be an interface between the presentation module 128 and the analytics module 124. As the analytics module 124 generates node attributes, the serving layer 129 can summarize, filter, and organize the attributes that comes from the analytics module 124. According to some examples, the serving layer 129 can request raw data from a sensor, collector, or the analytics module 124.


The UI 130, connected with the serving layer 129, can present the data in a format (e.g., pages, bar charts, core charts, tree maps, acyclic dependency maps, line graphs, or tables) for human presentation. The UI 130 can be configured to allow a user to “drill down” on information sets to get a filtered data representation specific to the item the user wishes to “drill down” to. For example, the filtered data representation can be individual traffic flows, components, etc. The UI 130 can also be configured to allow a user to search using a filter. This search filter can use natural language processing to analyze a network administrator's input. Options can be provided on the UI 130 to view data relative to the current second, minute, hour, day, etc. The UI 130 can allow a network administrator to view traffic flows, application dependency maps, network topology, etc.


According to some examples, the UI 130 can receive inputs from a network administrator to adjust configurations in the ADM system 100A or components of the datacenter. These instructions can be passed through the serving layer 129, and then sent to the configuration/image manager 102, or sent to the analytics module 124.


After receiving an adjustment to an input parameter, the analytics module 124 can generated an updated application dependency map using adjusted parameters. For example, a user can remove or add a node from a selected node cluster and rerun the node clustering, or an ADM pipeline. The user can define a period of time for generating the updated application dependency map, for example, Jan. 1, 2015-Jan. 15, 2015. The user can also create/name a new workspace, select nodes for generating the updated map, and upload side information, such as routs/subnets and load balancer information, for generating the application dependency map. Additionally, the user can, while adjusting part of the cluster parameters, approve or preserve certain cluster such that they are not subjected to modifications or re-runs.


Further, the user can adjust the clustering granularity, for example, via a knob or a selectable element on the UI 130. The clustering granularity can generated a preferred number of node clusters. For example, a coarse-grained system with a low granularity comprises fewer clusters of nodes, whereas a fine-grained system with a higher granularity comprises more clusters of nodes in an application dependency map.


With the updated application dependency mapping completed, the user can view network information on the UI 130. The network information can include, for example, number/name of node clusters, port information related to nodes, and comparison summary between most recent two ADM runs.


Additionally, various elements of the ADM system 100A can exist in various configurations. For example, the collectors 122 can be a component of the sensors 104. In some examples, additional elements can share certain portion of computation to reduce loading of the analytics module 124.



FIG. 2 illustrates an example of an ADM system 200 adopting a leaf-spine architecture, according to some examples. In this example, the ADM system 200 comprises a network fabric 201 that includes spine switches 202a, 202b, . . . , 202n (collectively, “202”) connected to leaf switches 204a, 204b, 204c, . . . , 204n (collectively “204”). The leaf switches 204 can include access ports (or non-fabric ports) and fabric ports. Fabric ports can provide uplinks to the spine switches 202, while access ports can provide connectivity for devices, hosts, end points, VMs, or external networks to the network fabric 201. Although a leaf-spine architecture is illustrated in the network fabric 201, one of ordinary skill in the art will readily recognize that the subject technology can be implemented in any suitable network fabric, including a data center or cloud network fabric. Other suitable architectures, designs, infrastructures, and variations are contemplated herein.


The spine switches 202 can provide various network capacities, such as 40 or 10 Gbps Ethernet speeds. The spine switches 202 can include one or more 40 Gigabit Ethernet ports, each of which can also be split to support other speeds. For example, a 40 Gigabit Ethernet port can be split into four 10 Gigabit Ethernet ports.


The leaf switches 204 can reside at an edge of the network fabric 201, thus representing the physical network edge. According to some examples, the leaf switches 204 can be top-of-rack switches configured according to a top-of-rack architecture. According to some examples, the leaf switches 204 can be aggregation switches in any particular topology, such as end-of-row or middle-of-row topologies. The leaf switches 204 can also represent aggregation switches.


In some examples, the leaf switches 204 are responsible for routing and/or bridging the tenant packets and applying network policies. According to some examples, a leaf switch can perform one or more additional functions, such as implementing a mapping cache, sending packets to a proxy function when there is a miss in the cache, encapsulate packets, enforce ingress or egress policies, etc.


Network packets of the network fabric 201 can flow through the leaf switches 204. For example, the leaf switches 204 can provide servers, resources, endpoints, external networks, or VMs network access to the network fabric 201. According to some examples, the leaf switches 204 can connect the network fabric 201 to one or more end point groups, or any external networks. Each end point group can connect to the network fabric 201 via one of leaf switches 204.


In this example, endpoints 218a-218d (collectively “218”) can connect to the network fabric 201 via the leaf switches 204. For example, the endpoints 218a and 218b can connect directly to the leaf switch 204A. On the other hand, the endpoints 218c and 218d can connect to the leaf switch 204b via a L1 network 208. Similarly, a wide area network (WAN) 220 can connect to the leaf switches 204n via L2 network 210.


The endpoints 218 can include any communication device or component, such as a node, computer, server, blade, hypervisor, virtual machine, container, process (e.g., running on a virtual machine), switch, router, gateway, etc. According to some examples, the endpoints 218 can include a server, hypervisor, process, or switch configured with a VTEP functionality which connects an overlay network with the network fabric 201. The overlay network can host physical devices, such as servers, applications, EPGs, virtual segments, virtual workloads, etc. In addition, the endpoints 218 can host virtual workload(s), clusters, and applications or services, which are connected to the network fabric 201 or any other device or network, including an external network. For example, one or more endpoints 218 can host, or connect to, a cluster of load balancers or an end point group of various applications.


In some examples, sensors 206a-206b (collectively “206) are associated with each node and component of a data center (e.g., virtual machine, hypervisor, slice, blade, switch, router, gateway, etc.). As illustrated in FIG. 2, the sensors 206 can be respectively associated with the leaf switches 204 and the endpoints 218. The sensors 206 can monitor communications to and from the component, report on environmental data related to the component (e.g., component IDs, statuses, etc.), and perform actions related to the component (e.g., shut down a process, block ports, redirect traffic, etc.). The sensors 206 can send these data to the collectors 212 for storage.


The sensors 206 can preprocess network flow data before sending out. For example, sensors 206 can remove extraneous or duplicative data or create a summary of the data (e.g., indicating latency and packets and bytes sent per traffic flow, or flagging abnormal activity). According to some examples, the sensors 206 are configured to selectively capture certain types of connection information while disregarding the rest. Further, to avoid overwhelming a system, sensors can capture only a representative sample of packets (for example, every 1,000th packet).


According to some examples, the sensors 206 can perform various actions with regard to associated network components. For example, a sensor installed on a VM can close, quarantine, restart, or throttle a process executing on the VM. The sensors 206 can create and enforce security policies (e.g., block access to ports, protocols, or addresses). According to some examples, the sensors 206 perform such actions autonomously or perform the actions based upon an external instruction.


The sensors 206 can send network flow data to one or more collectors 212. The one or more collectors 212 can comprise a primary collector and a secondary collector, or substantially identical collectors. In some examples, each of the sensors 206 is not assigned any specific collector. A sensor can determine an optimal collector through a discovery process. The sensor may change an optimal collector to report to when network environment changes, for example, when a determined optimal collector fails or when the sensor is migrated to a new location that is close to a different collector. According to some examples, a sensor may send different network flow data to different collectors 212. For example, the sensor can send a first report related to one type of process to a first collector, and send a second report related to a different type of process to a second collector.


The collectors 212 can be any type of storage medium that can serve as a repository for the data recorded by the sensors. The collectors 212 can be connected to the network fabric 201 via one or more network interfaces. The collectors 212 can be located near the end of row or elsewhere on or off premises. The placement of the collectors 212 can be optimized according to various priorities such as network capacity, cost, and system responsiveness. Although collectors 122 are generally herein referred to as a plural noun, a single machine or cluster of machines are contemplated to be sufficient, especially for smaller datacenters. In some examples, the collectors 122 can function as the sensors 202 as well.


According to some examples, the collectors 212 serve as network storage for network flow data. Additionally, the collectors 212 can organize, summarize, and preprocess the collected data. For example, the collectors 212 can tabulate how often packets of certain sizes or types are transmitted from different virtual machines. The collectors 212 can also characterize the traffic flows going to and from various network components. According to some examples, the collectors 212 can match packets based on sequence numbers, thus identifying traffic flows as well as connection links.


An analytics module 214 can automatically generate an application dependency map (e.g., a communication graph), which shows physical and logical dependencies of the application components, as well as dependencies between components of the underlying infrastructure resources. The application dependency map can be used to determine, for example, communication paths between nodes and TCP ports used for communication, as well as the processes executing on the nodes. The application dependency map can be instructive when analytics module 214 attempts to determine a root cause of a failure (because failure of one component can cascade and cause failure of its dependent components) or when the analytics module 214 attempts to predict what will happen if a component is taken offline. Additionally, the analytics module 214 can associate edges of an application dependency map with expected latency and bandwidth for that individual edge.


Similarly, based upon data provided from the sensors 206, the analytics module 214 can determine relationships between interdependent applications, the analytics module 214 can determine what type of devices exist on the network (brand and model of switches, gateways, machines, etc.), where they are physically located (e.g., latitude and longitude, building, datacenter, room, row, rack, machine, etc.), how they are interconnected (10 Gb Ethernet, fiber-optic, etc.), and what the strength of each connection is (bandwidth, latency, etc.). Automatically determined network topology can be used to integrate the ADM system 200 within an established datacenter. Furthermore, the analytics module 214 can detect changes of a network topology.


According to some examples, the analytics module 214 can determine similarity scores for the nodes, which indicate similarity levels among the plurality of nodes. A presentation module 222 can display the similarity scores on a user interface. Further, the system 200 can generate node clusters based on the similarity levels between the nodes, e.g. nodes sharing a high similarity score (e.g., higher than a selected threshold) are associated with one node cluster.


According to some examples, the ADM system 200 can enable re-runs of application dependent mapping to implement various adjustments to the system 200. For example, a system administrator can make one or more adjustments, e.g. editing the size of the clusters, changing data-capturing time, to optimize performance of the system 200. The analytics module 214 can compare the re-run data with the original data to summarize or highlight changes, e.g. determining the changes using a matching algorithm. Additionally, the presentation module 222 can display a summary of the changes on a user interface. This feature can help the administrator or user to track implemented changes and make necessary adjustments to improve performance of the system 200.



FIG. 3 is a flow diagram illustrating an example of a process 300 to generate a communication graph using an ADM pipeline, according to some examples. It should be understood that there can be additional, fewer, or alternative steps performed in similar or alternative orders, or in parallel, within the scope of the various examples unless otherwise stated.


At step 302, an ADM system can collect network data and process information of a plurality of nodes in a network using a plurality of sensors. The plurality of sensors includes at least a sensor of a physical switch of the network, a sensor of a hypervisor associated with the physical switch, or a sensor of a virtual machine associated with the hypervisor. For example, as illustrated in FIGS. 1A and 2, the plurality of sensors can be associated with various nodes and components of a data center (e.g., virtual machine, hypervisor, slice, blade, switch, router, gateway, etc.). The plurality of sensors can be respectively associated with leaf switches, hypervisors, and virtual machines and be configured to monitor communications to and from associated components or nodes, report environmental data related to the nodes (e.g., node IDs, statuses, etc.), and perform suitable actions related to the nodes (e.g., shut down a process, block ports, redirect traffic, etc.).


At step 304, the ADM system can determine a plurality of vectors based upon the network data and process information collected at each node of the plurality of nodes. In some examples, the network data and process information collected at each node are summarized into flow summaries on a regular basis (e.g., daily). Data, such as the flow summaries, side information, SLB, and route tags, can be used in determining the plurality of vectors and an initial communication graph. Using the flow summaries rather than raw flow data and processing information at each node may substantially reduce processing capacity and time needed for the system to generate the plurality of vectors and the initial communication graph. The system may further reduce processing capacity and time needed to generate an ADM pipeline run by partitioning nodes of the plurality of nodes into external and internal subnets, processing node vectors (i.e., feature reduction, tfidf, and normalization), and preserving certain information for a next run or recycling data from a previous ADM pipeline run.


At step 306, the ADM system can determine similarities between nodes of the plurality of nodes. The similarities can be measured by similarity scores that are determined based upon the network data and process information collected at the two nodes. At step 308, the ADM system can cluster the plurality of nodes of the network into a plurality of clustered vectors based upon similarities between nodes of the plurality of nodes. The plurality of clustered vectors represents a communication graph of the network. The ADM system may cluster nodes that share a high similarity score (e.g., higher than a selected threshold) into one node cluster. For examples, if a node A and a node B both communicate with a node C via a port 40, the node A and the node B may be deemed similar and clustered into the same cluster.


At step 310, the ADM system can define a policy of the network based upon the plurality of clustered vectors or the communication graph. For example, the policy may prohibit a network communication between two nodes if the network communication is not specifically included in the policy.


At step 312, the ADM system can present the policy to a user and collect the user's feedback. In some examples, the ADM system can provide a user interface (UI) for a user of a network to view generated clustered vectors, edit a specific cluster vector (i.e., add or remove a node), modify input parameters to cluster a plurality of nodes in the network, and start a new ADM pipeline run. The UI may provide an option for the user to generate or name a new workspace, select nodes/sensors in generating the plurality of clustered vectors or the communication graph, choose input parameters for the communication graph, and finalize and export a defined policy. The input parameters may include, but are not limited to, time granularity (e.g., a range of time that flow data and process information is to be analyzed), nodes to be included in an ADM pipeline run to generate a communication graph, side information (e.g., routs/subnets, load balancer information), and clustering granularity.


Based upon a user's feedback, the ADM system can re-cluster the plurality of clustered vector and regenerate the communication graph. A user can view on a user interface information such as statistics of the network, number/name of the node clusters, port information related to nodes, comparison summary between the last ADM to the recent ADM. Cluster statistics can include 1) the number of clusters that is added, 2) the number of clusters that is removed, 3) the number of existing clusters that are modified, and 4) the number of clusters remain unchanged, etc.


At step 314, the ADM system can enforce the policy in the network. For example, the ADM system may prohibit communications between the plurality of nodes of the network if the communications are not provided in the policy.


In some examples, the ADM system can automatically generate a communication graph by analyzing aggregate network flow data. The communication graph can be used to identify, for example, communication paths between the nodes, the TCP ports used for communication, as well as the processes executing on the nodes. This communication graph can be instructive when the ADM system attempts to determine the root cause of a failure (because a failure of one component in the ADM system can cascade and cause failure of dependent components) or when the ADM system attempts to predict what happens if a component is taken offline. Additionally, the ADM system can associate anticipated latency and bandwidth with nodes of the network based upon the communication graph.



FIGS. 4A and 4B illustrate example possible systems in accordance with various aspects of the present technology. The more appropriate example will be apparent to those of ordinary skill in the art when practicing the present technology. Persons of ordinary skill in the art will also readily appreciate that other system examples are possible.



FIG. 4A illustrates a conventional computing system architecture 400 wherein the components of the system are in electrical communication with each other using a bus 405. Example system 400 includes a processing unit (CPU or processor) 410 and a system bus 405 that couples various system components including the system memory 415, such as read only memory (ROM) 420 and random access memory (RAM) 425, to the processor 410. The system 400 can include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 410. The system 400 can copy data from the memory 415 and/or the storage device 430 to the cache 412 for quick access by the processor 410. In this way, the cache can provide a performance boost that avoids processor 410 delays while waiting for data. These and other modules can control or be configured to control the processor 410 to perform various actions. Other system memory 415 can be available for use as well. The memory 415 can include multiple different types of memory with different performance characteristics. The processor 410 can include any general purpose processor and a hardware module or software module, such as module 432, module 434, and module 436 stored in storage device 430, configured to control the processor 410 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 410 can essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor can be symmetric or asymmetric.


To enable user interaction with the computing device 400, an input device 445 can represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 435 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with the computing device 400. The communications interface 440 can generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here can easily be substituted for improved hardware or firmware arrangements as they are developed. Any features or steps in any example of this patent application may be mixed with any other features or steps in any other examples.


Storage device 430 is a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 425, read only memory (ROM) 420, and hybrids thereof.


The storage device 430 can include software modules 432, 434, 436 for controlling the processor 410. Other hardware or software modules are contemplated. The storage device 430 can be connected to the system bus 405. In one aspect, a hardware module that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as the processor 410, bus 405, output device 435 (e.g., a display), and so forth, to carry out the function.



FIG. 4B illustrates a computer system 500 having a chipset architecture that can be used in executing the described method and generating and displaying a graphical user interface (GUI). Computer system 500 is an example of computer hardware, software, and firmware that can be used to implement the disclosed technology. System 500 can include a processor 555, representative of any number of physically and/or logically distinct resources capable of executing software, firmware, and hardware configured to perform identified computations. Processor 555 can communicate with a chipset 560 that can control input to and output from processor 555. In this example, chipset 560 outputs information to output device 565, such as a display, and can read and write information to storage device 570, which can include magnetic media, and solid state media, for example. Chipset 560 can also read data from and write data to RAM 575. A bridge 580 for interfacing with a variety of user interface components 585 can be provided for interfacing with chipset 560. Such user interface components 585 can include a keyboard, a microphone, touch detection and processing circuitry, a pointing device, such as a mouse, and so on. In general, inputs to system 500 can come from any of a variety of sources, machine generated and/or human generated.


Chipset 560 can also interface with one or more communication interfaces 590 that can have different physical interfaces. Such communication interfaces can include interfaces for wired and wireless local area networks, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using the GUI disclosed herein can include receiving ordered datasets over the physical interface or be generated by the machine itself by processor 555 analyzing data stored in storage 570 or RAM 575. Further, the machine can receive inputs from a user via user interface components 585 and execute appropriate functions, such as browsing functions by interpreting these inputs using processor 555.


It can be appreciated that example systems 400 and 500 can have more than one processor 410 or be part of a group or cluster of computing devices networked together to provide greater processing capability.


For clarity of explanation, in some instances the present technology can be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.


In some examples, the computer-readable storage devices, mediums, and memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.


Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions can be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that can be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.


Devices implementing methods according to these disclosures can comprise hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.


The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.


Various aspects of the present technology provide systems and methods for generating a communication graph in a network using a ADM pipeline. While specific examples have been cited above showing how the optional operation can be employed in different instructions, other examples can incorporate the optional operation into different instructions. For clarity of explanation, in some instances the present technology can be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.


The various examples can be further implemented in a wide variety of operating environments, which in some cases can include one or more server computers, user computers or computing devices which can be used to operate any of a number of applications. User or client devices can include any of a number of general purpose personal computers, such as desktop or laptop computers running a standard operating system, as well as cellular, wireless and handheld devices running mobile software and capable of supporting a number of networking and messaging protocols. Such a system can also include a number of workstations running any of a variety of commercially-available operating systems and other known applications for purposes such as development and database management. These devices can also include other electronic devices, such as dummy terminals, thin-clients, gaming systems and other devices capable of communicating via a network.


To the extent examples, or portions thereof, are implemented in hardware, the present patent application can be implemented with any or a combination of the following technologies: a discrete logic circuit(s) having logic gates for implementing logic functions upon data signals, an application specific integrated circuit (ASIC) having appropriate combinational logic gates, programmable hardware such as a programmable gate array(s) (PGA), a field programmable gate array (FPGA), etc.


Most examples utilize at least one network that would be familiar to those skilled in the art for supporting communications using any of a variety of commercially-available protocols, such as TCP/IP, OSI, FTP, UPnP, NFS, CIFS, AppleTalk etc. The network can be, for example, a local area network, a wide-area network, a virtual private network, the Internet, an intranet, an extranet, a public switched telephone network, an infrared network, a wireless network and any combination thereof.


Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions can be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that can be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.


Devices implementing methods according to these technology can comprise hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include server computers, laptops, smart phones, small form factor personal computers, personal digital assistants, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.


In examples utilizing a Web server, the Web server can run any of a variety of server or mid-tier applications, including HTTP servers, FTP servers, CGI servers, data servers, Java servers and business application servers. The server(s) can also be capable of executing programs or scripts in response requests from user devices, such as by executing one or more Web applications that can be implemented as one or more scripts or programs written in any programming language, such as Java®, C, C# or C++ or any scripting language, such as Perl, Python or TCL, as well as combinations thereof. The server(s) can also include database servers, including without limitation those commercially available from open market.


The server farm can include a variety of data stores and other memory and storage media as discussed above. These can reside in a variety of locations, such as on a storage medium local to (and/or resident in) one or more of the computers or remote from any or all of the computers across the network. In a particular set of examples, the information can reside in a storage-area network (SAN) familiar to those skilled in the art. Similarly, any necessary files for performing the functions attributed to the computers, servers or other network devices can be stored locally and/or remotely, as appropriate. Where a system includes computerized devices, each such device can include hardware elements that can be electrically coupled via a bus, the elements including, for example, at least one central processing unit (CPU), at least one input device (e.g., a mouse, keyboard, controller, touch-sensitive display element or keypad) and at least one output device (e.g., a display device, printer or speaker). Such a system can also include one or more storage devices, such as disk drives, optical storage devices and solid-state storage devices such as random access memory (RAM) or read-only memory (ROM), as well as removable media devices, memory cards, flash cards, etc.


Such devices can also include a computer-readable storage media reader, a communications device (e.g., a modem, a network card (wireless or wired), an infrared computing device) and working memory as described above. The computer-readable storage media reader can be connected with, or configured to receive, a computer-readable storage medium representing remote, local, fixed and/or removable storage devices as well as storage media for temporarily and/or more permanently containing, storing, transmitting and retrieving computer-readable information. The system and various devices also typically will include a number of software applications, modules, services or other elements located within at least one working memory device, including an operating system and application programs such as a client application or Web browser. It should be appreciated that alternate examples can have numerous variations from that described above. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, software (including portable software, such as applets) or both. Further, connection to other computing devices such as network input/output devices can be employed.


Storage media and computer readable media for containing code, or portions of code, can include any appropriate media known or used in the art, including storage media and computing media, such as but not limited to volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage and/or transmission of information such as computer readable instructions, data structures, program modules or other data, including RAM, ROM, EPROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices or any other medium which can be used to store the desired information and which can be accessed by a system device. Based on the technology and teachings provided herein, a person of ordinary skill in the art will appreciate other ways and/or methods to implement the various aspects of the present technology.


The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that various modifications and changes can be made thereunto without departing from the broader spirit and scope of the patent application as set forth in the claims.

Claims
  • 1. A computer-implemented method comprising: collecting network data using a plurality of sensors associated with a plurality of nodes of a network;generating, based upon the network data, a plurality of vectors associated with the plurality of nodes;determining similarities between the plurality of vectors;clustering, based at least upon the similarities, the plurality of vectors into a plurality of clustered vectors;defining a policy based at least upon the plurality of clustered vectors, the policy prohibiting communications between at least two nodes of the plurality of nodes in the network;presenting the policy to a user, via a user interface (UI) including the plurality of clustered vectors, to enable collection of user feedback via input parameters, the input parameters including at least time granularity or clustering granularity in generating the plurality of clustered vectors; andreclustering the plurality of clustered vectors based on the user feedback.
  • 2. The computer-implemented method of claim 1, further comprising: summarizing, at each of the plurality of sensors, collected network data within a predefined time period into network flow and process summaries,wherein the plurality of vectors are generated based at least upon the network flow and process summaries at each of the plurality of sensors.
  • 3. The computer-implemented method of claim 2, wherein the plurality of vectors are generated based at least upon side information, server load balancing (SLB), route tags, or previously generated clustered vectors in the network.
  • 4. The computer-implemented method of claim 1, further comprising: partitioning the plurality of nodes into an external subnet of nodes and an internal subnet of nodes;processing the network data associated with the external subnet of nodes and the internal subnet of nodes; andselecting a subset of the network data in generating the plurality of vectors.
  • 5. The computer-implemented method of claim 4, wherein the processing of the network data includes at least one of steps for feature reduction, term frequency-inverse document frequency, or normalization.
  • 6. The computer-implemented method of claim 1, wherein the presenting of the policy via the UI includes presenting the plurality of clustered vectors, and enabling editing of a specific cluster vector of the plurality of clustered vectors, and modifying or choosing the input parameters to cause the reclustering of the plurality of clustered vectors.
  • 7. The computer-implemented method of claim 1, wherein the input parameters includes the time granularity, the clustering granularity in generating the plurality of clustered vectors, and nodes to be included in an application dependency mapping (ADM) pipeline.
  • 8. The computer-implemented method of claim 6, further comprising: presenting, via the UI, statistics of the plurality of nodes, a summary of one or more nodes in each of the plurality of clustered vectors, and a server port or a client port for each of the plurality of clustered vectors.
  • 9. The computer-implemented method of claim 6, further comprising: presenting, via the UI, a summary of changes to the plurality of clustered vectors in response to one or more modifications to the input parameters; andpresenting a user option to approve the plurality of clustered vectors.
  • 10. The computer-implemented method of claim 1, further comprising: generating a new workspace;selecting nodes/sensors in clustering the plurality of vectors; andenabling the policy.
  • 11. A system comprising: a processor;a user interface (UI); anda computer-readable medium storing instructions that, when executed by the processor, cause the system to perform operations comprising: collecting network data using a plurality of sensors associated with a plurality of nodes of a network;generating, based upon the network data, a plurality of vectors associated with the plurality of nodes;determining similarities between the plurality of vectors;clustering, based at least upon the similarities, the plurality of vectors into a plurality of clustered vectors;defining a policy based at least upon the plurality of clustered vectors, the policy prohibiting communications between at least two nodes of the plurality of nodes in the network;presenting the policy to a user, via the UI including the plurality of clustered vectors, to enable collection of user feedback via input parameters, the input parameters including at least time granularity or clustering granularity in generating the plurality of clustered vectors; andreclustering the plurality of clustered vectors based on the user feedback.
  • 12. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform further operations comprising: summarizing, at each of the plurality of sensors, collected network data within a predefined time period into network flow and process summaries,wherein the plurality of vectors are generated based at least upon the network flow and process summaries at each of the plurality of sensors.
  • 13. The system of claim 11, wherein the instructions, when executed by the processor, cause the system to perform further operations comprising: partitioning the plurality of nodes into an external subnet of nodes and an internal subnet of nodes;processing the network data associated with the external subnet of nodes and the internal subnet of nodes; andselecting a subset of the network data in generating the plurality of vectors.
  • 14. The system of claim 13, wherein the processing of the network data includes at least one of steps for feature reduction, term frequency-inverse document frequency, or normalization.
  • 15. The system of claim 11, wherein the presenting of the policy via the UI includes enabling editing of a specific cluster vector of the plurality of clustered vectors, and modifying or choosing input parameters to cause the reclustering of the plurality of clustered vectors.
  • 16. The system of claim 15, wherein the instructions, when executed by the processor, cause the system to perform further operations comprising: presenting, via the UI, statistics of the plurality of nodes, a summary of one or more nodes in each of the plurality of clustered vectors, and a server port or a client port for each of the plurality of clustered vectors.
  • 17. The system of claim 15, wherein the instructions, when executed by the processor, cause the system to perform further operations comprising: presenting, via the UI a summary of changes to the plurality of clustered vectors in response to one or more modifications to the input parameters; andpresenting a user option to approve the plurality of clustered vectors.
  • 18. A non-transitory computer-readable storage medium having stored therein instructions that, upon being executed by a processor, cause the processor to: collect network data using a plurality of sensors associated with a plurality of nodes of a network;generate, based upon the network data, a plurality of vectors associated with the plurality of nodes;determine similarities between the plurality of vectors;cluster, based at least upon the similarities, the plurality of vectors into a plurality of clustered vectors;define a policy based at least upon the plurality of clustered vectors, the policy prohibiting communications between at least two nodes of the plurality of nodes in the network;present the policy to a user, via a user interface (UI) including the plurality of clustered vectors, to enable collection of user feedback via input parameters, the input parameters including at least time granularity or clustering granularity in generating the plurality of clustered vectors; andrecluster the plurality of clustered vectors based on the user feedback.
  • 19. The non-transitory computer-readable storage medium of claim 18, wherein the instructions upon being executed further cause the processor to: summarize, at each of the plurality of sensors, collected network data within a predefined time period into network flow and process summaries;wherein the plurality of vectors are generated based at least upon the network flow and process summaries at each of the plurality of sensors.
  • 20. The non-transitory computer-readable storage medium of claim 18, wherein the instructions upon being executed further cause the processor to: partition the plurality of nodes into an external subnet of nodes and an internal subnet of nodes;process the network data associated with the external subnet of nodes and the internal subnet of nodes; andselect a subset of the network data in generating the plurality of vectors.
CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to U.S. Provisional Application 62/171,899, titled “System for Monitoring and Managing Datacenters” and filed at Jun. 5, 2015, the disclosure of which is incorporated herein by reference in its entirety.

US Referenced Citations (670)
Number Name Date Kind
5086385 Launey et al. Feb 1992 A
5319754 Meinecke et al. Jun 1994 A
5400246 Wilson et al. Mar 1995 A
5436909 Dev et al. Jul 1995 A
5555416 Owens et al. Sep 1996 A
5726644 Jednacz et al. Mar 1998 A
5742829 Davis et al. Apr 1998 A
5751914 Coley May 1998 A
5822731 Schultz Oct 1998 A
5831848 Rielly et al. Nov 1998 A
5903545 Sabourin et al. May 1999 A
6012096 Link et al. Jan 2000 A
6141595 Gloudeman et al. Oct 2000 A
6144962 Weinberg et al. Nov 2000 A
6239699 Ronnen May 2001 B1
6247058 Miller et al. Jun 2001 B1
6249241 Jordan et al. Jun 2001 B1
6295527 McCormack Sep 2001 B1
6330562 Boden et al. Dec 2001 B1
6353775 Nichols Mar 2002 B1
6525658 Streetman et al. Feb 2003 B2
6546420 Lemler et al. Apr 2003 B1
6597663 Rekhter Jul 2003 B1
6611896 Mason, Jr. et al. Aug 2003 B1
6654750 Adams et al. Nov 2003 B1
6728779 Griffin et al. Apr 2004 B1
6801878 Hintz Oct 2004 B1
6816461 Scrandis et al. Nov 2004 B1
6847993 Novaes et al. Jan 2005 B1
6848106 Hipp Jan 2005 B1
6925490 Novaes et al. Aug 2005 B1
6958998 Shorey Oct 2005 B2
6983323 Cantrell et al. Jan 2006 B2
6996817 Birum et al. Feb 2006 B2
6999452 Drummond-Murray et al. Feb 2006 B1
7002464 Bruemmer et al. Feb 2006 B2
7024468 Meyer et al. Apr 2006 B1
7111055 Falkner Sep 2006 B2
7120934 Ishikawa Oct 2006 B2
7133923 MeLampy et al. Nov 2006 B2
7181769 Keanini et al. Feb 2007 B1
7185103 Jain Feb 2007 B1
7203740 Putzolu et al. Apr 2007 B1
7302487 Ylonen et al. Nov 2007 B2
7337206 Wen et al. Feb 2008 B1
7349761 Cruse Mar 2008 B1
7353511 Ziese Apr 2008 B1
7356679 Le et al. Apr 2008 B1
7360072 Soltis et al. Apr 2008 B1
7370092 Aderton et al. May 2008 B2
7395195 Suenbuel et al. Jul 2008 B2
7444404 Wetherall et al. Oct 2008 B2
7466681 Ashwood-Smith et al. Dec 2008 B2
7467205 Dempster et al. Dec 2008 B1
7496040 Seo Feb 2009 B2
7496575 Buccella et al. Feb 2009 B2
7530105 Gilbert et al. May 2009 B2
7539770 Meier May 2009 B2
7568107 Rathi et al. Jul 2009 B1
7610330 Quinn et al. Oct 2009 B1
7633942 Bearden et al. Dec 2009 B2
7644438 Dash et al. Jan 2010 B1
7676570 Levy et al. Mar 2010 B2
7681131 Quarterman et al. Mar 2010 B1
7693947 Judge et al. Apr 2010 B2
7743242 Oberhaus et al. Jun 2010 B2
7752307 Takara Jul 2010 B2
7774498 Kraemer et al. Aug 2010 B1
7783457 Cunningham Aug 2010 B2
7787480 Mehta et al. Aug 2010 B1
7788477 Huang et al. Aug 2010 B1
7808897 Mehta et al. Oct 2010 B1
7813822 Hoffberg Oct 2010 B1
7844696 Labovitz et al. Nov 2010 B2
7844744 Abercrombie et al. Nov 2010 B2
7864707 Dimitropoulos et al. Jan 2011 B2
7873025 Patel et al. Jan 2011 B2
7873074 Boland Jan 2011 B1
7874001 Beck et al. Jan 2011 B2
7885197 Metzler Feb 2011 B2
7895649 Brook et al. Feb 2011 B1
7904420 Ianni Mar 2011 B2
7930752 Hertzog et al. Apr 2011 B2
7934248 Yehuda et al. Apr 2011 B1
7957934 Greifeneder Jun 2011 B2
7961637 McBeath Jun 2011 B2
7970946 Djabarov et al. Jun 2011 B1
7975035 Popescu et al. Jul 2011 B2
8001610 Chickering et al. Aug 2011 B1
8005935 Pradhan et al. Aug 2011 B2
8040232 Oh et al. Oct 2011 B2
8040822 Proulx et al. Oct 2011 B2
8115617 Thubert et al. Feb 2012 B2
8135657 Kapoor et al. Mar 2012 B2
8156430 Newman Apr 2012 B2
8160063 Maltz et al. Apr 2012 B2
8179809 Eppstein et al. May 2012 B1
8185824 Mitchell et al. May 2012 B1
8239365 Salman Aug 2012 B2
8239915 Satish et al. Aug 2012 B1
8250657 Nachenberg et al. Aug 2012 B1
8255972 Azagury et al. Aug 2012 B2
8266697 Coffman Sep 2012 B2
8272875 Jurmain Sep 2012 B1
8281397 Vaidyanathan et al. Oct 2012 B2
8291495 Burns et al. Oct 2012 B1
8296847 Mendonca et al. Oct 2012 B2
8311973 Zadeh Nov 2012 B1
8370407 Devarajan et al. Feb 2013 B1
8381289 Pereira et al. Feb 2013 B1
8391270 Van Der Stok et al. Mar 2013 B2
8407164 Malik Mar 2013 B2
8407798 Lotem et al. Mar 2013 B1
8442073 Skubacz et al. May 2013 B2
8451731 Lee et al. May 2013 B1
8462212 Kundu et al. Jun 2013 B1
8489765 Vasseur Jul 2013 B2
8499348 Rubin Jul 2013 B1
8516590 Ranadive et al. Aug 2013 B1
8527977 Cheng et al. Sep 2013 B1
8570861 Brandwine et al. Oct 2013 B1
8572600 Chung et al. Oct 2013 B2
8572734 McConnell et al. Oct 2013 B2
8572735 Ghosh et al. Oct 2013 B2
8588081 Salam et al. Nov 2013 B2
8600726 Varshney et al. Dec 2013 B1
8615803 Dacier et al. Dec 2013 B2
8630316 Haba Jan 2014 B2
8640086 Bonev et al. Jan 2014 B2
8656493 Capalik Feb 2014 B2
8661544 Yen et al. Feb 2014 B2
8677487 Balupari et al. Mar 2014 B2
8683389 Bar-Yam et al. Mar 2014 B1
8706914 Duchesneau Apr 2014 B2
8719452 Ding et al. May 2014 B1
8719835 Kanso et al. May 2014 B2
8750287 Bui et al. Jun 2014 B2
8752042 Ratica Jun 2014 B2
8755396 Sindhu et al. Jun 2014 B2
8762951 Kosche et al. Jun 2014 B1
8769084 Westerfeld et al. Jul 2014 B2
8775577 Alford et al. Jul 2014 B1
8776180 Kumar et al. Jul 2014 B2
8812448 Anderson et al. Aug 2014 B1
8812725 Kulkarni Aug 2014 B2
8813236 Saha et al. Aug 2014 B1
8825848 Dotan et al. Sep 2014 B1
8832013 Adams et al. Sep 2014 B1
8832461 Saroiu et al. Sep 2014 B2
8849926 Marzencki Sep 2014 B2
8881258 Paul Nov 2014 B2
8887238 Howard et al. Nov 2014 B2
8904520 Nachenberg et al. Dec 2014 B1
8908685 Patel et al. Dec 2014 B2
8914497 Xiao et al. Dec 2014 B1
8931043 Cooper et al. Jan 2015 B2
8954610 Berke et al. Feb 2015 B2
8966021 Allen Feb 2015 B1
8973147 Pearcy et al. Mar 2015 B2
8990386 He et al. Mar 2015 B2
8996695 Anderson et al. Mar 2015 B2
8997227 Mhatre et al. Mar 2015 B1
9014047 Alcala et al. Apr 2015 B2
9015716 Fletcher et al. Apr 2015 B2
9071575 Lemaster et al. Jun 2015 B2
9088598 Zhang et al. Jul 2015 B1
9110905 Polley et al. Aug 2015 B2
9130836 Kapadia et al. Sep 2015 B2
9160764 Stiansen et al. Oct 2015 B2
9170917 Kumar et al. Oct 2015 B2
9178906 Chen et al. Nov 2015 B1
9191400 Ptasinski et al. Nov 2015 B1
9197654 Ben-Shalom et al. Nov 2015 B2
9225793 Dutta et al. Dec 2015 B2
9237111 Banavalikar et al. Jan 2016 B2
9246702 Sharma et al. Jan 2016 B1
9246773 Degioanni Jan 2016 B2
9253042 Lumezanu et al. Feb 2016 B2
9253206 Fleischman Feb 2016 B1
9258217 Duffield et al. Feb 2016 B2
9281940 Matsuda et al. Mar 2016 B2
9286047 Avramov et al. Mar 2016 B1
9300689 Tsuchitoi Mar 2016 B2
9317574 Brisebois et al. Apr 2016 B1
9319384 Yan et al. Apr 2016 B2
9369435 Short et al. Jun 2016 B2
9378068 Anantharam et al. Jun 2016 B2
9405903 Xie et al. Aug 2016 B1
9417985 Baars et al. Aug 2016 B2
9418222 Rivera et al. Aug 2016 B1
9426068 Dunbar et al. Aug 2016 B2
9454324 Madhavapeddi Sep 2016 B1
9462013 Boss et al. Oct 2016 B1
9465696 McNeil et al. Oct 2016 B2
9501744 Brisebois et al. Nov 2016 B1
9531589 Clemm et al. Dec 2016 B2
9563517 Natanzon et al. Feb 2017 B1
9596196 Hills Mar 2017 B1
9621413 Lee Apr 2017 B1
9634915 Bley Apr 2017 B2
9645892 Patwardhan May 2017 B1
9684453 Holt et al. Jun 2017 B2
9697033 Koponen et al. Jul 2017 B2
9733973 Prasad et al. Aug 2017 B2
9749145 Banavalikar et al. Aug 2017 B2
9800608 Korsunsky et al. Oct 2017 B2
9813324 Nampelly Nov 2017 B2
9858621 Konrardy Jan 2018 B1
9904584 Konig et al. Feb 2018 B2
9916538 Zadeh et al. Mar 2018 B2
9935851 Gandham et al. Apr 2018 B2
10009240 Rao et al. Jun 2018 B2
10116531 Attar et al. Oct 2018 B2
10171319 Yadav et al. Jan 2019 B2
10447551 Zhang Oct 2019 B1
10454793 Deen et al. Oct 2019 B2
20010028646 Arts et al. Oct 2001 A1
20020053033 Cooper et al. May 2002 A1
20020097687 Meiri et al. Jul 2002 A1
20020103793 Koller et al. Aug 2002 A1
20020107857 Teraslinna Aug 2002 A1
20020141343 Bays Oct 2002 A1
20020184393 Leddy et al. Dec 2002 A1
20030023600 Nagamura Jan 2003 A1
20030023601 Fortier, Jr. et al. Jan 2003 A1
20030065986 Fraenkel et al. Apr 2003 A1
20030097439 Strayer et al. May 2003 A1
20030126242 Chang Jul 2003 A1
20030145232 Poletto et al. Jul 2003 A1
20030151513 Herrmann et al. Aug 2003 A1
20030154399 Zuk et al. Aug 2003 A1
20030177208 Harvey, IV Sep 2003 A1
20040019676 Iwatsuki et al. Jan 2004 A1
20040030776 Cantrell et al. Feb 2004 A1
20040046787 Henry Mar 2004 A1
20040205536 Newman et al. Oct 2004 A1
20040213221 Civanlar et al. Oct 2004 A1
20040220984 Dudfield et al. Nov 2004 A1
20040243533 Dempster et al. Dec 2004 A1
20040255050 Takehiro et al. Dec 2004 A1
20040268149 Aaron Dec 2004 A1
20050028154 Smith et al. Feb 2005 A1
20050039104 Shah et al. Feb 2005 A1
20050060403 Bernstein et al. Mar 2005 A1
20050063377 Bryant et al. Mar 2005 A1
20050083933 Fine et al. Apr 2005 A1
20050108331 Osterman May 2005 A1
20050122325 Twait Jun 2005 A1
20050138157 Jung et al. Jun 2005 A1
20050166066 Ahuja et al. Jul 2005 A1
20050177829 Vishwanath Aug 2005 A1
20050182681 Bruskotter et al. Aug 2005 A1
20050185621 Sivakumar et al. Aug 2005 A1
20050198247 Perry et al. Sep 2005 A1
20050198371 Smith et al. Sep 2005 A1
20050198629 Vishwanath Sep 2005 A1
20050207376 Ashwood-Smith et al. Sep 2005 A1
20050257244 Joly et al. Nov 2005 A1
20050289244 Sahu et al. Dec 2005 A1
20060048218 Lingafelt et al. Mar 2006 A1
20060075396 Surasinghe Apr 2006 A1
20060077909 Saleh et al. Apr 2006 A1
20060080733 Khosmood et al. Apr 2006 A1
20060089985 Poletto Apr 2006 A1
20060095968 Portolani et al. May 2006 A1
20060143432 Rothman et al. Jun 2006 A1
20060156408 Himberger et al. Jul 2006 A1
20060159032 Ukrainetz et al. Jul 2006 A1
20060173912 Lindvall et al. Aug 2006 A1
20060195448 Newport Aug 2006 A1
20060212556 Yacoby et al. Sep 2006 A1
20060272018 Fouant Nov 2006 A1
20060274659 Ouderkirk Dec 2006 A1
20060280179 Meier Dec 2006 A1
20060294219 Ogawa et al. Dec 2006 A1
20070014275 Bettink et al. Jan 2007 A1
20070025306 Cox et al. Feb 2007 A1
20070044147 Choi et al. Feb 2007 A1
20070097976 Wood et al. May 2007 A1
20070118654 Jamkhedkar et al. May 2007 A1
20070127491 Verzijp et al. Jun 2007 A1
20070162420 Ou et al. Jul 2007 A1
20070169179 Narad Jul 2007 A1
20070180526 Copeland, III Aug 2007 A1
20070195729 Li et al. Aug 2007 A1
20070195794 Fujita et al. Aug 2007 A1
20070195797 Patel et al. Aug 2007 A1
20070201474 Isobe Aug 2007 A1
20070211637 Mitchell Sep 2007 A1
20070214348 Danielsen Sep 2007 A1
20070230415 Malik Oct 2007 A1
20070232265 Park et al. Oct 2007 A1
20070250930 Aziz et al. Oct 2007 A1
20070300061 Kim et al. Dec 2007 A1
20080002697 Anantharamaiah et al. Jan 2008 A1
20080017619 Yamakawa Jan 2008 A1
20080022385 Crowell et al. Jan 2008 A1
20080028389 Genty et al. Jan 2008 A1
20080046708 Fitzgerald et al. Feb 2008 A1
20080049633 Edwards et al. Feb 2008 A1
20080056124 Nanda et al. Mar 2008 A1
20080082662 Danliker et al. Apr 2008 A1
20080101234 Nakil et al. May 2008 A1
20080120350 Grabowski et al. May 2008 A1
20080126534 Mueller et al. May 2008 A1
20080141246 Kuck et al. Jun 2008 A1
20080155245 Lipscombe et al. Jun 2008 A1
20080201109 Zill et al. Aug 2008 A1
20080250122 Zsigmond et al. Oct 2008 A1
20080250128 Sargent Oct 2008 A1
20080270199 Chess et al. Oct 2008 A1
20080282347 Dadhia et al. Nov 2008 A1
20080295163 Kang Nov 2008 A1
20080301765 Nicol et al. Dec 2008 A1
20090019026 Valdes-Perez Jan 2009 A1
20090059934 Aggarwal et al. Mar 2009 A1
20090064332 Porras et al. Mar 2009 A1
20090106646 Mollicone et al. Apr 2009 A1
20090109849 Wood et al. Apr 2009 A1
20090138590 Lee et al. May 2009 A1
20090177484 Davis Jul 2009 A1
20090180393 Nakamura Jul 2009 A1
20090241170 Kumar et al. Sep 2009 A1
20090292795 Ford et al. Nov 2009 A1
20090296593 Prescott Dec 2009 A1
20090300180 Dehaan et al. Dec 2009 A1
20090307753 Dupont et al. Dec 2009 A1
20090313373 Hanna et al. Dec 2009 A1
20090313698 Wahl Dec 2009 A1
20090319912 Serr et al. Dec 2009 A1
20090323543 Shimakura Dec 2009 A1
20090328219 Narayanaswamy Dec 2009 A1
20100005288 Rao et al. Jan 2010 A1
20100042716 Farajidana Feb 2010 A1
20100049839 Parker et al. Feb 2010 A1
20100054241 Shah et al. Mar 2010 A1
20100077445 Schneider et al. Mar 2010 A1
20100095293 O'Neill et al. Apr 2010 A1
20100095367 Narayanaswamy Apr 2010 A1
20100095377 Krywaniuk Apr 2010 A1
20100138526 DeHaan et al. Jun 2010 A1
20100138810 Komatsu et al. Jun 2010 A1
20100148940 Gelvin et al. Jun 2010 A1
20100153316 Duffield et al. Jun 2010 A1
20100153696 Beachem et al. Jun 2010 A1
20100180016 Bugwadia et al. Jul 2010 A1
20100194741 Finocchio Aug 2010 A1
20100220584 DeHaan et al. Sep 2010 A1
20100235514 Beachem Sep 2010 A1
20100235879 Burnside et al. Sep 2010 A1
20100235915 Memon et al. Sep 2010 A1
20100287266 Asati et al. Nov 2010 A1
20100303240 Beachem Dec 2010 A1
20100306180 Johnson et al. Dec 2010 A1
20100317420 Hoffberg Dec 2010 A1
20100319060 Aiken et al. Dec 2010 A1
20110004935 Moffie et al. Jan 2011 A1
20110010585 Bugenhagen et al. Jan 2011 A1
20110022641 Werth et al. Jan 2011 A1
20110055381 Narasimhan et al. Mar 2011 A1
20110055388 Yumerefendi et al. Mar 2011 A1
20110066719 Miryanov et al. Mar 2011 A1
20110069685 Tofighbakhsh Mar 2011 A1
20110072119 Bronstein et al. Mar 2011 A1
20110083125 Komatsu et al. Apr 2011 A1
20110085556 Breslin et al. Apr 2011 A1
20110103259 Aybay et al. May 2011 A1
20110107074 Chan et al. May 2011 A1
20110107331 Evans et al. May 2011 A1
20110125894 Anderson May 2011 A1
20110126136 Abella et al. May 2011 A1
20110126275 Anderson et al. May 2011 A1
20110145885 Rivers et al. Jun 2011 A1
20110153039 Gvelesiani et al. Jun 2011 A1
20110153811 Jeong et al. Jun 2011 A1
20110158088 Lofstrand et al. Jun 2011 A1
20110170860 Smith et al. Jul 2011 A1
20110173490 Narayanaswamy et al. Jul 2011 A1
20110185423 Sallam Jul 2011 A1
20110196957 Ayachitula et al. Aug 2011 A1
20110202655 Sharma et al. Aug 2011 A1
20110214174 Herzog et al. Sep 2011 A1
20110225207 Subramanian et al. Sep 2011 A1
20110228696 Agarwal et al. Sep 2011 A1
20110238793 Bedare et al. Sep 2011 A1
20110246663 Melsen et al. Oct 2011 A1
20110277034 Hanson Nov 2011 A1
20110283277 Castillo et al. Nov 2011 A1
20110302652 Westerfeld Dec 2011 A1
20110314148 Petersen et al. Dec 2011 A1
20110317982 Xu et al. Dec 2011 A1
20120005542 Petersen et al. Jan 2012 A1
20120079592 Pandrangi Mar 2012 A1
20120089664 Igelka Apr 2012 A1
20120096394 Balko Apr 2012 A1
20120102361 Sass et al. Apr 2012 A1
20120102543 Kohli et al. Apr 2012 A1
20120102545 Carter, III et al. Apr 2012 A1
20120110188 Van Biljon et al. May 2012 A1
20120117226 Tanaka et al. May 2012 A1
20120117642 Lin et al. May 2012 A1
20120136996 Seo et al. May 2012 A1
20120137278 Draper et al. May 2012 A1
20120137361 Yi et al. May 2012 A1
20120140626 Anand et al. Jun 2012 A1
20120195198 Regan Aug 2012 A1
20120197856 Banka et al. Aug 2012 A1
20120198541 Reeves Aug 2012 A1
20120216271 Cooper et al. Aug 2012 A1
20120218989 Tanabe et al. Aug 2012 A1
20120219004 Balus et al. Aug 2012 A1
20120233348 Winters Sep 2012 A1
20120233473 Vasseur et al. Sep 2012 A1
20120240185 Kapoor et al. Sep 2012 A1
20120240232 Azuma Sep 2012 A1
20120246303 Petersen et al. Sep 2012 A1
20120254109 Shukla et al. Oct 2012 A1
20120260227 Shukla et al. Oct 2012 A1
20120268405 Ferren Oct 2012 A1
20120278021 Lin et al. Nov 2012 A1
20120281700 Koganti et al. Nov 2012 A1
20120300628 Prescott et al. Nov 2012 A1
20130003538 Greenburg et al. Jan 2013 A1
20130003733 Venkatesan et al. Jan 2013 A1
20130006935 Grisby Jan 2013 A1
20130007435 Bayani Jan 2013 A1
20130038358 Cook et al. Feb 2013 A1
20130041934 Annamalaisami et al. Feb 2013 A1
20130054682 Malik et al. Feb 2013 A1
20130085889 Fitting et al. Apr 2013 A1
20130086272 Chen et al. Apr 2013 A1
20130103827 Dunlap et al. Apr 2013 A1
20130107709 Campbell et al. May 2013 A1
20130124807 Nielsen et al. May 2013 A1
20130125107 Bandakka et al. May 2013 A1
20130145099 Liu et al. Jun 2013 A1
20130148663 Xiong Jun 2013 A1
20130159999 Chiueh et al. Jun 2013 A1
20130173784 Wang et al. Jul 2013 A1
20130174256 Powers Jul 2013 A1
20130179487 Lubetzky et al. Jul 2013 A1
20130179879 Zhang et al. Jul 2013 A1
20130198517 Mazzarella Aug 2013 A1
20130198839 Wei et al. Aug 2013 A1
20130201986 Sajassi et al. Aug 2013 A1
20130205293 Levijarvi et al. Aug 2013 A1
20130219161 Fontignie et al. Aug 2013 A1
20130219500 Lukas et al. Aug 2013 A1
20130232498 Mangtani et al. Sep 2013 A1
20130238665 Sequin Sep 2013 A1
20130242999 Kamble et al. Sep 2013 A1
20130246925 Ahuja et al. Sep 2013 A1
20130247201 Alperovitch et al. Sep 2013 A1
20130254879 Chesla et al. Sep 2013 A1
20130268994 Cooper et al. Oct 2013 A1
20130275579 Hernandez et al. Oct 2013 A1
20130283374 Zisapel et al. Oct 2013 A1
20130290521 Labovitz Oct 2013 A1
20130297771 Osterloh et al. Nov 2013 A1
20130301472 Allan Nov 2013 A1
20130304900 Trabelsi et al. Nov 2013 A1
20130305369 Karta et al. Nov 2013 A1
20130318357 Abraham et al. Nov 2013 A1
20130326623 Kruglick Dec 2013 A1
20130333029 Chesla et al. Dec 2013 A1
20130336164 Yang et al. Dec 2013 A1
20130346736 Cook et al. Dec 2013 A1
20130347103 Veteikis et al. Dec 2013 A1
20140006610 Formby et al. Jan 2014 A1
20140006871 Lakshmanan et al. Jan 2014 A1
20140009338 Lin Jan 2014 A1
20140012814 Bercovici et al. Jan 2014 A1
20140019972 Yahalom et al. Jan 2014 A1
20140031005 Sumcad et al. Jan 2014 A1
20140033193 Palaniappan Jan 2014 A1
20140036688 Stassinopoulos et al. Feb 2014 A1
20140040343 Nickolov et al. Feb 2014 A1
20140047185 Peterson et al. Feb 2014 A1
20140047372 Gnezdov et al. Feb 2014 A1
20140056318 Hansson et al. Feb 2014 A1
20140059200 Nguyen et al. Feb 2014 A1
20140074946 Dirstine et al. Mar 2014 A1
20140075336 Curtis Mar 2014 A1
20140089494 Dasari et al. Mar 2014 A1
20140092884 Murphy et al. Apr 2014 A1
20140096058 Molesky et al. Apr 2014 A1
20140105029 Jain et al. Apr 2014 A1
20140115219 Ajanovic et al. Apr 2014 A1
20140129942 Rathod May 2014 A1
20140137109 Sharma et al. May 2014 A1
20140140213 Raleigh et al. May 2014 A1
20140140244 Kapadia et al. May 2014 A1
20140143825 Behrendt et al. May 2014 A1
20140149490 Luxenberg et al. May 2014 A1
20140156814 Barabash et al. Jun 2014 A1
20140156861 Cruz-Aguilar et al. Jun 2014 A1
20140164607 Bai et al. Jun 2014 A1
20140165200 Singla Jun 2014 A1
20140165207 Engel et al. Jun 2014 A1
20140173623 Chang et al. Jun 2014 A1
20140192639 Smirnov Jul 2014 A1
20140201717 Mascaro et al. Jul 2014 A1
20140215573 Cepuran Jul 2014 A1
20140215621 Xaypanya et al. Jul 2014 A1
20140224784 Kohler Aug 2014 A1
20140225603 Auguste et al. Aug 2014 A1
20140233387 Zheng et al. Aug 2014 A1
20140269777 Rothstein et al. Sep 2014 A1
20140280499 Basavaiah et al. Sep 2014 A1
20140280908 Rothstein et al. Sep 2014 A1
20140281030 Cui et al. Sep 2014 A1
20140286174 Iizuka et al. Sep 2014 A1
20140286354 Van De Poel et al. Sep 2014 A1
20140289854 Mahvi Sep 2014 A1
20140298461 Hohndel et al. Oct 2014 A1
20140307686 Su et al. Oct 2014 A1
20140317278 Kersch et al. Oct 2014 A1
20140317737 Shin et al. Oct 2014 A1
20140330616 Lyras Nov 2014 A1
20140331048 Casas-Sanchez et al. Nov 2014 A1
20140331276 Frascadore et al. Nov 2014 A1
20140331280 Porras et al. Nov 2014 A1
20140331304 Wong Nov 2014 A1
20140348182 Chandra et al. Nov 2014 A1
20140351203 Kunnatur et al. Nov 2014 A1
20140351415 Harrigan et al. Nov 2014 A1
20140359695 Chari et al. Dec 2014 A1
20150006689 Szilagyi et al. Jan 2015 A1
20150006714 Jain Jan 2015 A1
20150009840 Pruthi et al. Jan 2015 A1
20150033305 Shear et al. Jan 2015 A1
20150036480 Huang et al. Feb 2015 A1
20150036533 Sodhi et al. Feb 2015 A1
20150039751 Harrigan et al. Feb 2015 A1
20150046882 Menyhart et al. Feb 2015 A1
20150052441 Degioanni Feb 2015 A1
20150058976 Carney et al. Feb 2015 A1
20150067143 Babakhan et al. Mar 2015 A1
20150067786 Fiske Mar 2015 A1
20150082151 Liang et al. Mar 2015 A1
20150085665 Kompella et al. Mar 2015 A1
20150095332 Beisiegel et al. Apr 2015 A1
20150112933 Satapathy Apr 2015 A1
20150113133 Srinivas et al. Apr 2015 A1
20150124608 Agarwal et al. May 2015 A1
20150124652 Dhamapurikar et al. May 2015 A1
20150128205 Mahaffey et al. May 2015 A1
20150134801 Walley May 2015 A1
20150138993 Forster et al. May 2015 A1
20150142962 Srinivas et al. May 2015 A1
20150195291 Zuk et al. Jul 2015 A1
20150222939 Gallant et al. Aug 2015 A1
20150249622 Phillips et al. Sep 2015 A1
20150256555 Choi et al. Sep 2015 A1
20150261842 Huang et al. Sep 2015 A1
20150261886 Wu et al. Sep 2015 A1
20150271008 Jain et al. Sep 2015 A1
20150271255 Mackay et al. Sep 2015 A1
20150295945 Canzanese, Jr. et al. Oct 2015 A1
20150312233 Graham, III et al. Oct 2015 A1
20150347554 Vasantham et al. Dec 2015 A1
20150358352 Chasin et al. Dec 2015 A1
20160006753 McDaid et al. Jan 2016 A1
20160019030 Shukla et al. Jan 2016 A1
20160020959 Rahaman Jan 2016 A1
20160021131 Heilig Jan 2016 A1
20160026552 Holden et al. Jan 2016 A1
20160036636 Erickson et al. Feb 2016 A1
20160036833 Ardeli et al. Feb 2016 A1
20160036837 Jain et al. Feb 2016 A1
20160050132 Zhang et al. Feb 2016 A1
20160072815 Rieke et al. Mar 2016 A1
20160080414 Kolton et al. Mar 2016 A1
20160087861 Kuan et al. Mar 2016 A1
20160094394 Sharma et al. Mar 2016 A1
20160103692 Guntaka et al. Apr 2016 A1
20160105350 Greifeneder et al. Apr 2016 A1
20160112270 Danait et al. Apr 2016 A1
20160112284 Pon et al. Apr 2016 A1
20160119234 Valencia Lopez et al. Apr 2016 A1
20160127395 Underwood et al. May 2016 A1
20160147585 Konig et al. May 2016 A1
20160148251 Thomas et al. May 2016 A1
20160162308 Chen et al. Jun 2016 A1
20160162312 Doherty et al. Jun 2016 A1
20160173446 Nantel Jun 2016 A1
20160173535 Barabash et al. Jun 2016 A1
20160183093 Vaughn et al. Jun 2016 A1
20160205002 Rieke et al. Jul 2016 A1
20160216994 Sefidcon et al. Jul 2016 A1
20160217022 Velipasaoglu et al. Jul 2016 A1
20160234083 Ahn et al. Aug 2016 A1
20160255082 Rathod Sep 2016 A1
20160269424 Chandola et al. Sep 2016 A1
20160269442 Shieh Sep 2016 A1
20160269482 Jamjoom et al. Sep 2016 A1
20160292065 Thangamani Oct 2016 A1
20160294691 Joshi Oct 2016 A1
20160308908 Kirby et al. Oct 2016 A1
20160337204 Dubey et al. Nov 2016 A1
20160357424 Pang et al. Dec 2016 A1
20160357546 Chang et al. Dec 2016 A1
20160357587 Yadav et al. Dec 2016 A1
20160357957 Deen et al. Dec 2016 A1
20160359592 Kulshreshtha et al. Dec 2016 A1
20160359628 Singh et al. Dec 2016 A1
20160359658 Yadav et al. Dec 2016 A1
20160359673 Gupta et al. Dec 2016 A1
20160359677 Kulshreshtha et al. Dec 2016 A1
20160359678 Madani et al. Dec 2016 A1
20160359679 Parasdehgheibi et al. Dec 2016 A1
20160359680 Parasdehgheibi et al. Dec 2016 A1
20160359686 Parasdehgheibi et al. Dec 2016 A1
20160359695 Yadav et al. Dec 2016 A1
20160359696 Yadav et al. Dec 2016 A1
20160359697 Scheib et al. Dec 2016 A1
20160359698 Deen et al. Dec 2016 A1
20160359699 Gandham et al. Dec 2016 A1
20160359700 Pang et al. Dec 2016 A1
20160359701 Pang et al. Dec 2016 A1
20160359703 Gandham et al. Dec 2016 A1
20160359704 Gandham et al. Dec 2016 A1
20160359705 Parasdehgheibi et al. Dec 2016 A1
20160359708 Gandham et al. Dec 2016 A1
20160359709 Deen et al. Dec 2016 A1
20160359711 Deen et al. Dec 2016 A1
20160359712 Alizadeh Attar et al. Dec 2016 A1
20160359740 Parasdehgheibi et al. Dec 2016 A1
20160359759 Singh et al. Dec 2016 A1
20160359872 Yadav et al. Dec 2016 A1
20160359877 Kulshreshtha et al. Dec 2016 A1
20160359878 Prasad et al. Dec 2016 A1
20160359879 Deen et al. Dec 2016 A1
20160359880 Pang et al. Dec 2016 A1
20160359881 Yadav et al. Dec 2016 A1
20160359888 Gupta et al. Dec 2016 A1
20160359889 Yadav et al. Dec 2016 A1
20160359890 Deen et al. Dec 2016 A1
20160359891 Pang et al. Dec 2016 A1
20160359897 Yadav et al. Dec 2016 A1
20160359905 Touboul et al. Dec 2016 A1
20160359912 Gupta et al. Dec 2016 A1
20160359913 Gupta et al. Dec 2016 A1
20160359914 Deen et al. Dec 2016 A1
20160359915 Gupta et al. Dec 2016 A1
20160359917 Rao et al. Dec 2016 A1
20160373481 Sultan et al. Dec 2016 A1
20160380865 Dubai et al. Dec 2016 A1
20170006141 Bhadra Jan 2017 A1
20170024453 Raja et al. Jan 2017 A1
20170032310 Mimnaugh Feb 2017 A1
20170048121 Hobbs et al. Feb 2017 A1
20170070582 Desai et al. Mar 2017 A1
20170085483 Mihaly et al. Mar 2017 A1
20170208487 Ratakonda et al. Jul 2017 A1
20170250880 Akens et al. Aug 2017 A1
20170250951 Wang et al. Aug 2017 A1
20170289067 Lu et al. Oct 2017 A1
20170295141 Thubert et al. Oct 2017 A1
20170302691 Singh et al. Oct 2017 A1
20170324518 Meng et al. Nov 2017 A1
20170331747 Singh et al. Nov 2017 A1
20170346736 Chander et al. Nov 2017 A1
20170364380 Frye, Jr. et al. Dec 2017 A1
20180006911 Dickey Jan 2018 A1
20180007115 Nedeltchev et al. Jan 2018 A1
20180013670 Kapadia et al. Jan 2018 A1
20180032905 Abercrombie Feb 2018 A1
20180145906 Yadav et al. May 2018 A1
20200396129 Tedaldi Dec 2020 A1
Foreign Referenced Citations (25)
Number Date Country
101093452 Dec 2007 CN
101770551 Jul 2010 CN
102521537 Jun 2012 CN
103023970 Apr 2013 CN
103716137 Apr 2014 CN
104065518 Sep 2014 CN
107196807 Sep 2017 CN
0811942 Dec 1997 EP
1076848 Jul 2002 EP
1383261 Jan 2004 EP
1450511 Aug 2004 EP
2045974 Apr 2008 EP
2043320 Apr 2009 EP
2860912 Apr 2015 EP
2887595 Jun 2015 EP
2009-016906 Jan 2009 JP
1394338 May 2014 KR
WO 2007014314 Feb 2007 WO
WO 2007070711 Jun 2007 WO
WO 2008069439 Jun 2008 WO
WO 2008069439 Jan 2009 WO
WO 2013030830 Mar 2013 WO
WO 2015042171 Mar 2015 WO
WO 2016004075 Jan 2016 WO
WO 2016019523 Feb 2016 WO
Non-Patent Literature Citations (96)
Entry
Pathway Systems International Inc.; “What is Blueprints?”; 2010-2016; http://pathwaysystems.com/blueprints-about/.
Wang, R. et al.,“Learning directed acyclic graphs via bootstrap aggregating”, 2014, http://arxiv.org/abs/1406.2098.
Australian Government Department of Defence, Intelligence and Security, “Top 4 Strategies to Mitigate Targeted Cyber Intrusions,” Cyber Security Operations Centre Jul. 2013, http://www.asd.gov.au/infosec/top-mitigations/top-4-strategies-explained.htm.
Author Unknown, “Blacklists & Dynamic Reputation: Understanding Why the Evolving Threat Eludes Blacklists,” www.dambaia.com, 9 pages, Dambala, Atlanta, GA, USA.
Aydin, Galip, et al., “Architecture and Implementation of a Scalable Sensor Data Storage and Analysis Using Cloud Computing and Big Data Technologies,” Journal of Sensors, vol. 2015, Article ID 834217, Feb. 2015, 11 pages.
Backes, Michael, et al., “Data Lineage in Malicious Environments,” IEEE 2015, pp. 1-13.
Bayati, Mohsen, et al., “Message-Passing Algorithms for Sparse Network Alignment,” Mar. 2013, 31 pages.
Berezinski, Przemyslaw, et al., “An Entropy-Based Network Anomaly Detection Method,” Entropy, 2015, vol. 17, www.mdpi.com/joumal/entropy, pp. 2367-2408.
Berthier, Robin, et al. “Nfsight: Netflow-based Network Awareness Tool,” 2010, 16 pages.
Bhuyan, Dhiraj, “Fighting Bots and Botnets,” 2006, pp. 23-28.
Blair, Dana, et al., U.S. Appl. No. 62/106,006, filed Jan. 21, 2015, entitled “Monitoring Network Policy Compliance.”
Chandran, Midhun, et al., “Monitoring in a Virtualized Environment,” GSTF International Journal on Computing, vol. 1, No. 1, Aug. 2010.
Chari, Suresh, et al., “Ensuring continuous compliance through reconciling policy with usage,” Proceedings of the 18th ACM symposium on Access control models and technologies (SACMAT '13). ACM, New York, NY, USA, 49-60.
Chen, Xu, et al., “Automating network application dependency discovery: experiences, limitations, and new solutions,” 8th USENIX conference on Operating systems design and implementation (OSDI'08), USENIX Association, Berkeley, CA, USA, 117-130.
Cisco Systems, “Cisco Network Analysis Modules (NAM) Tutorial,” Cisco Systems, Inc., Version 3.5.
Cisco Systems, Inc., “Addressing Compliance from One Infrastructure: Cisco Unified Compliance Solution Framework,” 2014.
Cisco Systems, Inc., “Cisco Application Dependency Mapping Service,” 2009.
Cisco Systems, Inc., “White Paper—New Cisco Technologies Help Customers Achieve Regulatory Compliance,” 1992-2008.
Cisco Systems, Inc., “A Cisco Guide to Defending Against Distributed Denial of Service Attacks,” May 3, 2016, 34 pages.
Cisco Technology, Inc., “Cisco Lock-and-Key:Dynamic Access Lists,” http://www/cisco.com/c/en/us/support/docs/security-vpn/lock-key/7604-13.html; Updated Jul. 12, 2006, 16 pages.
Di Lorenzo, Guisy, et al., “EXSED: An Intelligent Tool for Exploration of Social Events Dynamics from Augmented Trajectories,” Mobile Data Management (MDM), pp. 323-330, Jun. 3-6, 2013.
Feinstein, Laura, et al., “Statistical Approaches to DDoS Attack Detection and Response,” Proceedings of the DARPA Information Survivability Conference and Exposition (DISCEX '03), Apr. 2003, 12 pages.
George, Ashley, et al., “NetPal: A Dynamic Network Administration Knowledge Base,” 2008, pp. 1-14.
Goldsteen, Abigail, et al., “A Tool for Monitoring and Maintaining System Trustworthiness at Run Time,” REFSQ (2015), pp. 142-147.
Hamadi, S., et al., “Fast Path Acceleration for Open vSwitch in Overlay Networks,” Global Information Infrastructure and Networking Symposium (GIIS), Montreal, QC, pp. 1-5, Sep. 15-19, 2014.
Hewlett-Packard, “Effective use of reputation intelligence in a security operations center,” Jul. 2013, 6 pages.
Hideshima, Yusuke, et al., “STARMINE: A Visualization System for Cyber Attacks,” https://www.researchgate.net/publication/221536306, Feb. 2006, 9 pages.
InternetPerils, Inc., “Control Your Internet Business Risk,” 2003-2015, https://www.internetperils.com.
Janoff, Christian, et al., “Cisco Compliance Solution for HIPAA Security Rule Design and Implementation Guide,” Cisco Systems, Inc., Updated Nov. 14, 2015, part 1 of 2, 350 pages.
Janoff, Christian, et al., “Cisco Compliance Solution for HIPAA Security Rule Design and Implementation Guide,” Cisco Systems, Inc., Updated Nov. 14, 2015, part 2 of 2, 588 pages.
Kerrison, Adam, et al., “Four Steps to Faster, Better Application Dependency Mapping—Laying the Foundation for Effective Business Service Models,” BMCSoftware, 2011.
Kraemer, Brian, “Get to know your data center with CMDB,” TechTarget, Apr. 5, 2006, http://searchdatacenter.techtarget.com/news/118820/Get-to-know-your-data-center-with-CMDB.
Lab SKU, “VMware Hands-on Labs—HOL-SDC-1301” Version: 20140321-160709, 2013; http://docs.hol.vmware.com/HOL-2013/holsdc-1301_html_en/ (part 1 of 2).
Lab SKU, “VMware Hands-on Labs—HOL-SDC-1301” Version: 20140321-160709, 2013; http://docs.hol.vmware.com/HOL-2013/holsdc-1301_html_en/ (part 2 of 2).
Lachance, Michael, “Dirty Little Secrets of Application Dependency Mapping,” Dec. 26, 2007.
Landman, Yoav, et al., “Dependency Analyzer,” Feb. 14, 2008, http://jfrog.com/confluence/display/DA/Home.
Lee, Sihyung, “Reducing Complexity of Large-Scale Network Configuration Management,” Ph.D. Dissertation, Carniege Mellon University, 2010.
Li, Ang, et al., “Fast Anomaly Detection for Large Data Centers,” Global Telecommunications Conference (GLOBECOM 2010, Dec. 2010, 6 pages.
Li, Bingbong, et al, “A Supervised Machine Learning Approach to Classify Host Roles On Line Using sFlow,” in Proceedings of the first edition workshop on High performance and programmable networking, 2013, ACM, New York, NY, USA, 53-60.
Liu, Ting, et al., “Impala: A Middleware System For Managing Autonomic, Parallel Sensor Systems,” In Proceedings of the Ninth ACM SIGPLAN Symposium On Principles And Practice Of Parallel Programming(PPoPP '03), ACM, New York, NY, USA, Jun. 11-13, 2003, pp. 107-118.
Lu, Zhonghai, et al., “Cluster-based Simulated Annealing for Mapping Cores onto 2D Mesh Networks on Chip,” Design and Diagnostics of Electronic Circuits and Systems, pp. 1, 6, 16-18, Apr. 2008.
Matteson, Ryan, “Depmap: Dependency Mapping of Applications Using Operating System Events: a Thesis,” Master's Thesis, California Polytechnic State University, Dec. 2010.
Natarajan, Arun, et al., “NSDMiner: Automated Discovery of Network Service Dependencies,” Institute of Electrical and Electronics Engineers INFOCOM, Feb. 2012, 9 pages.
Navaz, A.S. Syed, et al., “Entropy based Anomaly Detection System to Prevent DDoS Attacks in Cloud,” International Journal of computer Applications (0975-8887), vol. 62, No. 15, Jan. 2013, pp. 42-47.
Neverfail, “Neverfail IT Continuity Architect,” 2015, https://web.archive.org/web/20150908090456/http://www.neverfailgroup.com/products/it-continuity-architect.
Nilsson, Dennis K., et al., “Key Management And Secure Software Updates In Wireless Process Control Environments,” In Proceedings of the First ACM Conference On Wireless Network Security (WiSec '08), ACM, New York, NY, USA, Mar. 31-Apr. 2, 2008, pp. 100-108.
Nunnally, Troy, et al., “P3D: A Parallel 3D Coordinate Visualization for Advanced Network Scans,” IEEE 2013, Jun. 9-13, 2013, 6 pages.
O'Donnell, Glenn, et al., “The CMDB Imperative: How to Realize the Dream and Avoid the Nightmares,” Prentice Hall, Feb. 19, 2009.
Ohta, Kohei, et al., “Detection, Defense, and Tracking of Internet-Wide Illegal Access in a Distributed Manner,” 2000, pp. 1-16.
Pathway Systems International Inc., “How Blueprints does Integration,” Apr. 15, 2014, 9 pages, http://pathwaysystems.com/company-blog/.
Popa, Lucian, et al., “Macroscope: End-Point Approach to Networked Application Dependency Discovery,” CoNEXT'09, Dec. 1-4, 2009, Rome, Italy, 12 pages.
Prasad, K. Munivara, et al., “An Efficient Detection of Flooding Attacks to Internet Threat Monitors (ITM) using Entropy Variations under Low Traffic,” Computing Communication & Networking Technologies (ICCCNT '12), Jul. 26-28, 2012, 11 pages.
Sachan, Mrinmaya, et al., “Solving Electrical Networks to incorporate Supervision in Random Walks,” May 13-17, 2013, pp. 109-110.
Sammarco, Matteo, et al., “Trace Selection for Improved WLAN Monitoring,” Aug. 16, 2013, pp. 9-14.
Shneiderman, Ben, et al., “Network Visualization by Semantic Substrates,” Visualization and Computer Graphics, vol. 12, No. 5, pp. 733,740, Sep.-Oct. 2006.
Wang, Yongjun, et al., “A Network Gene-Based Framework for Detecting Advanced Persistent Threats,” Nov. 2014, 7 pages.
Woodberg, Brad, “Snippet from Juniper SRX Series” Jun. 17, 2013, 1 page, O'Reilly Media, Inc.
Zhang, Yue, et al., “CANTINA: A Content-Based Approach to Detecting Phishing Web Sites,” May 8-12, 2007, pp. 639-648.
Bosch, Greg, “Virtualization,” 2010, 33 pages.
Breen, Christopher, “Mac 911, How to dismiss Mac App Store Notifications,” Macworld.com, Mar. 24, 2014, 3 pages.
Chou, C.W., et al., “Optical Clocks and Relativity,” Science vol. 329, Sep. 24, 2010, pp. 1630-1633.
Huang, Hing-Jie, et al., “Clock Skew Based Node Identification in Wireless Sensor Networks,” IEEE, 2008, 5 pages.
Ives, Herbert, E., et al., “An Experimental Study of the Rate of a Moving Atomic Clock,” Journal of the Optical Society of America, vol. 28, No. 7, Jul. 1938, pp. 215-226.
Witze, Alexandra, “Special relativity aces time trial, ‘Time dilation’ predicted by Einstein confirmed by lithium ion experiment,” Nature, Sep. 19, 2014, 3 pages.
Zatrochova, Zuzana, “Analysis and Testing of Distributed NoSQL Datastore Riak,” Spring, 2015, 76 pages.
Bauch, Petr, “Reader's Report of Master's Thesis, Analysis and Testing of Distributed NoSQL Datastore Riak,” May 28, 2015, Brno. 2 pages.
Heckman, Sarah, et al., “On Establishing a Benchmark for Evaluating Static Analysis Alert Prioritization and Classification Techniques,” IEEE, 2008; 10 pages.
Kim, Myung-Sup, et al. “A Flow-based Method for Abnormal Network Traffic Detection, ” IEEE, 2004, pp. 599-612.
Thomas, R., “Bogon Dotted Decimal List,” Version 7.0, Team Cymru NOC, Apr. 27, 2012, 5 pages.
Baek, Kwang-Hyun, et al., “Preventing Theft of Quality of Service on Open Platforms,” 2005 Workshop of the 1st International Conference on Security and Privacy for Emerging Areas in Communication Networks, 2005, 12 pages.
Theodorakopoulos, George, et al., “On Trust Models and Trust Evaluation Metrics for Ad Hoc Networks,” IEEE Journal on Selected Areas in Communications. vol. 24, Issue 2, Feb. 2006, pp. 318-328.
Zeng, Sai, et al., “Managing Risk in Multi-node Automation of Endpoint Management,” 2014 IEEE Network Operations and Management Symposium (NOMS), 2014, 6 pages.
Al-Fuqaha, Ala, et al., “Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications,” IEEE Communication Surveys & Tutorials. vol. 17, No. 4, Nov. 18, 2015, pp. 2347-2376.
Brocade Communications Systems, Inc., “Chapter 5—Configuring Virtual LANs (VLANs),” Jun. 2009, 38 pages.
Cisco Systems, Inc. “Cisco, Nexus 3000 Series NX-OS Release Notes, Release 5.0(3)U3(1),” Feb. 29, 2012, Part No. OL-26631-01, 16 pages.
Cisco Systems, Inc., “Cisco—VPN Client User Guide for Windows,” Release 4.6, Aug. 2004, 148 pages.
Cisco Systems, Inc., “Cisco 4710 Application Control Engine Appliance Hardware Installation Guide,” Nov. 2007, 66 pages.
Cisco Systems, Inc., “Cisco Data Center Network Architecture and Solutions Overview,” Feb. 2006, 19 pages.
Cisco Systems, Inc., “Cisco IOS Configuration Fundamentals Configuration Guide: Using Autoinstall and Setup,” Release 12.2, first published Apr. 2001, last updated Sep. 2003, 32 pages.
Cisco Systems, Inc., “Cisco VN-Link: Virtualization-Aware Networking,” White Paper, Mar. 2009, 10 pages.
Cisco Systems, Inc., “Cisco, Nexus 5000 Series and Cisco Nexus 2000 Series Release Notes, Cisco NX-OS Release 5.1 (3)N2(1b), NX-OS Release 5.1 (3)N2(1a) and NX-OS Release 5.1(3)N2(1),” Sep. 5, 2012, Part No. OL-26652-03 CO, 24 pages.
Cisco Systems, Inc., “Nexus 3000 Series NX-OS Fundamentals Configuration Guide, Release 5.0(3)U3(1): Using PowerOn Auto Provisioning,” Feb. 29, 2012, Part No. OL-26544-01, 10 pages.
Cisco Systems, Inc., “Quick Start Guide, Cisco ACE 4700 Series Application Control Engine Appliance,” Software Ve740rsion A5(1.0), Sep. 2011, 138 pages.
Cisco Systems, Inc., “Routing And Bridging Guide, Cisco ACE Application Control Engine,” Software Version A5(1.0), Sep. 2011, 248 pages.
Cisco Systems, Inc., “VMWare and Cisco Virtualization Solution: Scale Virtual Machine Networking,” Jul. 2009, 4 pages.
Cisco Systems, Inc., “Cisco Remote Integrated Service Engine for Citrix NetScaler Appliances and Cisco Nexus 7000 Series Switches Configuration Guide,” Last modified Apr. 29, 2014, 78 pages.
Cisco Technology, Inc., “Cisco IOS Software Release 12.4T Features and Hardware Support,” Feb. 2009, 174 pages.
Cisco Systems, Inc.,“Cisco Application Control Engine (ACE) Troubleshooting Guide—Understanding the ACE Module Architecture and Traffic Flow,” Mar. 11, 2011, 6 pages.
Costa, Raul, et al., “An Intelligent Alarm Management System for Large-Scale Telecommunication Companies,” In Portuguese Conference on Artificial Intelligence, Oct. 2009, 14 pages.
De Carvalho, Tiago Filipe Rodrigues, “Root Cause Analysis in Large and Complex Networks,” Dec. 2008, Repositorio.ul.pt, pp. 1-55.
Foundation for Intelligent Physical Agents, “FIPA Agent Message Transport Service Specification,” Dec. 3, 2002, http://www.fipa.org; 15 pages.
Gia, Tuan Nguyen, et al., “Fog Computing in Healthcare Internet of Things: A Case Study on ECG Feature Extraction,” 2015 IEEE International Conference on Computerand Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing, Oct. 26, 2015, pp. 356-363.
Joseph, Dilip, et al., “Modeling Middleboxes,” IEEE Network, Sep./Oct. 2008, pp. 20-25.
Kent, S., et al. “Security Architecture for the Internet Protocol,” Network Working Group, Nov. 1998, 67 pages.
Online Collins English Dictionary, 1 page (Year: 2018).
Voris, Jonathan, et al., “Bait and Snitch: Defending Computer Systems with Decoys,” Columbia University Libraries, Department of Computer Science, 2013, pp. 1-25.
Related Publications (1)
Number Date Country
20170034018 A1 Feb 2017 US
Provisional Applications (1)
Number Date Country
62171899 Jun 2015 US