System and method for providing scalable flow monitoring in a data center fabric

Information

  • Patent Grant
  • 11233721
  • Patent Number
    11,233,721
  • Date Filed
    Wednesday, March 4, 2020
    4 years ago
  • Date Issued
    Tuesday, January 25, 2022
    2 years ago
Abstract
Disclosed is a method that includes calculating, at a collector receiving a data flow and via a hashing algorithm, all possible hashes associated with at least one virtual attribute associated with the data flow to yield resultant hash values. Based on the resultant hash values, the method includes computing a multicast address group and multicasting the data flow to n leafs based on the multicast address group. At respective other collectors, the method includes filtering received sub-flows of the data flow based on the resultant hashes, wherein if a respective hash is owned by a collector, the respective collector accepts and saves the sub-flow in a local switch collector database. A scalable, distributed netflow is possible with the ability to respond to queries for fabric-level netflow statistics even on virtual constructs.
Description
TECHNICAL FIELD

The disclosure provides a method of creating a virtual netflow collector in which netflow packet collection is distributed across switches in an Application Centric Infrastructure fabric, a hash combination is calculated for packet subflows and the hash combination is mapped to an IP multicast address for mapping to a physical netflow collector.


BACKGROUND

Today, netflow data collection is on a per node, per interface basis and is configured and managed for individual switches. The current approach has the following limitations. First, it is very difficult to correlate common (such as Tenant, Context (virtual routing and forwarding or VRF), Bridge Domains (BD)) and granular statistics (Application stats) across a network of switches, unless all the flow statistics go to the same collector. In a typical Application Centric Infrastructure (ACI) deployment, collecting fabric-level netflow statistics on virtual constructs such as the Tenant, VRF or BD is difficult, as the flows for these higher-level constructs will be spread across multiple switches in the fabric and these switches may be using different collectors for bandwidth scaling. Also, in a controller managed datacenter fabric, it is desired to collect finer statistics at various scopes than a traditional network. For instance, an administrator might want to collect statistics of a particular application for a tenant and multiple instances of this application can be running attached to different switches in the fabric. In general, fabric-wide granular netflow support will help provide meaningful information of application flows in the world of ACI.


Another limitation is the scalability and the management of the netflow collectors which cater to these set of the switches. In the current method, a flow collector is statically mapped to a netflow monitoring entity such as an interface on a switch. This method cannot scale when the bandwidth needs are different across different interfaces or switches. Also, when there are more collectors/switches, it becomes too difficult to manage the collector configuration. In a Dynamic Virtual Machine (VM) management environment, a collector should be able to cater to the VM moves. The same collector has to be provisioned across the entire domain where the VM could move.


As ACI ventures into cloud deployments, the requirement for an efficient netflow solution is even more compelling, as the fabric will be extended to support higher scale of virtual leaf switches and virtual PODs in the cloud. In this environment, managing netflow collectors per virtual leaf and maintaining a large number of collectors will be difficult.





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 embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only exemplary embodiments 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. 1 illustrates an example system configuration;



FIG. 2 illustrates an example network environment;



FIG. 3 illustrates a collector cluster and numerous respective collectors connected thereto;



FIG. 4 illustrates further details associated with the collector cluster and the approach disclosed herein;



FIG. 5 illustrates a method embodiment; and



FIG. 6 illustrates another method embodiment.





DESCRIPTION OF EXAMPLE EMBODIMENTS

Various embodiments of the disclosure 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 parting from the spirit and scope of the disclosure.


OVERVIEW

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.


A method aspect of this disclosure includes distributing netflow packet collectors across all switched in a network fabric of switches to yield a virtual netflow collector, calculating a first hash at a source switch of an incoming packet on each possible combination of a 5-tuple IP packet header, calculating a second hash at the source switch of an incoming packet on each possible combination of at least one virtual attribute of the network fabric of switches, creating an N-Tuple flow from the first hash and the second hash, exporting the N-Tuple flow to the virtual netflow collector and mapping, via a virtual extensible local area network multicast address group, the virtual netflow collector to one or more physical netflow collector.


Another method aspect includes calculating, at a collector receiving a data flow and via a hashing algorithm, all possible hashes associated with at least one virtual attribute associated with the data flow to yield resultant hash values, and, based on the resultant hash values, computing a multicast address group and multicasting the data flow to n leafs based on the multicast address group. The method includes, at respective other collectors, filtering received sub-flows of the data flow based on the resultant hashes, wherein if a respective collector is owned by a hash, the respective collector accepts and saves the sub-flow in a local switch collector database. The method also can include receiving a query using the hashing algorithm to query a relevant aggregated or granular flow.


DETAILED DESCRIPTION

The present disclosure addresses the issues raised above. The disclosure provides a system, method and computer-readable storage device embodiments. The concepts disclosed herein address the monitoring requirements for a high scale datacenter fabric environment. The concepts include correlating common attributes across a network of switches, providing a granular view of statistics which makes any form of visualization and projection easy, providing a scalable collection mechanism which can elastically handle additional nodes and bandwidth, and placing a collector that is decoupled from the monitoring entity, which helps dynamically migrating the collector to any node without having to change anything in the monitoring entity. These features allow the netflow collection to be placed through any workload orchestration, making better use of distributed compute resources.


First a general example system shall be disclosed in FIG. 1 which can provide some basic hardware components making up a server, node or other computer system. FIG. 1 illustrates a computing system architecture 100 wherein the components of the system are in electrical communication with each other using a connector 105. Exemplary system 100 includes a processing unit (CPU or processor) 110 and a system connector 105 that couples various system components including the system memory 115, such as read only memory (ROM) 120 and random access memory (RAM) 125, to the processor 110. The system 100 can include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 110. The system 100 can copy data from the memory 115 and/or the storage device 130 to the cache 112 for quick access by the processor 110. In this way, the cache can provide a performance boost that avoids processor 110 delays while waiting for data. These and other modules/services can control or be configured to control the processor 110 to perform various actions. Other system memory 115 may be available for use as well. The memory 115 can include multiple different types of memory with different performance characteristics. The processor 110 can include any general purpose processor and a hardware module or software module/service, such as service 1132, service 2134, and service 3136 stored in storage device 130, configured to control the processor 110 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 110 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus (connector), memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.


To enable user interaction with the computing device 100, an input device 145 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 135 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 100. The communications interface 140 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 may easily be substituted for improved hardware or firmware arrangements as they are developed.


Storage device 130 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) 125, read only memory (ROM) 120, and hybrids thereof.


The storage device 130 can include software services 132, 134, 136 for controlling the processor 110. Other hardware or software modules/services are contemplated. The storage device 130 can be connected to the system connector 105. 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 110, connector 105, display 135, and so forth, to carry out the function.


Having introduced the basic computing components which can be applicable to embodiments associated with this disclosure, the disclosure now turn to FIG. 2 which illustrates an example network environment.



FIG. 2 illustrates a diagram of example network environment 200. This figure is discussed with the concept of capturing agents on various network components. It is noted that the disclosed concept discussed below with respect to FIG. 4, and the focus of this disclosure, differs in how collection is done from what is referenced in FIG. 2. With reference to FIG. 2, fabric 212 can represent the underlay (i.e., physical network) of network environment 200. Fabric 212 can include spine routers 1-N (202A-N) (collectively “202”) and leaf routers 1-N (204A-N) (collectively “204”). Leaf routers 204 can reside at the edge of fabric 212, and can thus represent the physical network edges. Leaf routers 204 can be, for example, top-of-rack (“ToR”) switches, aggregation switches, gateways, ingress and/or egress switches, provider edge devices, and/or any other type of routing or switching device.


Leaf routers 204 can be responsible for routing and/or bridging tenant or endpoint packets and applying network policies. Spine routers 202 can perform switching and routing within fabric 212. Thus, network connectivity in fabric 212 can flow from spine routers 202 to leaf routers 204, and vice versa.


Leaf routers 204 can provide servers 1-5 (206A-E) (collectively “206”), hypervisors 1-4 (208A-208D) (collectively “208”), and virtual machines (VMs) 1-5 (210A-210E) (collectively “210”) access to fabric 212. For example, leaf routers 204 can encapsulate and decapsulate packets to and from servers 206 in order to enable communications throughout environment 200. Leaf routers 204 can also connect other devices, such as device 214, with fabric 212. Device 214 can be any network-capable device(s) or network(s), such as a firewall, a database, a server, a collector 218 (further described below), an engine 220 (further described below), etc. Leaf routers 204 can also provide any other servers, resources, endpoints, external networks, VMs, services, tenants, or workloads with access to fabric 212.


VMs 210 can be virtual machines hosted by hypervisors 208 running on servers 206. VMs 210 can include workloads running on a guest operating system on a respective server. Hypervisors 208 can provide a layer of software, firmware, and/or hardware that creates and runs the VMs 210. Hypervisors 208 can allow VMs 210 to share hardware resources on servers 206, and the hardware resources on servers 206 to appear as multiple, separate hardware platforms. Moreover, hypervisors 208 and servers 206 can host one or more VMs 210. For example, server 206A and hypervisor 208A can host VMs 210A-B.


In some cases, VMs 210 and/or hypervisors 208 can be migrated to other servers 206. For example, VM 210A can be migrated to server 206C and hypervisor 208B. Servers 206 can similarly be migrated to other locations in network environment 200. A server connected to a specific leaf router can be changed to connect to a different or additional leaf router. In some cases, some or all of servers 206, hypervisors 208, and/or VMs 210 can represent tenant space. Tenant space can include workloads, services, applications, devices, and/or resources that are associated with one or more clients or subscribers. Accordingly, traffic in network environment 200 can be routed based on specific tenant policies, spaces, agreements, configurations, etc. Moreover, addressing can vary between one or more tenants. In some configurations, tenant spaces can be divided into logical segments and/or networks and separated from logical segments and/or networks associated with other tenants.


Any of leaf routers 204, servers 206, hypervisors 208, and VMs 210 can include a capturing agent (also referred to as a “sensor”) configured to capture network data, and report any portion of the captured data to collector 218. Capturing agents 216 can be processes, agents, modules, drivers, or components deployed on a respective system (e.g., a server, VM, hypervisor, leaf router, etc.), configured to capture network data for the respective system (e.g., data received or transmitted by the respective system), and report some or all of the captured data to collector 218.


For example, a VM capturing agent can run as a process, kernel module, or kernel driver on the guest operating system installed in a VM and configured to capture data (e.g., network and/or system data) processed (e.g., sent, received, generated, etc.) by the VM. Additionally, a hypervisor capturing agent can run as a process, kernel module, or kernel driver on the host operating system installed at the hypervisor layer and configured to capture data (e.g., network and/or system data) processed (e.g., sent, received, generated, etc.) by the hypervisor. A server capturing agent can run as a process, kernel module, or kernel driver on the host operating system of a server and configured to capture data (e.g., network and/or system data) processed (e.g., sent, received, generated, etc.) by the server. And a network device capturing agent can run as a process or component in a network device, such as leaf routers 204, and configured to capture data (e.g., network and/or system data) processed (e.g., sent, received, generated, etc.) by the network device.


Capturing agents or sensors can be configured to report the observed data and/or metadata about one or more packets, flows, communications, processes, events, and/or activities to collector 218. For example, capturing agents can capture network data as well as information about the system or host of the capturing agents (e.g., where the capturing agents are deployed). Such information can also include, for example, data or metadata of active or previously active processes of the system, operating system user identifiers, metadata of files on the system, system alerts, networking information, etc. Capturing agents may also analyze all the processes running on the respective VMs, hypervisors, servers, or network devices to determine specifically which process is responsible for a particular flow of network traffic. Similarly, capturing agents may determine which operating system user(s) is responsible for a given flow. Reported data from capturing agents can provide details or statistics particular to one or more tenants. For example, reported data from a subset of capturing agents deployed throughout devices or elements in a tenant space can provide information about the performance, use, quality, events, processes, security status, characteristics, statistics, patterns, conditions, configurations, topology, and/or any other information for the particular tenant space.


Collectors 218 can be one or more devices, modules, workloads and/or processes capable of receiving data from capturing agents. Collectors 218 can thus collect reports and data from capturing agents. Collectors 218 can be deployed anywhere in network environment 200 and/or even on remote networks capable of communicating with network environment 200. For example, one or more collectors can be deployed within fabric 212 or on one or more of the servers 206. One or more collectors can be deployed outside of fabric 212 but connected to one or more leaf routers 204. Collectors 218 can be part of servers 206 and/or separate servers or devices (e.g., device 214). Collectors 218 can also be implemented in a cluster of servers.


Collectors 218 can be configured to collect data from capturing agents. In addition, collectors 218 can be implemented in one or more servers in a distributed fashion. As previously noted, collectors 218 can include one or more collectors. Moreover, each collector can be configured to receive reported data from all capturing agents or a subset of capturing agents. For example, a collector can be assigned to a subset of capturing agents so the data received by that specific collector is limited to data from the subset of capturing agents.


Collectors 218 can be configured to aggregate data from all capturing agents and/or a subset of capturing agents. Moreover, collectors 218 can be configured to analyze some or all of the data reported by capturing agents. For example, collectors 218 can include analytics engines (e.g., engines 220) for analyzing collected data. Environment 200 can also include separate analytics engines 220 configured to analyze the data reported to collectors 218. For example, engines 220 can be configured to receive collected data from collectors 218 and aggregate the data, analyze the data (individually and/or aggregated), generate reports, identify conditions, compute statistics, visualize reported data, present visualized data, troubleshoot conditions, visualize the network and/or portions of the network (e.g., a tenant space), generate alerts, identify patterns, calculate misconfigurations, identify errors, generate suggestions, generate testing, and/or perform any other analytics functions.


While collectors 218 and engines 220 are shown as separate entities, this is for illustration purposes as other configurations are also contemplated herein. For example, any of collectors 218 and engines 220 can be part of a same or separate entity. Moreover, any of the collector, aggregation, and analytics functions can be implemented by one entity (e.g., collectors 218) or separately implemented by multiple entities (e.g., engine 220 and/or collectors 218).


Each of the capturing agents can use a respective address (e.g., interne protocol (IP) address, port number, etc.) of their host to send information to collectors 218 and/or any other destination. Collectors 218 may also be associated with their respective addresses such as IP addresses. Moreover, capturing agents can periodically send information about flows they observe to collectors 218. Capturing agents can be configured to report each and every flow they observe. Capturing agents can report a list of flows that were active during a period of time (e.g., between the current time and the time of the last report). The consecutive periods of time of observance can be represented as pre-defined or adjustable time series. The series can be adjusted to a specific level of granularity. Thus, the time periods can be adjusted to control the level of details in statistics and can be customized based on specific requirements, such as security, scalability, storage, etc. The time series information can also be implemented to focus on more important flows or components (e.g., VMs) by varying the time intervals. The communication channel between a capturing agent and collector 218 can also create a flow in every reporting interval. Thus, the information transmitted or reported by capturing agents can also include information about the flow created by the communication channel.



FIG. 3 illustrates a network fabric having a Leaf 1 (302) receiving a flow f1, Leaf 2 (304) receiving a flow f2, Leaf 3 (306) receiving a flow f3 and a Leaf n (308) receiving a flow fn. The flows f1, f2, f3 and fn each represent the same flow (5-tuple) (or different flows) coming into different switches. For example, the flow could be into the same bridge domain (BD) deployed on n switches.


The features f1.tenant, f2.tenant, and f3.tenant represent an example of the tenant level sub-flow created for a given tenant, such as f1.tenant:tn-1. A tenant is a logical container for application policies that enable an administrator to exercise domain-based access control. The features f1.tenant.vrf, f2.tenant.vrf, and f3.tenant.vrf each represent an example of the tenant+vrf-level sub-flow created for a given virtual routing and forwarding (VRF) object (or context) which is a tenant network. A VRF is a unique layer 3 forwarding an application policy domain. For example, the VRF can be characterized as tn-1:vrf-1.


The features f1.tenant.vrf.https, f2.tenant.vrf.https, and f3.tenant.vrf.https each represent the https sub-flow for tn-1:vrf-1. As shown in FIG. 3, each of the 5-tuple data flows into a respective leaf node. A 5-tuple refers to a set of five different values that are a part of a Transmission Control Protocol/Internet Protocol (TCP/IP) connection. It includes a source IP address/port number, destination IP address/port number and the protocol in use. From the packet headers and incoming interface on the switch (Leaf 1, Leaf 2, etc.), each respective switch can derive other virtual attributes like Tenant, VRF, BD, Application, Endpoint Group (EPG) and create finer flows (N Tuples) from the initial 5-tuple flow. Examples of the sub-flows or finer flows are shown as the f1.tenant, f1.tenant.vrf and f1.tenant.vrf.https flows from Leaf 1. Other sub-flows can of course be derived as well. Each of these sub/micro flows corresponds to a combination of one or more of the attributes of the 5-tuple along with one or more of the virtual attributes.


Each of the sub-flows is exported to the virtual netflow collector or collector cluster 310, which gets mapped in the network to one or more of the physical netflow collectors 312, 314, 316 in the cluster through consistent hashing of the sub-flow parameters. As is shown in FIG. 3, all of the fx.tenant sub-flows are mapped to collector 1 (312), all of the fx.tenant.vrf sub-flows are mapped to collector 2 (314) and all of the f1.tenant.vrf.https sub-flows are mapped to collector n (316).


A given sub-flow created in one or more switches (302, 304, 306, 308) in the fabric will end up in the same physical instance of the collector cluster to provide a aggregated view. As an example, HTTPS traffic statistics on a given BD which is spread across multiple switches will always end up in the same physical collector instance. Similarly, aggregated traffic stats for a VRF will end in one collector instance.


The same idea applies for any visualization of the collected flows. Since the sub-flow is mapped to a physical collector inside the virtual collector 310, any form of query can be targeted at the virtual collector 310, which then gets internally mapped to the physical collector instance (312, 314, 316) holding the sub-flow. For example, an administrator can query the system for “https traffic for BD b1 in tenant t1” and can automatically be redirected by the network to the collector instance holding the entry, which is collector n (316) in FIG. 3. In one aspect, the network fabric presents one collector view for both collection and visualization.


While the above steps can be applied for any network of switches that are logically managed together, it is particularly significant in the ACI fabric. In the ACI fabric, the netflow collector functionality can be distributed across the spine and leaf switches and the underlay network control and data plane can be leveraged to provide the network function that maps the sub-flow to the physical collector instance. The entire ACI fabric can be envisioned as one netflow monitor and collector domain, which can also provide visualization interface through the REST interface. The REST interface is the Representative State Transfer and it relies on a stateless, client-server, cacheable communications protocol.


The solution disclosed herein makes use of the fabric compute resources like the leaf and spine CPU resources to run collector functionality, instead of mandating external collector nodes. Also, the solution uses the underlay multicast and VxLAN (discussed more fully below) segmentation to map and efficiently deliver the sub-flows to the corresponding collectors residing in the Leaf/Spine switches. This mapping function is done in a deterministic and distributed way without need for synchronization. This helps the leaf and spine switches that form the collector domain to be dynamically rearranged based on the available compute resources to do the functionality. When a leaf leaves the collector domain (or) when a new leaf gets added to the collector domain, the collection functionality in the rest of the fabric is not affected. This provides one of the benefits of the present disclosure, which is the ability to scale or expand easily for new leaf nodes added to a fabric.


Virtual Extensible local area network (VxLAN) is a network virtualization technology that attempts to address the scalability problems associated with large cloud computing deployments. The technology applies a virtual LAN (VLAN) type of encapsulation technique to encapsulate MAC-based OSI layer 2 Ethernet frames within layer 4 UDP (user datagram protocol) packets, using 4789 as the default IANA-assigned destination UDP port number. VxLAN endpoints, which terminate VxLAN tunnels and may be virtual and/or physical switch ports, are known as VxLAN tunnel endpoints (VTEPs).


VxLAN seeks to standardize on an overlay encapsulation protocol. Multicast or unicast with HER (Head-End Replication) is used to flood BUM (broadcast, unknown destination address, multicast) traffic. RFC 7348, which is incorporated herein by reference as background material.


The following are examples of the ACI fabric's virtual constructs: tenant, virtual routing and forwarding (VRF) and bridge domain (BD). Current netflow standards are at a switch-level and hence do not augur well for collection of fabric-wide statistics such as an amount of HTTPS traffic on a given tenant, number of packets originating from IP <A.B.C.D> on a given VRF, number of incoming packets across all interfaces in a given BD or traffic originating from a particular distributed application.


One example way to achieve a desired level of fabric-wide aggregation is presented with reference to FIG. 4. FIG. 4 shows an example fabric 400 with various components shown to highlight the process disclosed herein. In one aspect, the concept includes distributing netflow packet collection across all switches in the ACI fabric. i.e, the switches in the fabric can each act as individual netflow collectors. In one example, a source switch (Leaf 1, Collector 1 (404)) of the incoming packet will calculate a hash on each possible combination of the 5-tuple IP Packet header, along with the tenant, VRF, application and/or interface information. For example, a hash on combinations of each of {tenant, VRF, application, interface} on one side and {SIP, DIP, SPort, DPort, Protocol} on the other side. An example equation could perform this evaluation can include:

(r=1-xΣxCr)×(r=1-5Σ5Cr).


The above example equation computes 7 different combinations of {tenant, VRF, interface} (for x=3) combined along with 31 different combination of 5-tuple, giving as result of a total of (7×31)=217 possible combinations.


Each of the resultant hash combinations can correspond to one or more target switches (406, 408, 410, 414 through cloud 412) that will act as netflow collectors for that unique hash. Hence, all the above 217 combinations of netflow packet records will be sent to various destination switches using the underlay network. Each subflow is resident on multiple switches for resiliency and for providing scalable queries.


Based on the resultant hash values, the Leaf 1 will compute a VxLAN multicast address group and the Leaf 1 will multicast the flow to n leafs. As is shown in FIG. 3, the f1.tenant subflow is sent to Leaf 2 (Collector 2) 406, f1.tenant.vrf subflow is sent to Leaf 3 (Collector 3) 408, and the f1.tenant.app subflow is sent through the cloud 412 to a remote vleaf (Collector n+1) 414.


Consider the f1.tenant subflow as an example. The incoming sub-flow to Leaf 2 (Collector 2) 406 will be filtered based on the hash. If the hash is owned by the respective collector, the sub-flow is accepted and saved in the local switch collector database. If not, the sub-flow is rejected. An application policy infrastructure controller (APIC) 416 can use the same hashing algorithm to query any relevant aggregated or granular flow.


As noted above, computing the VxLAN multicast address group can be performed by a function that maps the sub-flow hash to an IP Multicast address, VxLAN Segment ID combination in the overlay network. A group of leaf switches which share one or more hashes can be considered to be part of a multicast group. A packet corresponding to a hash will be sent on the corresponding multicast group and reaches all the component switches. If a particular switch owns the hash, as in the Leaf 2406 discussed above, it accepts the packet and creates the flow record in the collector. If a switch doesn't own the hash, it rejects the packet. VxLAN segment ID is used to convey the hash value. The multicast group or multicast rules can be established or set up based on the all possible calculated hash values or hash combination values.


Note that the hash-to-switch mapping can be done in a distributed fashion in individual switches as it can be computed based on the vector of cluster nodes. Similarly, the hash to multicast group, VxLAN mapping can also be done in a distributed fashion. A switch can automatically join/leave a multicast group based on the hash ownership. In the incoming switch, the packet can be automatically mapped to the multicast group likewise. The above approach makes dynamic addition and deletion of collection nodes automatic and simple. The approach can be particularly useful in a cloud setting, when the collection service is treated as a workload which can be migrated to any node based on the immediate availability of the compute resource. In an ACI fabric distributed across several physical and virtual PODs (a grouping of one or more application images, with additional metadata applied to the POD as a whole), the system could use an orchestrator to place the physical collector instance in any available node. When a new node is added and the hash vector computed, the new node can automatically become part of the collection domain.


The target switch, say Leaf 2 (406), on receipt of the netflow packet will save the information in the switch's local database, thereby truly achieving distributed netflow collection.


The collected data can now be queried using the same formula by an administrator, where the query for a particular combination can be distributed to different switches based on the same hash calculation, and then aggregated at the APIC controller 416 level. For example, a query on {tenant A, Protocol X} will correspond to a unique hash, whose results can be queried from the corresponding switch acting as a collector for that combination. The query, in other words, can use the same hashing mechanism used in association with the multicast rules to enable the query to pull the desired data from the fabric.


The end result is that the approach disclosed herein achieves scalable, distributed netflow along with adding the capability to provide fabric-level netflow statistics even on virtual constructs like tenant, VRF etc.


Advantages of the disclosed approach include allowing the system to analyze statistics at a fabric-level (as opposed to individual switch-level) as well as enabling the distribution of netflow record collection across the entire fabric, thereby removing a single point of failure, and also enabling us to make distributed queries and data-aggregation. The concept can be extended to the cloud where an Application Virtual Switch (AVS) residing in the cloud can potentially use the ACI fabric as a distributed netflow collector for the stats that the AVS collects. Conversely, the AVS switch itself could act as one of the distributed collectors across the cloud, thereby taking netflow beyond traditional data-center boundaries.


The disclosed idea provides granular statistics in a distributed fashion, which are otherwise difficult to sustain with static collector configuration. The idea also proposes newer netflow statistics which are more application centric and makes use of ACI constructs. The idea makes use of ACI Leaf and Spine resources for providing collector functionality and uses the fabric multicast service to efficiently deliver the information to the collector. Use of the concept is easily detectible as the solution of fabric wide netflow with a virtual collector needs to be a documented functionality with specific user configuration and guideline. Also, the use of the idea can be viewed by observing the netflow packets on the wire which carry the VxLAN Header and terminating in the Fabric Leaf switches. Collectors can be different leafs in the fabric 400 or can be any other component or node within the fabric.



FIG. 5 illustrates a method embodiment of this disclosure. A method includes distributing netflow packet collectors across all switched in a network fabric of switches to yield a virtual netflow collector (502), calculating a first hash at a source switch of an incoming packet on each possible combination of a 5-tuple IP packet header (504), calculating a second hash at the source switch of an incoming packet on each possible combination of at least one virtual attribute of the network fabric of switches (506) and creating an N-Tuple flow from the first hash and the second hash (508).


The method further includes exporting the N-Tuple flow to the virtual netflow collector (510) and mapping, via a virtual extensible local area network multicast address group, the virtual netflow collector to one or more physical netflow collector (512).


In one aspect, each switch in the network fabric of switches can act as a respective netflow collector. The method can further include receiving a query at the virtual netflow collector regarding the N-Tuple flow (514) and presenting a response to the query based on the mapping of the virtual netflow collector to the one or more physical netflow collector (516). The response can include a visualization response. The query can utilize at least one of the first hash and the second hash or a combined hash to basically use the same hashing algorithm to query as was used to process the flow in the first instance.


The method can include aggregating statistics for a given virtual attribute to end up in a same physical collector instance according to the mapping of the virtual netflow collector to the one or more physical netflow collector. At least one virtual attribute can include one or more of a tenant, a virtual routing and forwarding object, an endpoint group, a bridge domain, a subnet, a contract, an application, and a filter.



FIG. 6 illustrates another method embodiment. As shown in FIG. 6, a method includes calculating, at a collector receiving a data flow and via a hashing algorithm, all possible hashes associated with at least one virtual attribute associated with the data flow to yield resultant hash values (602), and based on the resultant hash values, computing a multicast address group (604) and multicasting the data flow to n leafs based on the multicast address group (606). The method includes, at respective other collectors, filtering received sub-flows of the data flow based on the resultant hashes (608) wherein if a respective collector is owned by a hash, the respective collector accepts and saves the sub-flow in a local switch collector database (610). The method also includes receiving a query using the hashing algorithm to query a relevant aggregated or granular flow (612). The system will respond by distributing the query to different switches based on the hash algorithm such that the user can receive fabric-level network statistics even on subflows based on a virtual construct like tenant, VRF, etc.


In some embodiments the computer-readable storage devices, mediums, and/or 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 may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may 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, rackmount devices, standalone devices, 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.


Although a variety of examples and other information was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims. Moreover, claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim.


It should be understood that features or configurations herein with reference to one embodiment or example can be implemented in, or combined with, other embodiments or examples herein. That is, terms such as “embodiment”, “variation”, “aspect”, “example”, “configuration”, “implementation”, “case”, and any other terms which may connote an embodiment, as used herein to describe specific features or configurations, are not intended to limit any of the associated features or configurations to a specific or separate embodiment or embodiments, and should not be interpreted to suggest that such features or configurations cannot be combined with features or configurations described with reference to other embodiments, variations, aspects, examples, configurations, implementations, cases, and so forth. In other words, features described herein with reference to a specific example (e.g., embodiment, variation, aspect, configuration, implementation, case, etc.) can be combined with features described with reference to another example. Precisely, one of ordinary skill in the art will readily recognize that the various embodiments or examples described herein, and their associated features, can be combined with each other. For example, while some specific protocols such as 802.11 and 802.3 are mentioned in the examples above, the principles could apply to any communication protocol and does not have to be limited to these particular protocols. Any configuration in which received data is acknowledged through an ACK signal could implement the concepts disclosed herein.


A phrase such as an “aspect” does not imply that such aspect is essential to the subject technology or that such aspect applies to all configurations of the subject technology. A disclosure relating to an aspect may apply to all configurations, or one or more configurations. A phrase such as an aspect may refer to one or more aspects and vice versa. A phrase such as a “configuration” does not imply that such configuration is essential to the subject technology or that such configuration applies to all configurations of the subject technology. A disclosure relating to a configuration may apply to all configurations, or one or more configurations. A phrase such as a configuration may refer to one or more configurations and vice versa. The word “exemplary” is used herein to mean “serving as an example or illustration.” Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs.


Moreover, claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim. For example, claim language reciting “at least one of A, B, and C” or “at least one of A, B, or C” means A alone, B alone, C alone, A and B together, A and C together, B and C together, or A, B and C together.

Claims
  • 1. A method for monitoring netflow in a network, the method comprising: creating a virtual netflow collector by distributing netflow packet collectors in a network fabric of switches;in response to receiving an incoming packet at a source switch, calculating a first hash at the source switch of the incoming packet on at least one possible combination of an IP packet header;calculating a second hash at the source switch of the incoming packet on at least one possible combination of at least one virtual attribute of the network fabric of switches;creating a flow from the first hash and the second hash;exporting the flow to the virtual netflow collector; andmapping, at the virtual netflow collector, the flow to one or more physical netflow collector.
  • 2. The method of claim 1, wherein each of the switches are configured to function as a netflow collector.
  • 3. The method of claim 1, further comprising: receiving a query at the virtual netflow collector regarding the flow; andpresenting a response to the query based on the mapping.
  • 4. The method of claim 3, wherein the response comprises a visualization response.
  • 5. The method of claim 3, wherein the query uses at least one of the first hash and the second hash.
  • 6. The method of claim 1, wherein aggregated statistics for a given virtual attribute end up in a same physical collector instance according to the mapping.
  • 7. The method of claim 1, wherein the at least one virtual attribute comprises one or more of a tenant, a virtual routing and forwarding object, an endpoint group, a bridge domain, a subnet, a contract, an application, or a filter.
  • 8. A system for monitoring netflow in a network, the system comprising: at least one processor; andat least one memory storing instructions which when executed by the at least one processor, cause the at least one processor to: create a virtual netflow collector by distributing netflow packet collectors in a network fabric of switches;in response to receiving an incoming packet at a source switch, calculate a first hash at the source switch of the incoming packet on at least one possible combination of an IP packet header;calculate a second hash at the source switch of the incoming packet on at least one possible combination of at least one virtual attribute of the network fabric of switches;create a flow from the first hash and the second hash;export the flow to the virtual netflow collector; andmap, at the virtual netflow collector, the flow to one or more physical netflow collector.
  • 9. The system of claim 8, wherein each of the switches are configured to function as a netflow collector.
  • 10. The system of claim 8, comprising further instructions, which when executed by the at least one processor, causes the at least one processor to: receive a query at the virtual netflow collector regarding the flow; andpresent a response to the query based on the mapping.
  • 11. The system of claim 10, wherein the response comprises a visualization response.
  • 12. The system of claim 10, wherein the query uses at least one of the first hash and the second hash.
  • 13. The system of claim 8, wherein aggregated statistics for a given virtual attribute end up in a same physical collector instance according to the mapping.
  • 14. The system of claim 8, wherein the at least one virtual attribute comprises one or more of a tenant, a virtual routing and forwarding object, an endpoint group, a bridge domain, a subnet, a contract, an application, or a filter.
  • 15. At least one non-transitory computer readable medium storing instructions which when executed by at least one processor, cause the at least one processor to: create a virtual netflow collector by distributing netflow packet collectors in a network fabric of switches;in response to receiving an incoming packet at a source switch, calculate a first hash at the source switch of the incoming packet on at least one possible combination of an IP packet header;calculate a second hash at the source switch of the incoming packet on at least one possible combination of at least one virtual attribute of the network fabric of switches;create a flow from the first hash and the second hash;export the flow to the virtual netflow collector; andmap, at the virtual netflow collector, the flow to one or more physical netflow collector.
  • 16. The at least one non-transitory computer readable medium of claim 15, wherein each of the switches are configured to function as a netflow collector.
  • 17. The system of claim 15, comprising further instructions, which when executed by the at least one processor, causes the at least one processor to: receive a query at the virtual netflow collector regarding the flow; andpresent a response to the query based on the mapping.
  • 18. The system of claim 17, wherein the response comprises a visualization response.
  • 19. The system of claim 17, wherein the query uses at least one of the first hash and the second hash.
  • 20. The system of claim 15, wherein aggregated statistics for a given virtual attribute end up in a same physical collector instance according to the mapping.
CROSS-REFERENCE TO RELATED APPLICATION

This application is a Continuation of, and claims priority to, U.S. Non-Provisional patent application Ser. No. 15/658,215, filed Jul. 24, 2017, the contents of which are incorporated herein by reference in its entirety.

US Referenced Citations (446)
Number Name Date Kind
5812773 Norin Sep 1998 A
5889896 Meshinsky et al. Mar 1999 A
6108782 Fletcher et al. Aug 2000 A
6178453 Mattaway et al. Jan 2001 B1
6298153 Oishi Oct 2001 B1
6343290 Cossins et al. Jan 2002 B1
6643260 Kloth et al. Nov 2003 B1
6683873 Kwok et al. Jan 2004 B1
6721804 Rubin et al. Apr 2004 B1
6733449 Krishnamurthy et al. May 2004 B1
6735631 Oehrke et al. May 2004 B1
6996615 McGuire Feb 2006 B1
7002965 Cheriton Feb 2006 B1
7054930 Cheriton May 2006 B1
7058706 Lyer et al. Jun 2006 B1
7062571 Dale et al. Jun 2006 B1
7111177 Chauvel et al. Sep 2006 B1
7212490 Kao et al. May 2007 B1
7277948 Igarashi et al. Oct 2007 B2
7313667 Pullela et al. Dec 2007 B1
7379846 Williams et al. May 2008 B1
7480672 Hahn et al. Jan 2009 B2
7496043 Leong et al. Feb 2009 B1
7536476 Alleyne May 2009 B1
7567504 Darling et al. Jul 2009 B2
7583665 Duncan et al. Sep 2009 B1
7606147 Luft et al. Oct 2009 B2
7644437 Volpano Jan 2010 B2
7647594 Togawa Jan 2010 B2
7773510 Back et al. Aug 2010 B2
7808897 Mehta et al. Oct 2010 B1
7881957 Cohen et al. Feb 2011 B1
7917647 Cooper et al. Mar 2011 B2
8010598 Tanimoto Aug 2011 B2
8028071 Mahalingam et al. Sep 2011 B1
8041714 Aymeloglu et al. Oct 2011 B2
8121117 Amdahl et al. Feb 2012 B1
8171415 Appleyard et al. May 2012 B2
8234377 Cohn Jul 2012 B2
8244559 Horvitz et al. Aug 2012 B2
8250215 Stienhans et al. Aug 2012 B2
8280880 Aymeloglu et al. Oct 2012 B1
8284664 Aybay et al. Oct 2012 B1
8301746 Head et al. Oct 2012 B2
8345692 Smith Jan 2013 B2
8406141 Couturier et al. Mar 2013 B1
8407413 Yucel et al. Mar 2013 B1
8448171 Donnellan et al. May 2013 B2
8477610 Zuo et al. Jul 2013 B2
8495356 Ashok et al. Jul 2013 B2
8495725 Ahn Jul 2013 B2
8510469 Portolani Aug 2013 B2
8514868 Hill Aug 2013 B2
8532108 Li et al. Sep 2013 B2
8533687 Greifeneder et al. Sep 2013 B1
8547974 Guruswamy et al. Oct 2013 B1
8560639 Murphy et al. Oct 2013 B2
8560663 Baucke et al. Oct 2013 B2
8589543 Dutta et al. Nov 2013 B2
8590050 Nagpal et al. Nov 2013 B2
8611356 Yu et al. Dec 2013 B2
8612625 Andreis et al. Dec 2013 B2
8630291 Shaffer et al. Jan 2014 B2
8639787 Lagergren et al. Jan 2014 B2
8656024 Krishnan et al. Feb 2014 B2
8660129 Brendel et al. Feb 2014 B1
8719804 Jain May 2014 B2
8775576 Hebert et al. Jul 2014 B2
8797867 Chen et al. Aug 2014 B1
8805951 Faibish et al. Aug 2014 B1
8850002 Dickinson et al. Sep 2014 B1
8850182 Fritz et al. Sep 2014 B1
8856339 Mestery et al. Oct 2014 B2
8909928 Ahmad et al. Dec 2014 B2
8918510 Gmach et al. Dec 2014 B2
8924720 Raghuram et al. Dec 2014 B2
8930747 Levijarvi et al. Jan 2015 B2
8938775 Roth et al. Jan 2015 B1
8959526 Kansal et al. Feb 2015 B2
8977754 Curry, Jr. et al. Mar 2015 B2
9009697 Breiter et al. Apr 2015 B2
9015324 Jackson Apr 2015 B2
9043439 Bicket et al. May 2015 B2
9049115 Rajendran et al. Jun 2015 B2
9063789 Beaty et al. Jun 2015 B2
9065727 Liu et al. Jun 2015 B1
9075649 Bushman et al. Jul 2015 B1
9130846 Szabo et al. Sep 2015 B1
9164795 Vincent Oct 2015 B1
9167050 Durazzo et al. Oct 2015 B2
9201701 Boldyrev et al. Dec 2015 B2
9201704 Chang et al. Dec 2015 B2
9203784 Chang et al. Dec 2015 B2
9223634 Chang et al. Dec 2015 B2
9244776 Koza et al. Jan 2016 B2
9251114 Ancin et al. Feb 2016 B1
9264478 Hon et al. Feb 2016 B2
9294408 Dickinson et al. Mar 2016 B1
9313048 Chang et al. Apr 2016 B2
9356866 Sivaramakrishnan et al. May 2016 B1
9361192 Smith et al. Jun 2016 B2
9379982 Krishna et al. Jun 2016 B1
9380075 He et al. Jun 2016 B2
9397946 Yadav Jul 2016 B1
9432245 Sorenson, III et al. Aug 2016 B1
9432294 Sharma et al. Aug 2016 B1
9444744 Sharma et al. Sep 2016 B1
9473365 Melander et al. Oct 2016 B2
9503530 Niedzielski Nov 2016 B1
9558078 Farlee et al. Jan 2017 B2
9571570 Mutnuru Feb 2017 B1
9613078 Vermeulen et al. Apr 2017 B2
9628471 Sundaram et al. Apr 2017 B1
9658876 Chang et al. May 2017 B2
9692802 Bicket et al. Jun 2017 B2
9755858 Bagepalli et al. Sep 2017 B2
9755972 Mao Sep 2017 B1
10616101 Peterson Apr 2020 B1
20010055303 Horton et al. Dec 2001 A1
20020073337 Ioele et al. Jun 2002 A1
20020122422 Kenney Sep 2002 A1
20020143928 Maltz et al. Oct 2002 A1
20020166117 Abrams et al. Nov 2002 A1
20020174216 Shorey et al. Nov 2002 A1
20020181463 Knight Dec 2002 A1
20030018591 Komisky Jan 2003 A1
20030056001 Mate et al. Mar 2003 A1
20030228585 Inoko et al. Dec 2003 A1
20040004941 Malan et al. Jan 2004 A1
20040034702 He Feb 2004 A1
20040088542 Daude et al. May 2004 A1
20040095237 Chen et al. May 2004 A1
20040131059 Ayyakad et al. Jul 2004 A1
20040197079 Latvala et al. Oct 2004 A1
20040264481 Darling et al. Dec 2004 A1
20050060418 Sorokopud Mar 2005 A1
20050125424 Herriott et al. Jun 2005 A1
20060062187 Rune Mar 2006 A1
20060104286 Cheriton May 2006 A1
20060126665 Ward et al. Jun 2006 A1
20060146825 Hofstaedter et al. Jul 2006 A1
20060155875 Cheriton Jul 2006 A1
20060168338 Bruegl et al. Jul 2006 A1
20060233106 Achlioptas et al. Oct 2006 A1
20070174663 Crawford et al. Jul 2007 A1
20070223487 Kajekar et al. Sep 2007 A1
20070242830 Conrado et al. Oct 2007 A1
20080005293 Bhargava et al. Jan 2008 A1
20080080524 Tsushima et al. Apr 2008 A1
20080084880 Dharwadkar Apr 2008 A1
20080165778 Ertemalp Jul 2008 A1
20080198752 Fan et al. Aug 2008 A1
20080198858 Townsley et al. Aug 2008 A1
20080201711 Amir Husain Aug 2008 A1
20080235755 Blaisdell et al. Sep 2008 A1
20090006527 Gingell, Jr. et al. Jan 2009 A1
20090019367 Cavagnari et al. Jan 2009 A1
20090031312 Mausolf et al. Jan 2009 A1
20090083183 Rao et al. Mar 2009 A1
20090138763 Arnold May 2009 A1
20090177775 Radia et al. Jul 2009 A1
20090178058 Stillwell, III et al. Jul 2009 A1
20090182874 Morford et al. Jul 2009 A1
20090265468 Annambhotla et al. Oct 2009 A1
20090265753 Anderson et al. Oct 2009 A1
20090293056 Ferris Nov 2009 A1
20090300608 Ferris et al. Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090323706 Germain et al. Dec 2009 A1
20090328031 Pouyadou et al. Dec 2009 A1
20100036903 Ahmad et al. Feb 2010 A1
20100042720 Stienhans et al. Feb 2010 A1
20100061250 Nugent Mar 2010 A1
20100115341 Baker et al. May 2010 A1
20100131765 Bromley et al. May 2010 A1
20100149966 Achlioptas et al. Jun 2010 A1
20100191783 Mason et al. Jul 2010 A1
20100192157 Jackson et al. Jul 2010 A1
20100205601 Abbas et al. Aug 2010 A1
20100211782 Auradkar et al. Aug 2010 A1
20100293270 Augenstein et al. Nov 2010 A1
20100318609 Lahiri et al. Dec 2010 A1
20100325199 Park et al. Dec 2010 A1
20100325441 Laurie et al. Dec 2010 A1
20100333116 Prahlad et al. Dec 2010 A1
20110016214 Jackson Jan 2011 A1
20110035754 Srinivasan Feb 2011 A1
20110055396 Dehaan Mar 2011 A1
20110055398 Dehaan et al. Mar 2011 A1
20110055470 Portolani Mar 2011 A1
20110072489 Parann-Nissany Mar 2011 A1
20110075667 Li et al. Mar 2011 A1
20110110382 Jabr et al. May 2011 A1
20110116443 Yu et al. May 2011 A1
20110125749 Wood May 2011 A1
20110126099 Anderson et al. May 2011 A1
20110138055 Daly et al. Jun 2011 A1
20110145413 Dawson et al. Jun 2011 A1
20110145657 Bishop et al. Jun 2011 A1
20110173303 Rider Jul 2011 A1
20110185063 Head et al. Jul 2011 A1
20110185065 Stanisic et al. Jul 2011 A1
20110191624 Rodgers Aug 2011 A1
20110206052 Tan et al. Aug 2011 A1
20110213966 Fu et al. Sep 2011 A1
20110219434 Betz et al. Sep 2011 A1
20110231715 Kunii et al. Sep 2011 A1
20110231899 Pulier et al. Sep 2011 A1
20110239039 Dieffenbach et al. Sep 2011 A1
20110252327 Awasthi et al. Oct 2011 A1
20110261811 Battestilli et al. Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110276675 Singh et al. Nov 2011 A1
20110276951 Jain Nov 2011 A1
20110283013 Grosser et al. Nov 2011 A1
20110295998 Ferris et al. Dec 2011 A1
20110305149 Scott et al. Dec 2011 A1
20110307531 Gaponenko et al. Dec 2011 A1
20110310739 Aybay Dec 2011 A1
20110320870 Kenigsberg et al. Dec 2011 A1
20120005724 Lee Jan 2012 A1
20120036234 Staats et al. Feb 2012 A1
20120054367 Ramakrishnan et al. Mar 2012 A1
20120072318 Akiyama et al. Mar 2012 A1
20120072578 Alam Mar 2012 A1
20120072581 Tung et al. Mar 2012 A1
20120072985 Davne et al. Mar 2012 A1
20120072992 Arasaratnam et al. Mar 2012 A1
20120084445 Brock et al. Apr 2012 A1
20120084782 Chou et al. Apr 2012 A1
20120096134 Suit Apr 2012 A1
20120102193 Rathore et al. Apr 2012 A1
20120102199 Hopmann et al. Apr 2012 A1
20120131174 Ferris et al. May 2012 A1
20120137215 Kawara May 2012 A1
20120158967 Sedayao et al. Jun 2012 A1
20120159097 Jennas, II et al. Jun 2012 A1
20120167094 Suit Jun 2012 A1
20120173710 Rodriguez Jul 2012 A1
20120179909 Sagi et al. Jul 2012 A1
20120180044 Donnellan et al. Jul 2012 A1
20120182891 Lee et al. Jul 2012 A1
20120185913 Martinez et al. Jul 2012 A1
20120192016 Gotesdyner et al. Jul 2012 A1
20120192075 Ebtekar et al. Jul 2012 A1
20120201135 Ding et al. Aug 2012 A1
20120214506 Skaaksrud et al. Aug 2012 A1
20120222106 Kuehl Aug 2012 A1
20120236716 Anbazhagan et al. Sep 2012 A1
20120240113 Hur Sep 2012 A1
20120265976 Spiers et al. Oct 2012 A1
20120272025 Park et al. Oct 2012 A1
20120281706 Agarwal et al. Nov 2012 A1
20120281708 Chauhan et al. Nov 2012 A1
20120290647 Ellison et al. Nov 2012 A1
20120297238 Watson et al. Nov 2012 A1
20120311106 Morgan Dec 2012 A1
20120311568 Jansen Dec 2012 A1
20120324092 Brown et al. Dec 2012 A1
20120324114 Dutta et al. Dec 2012 A1
20130003567 Gallant et al. Jan 2013 A1
20130013248 Brugler et al. Jan 2013 A1
20130031294 Feng et al. Jan 2013 A1
20130036213 Hasan et al. Feb 2013 A1
20130044636 Koponen et al. Feb 2013 A1
20130066940 Shao Mar 2013 A1
20130080509 Wang Mar 2013 A1
20130080624 Nagai et al. Mar 2013 A1
20130091557 Gurrapu Apr 2013 A1
20130097601 Podvratnik et al. Apr 2013 A1
20130104140 Meng et al. Apr 2013 A1
20130111540 Sabin May 2013 A1
20130117337 Dunham May 2013 A1
20130124712 Parker May 2013 A1
20130125124 Kempf et al. May 2013 A1
20130138816 Kuo et al. May 2013 A1
20130144978 Jain et al. Jun 2013 A1
20130152076 Patel Jun 2013 A1
20130152175 Hromoko et al. Jun 2013 A1
20130159097 Schory et al. Jun 2013 A1
20130159496 Hamilton et al. Jun 2013 A1
20130160008 Cawlfield et al. Jun 2013 A1
20130162753 Hendrickson et al. Jun 2013 A1
20130169666 Pacheco et al. Jul 2013 A1
20130179941 McGloin et al. Jul 2013 A1
20130182712 Aguayo et al. Jul 2013 A1
20130185433 Zhu et al. Jul 2013 A1
20130191106 Kephart et al. Jul 2013 A1
20130198374 Zalmanovitch et al. Aug 2013 A1
20130201989 Hu et al. Aug 2013 A1
20130204849 Chacko Aug 2013 A1
20130232491 Radhakrishnan et al. Sep 2013 A1
20130246588 Borowicz et al. Sep 2013 A1
20130250770 Zou et al. Sep 2013 A1
20130254415 Fullen et al. Sep 2013 A1
20130262347 Dodson Oct 2013 A1
20130283364 Chang et al. Oct 2013 A1
20130297769 Chang et al. Nov 2013 A1
20130318240 Hebert et al. Nov 2013 A1
20130318546 Kothuri et al. Nov 2013 A1
20130339949 Spiers et al. Dec 2013 A1
20140006481 Frey et al. Jan 2014 A1
20140006535 Reddy Jan 2014 A1
20140006585 Dunbar et al. Jan 2014 A1
20140040473 Ho et al. Feb 2014 A1
20140040883 Tompkins Feb 2014 A1
20140052877 Mao Feb 2014 A1
20140056146 Hu et al. Feb 2014 A1
20140059310 Du et al. Feb 2014 A1
20140074850 Noel et al. Mar 2014 A1
20140075048 Yuksel et al. Mar 2014 A1
20140075108 Dong et al. Mar 2014 A1
20140075357 Flores et al. Mar 2014 A1
20140075501 Srinivasan et al. Mar 2014 A1
20140089727 Cherkasova et al. Mar 2014 A1
20140098762 Ghai et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140122560 Ramey et al. May 2014 A1
20140136779 Guha et al. May 2014 A1
20140140211 Chandrasekaran et al. May 2014 A1
20140141720 Princen et al. May 2014 A1
20140156557 Zeng et al. Jun 2014 A1
20140164486 Ravichandran et al. Jun 2014 A1
20140188825 Muthukkaruppan et al. Jul 2014 A1
20140189095 Lindberg et al. Jul 2014 A1
20140189125 Amies et al. Jul 2014 A1
20140215471 Cherkasova Jul 2014 A1
20140222953 Karve et al. Aug 2014 A1
20140244851 Lee Aug 2014 A1
20140245298 Zhou et al. Aug 2014 A1
20140281173 Im et al. Sep 2014 A1
20140282536 Dave et al. Sep 2014 A1
20140282611 Campbell et al. Sep 2014 A1
20140282889 Ishaya et al. Sep 2014 A1
20140289200 Kato Sep 2014 A1
20140295831 Karra et al. Oct 2014 A1
20140297569 Clark et al. Oct 2014 A1
20140297835 Buys Oct 2014 A1
20140310391 Sorensen, III et al. Oct 2014 A1
20140310417 Sorensen, III et al. Oct 2014 A1
20140310418 Sorensen, III et al. Oct 2014 A1
20140314078 Jilani Oct 2014 A1
20140317261 Shatzkamer et al. Oct 2014 A1
20140321278 Cafarelli et al. Oct 2014 A1
20140330976 van Bemmel Nov 2014 A1
20140330977 van Bemmel Nov 2014 A1
20140334488 Guichard et al. Nov 2014 A1
20140362682 Guichard et al. Dec 2014 A1
20140362705 Pan Dec 2014 A1
20140365680 van Bemmel Dec 2014 A1
20140366155 Chang et al. Dec 2014 A1
20140369204 Anand et al. Dec 2014 A1
20140372567 Ganesh et al. Dec 2014 A1
20140372616 Arisoylu et al. Dec 2014 A1
20140379938 Bosch et al. Dec 2014 A1
20150033086 Sasturkar et al. Jan 2015 A1
20150043576 Dixon et al. Feb 2015 A1
20150052247 Threefoot et al. Feb 2015 A1
20150052517 Raghu et al. Feb 2015 A1
20150058382 St. Laurent et al. Feb 2015 A1
20150058459 Amendjian et al. Feb 2015 A1
20150071285 Kumar et al. Mar 2015 A1
20150085870 Narasimha et al. Mar 2015 A1
20150089082 Patwardhan et al. Mar 2015 A1
20150100471 Curry, Jr. et al. Apr 2015 A1
20150103827 Quinn et al. Apr 2015 A1
20150106802 Ivanov et al. Apr 2015 A1
20150106805 Melander et al. Apr 2015 A1
20150117199 Chinnaiah Sankaran et al. Apr 2015 A1
20150117458 Gurkan et al. Apr 2015 A1
20150120914 Wada et al. Apr 2015 A1
20150124622 Kovvali et al. May 2015 A1
20150138973 Kumar et al. May 2015 A1
20150178133 Phelan et al. Jun 2015 A1
20150189009 van Bemmel Jul 2015 A1
20150215819 Bosch et al. Jul 2015 A1
20150227405 Jan et al. Aug 2015 A1
20150242204 Hassine et al. Aug 2015 A1
20150244617 Nakil et al. Aug 2015 A1
20150249709 Teng et al. Sep 2015 A1
20150263901 Kumar et al. Sep 2015 A1
20150280980 Bitar Oct 2015 A1
20150281067 Wu Oct 2015 A1
20150281113 Siciliano et al. Oct 2015 A1
20150309908 Pearson et al. Oct 2015 A1
20150319063 Zourzouvillys et al. Nov 2015 A1
20150326524 Tankala et al. Nov 2015 A1
20150339210 Kopp et al. Nov 2015 A1
20150358850 La, Jr. et al. Dec 2015 A1
20150365324 Kumar et al. Dec 2015 A1
20150370604 Miwa et al. Dec 2015 A1
20150373108 Fleming et al. Dec 2015 A1
20160011925 Kulkarni et al. Jan 2016 A1
20160013990 Kulkarni et al. Jan 2016 A1
20160026684 Mukherjee et al. Jan 2016 A1
20160062786 Meng et al. Mar 2016 A1
20160094389 Jain et al. Mar 2016 A1
20160094398 Choudhury et al. Mar 2016 A1
20160094453 Jain et al. Mar 2016 A1
20160094454 Jain et al. Mar 2016 A1
20160094455 Jain et al. Mar 2016 A1
20160094456 Jain et al. Mar 2016 A1
20160094480 Kulkarni et al. Mar 2016 A1
20160094643 Jain et al. Mar 2016 A1
20160099847 Melander et al. Apr 2016 A1
20160099853 Nedeltchev et al. Apr 2016 A1
20160099864 Akiya et al. Apr 2016 A1
20160105393 Thakkar et al. Apr 2016 A1
20160127184 Bursell May 2016 A1
20160134557 Steinder et al. May 2016 A1
20160156708 Jalan et al. Jun 2016 A1
20160164780 Timmons et al. Jun 2016 A1
20160164914 Madhav et al. Jun 2016 A1
20160182378 Basavaraja et al. Jun 2016 A1
20160188527 Cherian et al. Jun 2016 A1
20160234071 Nambiar et al. Aug 2016 A1
20160239399 Babu et al. Aug 2016 A1
20160253078 Ebtekar et al. Sep 2016 A1
20160254968 Ebtekar et al. Sep 2016 A1
20160261564 Foxhoven et al. Sep 2016 A1
20160277368 Narayanaswamy et al. Sep 2016 A1
20160359872 Yadav et al. Dec 2016 A1
20160359888 Gupta et al. Dec 2016 A1
20160380865 Dubal et al. Dec 2016 A1
20170005948 Melander et al. Jan 2017 A1
20170024260 Chandrasekaran et al. Jan 2017 A1
20170026294 Basavaraja et al. Jan 2017 A1
20170026470 Bhargava et al. Jan 2017 A1
20170041342 Efremov et al. Feb 2017 A1
20170048146 Sane et al. Feb 2017 A1
20170054659 Ergin et al. Feb 2017 A1
20170097841 Chang et al. Apr 2017 A1
20170099188 Chang et al. Apr 2017 A1
20170104755 Arregoces et al. Apr 2017 A1
20170126566 Wang et al. May 2017 A1
20170126567 Wang et al. May 2017 A1
20170147297 Krishnamurthy et al. May 2017 A1
20170149878 Mutnuru May 2017 A1
20170163531 Kumar et al. Jun 2017 A1
20170171158 Hoy et al. Jun 2017 A1
20170195261 Choi Jul 2017 A1
20170264663 Bicket et al. Sep 2017 A1
20170339070 Chang et al. Nov 2017 A1
20180077027 VanderKwaak Mar 2018 A1
20180109606 Alpert et al. Apr 2018 A1
20180367364 Johansson Dec 2018 A1
Foreign Referenced Citations (13)
Number Date Country
101719930 Jun 2010 CN
101394360 Jul 2011 CN
102164091 Aug 2011 CN
104320342 Jan 2015 CN
105740084 Jul 2016 CN
2228719 Sep 2010 EP
2439637 Apr 2012 EP
2645253 Nov 2014 EP
10-2015-0070676 May 2015 KR
M394537 Dec 2010 TW
WO 2009155574 Dec 2009 WO
WO 2010030915 Mar 2010 WO
WO 2013158707 Oct 2013 WO
Non-Patent Literature Citations (69)
Entry
International Search Report and Written Opinion from the International Searching Authority, dated Nov. 29, 2018, 15 pages, for corresponding International Patent Application No. PCT/US2018/043400.
Kemper, Alfons, et al., “HyperQueries: Dynamic Distributed Query Processing on the Internet,” Proceedings of the 27th VLDB Conference, Sep. 14, 2001, 10 pages, Rome, Italy.
Amedro, Brian, et al., “An Efficient Framework for Running Applications on Clusters, Grids and Cloud,” 2010, 17 pages.
Author Unknown, “5 Benefits of a Storage Gateway in the Cloud,” Blog, TwinStrata, Inc., Jul. 25, 2012, XP055141645, 4 pages, https://web.archive.org/web/20120725092619/http://blog.twinstrata.com/2012/07/10//5-benefits-of-a-storage-gateway-in-the-cloud.
Author Unknown, “Joint Cisco and VMWare Solution for Optimizing Virtual Desktop Delivery: Data Center 3.0: Solutions to Accelerate Data Center Virtualization,” Cisco Systems, Inc. and VMware, Inc., Sep. 2008, 10 pages.
Author Unknown, “A Look at DeltaCloud: The Multi-Cloud API,” Feb. 17, 2012, 4 pages.
Author Unknown, “About Deltacloud,” Apache Software Foundation, Aug. 18, 2013, 1 page.
Author Unknown, “Architecture for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0102, Jun. 18, 2010, 57 pages.
Author Unknown, “Cloud Infrastructure Management Interface—Common Information Model (CIMI-CIM),” Document No. DSP0264, Version 1.0.0, Dec. 14, 2012, 21 pages.
Author Unknown, “Cloud Infrastructure Management Interface (CIMI) Primer,” Document No. DSP2027, Version 1.0.1, Sep. 12, 2012, 30 pages.
Author Unknown, “cloudControl Documentation,” Aug. 25, 2013, 14 pages.
Author Unknown, “Interoperable Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0101, Nov. 11, 2009, 21 pages.
Author Unknown, “Microsoft Cloud Edge Gateway (MCE) Series Appliance,” Iron Networks, Inc., 2014, 4 pages.
Author Unknown, “Open Data Center Alliance Usage: Virtual Machine (VM) Interoperability in a Hybrid Cloud Environment Rev. 1.2,” Open Data Center Alliance, Inc., 2013, 18 pages.
Author Unknown, “Real-Time Performance Monitoring on Juniper Networks Devices, Tips and Tools for Assessing and Analyzing Network Efficiency,” Juniper Networks, Inc., May 2010, 35 pages.
Author Unknown, “Use Cases and Interactions for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-ISO0103, Jun. 16, 2010, 75 pages.
Author Unknown, “Apache Ambari Meetup What's New,” Hortonworks Inc., Sep. 2013, 28 pages.
Author Unknown, “Introduction,” Apache Ambari project, Apache Software Foundation, 2014, 1 page.
Baker, F., “Requirements for IP Version 4 Routers,” Jun. 1995, 175 pages, Network Working Group, Cisco Systems.
Beyer, Steffen, “Module “Data::Locations?!”,” YAPC::Europe, London, UK,ICA, Sep. 22-24, 2000, XP002742700, 15 pages.
Blanchet, M., “A Flexible Method for Managing the Assignment of Bits of an IPv6 Address Block,” Apr. 2003, 8 pages, Network Working Group, Viagnie.
Borovick, Lucinda, et al., “Architecting the Network for the Cloud,” IDC White Paper, Jan. 2011, 8 pages.
Bosch, Greg, “Virtualization,” last modified Apr. 2012 by B. Davison, 33 pages.
Broadcasters Audience Research Board, “What's Next,” http://lwww.barb.co.uk/whats-next, accessed Jul. 22, 2015, 2 pages.
Cisco Systems, Inc. “Best Practices in Deploying Cisco Nexus 1000V Series Switches on Cisco UCS B and C Series Cisco UCS Manager Servers,” Cisco White Paper, Apr. 2011, 36 pages, http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9902/white paper c11-558242.pdf.
Cisco Systems, Inc., “Cisco Unified Network Services: Overcome Obstacles to Cloud-Ready Deployments,” Cisco White Paper, Jan. 2011, 6 pages.
Cisco Systems, Inc., “Cisco Intercloud Fabric: Hybrid Cloud with Choice, Consistency, Control and Compliance,” Dec. 10, 2014, 22 pages.
Cisco Technology, Inc., “Cisco Expands Videoscape TV Platform Into the Cloud,” Jan. 6, 2014, Las Vegas, Nevada, Press Release, 3 pages.
Citrix, “Citrix StoreFront 2.0” White Paper, Proof of Concept Implementation Guide, Citrix Systems, Inc., 2013, 48 pages.
Citrix, “CloudBridge for Microsoft Azure Deployment Guide,” 30 pages.
Citrix, “Deployment Practices and Guidelines for NetScaler 10.5 on Amazon Web Services,” White Paper, citrix.com, 2014, 14 pages.
CSS Corp, “Enterprise Cloud Gateway (ECG)—Policy driven framework for managing multi-cloud environments,” original published on or about Feb. 11, 2012; 1 page; http://www.css-cloud.com/platform/enterprise-cloud-gateway.php.
Fang K., “LISP MAC-EID-TO-RLOC Mapping (LISP based L2VPN),” Network Working Group, Internet Draft, CISCO Systems, Jan. 2012, 12 pages.
Ford, Bryan, et al., Peer-to-Peer Communication Across Network Address Translators, In USENIX Annual Technical Conference, 2005, pp. 179-192.
Gedymin, Adam, “Cloud Computing with an emphasis on Google App Engine,” Sep. 2011, 146 pages.
Good, Nathan A., “Use Apache Deltacloud to administer multiple instances with a single API,” Dec. 17, 2012, 7 pages.
Herry, William, “Keep It Simple, Stupid: OpenStack nova-scheduler and its algorithm”, May 12, 2012, IBM, 12 pages.
Hewlett-Packard Company, “Virtual context management on network devices”, Research Disclosure, vol. 564, No. 60, Apr. 1, 2011, Mason Publications, Hampshire, GB, Apr. 1, 2011, 524.
Juniper Networks, Inc., “Recreating Real Application Traffic in Junosphere Lab,” Solution Brief, Dec. 2011, 3 pages.
Kenhui, “Musings On Cloud Computing and IT-as-a-Service: [Updated for Havana] Openstack Computer for VSphere Admins, Part 2: Nova-Scheduler and DRS”, Jun. 26, 2013, Cloud Architect Musings, 12 pages.
Kolyshkin, Kirill, “Virtualization in Linux,” Sep. 1, 2006, XP055141648, 5 pages, https://web.archive.org/web/20070120205111/http://download.openvz.org/doc/openvz-intro.pdf.
Kumar, S., et al., “Infrastructure Service Forwarding For NSH,” Service Function Chaining Internet Draft, draft-kumar-sfc-nsh-forwarding-00, Dec. 5, 2015, 10 pages.
Kunz, Thomas, et al., “OmniCloud—The Secure and Flexible Use of Cloud Storage Services,” 2014, 30 pages.
Lerach, S.R.O., “Golem,” http://www.lerach.cz/en/products/golem, accessed Jul. 22, 2015, 2 pages.
Linthicum, David, “VM Import could be a game changer for hybrid clouds”, InfoWorld, Dec. 23, 2010, 4 pages.
Logan, Marcus, “Hybrid Cloud Application Architecture for Elastic Java-Based Web Applications,” F5 Deployment Guide Version 1.1, 2016, 65 pages.
Lynch, Sean, “Monitoring cache with Claspin” Facebook Engineering, Sep. 19, 2012, 5 pages.
Meireles, Fernando Miguel Dias, “Integrated Management of Cloud Computing Resources,” 2013-2014, 286 pages.
Meraki, “meraki releases industry's first cloud-managed routers,” Jan. 13, 2011, 2 pages.
Mu, Shuai, et al., “uLibCloud: Providing High Available and Uniform Accessing to Multiple Cloud Storages,” 2012 IEEE, 8 pages.
Naik, Vijay K., et al., “Harmony: A Desktop Grid for Delivering Enterprise Computations,” Grid Computing, 2003, Fourth International Workshop on Proceedings, Nov. 17, 2003, pp. 1-11.
Nair, Srijith K. et al., “Towards Secure Cloud Bursting, Brokerage and Aggregation,” 2012, 8 pages, www.flexiant.com.
Nielsen, “SimMetry Audience Measurement—Technology,” http://www.nielsen-admosphere.eu/products-and-services/simmetry-audience-measurement-technology/, accessed Jul. 22, 2015, 6 pages.
Nielsen, “Television,” http://www.nielsen.com/us/en/solutions/measurement/television.html, accessed Jul. 22, 2015, 4 pages.
Open Stack, “Filter Scheduler,” updated Dec. 17, 2017, 5 pages, accessed on Dec. 18, 2017, https://docs.openstack.org/nova/latest/user/filter-scheduler.html.
Quinn, P., et al., “Network Service Header,” Internet Engineering Task Force Draft, Jul. 3, 2014, 27 pages.
Quinn, P., et al., “Service Function Chaining (SFC) Architecture,” Network Working Group, Internet Draft, draft-quinn-sfc-arch-03.txt, Jan. 22, 2014, 21 pages.
Rabadan, J., et al., “Operational Aspects of Proxy-ARP/ND in EVPN Networks,” BESS Worksgroup Internet Draft, draft-snr-bess-evpn-proxy-arp-nd-02, Oct. 6, 2015, 22 pages.
Saidi, Ali, et al., “Performance Validation of Network-Intensive Workloads on a Full-System Simulator,” Interaction between Operating System and Computer Architecture Workshop, (IOSCA 2005), Austin, Texas, Oct. 2005, 10 pages.
Shunra, “Shunra for HP Software; Enabling Confidence in Application Performance Before Deployment,” 2010, 2 pages.
Son, Jungmin, “Automatic decision system for efficient resource selection and allocation in inter-clouds,” Jun. 2013, 35 pages.
Sun, Aobing, et al., “IaaS Public Cloud Computing Platform Scheduling Model and Optimization Analysis,” Int. J. Communications, Network and System Sciences, 2011, 4, 803-811, 9 pages.
Szymaniak, Michal, et al., “Latency-Driven Replica Placement”, vol. 47 No. 8, IPSJ Journal, Aug. 2006, 12 pages.
Toews, Everett, “Introduction to Apache jclouds,” Apr. 7, 2014, 23 pages.
Von Laszewski, Gregor, et al., “Design of a Dynamic Provisioning System for a Federated Cloud and Bare-metal Environment,” 2012, 8 pages.
Wikipedia, “Filter (software)”, Wikipedia, Feb. 8, 2014, 2 pages, https://en.wikipedia.org/w/index.php?title=Filter %28software%29&oldid=594544359.
Wikipedia; “Pipeline (Unix)”, Wikipedia, May 4, 2014, 4 pages, https://en.wikipedia.org/w/index/php?title=Pipeline2/028Unix%29&oldid=606980114.
Ye, Xianglong, et al., “A Novel Blocks Placement Strategy for Hadoop,” 2012 IEEE/ACTS 11th International Conference on Computer and Information Science, 2012 IEEE, 5 pages.
Extended European Search Report, dated Jun. 14, 2021, issued by the European Patent Office for corresponding EP Application No. 21163068.6, 9 pages.
Related Publications (1)
Number Date Country
20200204473 A1 Jun 2020 US
Continuations (1)
Number Date Country
Parent 15658215 Jul 2017 US
Child 16808768 US