Patent Grant
10705882
The present technology pertains to a system and method of determining a point of delivery (POD) device or network component for workload placement in a multi-cloud environment.
In multi-cloud environments that offer services such as server less computing services, data intensive workloads are often implemented over multiple devices, each located within a different cloud (that is possibly located in different geographical locations). Typically, there is a cost function (expressed either in terms of resource utilization and/or monetary value) associated with transitioning workloads from one network component in one cloud environment to another network component in another cloud environment. Accordingly, there is a need for optimizing workload placement across various clouds in order to minimize transit costs and provide optimal performance.
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:
Various examples 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.
References to one or an example embodiment in the present disclosure can be, but not necessarily are, references to the same example embodiment; and, such references mean at least one of the example embodiments.
Reference to “one example embodiment” or “an example embodiment” means that a particular feature, structure, or characteristic described in connection with the example embodiment is included in at least one example of the disclosure. The appearances of the phrase “in one example embodiment” in various places in the specification are not necessarily all referring to the same example embodiment, nor are separate or alternative example embodiments mutually exclusive of other example embodiments. Moreover, various features are described which may be exhibited by some example embodiments and not by others. Similarly, various features are described which may be features for some example embodiments but not other example embodiments.
The terms used in this specification generally have their ordinary meanings in the art, within the context of the disclosure, and in the specific context where each term is used. Alternative language and synonyms may be used for any one or more of the terms discussed herein, and no special significance should be placed upon whether or not a term is elaborated or discussed herein. Synonyms for certain terms are provided. A recital of one or more synonyms does not exclude the use of other synonyms. The use of examples anywhere in this specification including examples of any terms discussed herein is illustrative only, and is not intended to further limit the scope and meaning of the disclosure or of any exemplified term. Likewise, the disclosure is not limited to various examples given in this specification.
Without intent to limit the scope of the disclosure, examples of instruments, apparatus, methods and their related results according to examples of the present disclosure are given below. Note that titles or subtitles may be used in the examples for convenience of a reader, which in no way should limit the scope of the disclosure. Unless otherwise defined, technical and scientific terms used herein have the meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. In the case of conflict, the present document, including definitions will control.
Although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and similarly, a second element could be termed a first element, without departing from the scope of this disclosure. As used herein, the term “and/or,” includes any and all combinations of one or more of the associated listed items.
When an element is referred to as being “connected.” or “coupled,” to another element, it can be directly connected or coupled to the other element or intervening elements may be present. By contrast, when an element is referred to as being “directly connected.” or “directly coupled,” to another element, there are no intervening elements present. Other words used to describe the relationship between elements should be interpreted in a like fashion (e.g., “between,” versus “directly between,” “adjacent.” versus “directly adjacent,” etc.).
The terminology used herein is for the purpose of describing particular examples only and is not intended to be limiting. As used herein, the singular forms “a”, “an”, and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”. “comprising,”. “includes” and/or “including”, when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It should also be noted that in some alternative implementations, the functions/acts noted may occur out of the order noted in the figures. For example, two figures shown in succession may in fact be executed substantially concurrently or may sometimes be executed in the reverse order, depending upon the functionality/acts involved.
Specific details are provided in the following description to provide a thorough understanding of examples. However, it will be understood by one of ordinary skill in the art that examples may be practiced without these specific details. For example, systems may be shown in block diagrams so as not to obscure the examples in unnecessary detail. In other instances, well-known processes, structures and techniques may be shown without unnecessary detail in order to avoid obscuring examples.
In the following description, illustrative examples will be described with reference to acts and symbolic representations of operations (e.g., in the form of flow charts, flow diagrams, data flow diagrams, structure diagrams, block diagrams, etc.) that may be implemented as program services or functional processes include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types and may be implemented using hardware at network elements. Non-limiting examples of such hardware may include one or more Central Processing Units (CPUs), digital signal processors (DSPs), application-specific-integrated-circuits, field programmable gate arrays (FPGAs) computers or the like.
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.
In one aspect of the present disclosure, a computer-implemented method for selecting a network node to implement a network function includes determining a first amount of data for transitioning from performing a first function on input data to performing a second function on a first outcome of the first function; determining a second amount of data for transitioning from performing the second function on the first outcome to performing a third function on a second outcome of the second function; determining a processing capacity for each of one or more network nodes on which the first function and the third function are implemented; and selecting the network node for implementing the second function based on the first amount of data, the second amount of data, and the processing capacity for each of the network nodes.
In one aspect of the present disclosure, a system for selecting a network node to implement a network function includes memory configured to store computer-readable instructions therein and one or more processors configured to execute the computer-readable instructions to perform functions including determining a first amount of data for transitioning from performing a first function on input data to performing a second function on a first outcome of the first function; determining a second amount of data for transitioning from performing the second function on the first outcome to performing a third function on a second outcome of the second function: determining a processing capacity for each of one or more network nodes on which the first function and the third function are implemented; and selecting the network node for implementing the second function based on the first amount of data, the second amount of data, and the processing capacity for each of the network nodes.
In one aspect of the present disclosure, one or more non-transitory computer-readable medium have computer-readable instructions stored therein, which when executed by one or more processors, cause the one or more processors to select a network node for implementing a network function by performing the functions of determining a first amount of data for transitioning from performing a first function on input data to performing a second function on a first outcome of the first function; determining a second amount of data for transitioning from performing the second function on the first outcome to performing a third function on a second outcome of the second function; determining a processing capacity for each of one or more network nodes on which the first function and the third function are implemented; and selecting the network node for implementing the second function based on the first amount of data, the second amount of data, and the processing capacity for each of the network nodes.
The disclosed technology addresses the need in the art for determining a proper placement of workloads (resources) across network components corresponding to different clouds in order to increase efficiency and processing speed of underlying workloads as well as to reduce various costs associated with inter-cloud migration/transition/transfer of workloads and associated data.
The disclosure begins with a description of example network environments and architectures which can be implemented for distributed streaming systems, as illustrated in
The disclosure begins with a description of example network environments and architectures, as illustrated in
Transceiver 108 can be any known or to be developed receiver and transmitter through which controller 102 can send and receive information to and from external components such as components of distributed streaming system 120.
Network operators and controllers (operational management component) can use display 110 to view data corresponding to status and/or management of operation of distributed streaming system 120, as will be described below. Display 110 can be any type of know or to be developed display such as a liquid crystal display (LCD), a light emitting diode display (LED), etc.
Input device 112 can be any known or to be developed input device including, but not limited to, a keyboard, a touch-based input device, etc. In one example, display 110 and input device 112 can be the same when display 110 is a touch enabled device capable of receiving inputs. Network managers and operators can provide appropriate commands for monitoring and management of distributed streaming system 120, via input device 112.
Controller 102 can communicate with various components of distributed streaming system 120 via any known or to be developed wireless communications and/or wired communications mean. For example, controller 102 can access and obtain information (and/or send information) to each component of distributed streaming system 120 via a network such as a local area wireless network (LAN), a virtual local area network (vLAN) and/or any other type of, known or to be developed, network through which controller 102 can communicate with each component of distributed streaming system 120.
In one aspect, controller 102 can be any known or to be developed electronic device including, but not limited to, a laptop, a desktop computer, a mobile device, a handheld device, etc.
Distributed streaming system 120 can be any known, or to be developed, distributed streaming system where various components thereof such as components 122-1, 122-2, 122-3 and 122-4 communicate with one another to provide a streaming service to users in a distributed fashion. Hereinafter, components 122-1, 122-2, 122-3 and 122-4 may simply be referred to as components 122 or nodes 122. While throughout the present disclosure, distributed streaming system 120 is provided as an example, the present disclosure is not limited thereto and can encompass and be applicable to any distributed systems that can be abstracted into a Directed Acyclic Graph (DAG) where each vertex can denote an information/message, and information/messages are passed through edges in certain directions. Other examples of distributed systems include a distributed sensor network where signals are propagated from sensor to sensor, a multi-component data processing system where each component receives and processes chunks of data and pass it to the next component(s).
Each one of components 122 can be any know or to be developed electronic device capable of communicating remotely with other devices such as other components 122. For example, each component 122 can be a mobile device, a laptop, a desktop computer, a switch, a data center comprising one or more servers, etc. For example, while some of components 122 can be end user devices or hosts, other ones of components 122 can be servers that facilitate the streaming services provided by distributed streaming system 120.
Furthermore, distributed streaming system 120 can have a server 114 acting as a collector of information (data) for other components (end user devices) in the system. Examples of data include device metrics such as device ID, an associated timestamp, device IP address, device throughput, device latency, memory and processing speed characteristics, etc.
In one example, system 100 further includes one or more feedback servers 116, where various types of data (to be used by controller 102) on components 122 can be collected and saved. In another example, system 100 does not include any feedback servers and instead can directly receive (through push or pull operations) the intended data (which will be described below) from each component 122.
While certain components are illustrated as part of system 100, system 100 is not limited thereto and may include any other type of component (e.g., additional servers, access points, sensors, etc.) for providing services to clients and end users.
Distributed streaming system 120 can be a cloud based system, where each component thereof is located in a different geographical location but can communicate with one another to form distributed streaming system 120 (e.g., over the Internet).
Examples of streaming services provided via distributed streaming system 120 can include, but is not limited to, live video and/or audio content such as a speech, a concert, a TV program, music, etc. These examples, along with many other examples, such as signal image and video processing applications and services can be referred to data-intensive services or workloads.
Operations of distributed streaming system 120 for delivering a streaming service to end users can be based on any know or to be developed method for doing so, by for example, continuously processing a stream of text, graphs, videos, audios, time series data, etc. in real time or near real time or periodically. The system 100 of
The cloud 132 can provide various cloud computing services via the cloud elements 134-144, such as software as a service (SaaS) (e.g., collaboration services, email services, enterprise resource planning services, content services, communication services, etc.), infrastructure as a service (IaaS) (e.g., security services, networking services, systems management services, etc.), platform as a service (PaaS) (e.g., web services, streaming services, application development services, etc.), function as a service (FaaS), and other types of services such as desktop as a service (DaaS), information technology management as a service (ITaaS), managed software as a service (MSaaS), mobile backend as a service (MBaaS), etc.
The client endpoints 146 can connect with the cloud 132 to obtain one or more specific services from the cloud 132. The client endpoints 146 can communicate with elements 134-144 via one or more public networks (e.g., Internet), private networks, and/or hybrid networks (e.g., virtual private network). The client endpoints 146 can include any device with networking capabilities, such as a laptop computer, a tablet computer, a server, a desktop computer, a smartphone, a network device (e.g., an access point, a router, a switch, etc.), a smart television, a smart car, a sensor, a GPS device, a game system, a smart wearable object (e.g., smartwatch, etc.), a consumer object (e.g., Internet refrigerator, smart lighting system, etc.), a city or transportation system (e.g., traffic control, toll collection system, etc.), an internet of things (IoT) device, a camera, a network printer, a transportation system (e.g., airplane, train, motorcycle, boat, etc.), or any smart or connected object (e.g., smart home, smart building, smart retail, smart glasses, etc.), and so forth.
In one example, one or more servers 134 can implement the functionalities of controller 102, which will be described below. Alternatively, controller 102 can be a separate component that communicates with components of the fog computing architecture 150 that function as a distributed streaming system similar to the distributed streaming system 120.
The fog layer 156 or “the fog” provides the computation, storage and networking capabilities of traditional cloud networks, but closer to the endpoints. The fog can thus extend the cloud 132 to be closer to the client endpoints 146. The fog nodes 162 can be the physical implementation of fog networks. Moreover, the fog nodes 162 can provide local or regional services and/or connectivity to the client endpoints 146. As a result, traffic and/or data can be offloaded from the cloud 132 to the fog layer 156 (e.g., via fog nodes 162). The fog layer 156 can thus provide faster services and/or connectivity to the client endpoints 146, with lower latency, as well as other advantages such as security benefits from keeping the data inside the local or regional network(s).
The fog nodes 162 can include any networked computing devices, such as servers, switches, routers, controllers, cameras, access points, kiosks, gateways, etc. Moreover, the fog nodes 162 can be deployed anywhere with a network connection, such as a factory floor, a power pole, alongside a railway track, in a vehicle, on an oil rig, in an airport, on an aircraft, in a shopping center, in a hospital, in a park, in a parking garage, in a library, etc.
In some configurations, one or more fog nodes 162 can be deployed within fog instances 158, 160. The fog instances 158 and 160 can be local or regional clouds or networks. For example, the fog instances 158 and 160 can be a regional cloud or data center, a local area network, a network of fog nodes 162, etc. In some configurations, one or more fog nodes 162 can be deployed within a network, or as standalone or individual nodes, for example. Moreover, one or more of the fog nodes 162 can be interconnected with each other via links 164 in various topologies, including star, ring, mesh or hierarchical arrangements, for example.
In some cases, one or more fog nodes 162 can be mobile fog nodes. The mobile fog nodes can move to different geographic locations, logical locations or networks, and/or fog instances while maintaining connectivity with the cloud layer 154 and/or the endpoints 146. For example, a particular fog node can be placed in a vehicle, such as an aircraft or train, which can travel from one geographic location and/or logical location to a different geographic location and/or logical location. In this example, the particular fog node may connect to a particular physical and/or logical connection point with the cloud layer 154 while located at the starting location and switch to a different physical and/or logical connection point with the cloud layer 154 while located at the destination location. The particular fog node can thus move within particular clouds and/or fog instances and, therefore, serve endpoints from different locations at different times.
Spine switches 184 connect to leaf switches 186 in the fabric 182. Leaf switches 186 can include access ports (or non-fabric ports) and fabric ports. Fabric ports can provide uplinks to the spine switches 182, while access ports can provide connectivity for devices, hosts, endpoints. VMs, or external networks to the fabric 182.
Leaf switches 186 can reside at the boundary between the fabric 182 and the tenant or customer space. The leaf switches 186 can route and/or bridge the tenant packets and apply network policies. In some cases, a leaf switch can perform one or more additional functions, such as implementing a mapping cache, sending packets to the proxy function when there is a miss in the cache, encapsulate packets, enforce ingress or egress policies, etc.
Moreover, the leaf switches 186 can contain virtual switching and/or tunneling functionalities, such as a virtual tunnel endpoint (VTEP) function. Thus, leaf switches 186 can connect the fabric 182 to an overlay (e.g., VXLAN network).
Network connectivity in the fabric 182 can flow through the leaf switches 186. The leaf switches 186 can provide servers, resources, endpoints, external networks, containers, or VMs access to the fabric 182, and can connect the leaf switches 186 to each other. The leaf switches 186 can connect applications and/or endpoint groups (“EPGs”) to other resources inside or outside of the fabric 182 as well as any external networks.
Endpoints 192A-D (collectively “endpoints 192”) can connect to the fabric 182 via leaf switches 186. For example, endpoints 192A and 192B can connect directly to leaf switch 186A, which can connect endpoints 192A and 192B to the fabric 182 and/or any other of the leaf switches 186. Similarly, controller 102 (which can be the same as controller 102 described above with reference to
Endpoints 192 can include any communication device or resource, such as a computer, a server, a cluster, a switch, a container, a VM, a virtual application, etc. In some cases, the endpoints 192 can include a server or switch configured with a virtual tunnel endpoint functionality which connects an overlay network with the fabric 182. For example, in some cases, the endpoints 192 can represent hosts (e.g., servers) with virtual tunnel endpoint capabilities, and running virtual environments (e.g., hypervisor, virtual machine(s), containers, etc.). An overlay network associated with the endpoints 192 can host physical devices, such as servers; applications: EPGs; virtual segments; virtual workloads; etc. Likewise, endpoints 192 can also host virtual workloads and applications, which can connect with the fabric 182 or any other device or network, including an external network.
Furthermore, each one of first cloud environment 205, second cloud environment 210 and third cloud environment 215 can be located in a separate geographical location and/or operated by a different cloud service provider.
Client endpoints 146 are the same as those described above with reference to
As will be described below, various application processes and services to be provided as part of a workload requested by a client endpoint and/or other cloud network components can be provided by components in the same one of first cloud environment 205, second cloud environment 210 and third cloud environment 215 or by different components located in different ones of first cloud environment 205, second cloud environment 210 and third cloud environment 215. Accordingly, there is a need to determine, when going from one process (function) on the underlying data to the next as part of a requested service or workload, which cloud environment (network component on such cloud environment) to perform the next function or process on such that costs associated with transition/migration of data from one network component to the next over multiple cloud environments is reduced/minimized. This will be further described with reference to
In one example and while not shown in
While
Interfaces 302 are typically provided as modular interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with network device 300. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces may be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POS interfaces, FDDI interfaces. WIFI interfaces, 3G/4G/5G cellular interfaces. CAN BUS, LoRA, and the like. Generally, these interfaces may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control, signal processing, crypto processing, and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 304 to efficiently perform routing computations, network diagnostics, security functions, etc.
Although the system shown in
Regardless of the network device's configuration, it may employ one or more memories or memory modules (including memory 306) configured to store program instructions for the general-purpose network operations and mechanisms for roaming, route optimization and routing functions described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store tables such as mobility binding, registration, and association tables, etc. Memory 306 could also hold various software containers and virtualized execution environments and data.
Network device 300 can also include an application-specific integrated circuit (ASIC), which can be configured to perform routing and/or switching operations. The ASIC can communicate with other components in network device 300 via bus 310, to exchange data and signals and coordinate various types of operations by network device 300, such as routing, switching, and/or data storage operations, for example.
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 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 may easily be substituted for improved hardware or firmware arrangements as they are developed.
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 services 432, 434, 436 for controlling the processor 410. Other hardware or software modules are contemplated. The storage device 430 can be connected to the connector 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, connector 405, output device 435, and so forth, to carry out the function.
As indicated above, for data-intensive workloads (e.g., a log processing workload), there may be several functions to be performed on the underlying data. For instance, in the log processing workload, a first function can be performed (implemented, carried out, etc.) that receives machine logs and converts them to a certain format. The first function can be referred to as the conversion function. A second function can be performed for analyzing the converted machine logs, where the analysis can include filtering, pattern recognition, etc. The second function can be referred to as the analysis function. A third function can be performed for outputting and storing the analyzed machine logs. The third function can be referred to as the output or storing function.
In one scenario, the first function is performed in cloud environment 205 (or alternatively in one of cloud environments 210 and cloud environments 215) of
In one example, performing a function at a particular cloud environment is meant to include performing the function at a network node that is part of the particular cloud environment.
Hereinafter, a process for workload placement in a multi-cloud environment is described with reference to
At S500, controller 102 receives an indication of incoming data (e.g., underlying data) on which a particular set of functions are to be implemented. For example, controller 102 receives an indication from a data source indicating that incoming data is to be sent to a source function (e.g., the conversion function of the example described above) for processing. The data source can be communicatively coupled to the network node on which the source function is implemented and can be, for example, a database, a network gateway, a data stream pipeline, one or more client endpoints (e.g., client endpoints 146), etc. In another example, controller 102 can receive the indication from the network node on which the source function is implemented, where the network node sends the indication indicating the incoming data is received at the network node from a data source.
This data can also be referred to as workload data. The workload data can be, for example, machine logs of the example described above.
At S502, controller 102 identifies the functions to be performed on the workload data. These functions can be, for example, the conversion function, the analysis function and the output or storing function of the example described above. Hereinafter, the first function is also referred to as a source function (Sc), the second function is also referred to as an intermediate function (f(x)) and the third function is also referred to as the sink function (Si).
At S504, controller 102 configures the data source to send the workload data of S500 to a cloud environment (e.g., a network node in a cloud environment) for performing the first function thereon. For example, if the first function is to be implemented by an application 140 in cloud environment 205, then controller 102 can send a command to the data source directing the data source to send the workload data of S500 to cloud environment 205 and more particularly to a server 134 of cloud environment 205 that implements the application 140.
Upon performance of the first function on the workload data, at S504, controller 102 determines an average amount of data traffic between the first function and the second function (between the source function and the intermediate function). This average amount of data traffic can be referred to as the first amount of data.
In one example, the first amount of data between the source function Sc and intermediate function fix) is represented as w(Sc,f(x)). The value of the first amount of data can be represented in terms of messages per second, for example. Controller 102 determines the first amount of data according to any known, or to be developed method.
At S508, controller 102 determines an average amount of data traffic between the second function and the third function (between the intermediate function and the sink function). This average amount of data traffic can be referred to as the second amount of data.
In one example, the second amount of data between the intermediate function f(x) and sink function Si is represented as w(f(x),Si). The value of the second amount of data can be represented in terms of messages per second, for example. Controller 102 determines the second amount of data according to any known, or to be developed method.
At S510, controller 102 determines whether the first function Sc and the third function Si are in the same cloud environment (e.g., are performed at network node(s) belonging to the same one of cloud environments 205, 210 or 215).
If at S510, controller 102 determines that the first function Sc and the third function Si are in the same cloud environment, then at S512, controller 102 determines a capacity of the same cloud environment on which the first function Sc and the third function Si are implemented. The capacity can be a processing capacity of the cloud environment (or that of corresponding network node(s) of the same cloud environment). This capacity can be represented at CR_k, where k is an index identifying a particular cloud environment (e.g., k can be 205, 210 and 215 corresponding to one of cloud environments 205, 210 and 215 of
At S514, controller 102 determines whether CR_k is equal to or greater than a minimum of the first amount of data w(Sr,f(x)) and second amount of data w(f(x),Si). In one example, the requirement of CR_k being equal to or greater than the minimum of the first amount of data and the second amount of data ensures that functions are executed such that a particular service level agreement (SLA) between the cloud provider and the corresponding client for which the workload process is being carried out, is satisfied.
If at S514, controller 102 determines that CR_k is equal to or greater than a minimum of the first amount of data and the second amount of data, then at S516, controller 102 determines that the intermediate function (second function f(x)) is to be performed/implemented on the same cloud environment (e.g., one of cloud environments 205, 210 and 215) as the one on which the source function Sc and the sink function Si are implemented. Thereafter, the process proceeds to S532 and S534 as will be further described below.
However, if at S514, controller 102 determines that CR_k is less than the minimum of the first amount of data and the second amount of data, then at S518, controller 102 selects another cloud environment for implemented the second function on. This selected cloud environment can also be referred to as a selected Point of Delivery (POD). In one example, the cloud environment selected at S518 is a cloud environment that satisfied two conditions. The first condition is that a corresponding CR_k of the selected cloud environment is equal to or greater than a minimum of the first amount of data and the second amount data. The second condition is that a cost (a sum of costs, a total cost, etc.) of migrating (transitioning) the output of the first function (outcome of the first function) from a cloud environment on which the first function is implemented (C_Sc) to the selected cloud environment on which the second function is to be implemented (C_f(x)) (where the cost function can be represented as C(C_Sc, C_f(x)) and a cost of migrating (transitioning) the output of the second function (outcome of the second function) from the cloud environment on which the second function is implemented (C_f(x)) to a cloud environment on which the third function (C_Si) is implemented (where the cost function can be represented as C(C_f(x), C_Si), are minimized among all costs associated with migrating the output of the first function from C_Sc and (in addition to) the output of the second function from C_f(x), respectively, to any other cloud environment on which the first function (Source function) and/or second function (intermediate function) are to be implemented. Thereafter, the process proceeds to S532 and S534 as will be further described below.
Referring back to S510, if controller 102 determines that the first function (source function Sc) and the third function (sink function Si) are not implemented on the same cloud environment, then at S520, controller 102 determines the CR_Sc and CR_Si in a same manner as described above with respect to S512.
Thereafter, at S522, controller 102 determines if CR_Sc is equal to or greater than a minimum of the first amount of data and the second amount of data. If at S522, controller 102 determines that CR_Sc is equal to or greater than the minimum of the first amount of data and the second amount of data, then at S524, controller 102 selects the same cloud environment as the one on which the source function Sc is implemented (source function cloud environment) for implementing the intermediate function f(x). Thereafter, the process proceeds to S532 and S534 as will be further described below.
However, if at S522, controller 102 determines that CR_Sc is less than a minimum of the first amount of data and the second amount of data, then at S526, controller 102 determines if the processing capacity of the cloud environment on which the sink function is implemented (CR_Si) is equal to or greater than a minimum of the first amount of data and the second amount of data.
If at S526, controller 102 determines that CR_Si is equal to or greater than the minimum of the first amount of data and the second amount of data, then at S528, selects the same cloud environment as the one on which the source function Sc is implemented (sink function cloud environment) for implementing the intermediate function f(x). Thereafter, the process proceeds to S532 and S534 as will be further described below.
However, if at S526, controller 102 determines that CR_Si is less than the minimum of the first amount of data and the second amount of data, then at S530, controller 102 selects another cloud environment for implemented the second function on in a same manner as in S518 described above. This selected cloud environment can also be referred to as a selected Point of Delivery (POD). In one example, the cloud environment selected at S530 is a cloud environment that satisfied two conditions. The first condition is that a corresponding CR_k of the selected cloud environment is equal to or greater than a minimum of the first amount of data and the second amount data. The second condition is that a cost of migrating the output of the first function (out of the first function) from a cloud environment on which the first function is implemented (C_Sc) to the selected cloud environment on which the second function is to be implemented (C_f(x)) (where the cost function can be represented as C(C_Si, C_f(x)), is minimized among all costs associated with migrating the output of the first function from C_Sc to any other cloud environment on which the second function is to be implemented. Thereafter, the process proceeds to S532 and S534 as will be further described below.
At S532 and upon selecting the appropriate cloud environment for implementing the intermediate function on (selected POD), controller 102 configures the source function (e.g., sends a command to a network node on which the source function is implemented) to send the outcome (output) of the first function to the selected appropriate cloud environment for implementing the intermediate function thereon (which may or may not be the same as the cloud environment on which the source function is performed).
Upon implementation of the intermediate function on the outcome of the first function, at S534, controller 102 configures the intermediate function (e.g., sends a command to a network node on which the intermediate function is implemented) to send the outcome (output) of the intermediate function to a cloud environment on which the sink function is performed (which may or may not be the same as the cloud environment on which the intermediate function is performed). Thereafter, the process ends.
It can be appreciated that while
Having described a process of selecting a cloud environment for workload placement, there can be instances where the functions (e.g., source, intermediate and sink functions) are to be performed to a tuple of data at a particular point in time (predetermined point of time or simply predetermined time).
For instance, taking back up searches as a particular example of a workload (which can have several functions performed as part of the entire process), the functions can be scheduled for performance every 12 hours, once every 24 hours, etc.
However, if controller 102 waits until all workload data is received up to the particular point in time before implementing the functions thereon, there can be high data traffic involved, which makes the application of the process of
Accordingly, the present disclosure includes a process at which the functions (e.g., functions of backup searches) are implemented on received workload data at designated points of time (plurality of target times) between the start of receiving workload data and the predetermined point of time. In the example of backup searches, these designated points in time can be every 3 hours between 12:00 AM to 11:59 PM or every 6 hours between 12:00 AM to 11:59 AM, etc.
In accordance with this process, the result of implementing the functions at each designated point in time is temporarily saved. Upon reaching the predetermined point in time, a determination is made as to whether the data has changed or not. If the data is changed, the temporarily stored results can be discarded and the functions can be performed on the entirety of the workload data received up to the predetermined point in time. However, if the workload data is unchanged, only the unprocessed portion of the workload data can be processed by the functions at the predetermined point of time, the result of which is augmented by the temporary stored results at designated points of time. This piecemeal implementation of the functions for a particular workload can reduce the amount of data traffic and better performance of cloud environment selection process of
At S600, controller 102 receives an indication of incoming workload data (or portions thereof) in a similar manner as described above with reference to S500. In one example, the workload data is defined as a batch represented by D(t)=[d-0, d-1, d-2, . . . , d-t], where each of 0, 1, 2, . . . , t, represent a designated point of time. In one example, “T” can represent the predetermined period of time, described above. Accordingly, d-0 is a chunk of the workload data received up to the first designated point of time 0, d-1 is a chunk of data received between the first designated point of time 0 and the second designated period of time 1, etc. d-0, d-1, d-2 to d-t can be referred to as plurality of data segments.
At S602, controller 102 determines if a designated point of time such as one of designated points of time 0, 1, 2, etc., is reached. If controller 102 determines that a designated point of time is not reached, the process reverts back to S600 and controller 102 continues to receive workload data until a designated point of time is reached.
If at S602, controller 102 determines that the designated point of time is reached, then at S604, controller 102 implements the process of
Thereafter, at S606, controller 102 temporary stores (in an associated memory) the result of implementing the functions of the chunk of data corresponding to the reached designated point in time (e.g., the result of implementing the functions on d-0). This temporary stored result can be represented y′.
In one example, every time controller 102 repeats S602 to S606, controller 102 updates y′ with new results of implementing the functions on the latest chunks of workload data.
At S608, controller 102 determines if the predetermined point of time is reached. This can be, for example, the time T (e.g., performed search backups every 12 hours, once every 24 hours, etc., as described above). If controller 102 determines that the predetermined point of time is not reached at S608, then the process reverts back to S600 and controller 102 repeats S600 to S608.
However, if at S608, controller 102 determines that the predetermined point of time is reached, then at S610, controller 102 determines if workload data is changed. In one example, if the workload data at the predetermined period of time T (d-T) is a concatenation of all received data chunks (i.e., D(T)=[D(t), [d-t+1, d-t+2, . . . , d-T]]), then controller 102 determines that workload data is not changed. Otherwise, controller 102 determines that workload data is changed at the predetermined point of time.
If at S608, controller 102 determines that the workload data is not changed, then at S612 controller 102 implements the process of
Thereafter at S614, controller 102 combines y′ (temporarily stored results at S606) and y to output (and/or optionally store) the result of implementing the functions on all of the plurality of data chunks. Thereafter the process ends or alternatively reverts back to S600, where controller 102 repeats the process of
However, if at S608, controller 102 determines that the workload data is changed, then at S616 controller 102 discards y′ (the temporarily stored results of S606). Then at S618, controller 102 implements the process of
Thereafter, at S620, controller 102 outputs the result of implementing the functions on entirety of the workload data. Thereafter the process ends or alternatively reverts back to S600, where controller 102 repeats the process of
Examples described above with reference to the accompanying figures provide an improvement to one or more aspects of existing methods and systems for optimizing placement of workloads across multiple clouds (a network of distributed cloud environments). Such optimization plays an important role in the technological field of modern software services, many components of which have complex dependencies and operate in real-time and in a distributed fashion. It is an important factor for any network operator using these services to optimize the usage of available network resources and reduce the associated costs in order to provide their customers with better and more efficient services. For example, there are costs associated with performing certain functions at certain locations within a cloud network and/or migrating underlying processed (or to be processed data) from one cloud environment to another, as described above. A blind (random) selection of a cloud environment for implementing a network function on the underlying data can increase a network operator's resource consumption and/or cost. Therefore, it is important to provide a method, as described above, for determining a cloud environment for implementing a network function on the underlying data, which improves network resource consumption and reduces associated costs for network operators.
For clarity of explanation, in some instances the present technology may 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 embodiments 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 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.
Claim language reciting “at least one of” refers to at least one of a set and 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 and B” means A. B, or A and B.
| 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 |
| 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 |
| 7970905 | Baskaran et al. | Jun 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 |
| 9361192 | Smith et al. | Jun 2016 | B2 |
| 9379982 | Krishna et al. | Jun 2016 | B1 |
| 9380075 | He et al. | Jun 2016 | B2 |
| 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 |
| 9626208 | Cao 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 |
| 9705778 | Bragstad et al. | Jul 2017 | B2 |
| 9755858 | Bagepalli et al. | Sep 2017 | B2 |
| 20010055303 | Horton et al. | Dec 2001 | A1 |
| 20020073337 | Ioele et al. | Jun 2002 | A1 |
| 20020143928 | Maltz et al. | Oct 2002 | A1 |
| 20020166117 | Abrams et al. | Nov 2002 | A1 |
| 20020174216 | Shorey et al. | Nov 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 20130219405 | Lee et al. | 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 |
| 20140229221 | Shih 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 | Sorenson, III et al. | Oct 2014 | A1 |
| 20140310417 | Sorenson, III et al. | Oct 2014 | A1 |
| 20140310418 | Sorenson, 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 |
| 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 |
| 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 |
| 20150143366 | Suragi Math | 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 |
| 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 Roche, Jr. et al. | Dec 2015 | A1 |
| 20150365324 | Kumar 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 |
| 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 |
| 20170054659 | Ergin et al. | Feb 2017 | A1 |
| 20170093639 | Dabbagh | Mar 2017 | A1 |
| 20170097841 | Chang et al. | Apr 2017 | A1 |
| 20170099188 | Chang et al. | Apr 2017 | A1 |
| 20170104755 | Arregoces et al. | Apr 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 |
| 20170220365 | Dow | Aug 2017 | A1 |
| 20170264663 | Bicket et al. | Sep 2017 | A1 |
| 20170339070 | Chang et al. | Nov 2017 | A1 |
| 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 |
| Entry |
|---|
| International Search Report and Written Opinion from the International Searching Authority, dated May 17, 2019, 11 pages, for corresponding International Patent Application No. PCT/US2018/066469. |
| 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. |
| Number | Date | Country | |
|---|---|---|---|
| 20190196879 A1 | Jun 2019 | US |
