Cloud resource placement optimization and migration execution in federated clouds

Information

  • Patent Grant
  • 10205677
  • Patent Number
    10,205,677
  • Date Filed
    Tuesday, November 24, 2015
    8 years ago
  • Date Issued
    Tuesday, February 12, 2019
    5 years ago
Abstract
The present disclosure describes a method for cloud resource placement optimization. A resources monitor monitors state information associated with cloud resources and physical hosts in the federated cloud having a plurality of clouds managed by a plurality of cloud providers. A rebalance trigger triggers a rebalancing request to initiate cloud resource placement optimization based on one or more conditions. A cloud resource placement optimizer determines an optimized placement of cloud resources on physical hosts across the plurality of clouds in the federated cloud based on (1) costs including migration costs, (2) the state information, and (3) constraints, wherein each physical host is identified in the constraints-driven optimization solver by an identifier of a respective cloud provider and an identifier of the physical host. A migrations enforcer determines an ordered migration plan and transmits requests to place or migrate cloud resources according to the ordered migration plan.
Description
TECHNICAL FIELD

This disclosure relates in general to the field of computing and, more particularly, to cloud resource placement optimization and migration execution in federated clouds.


BACKGROUND

Cloud computing allows cloud providers to pool a collection of physical computing devices and enables the pool of computing devices to be shared and used on demand by a plurality of tenants. Clouds can provide Infrastructure as a Service (IaaS), where virtual resources are provided in the cloud and made accessible to tenants as a service. Tenants, such as users and enterprises, can access virtual machines, virtual storage volumes, and even run applications on demand in the cloud. Cloud providers incur significant capital expenses and operating expenses when implementing and maintaining the pool of resources. Tenants and cloud providers often have high demands for performance. Accordingly, cloud providers are always looking for ways to improve the efficiency and performance of the cloud so that resources are used efficiently and in a cost-effective manner.





BRIEF DESCRIPTION OF THE DRAWINGS

To provide a more complete understanding of the present disclosure and features and advantages thereof, reference is made to the following description, taken in conjunction with the accompanying figures, wherein like reference numerals represent like parts, in which:



FIG. 1 shows an exemplary cloud resource placement and rebalancing system for a federated cloud and an illustrative federated cloud, according to some embodiments of the disclosure;



FIG. 2 is a flow diagram illustrating a method for cloud resource placement and migration optimization for a federated cloud, according to some embodiments of the disclosure;



FIG. 3 is an illustration of federated cloud resource placement and rebalancing data flow, according to some embodiments of the disclosure;



FIG. 4 shows initial virtual machine placements, according to some embodiments of the disclosure;



FIG. 5 shows desired virtual machine placements, according to some embodiments of the disclosure;



FIG. 6 shows resource requirements associated with the virtual machines, according to some embodiments of the disclosure;



FIG. 7 shows host capacities associated with physical hosts, according to some embodiments of the disclosure;



FIGS. 8-10 illustrate an example implementing a backtracking-based method for determining a sequence of migrations, according to some embodiments of the disclosure; and



FIG. 11 shows an aggregated physical host in a federated cloud, according to some embodiments of the disclosure.





DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS

Overview


The present disclosure describes, among other things, a method for cloud resource placement and migration optimization for a federated cloud. A resources monitor monitors state information associated with cloud resources and physical hosts in the federated cloud having a plurality of clouds managed by a plurality of cloud providers. A rebalance trigger triggers, based on one or more conditions, a rebalancing request to initiate cloud resource placement optimization. A constraints-driven optimization cloud resource placement solver (or a cloud resource placement optimizer) determines an optimized placement of cloud resources on physical hosts across the plurality of clouds in the federated cloud based on (1) costs including migration costs, (2) the state information, and (3) constraints, wherein each physical host is identified in the constraints-driven optimization solver by an identifier of a respective cloud provider and an identifier of the physical host. A migrations enforcer determines an ordered migration plan for the optimized placement of cloud resources based on the optimized placement of cloud resources and the state information, and transmits one or more requests to place or migrate cloud resources in the plurality of clouds in the federated cloud according to the ordered migration plan. The identification mechanism for each physical host allows a global optimization solution to be determined and executed across different cloud providers.


According to one aspect, monitoring the state information in the federated cloud comprises normalizing different types of state information associated with different cloud providers to a common schema.


According to one aspect, monitoring the state information in the federated clouds comprises receiving state information from respective agents deployed in respective clouds in the federated cloud.


According to one aspect, state information comprises one or more of the following: current placements of cloud resources to physical hosts; number of cloud resources; resource requirements of cloud resources; number of workloads; number of physical hosts; capacities of physical hosts; one or more events occurred in the federated cloud; one or more alarms in the federated cloud; one or more metrics associated with application(s) running on the federated cloud; one or more metrics associated with physical hosts in the federated cloud; and one or more metrics associated with network resources in the federated cloud.


According to one aspect, state information associated with resources in the federated cloud comprises time-series information.


According to one aspect, the resources monitor can apply a predictive model on the time-series information to determine predicted state information. The one or more conditions can include the predicted state information meeting a predetermined criteria.


According to one aspect, the one or more conditions include a scheduled time condition.


According to one aspect, the one or more conditions include the state information meeting a predetermined criteria.


According to one aspect, determining the optimized placement of cloud resources comprises: (1) defining M×N number of assignment variables indicating whether a particular cloud resource is to be placed on a particular physical host, wherein M is the number of cloud resources and N is the number of available physical hosts in the federated cloud, (2) defining N×M number of cost variables indicating cost of migrating a particular cloud resource from a current physical host to another physical host in the federated cloud and/or cost of placing the particular cloud resource on a particular physical host, (3) defining constraints, in terms of the assignment variables and/or cost variables, based on one or more of the following: the state information, one or more policies, one or more business rules, one or more affinity rules, and one or more anti-affinity rules, and (4) solving for the optimized placement of cloud resources based on the constraints and an objective function in terms of the assignment variables and cost variables.


According to one aspect, the resources monitor and/or the cloud resource placement optimizer can aggregate physical hosts managed by a first cloud provider as an aggregated physical host. The cloud resource placement optimizer can defining the assignment variables and the cost variables by defining assignment variables and cost variables based on the aggregated physical host and other physical hosts managed by cloud providers different from the first cloud provider.


According to one aspect, determining the ordered migration plan comprises determining a sequence of migrations of cloud resources from source physical hosts to destination physical hosts which does not violate capacity requirements of the destination physical hosts during the sequence of migrations.


According to one aspect, determining the ordered migration plan includes: (A) determining a series of migrations from the optimized placement of cloud resources, (B) determining capacities of physical hosts and requirements of cloud resources associated cloud resources and physical hosts of the series of migrations based on the state information, and (C) executing a backtracking-based method. The backtracking-based method can include (1) determining if a current capacity of a particular destination physical host for a particular migration accommodates requirement of a particular cloud resource for the particular migration, (2) if the current capacity accommodates the requirement, adding the particular migration from the series of migrations to the ordered migration plan and updating the current capacity of the particular destination physical host and a particular source physical host for the particular migration based on the requirement, and (3) if the current capacity does not accommodate the requirement, repeat steps (1) and (2) for other migration(s) in the series of migrations which have not been added to the ordered migration plan based on current capacities of physical hosts until all migrations in the series of migrations are added to the ordered migration plan.


According to one aspect, determining the ordered migration plan comprises determining host capacities based on the state information, wherein determining the host capacities comprises aggregating state information associated with physical hosts managed by a first cloud provider as an aggregated physical host, and determining a sequence of migrations of cloud resources from source physical hosts including the aggregated physical host to destination physical hosts including the aggregated physical host which does not violate capacity requirements of the destination physical hosts including the aggregated physical host during the sequence of migrations.


Understanding Federated Clouds


Traditionally, a cloud provider manages one or more clouds, where a cloud includes a pool of physical computing devices, or referred herein as pools of physical hosts on which virtual resources can be placed. Virtual resources (referred herein as “cloud resources”) can include virtual machines, virtual storage volumes, virtual platforms, virtual networks, software applications, services, workloads, and so on. Physical hosts can include physical computing devices such as servers, computer processors, computer-readable storage media, networks, network links, etc. As used herein, physical hosts can encompass one or more of the following: compute, storage, and network resources. Tenants can make requests to use the cloud, e.g., to place or access cloud resources on the physical hosts. Examples of requests from the tenants include: requesting a workload to be carried out by virtual machines in the cloud, requesting a number of virtual storage volumes to be allocated in the cloud, requesting a service on demand. The cloud provider is responsible for providing and maintaining the physical computing resources in the cloud(s) and placing virtual cloud resources on the physical computing resources as demanded by the tenants.


Generally speaking, running applications in a virtualized cloud environment such as OpenStack involves creating virtual machines (VMs) in a cluster of physical host servers (referred to as “physical hosts”). All the VMs running in the cloud share the common physical resources—compute, storage, and network. Depending on the application workload or the VM density on a physical host, sometimes it could lead to poor performing VMs because of overloading. As a way to mitigate this effect, cloud infrastructures such as OpenStack provide software support for migrating VMs from one host to another host. However in the OpenStack cloud, currently the only way to achieve migration is by letting the cloud operator manually decide which VM to migrate and to which physical host. There is no automatic support, or any guidance on the migrations. Similarly for managing the virtual storage migrations, in terms of logical volumes, or for virtual networks distribution. Managing overloading in a cloud remains a difficult task.


Recent developments in cloud computing has motivated a new type of cloud called the federated cloud (or called “cloud federation”), where clouds managed by different cloud providers are collected together to provide a common service. For instance, tenants may have cloud storage resources spread across multiple clouds (e.g., internal cloud(s) and external cloud(s), multiple internal clouds, multiple external clouds, etc.), which may be managed by different cloud providers, or even running on different platforms. Cloud providers do not always use the same platform, and application programming interfaces are generally different from one cloud provider to another. As a result, clouds managed by different cloud providers do not share resources or information with each other, since the platforms are very different and cloud providers are generally competitors against each other. Nevertheless, federation is useful for tenants because the different clouds can provide a diversity of provision and delivery of services, but cooperation or sharing of resources between clouds in the federated cloud is minimal. The different platforms can make it very difficult for cloud providers to manage the federated cloud and improve the federated cloud's efficiency. Federated clouds are not to be confused with hybrid clouds where public and private clouds managed by the same cloud operator are collected together.


For the federated cloud scenario, one or more technical goals remain to be achieved by state of the art systems:

    • determining the best possible placements or migrations for cloud resources running in the cluster of physical hosts across federated cloud providers, such that the cloud cluster is balanced, without impacting the cloud resource placement requirements, as well as keeping the cost of migrations to a minimum;
    • addressing issues of platform differences;
    • addressing issues related to uncooperative cloud providers;
    • providing suitable conditions for reactively responding and rebalancing the federated cloud;
    • providing a proactive way to predict when a cloud rebalance may avoid catastrophic VM failures;
    • providing support for triggering a periodic cloud rebalance operations; and
    • determining a proper migration plan to ensure rebalancing can be executed.


In one example, OpenStack live migration expects an administrator user to manually trigger the migration operation on a single VM basis, and expects the final VM destination to be specified. It fails if the destination has not enough resources to handle the migration, and expects the administrator user to manually determine if this migration is possible.


In another example, VMWare vSphere Dynamic Resource Scheduler (DRS) and Dynamic Power Management (DPM) functionality offers dynamic functionality but fails to address issues related to a federated cloud scenario. The DRS functionality handles resource demand in a cluster of hosts, by guaranteeing resources to virtual machines, and allowing for automatic migration of virtual machines during maintenance without service disruption. Depending on the automation levels provided, it provides recommendations or automatically migrates to keep the cluster load balanced and to maximize performance. It provides constraint correction abilities with support for user defined constraints such as affinity or anti-affinity requirements. The DPM functionality manages energy consumption by keeping hosts in standby mode when demand for resources is low, and powering on additional hosts when needed. While these dynamic functionalities are useful, the dynamic functionalities operate under limited conditions.


Cloud Resource Placement and Rebalancing in a Federated Cloud Environment


The solution to achieve the one or more aforementioned technical goals involves the following series of technical tasks: unified resources monitoring, comprehensive triggering for rebalancing of the federated cloud, smart placement optimization across the federated cloud, and systematic migration for carrying out the rebalancing of the federated cloud. The present disclosure describes various aspects of the system architecture and methods for implementing and carrying out these technical tasks. These tasks are designed specifically to handle the federated cloud scenario and to provide a more intelligent rebalancing triggering mechanism.



FIG. 1 shows an exemplary cloud resource placement and rebalancing system for a federated cloud 102 and an illustrative federated cloud 104, according to some embodiments of the disclosure. In this example, the federated cloud 104 comprises three clouds or three clusters of physical hosts: a first cloud 122, a second cloud 124, and a third cloud 126. The three clouds are managed by different cloud providers. For purposes of illustration, the first cloud 122 is managed by cloud provider A (“CP_A”). The second cloud 124 is managed by cloud provider B (“CP_B”). The third cloud 126 is managed by cloud provider C (“CP_C”). Each cloud may have different number of physical hosts, and a number of cloud resources may already be placed (or allocated) in the physical hosts. The cloud resource placement and rebalancing system for a federated cloud 102 includes one or more memory elements 110 (e.g., non-transitory computer readable storage medium), one or more processors 108 coupled to the one or more memory elements 110. The system 102 can further include resources monitor 112, a rebalance trigger 114, cloud resource placement optimizer 116, and migrations enforcer 118. Instructions stored on one or more memory elements 110 can be executed by one or more processors 108 to carry out or provide functionalities associated with parts including one or more of: resources monitor 112, a rebalance trigger 114, cloud resource placement optimizer 116, and migrations enforcer 118. These parts that when executed by the at least one processor are configured to carry out or provide functionalities described herein. The functionalities and data flow of these parts are described in greater detail in later sections of the present disclosure.


To obtain information about the state of the three clouds, resources monitor 112 can be communicably connected to respective agents deployed in respective clouds in the federated cloud 104. A first agent 132 is deployed in the first cloud 122. A second agent 134 is deployed in the second cloud 124. A third agent 136 is deployed in the third cloud 126. Each agent for a respective cloud provides an interface which can respond to requests from the resources monitor 112 for state information associated with the respective cloud and/or push state information associated with the respective cloud to the resources monitor 112.


The resources monitor 112 can communicate with rebalance trigger 114, cloud resource placement optimizer 116, and migrations enforcer 118, e.g., to provide state information. Rebalance trigger 114 can communicate with cloud resource placement optimizer 116 to signal when to rebalance the federated cloud.


To execute migrations according to an optimized placement of cloud resources determined by cloud resource placement optimizer 116, migrations enforcer 118 can be communicably connected to respective services deployed in respective clouds in the federated cloud 104. A first service 142 is deployed in the first cloud 122. A second service 144 is deployed in the second cloud 124. A third service 146 is deployed in the third cloud 126. Typically, each service for a respective cloud is provided by the cloud provider to allow requests to be made by tenants to use the cloud, e.g., to allocate X number of cloud resources in the cloud, to move a cloud resource from one host to another host. These services can receive requests to place or migrate cloud resources from the migrations enforcer 118 to implement migrations for rebalancing the federated cloud.


The cloud resource placement and rebalancing system for a federated cloud 102 provides an intelligent system for rebalancing the clouds even if they are managed by different cloud providers. Resources monitor 112 can keep track of the state of the federated cloud including, e.g., information relating to existing cloud resources and physical hosts, consumption and/or utilization information, behavior of workloads, etc. Through a comprehensive framework defined by the system 102, rebalance trigger 114 can determine when rebalancing should occur. To rebalance the federated cloud, cloud resource placement optimizer 116 can determine an optimized placement of cloud resources across the clouds. Migrations enforcer 118 can determine an ideal order in which migrations are to be executed.


Exemplary Method for Cloud Resource Placement and Migration Optimization for a Federated Cloud Involving a Global Namespace to Treat the Federated Cloud as a Single Cloud


Many state of the art migrations schemes do not address how to rebalance a federated cloud to actively prevent overloading of resources in the federated cloud. Treating the clouds managed by different cloud providers as a single cloud, a global optimization can be applied to determine effectively determine the optimized or improved placements or migrations for cloud resources across the clouds, such that the federated cloud as a whole is balanced. The global optimization can ensure cloud resource placement requirements are met, as well as keep the cost of migrations to a minimum by defining a proper objective function.



FIG. 2 is a flow diagram illustrating a method for cloud resource placement and migration optimization for a federated cloud, according to some embodiments of the disclosure. The method is being described in conjunction with the parts illustrated in FIG. 1. Details related to various tasks of the method are described in later sections of the present disclosure.


Resources monitor 112 can monitor state information associated with cloud resources and physical hosts in the federated cloud having a plurality of clouds managed by a plurality of cloud providers (task 202). Resources monitor can optionally normalize the state information from different cloud providers (task 204). Rebalance trigger 114 can trigger, based on one or more conditions, a rebalancing request to initiate cloud resource placement optimization (task 206). A constraints-driven optimization solver of cloud resource placement optimizer 116 can determine an optimized placement of cloud resources on physical hosts (task 208) across the plurality of clouds in the federated cloud based on (1) costs (in some cases including migration costs), (2) the state information, and (3) constraints, wherein each physical host is identified in the constraints-driven optimization solver by an identifier of a respective cloud provider and an identifier of the physical host. Migrations enforcer 118 can determine an ordered migration plan for the optimized placement of cloud resources based on the optimized placement of cloud resources and the state information (task 210). Migrations enforcer 118 can transmit one or more requests to place or migrate cloud resources in the plurality of clouds in the federated cloud according to the ordered migration plan (task 212).


For task 208, a distinguishing feature involves identifying each physical host in the constraints-driven optimization solver by an identifier of a respective cloud provider and an identifier of the physical host. For cloud provider A's Host_1's identifier used by the optimization solver can be prefixed with an identifier to indicate the location or corresponding cloud provider by specifying the host as “CP_A:Host_1”. As a result, each physical host across the federated cloud can be treated as part of a single cloud and a global optimization can be applied across the federated cloud. The namespace ensures the cloud resource placement and rebalancing system for a federated cloud can identify to which cloud provider a host belongs. Furthermore, the namespace abstraction allows the global optimization to be performed without requiring the cloud providers to change their respective clouds, interfaces, or application programming interfaces. An optimization solver can optimize placement and migrations for multiple clouds across the federated cloud as if it is performing the optimization for a single cloud. The namespace abstraction allows the migrations enforcer to transmit requests to the correct cloud provider(s) to execute migrations.


The namespace can be used across different parts of the cloud resource placement and rebalancing system 102. Resources monitor 112 can associate state information to different hosts using the namespace. Variables and optimized placements in the cloud resource placement optimizer 116 can use the namespace. Migrations enforcer can resolve the namespace to generate requests to the appropriate cloud provider when executing migrations.



FIG. 3 is an illustration of federated cloud resource placement and rebalancing data flow, according to some embodiments of the disclosure. The data flow between different parts of the cloud resource placement and rebalancing system further clarifies the functionalities of the parts illustrated in FIG. 1 and tasks illustrated by FIG. 2. Each part of the cloud resource placement and rebalancing system and their respective functionalities are described in greater detail in the following sections.


Unified Resources Monitoring in the Federated Cloud Scenario


Resources monitor 112 can monitor state information associated with cloud resources and physical hosts in the federated cloud having a plurality of clouds managed by a plurality of cloud providers (task 202 of FIG. 2). As illustrated in FIG. 3, resources monitor 112 can receive state information, which may include one or more of the following: current placements of cloud resources to physical hosts, number of cloud resources, requirements of cloud resources; number of physical hosts, capacities of physical hosts; number of workloads, one or more events occurred in the federated cloud, one or more alarms in the federated cloud, one or more metrics associated with application(s) running on the federated cloud, one or more metrics associated with physical hosts in the federated cloud, and one or more metrics associated with network resources in the federated cloud.


In terms of applications running on the federated cloud, some metric examples include: application latency/response times, transactions rate, etc. Physical host metric examples include: CPU usage, memory (RAM) usage, disk usage, network utilization, network resource metrics such as packets read/write rates, etc. Some of these host metrics can be captured even for the cloud resources such as virtual machines, virtual storage volumes, etc.


Because the clouds are managed by different cloud providers, there is generally no centralized entity which has state information for all the clouds, accordingly, resources monitor 112 is provided to receiving state information from respective agents deployed in respective clouds in the federated cloud. Resources monitor 112 can collect and monitor measurable state information, including metrics from the underlying cloud infrastructure, e.g., the first cloud 122, the second cloud 124, and the third cloud 126, by communicating with the cloud infrastructures components and services, e.g., the first agent 132, the second agent 134, and the third agent 136.


For example, in OpenStack clouds, there is a service called Ceilometer, which publishes periodic metrics such as Computer Processing Unit (CPU) Utilization, Memory Utilization, and other usage metrics associated with the cloud. Resources monitor 112 can talk to these kind of services (referred here in as “agents”), and also some (native) monitoring agents running on the hosts, to gather and consolidate all the data. Advantageously, resources monitor 112 in a federated cloud scenario can receive and maintain monitorable data from the clouds managed by all the different cloud providers, and ensures it can appropriately process the information to make decisions for each of the clouds. As used herein, agents can include any one or more of the above entities or other suitable entities which can report state information to the resources monitor 112; agents are computer-implemented services or devices associated with the clouds. The agents can be implemented in the physical hosts. The agents can be implemented in the cloud resources (e.g., as a service running on a virtual machine). The agents can be implemented in applications running in the cloud (e.g., as a part of the application).


When clouds are managed by different cloud providers, certain types of state information may not always be available. In some cases, even when the type of state information is available, the format and/or terminology of the state information may not be the same across the clouds managed by different service providers. To address this issue, resources monitor 112, include a normalizer 302 to normalize the state information from different cloud providers (task 204 of FIG. 2). The normalizer 302 can normalizing different types of state information associated with different cloud providers to a common schema. Once the state information is normalized, the (normalized) state information as illustrated in FIG. 3 can then be provided to and used by other parts of the cloud resource placement and rebalancing system 102 (e.g., rebalance trigger 114, cloud resource placement optimizer 116, and migration enforcer 118).


Comprehensive Triggering for Rebalancing of the Federated Cloud


Rebalance trigger 114 can trigger, based on one or more conditions, a rebalancing request to initiate cloud resource placement optimization (task 206 of FIG. 2). As illustrated in FIG. 3, rebalance trigger 114 can receive (normalized) state information from resources monitor 112 to check one or more conditions and decide whether rebalancing is needed. To avoid overloading issues in a federated cloud, resources monitor 112 monitors state information, e.g., metrics for workloads, and the rebalance trigger 114 can check the state information against one or more conditions to assess whether rebalancing is needed for the federated cloud. For instance, when workloads are running, rebalance trigger 114 can take into account time-series data on CPU, memory, disk utilization. The time-series data can indicate whether a host is overloaded, or even whether a virtual machine itself is overloaded. In another example, rebalance trigger 114 can take into account of network load for transfers to a host's interface, which can also indicate whether a host is overloaded and whether a virtual machine needs to be migrated elsewhere. In yet another example, rebalance trigger 114 can take into account an application-level metric (for an application running on a VM), such as a web server running on a virtual machine. For instance, rebalance trigger 114 can take into account whether the application has a slow response time, to determine whether rebalancing is needed.


Rebalance trigger 114 can determine a rebalancing of the federated cloud is desirable or needed using one or more of these modes: reactive triggering, proactive triggering, and scheduled triggering. Any of these modes includes one or more conditions for triggering a cloud resource rebalance request to be transmitted to the cloud resource placement optimizer 116. The modes provide a comprehensive scheme for intelligently triggering a rebalancing of the federated cloud for a variety of situations (i.e., based one on or more conditions, e.g., as specified by an administrator of the federated cloud).


For reactive triggering, rebalance trigger 114 can respond to events or alarms notifications from the clouds in the federated cloud. For instance, rebalance trigger 114 can implement rules and/or threshold checkers that monitor certain types of state information. In some embodiments, the rebalance trigger 114 can assess whether the state information meets a predetermined criteria (e.g., rules, threshold checks). In some embodiments, the rebalance trigger 114 can assess whether a certain alarm went off and/or event has occurred. The types of state information, the rules, and/or threshold checkers can be configured by an administrator. Example events or alarm notifications from the clouds may include one or more of the following: host failing events (typically indicating a cloud resource on the host needs to be migrated), some other alarms that are configured in the infrastructure service directly, etc. In some embodiments, Ceilometer service in OpenStack supports triggering alarms based on values of some metrics, and such alarms can be used for the rebalance trigger 114 to reactively trigger rebalancing of the federated cloud. In some cases, rebalance trigger 114 can assess state information at the cloud resource level, e.g., based on virtual machine specific performance metrics. With the help of monitoring agents running in the virtual machines directly, rebalance trigger 114 can measure the application performance and if the application performance is deteriorating, e.g., when a virtual machine migration might benefit.


For proactive triggering, rebalance trigger 114 predicts can predict the performance of the cloud, and use predicted state information to determine if one or more criteria has been met for triggering a rebalancing of the federated cloud. The performance of the cloud can include performance information at one or more levels including: at the network level, at the physical host level, at the cloud resource level, and/or at the application level. Typically, rebalance trigger 114 monitors state information to determine performance of the cloud (i.e., performance of the resources in the cloud). The state information associated with cloud resources and physical hosts in the federated cloud can include time-series information. Rebalance trigger 114 can apply a predictive model on the time-series information to determine predicted state information, and determine whether the predicted state information meets one or more of the predetermined criteria (e.g., based on rules and/or threshold checks). Predictive models can include advanced techniques such as Holt-Winters model, autoregressive integrated moving average (ARIMA) model, and any suitable time-series analysis and prediction model. Effectively, rebalance trigger 114 can determine when it is appropriate or needed, e.g., to rebalance the federated cloud to prevent overloading, to perform a migration for the current workload, etc. Rebalance trigger 114 leverages a unified resources monitor 112, which continuously monitors state information associated with the cloud resources and physical hosts in the federated cloud. Based on the state information, rebalance trigger 114 can apply special data analysis techniques such as forecasting to study demand, loads, usage behavior, etc. to determine predicted state information. The predicted state information can then be used as a basis for triggering a cloud resource rebalance request to be transmitted to cloud resource placement optimizer 116. For instance, based on N number of time-series data points of a particular metric, it is possible to predict the value of the metric using a suitable predictive model. If the predicted value of the particular metric exceeds a threshold, rebalance trigger 114 can trigger a cloud resource rebalance request. Advantageously, rebalance trigger can proactively rebalance the federated cloud to avoid any downtimes and performance degradations. For instance, rebalance trigger 114 can execute predictive machine learning algorithms on state information (e.g., metrics in time-series format, and usage behaviors based on the historical data collected from the cloud infrastructure), and take decisions to rebalance the federated cloud proactively. In some cases, anomalies detected using an anomaly detection algorithms can also be used as a basis for determining whether to trigger a rebalance request to avoid failures.


For scheduled triggering, rebalance trigger 114 may include one or more timers. Based on a scheduled time condition, rebalance trigger 114 can trigger a cloud resource rebalance request to be transmitted to cloud resource placement optimizer. Examples of scheduled time conditions may include: periodic maintenance window support, scheduled maintenance, periodic scheduled rebalancing, etc.


Smart Placement Optimization Across the Federated Cloud


A constraints-driven optimization cloud resource placement solver of cloud resource placement optimizer 116 can determine an optimized placement of cloud resources on physical hosts (task 208 of FIG. 2) across the plurality of clouds in the federated cloud. As illustrated in FIG. 3, cloud resource placement optimizer 116 includes constraints-driven optimization resource placement solver 310. For the federated cloud scenario, the solver effectively combines the resources from all the clouds managed by different cloud providers and forms a single cloud, i.e., a common resource pool. For instance, suppose the federated cloud has two clouds: a local cloud and an external cloud. The resource of external cloud could be seen as some additional capacity of local cloud. The external cloud can be modeled as one or more additional hosts to the local cloud with available capacity and associated costs. By aggregating the resources from different cloud providers, the constraints-driven optimization cloud resource placement can work across physical hosts from different clouds managed by different cloud providers. Each physical host is identified in the constraints-driven optimization solver by an identifier of a respective cloud provider and an identifier of the physical host. As previously explained, the namespace ensures the cloud resource placement and rebalancing system for a federated cloud can identify to which cloud provider a host belongs, and the namespace abstraction allows the global optimization to be performed without requiring the cloud providers to change their respective clouds, interfaces, or application programming interfaces.


The constraints-driven optimization cloud resource placement solver 310 determines a balanced and optimized set of new placements of cloud resources (e.g., virtual machines, storage, network) while ensuring the set of new placements satisfy requirement(s) of the various cloud providers. In other words, the optimized placement of cloud resources on physical hosts across the plurality of clouds aim to keep the clouds balanced, increase performance, and ensure user requested placement constraints are satisfied.


Some examples herein are related to virtual machine placement and virtual machine migrations. These examples are serve to illustrate how the constraints-driven optimization cloud resource placement solver 310 operates; these examples are not meant to be limiting. The present disclosure encompasses other types of placements involving other types of cloud resources, such as storage resources and network resources. To rebalance the federated cloud, the solver 310 tries to find an optimized placement of virtual machines by solving optimal placements as if the existing virtual machines are new requests for virtual machines to be placed in the cloud. In one example, the solver 310 determines an optimal placement for each virtual machine (i.e., which physical host is best for hosting the virtual machine), by taking the following into consideration:

    • consider all the existing virtual machines as a new request of virtual machines with their specific demand of resources;
    • consider the physical hosts as available (as if it was a fresh start);
    • consider all the existing virtual machines constraints, e.g., special requirements in terms of policies, business rules, affinity/anti-affinity requirements, or any other special constraints virtual machines had when they were initial placed;
    • minimize cost, including cost of migration, e.g., the number of migrations;
    • maximize the cloud rebalancing and performance impact, in terms of the final values of a set of cloud metrics after the resulting new distribution.


As illustrated in FIG. 3, the constraints-driven optimization cloud resource placement solver determines an optimized placement of cloud resources based on (1) costs 304, (2) state information 306, and (3) constraints 308. When optimizing placement of cloud resources in a federated cloud, special considerations are given to (1) costs 304, (2) state information 306, and (3) constraints 308 (when compared with optimizations performed for a single cloud), since migrating cloud resources across clouds managed by different cloud providers is different from migrating cloud resources within a single cloud.


Special set of costs are considered by the solver 310 in the federated cloud scenario. Examples of costs 304 can include: the cost for a particular physical host hosting a particular virtual resource, the cost of running in a federated cloud (e.g., comparing cloud A vs cloud B using a cost matrix with effective cost of running in each of the clouds available for federation), cost of migration, etc. In particular, examples of cost of migration can include: a number of physical hosts running/utilized after all migrations, number of migrations (and associated costs), time required for executing migrations, amount of data transfer required for executing migrations, the cost of migrating a cloud resource from a source cloud provider to a destination cloud provider.


As explained previously, state information 306 for the solver 310 utilizes the namespace to identify which cloud provider a physical host is located, and the state information across the clouds are unified and optionally normalized by resource monitor 112.


Special set of constraints can be taken into account in the federated cloud scenario. Examples of constraints 308 can include: geo-location-based policies, tenant-specific requirements in terms of what clouds are allowed or not allowed, resource-based constraints in terms of capabilities in the clouds managed by different cloud providers, etc.


In some embodiments, the solver 310 can determine the optimized placement of cloud resources by setting up a constraints-driven optimization problem. The solver 310 can define M×N number of assignment variables indicating whether a particular cloud resource is to be placed on a particular physical host, wherein M is the number of (existing) cloud resources and N is the number of available physical hosts in the federated cloud. An assignment variable can be a binary variable, whose value indicates whether a particular virtual resource is to be placed on a physical host. The solver 310 can define N×M number of cost variables indicating cost of migrating a particular cloud resource from a current physical host to another physical host in the federated cloud and/or cost of placing the particular cloud resource on a particular physical host. The solver 310 can define constraints, in terms of the assignment variables and/or cost variables, based on one or more of the following: the state information, one or more policies, one or more business rules, one or more affinity rules, and one or more anti-affinity rules. Constraints can be mathematically defined in terms of the assignment variables and/or cost variables. For instance, one constraint can specify that the sum of all assignment variables must equal to the number of (existing) cloud resources. In another instance, one constraint can specify that the required/requested amount of resources for particular cloud resource(s) to be placed on a particular physical host must not exceed the available capacity of a particular physical host. The solver 310 can solve for the optimized placement of cloud resources based on the constraints and an objective function in terms of the assignment variables and cost variables. Specifically, the solver 310 searches through possible placements to find an optimal placement of cloud resources which can optimize the objective function. The objective function can be a cost function which takes into account of the total cost of placing the cloud resources and the total cost of needed migrations. The solver 310 would find an optimal placement which minimizes the cost function while ensuring constraints are satisfied. The objective function can be a utility function which rewards performance and/or placements which involve less migrations. The solver 310 would find an optimal placement which maximizes the utility function while ensuring constraints are satisfied. Any suitable constraints-driven optimization solver can be used. The result generated by the solver 310, i.e., the optimized placement of cloud resources, includes mapping of each cloud resource to a particular physical host. The optimized placement of cloud resources is transmitted to migrations enforcer 118.


Systematic Migration for Carrying Out the Rebalancing of the Federated Cloud


Based on the optimized placement from cloud resource placement optimizer 116, migrations enforcer 118 determines an (unordered) series of migrations. Depending on the optimized placement of cloud resources, one or more existing cloud resources may be assigned to its current physical host (i.e., the physical host on which the cloud resource is currently placed) and one or more existing cloud resources may be assigned to a physical host different from its current physical host. When a cloud resource is assigned to a physical host different from its current physical host, a migration is needed. The series of migration(s) includes one or more such migrations. In an example dealing with migrating virtual machines, the series of migrations includes a set of all required migrations involving virtual machines migrating from their source physical hosts to a new destination physical hosts. A migration can be represented as a tuple, e.g., <VM, Cloud_Provider:Host_source, Cloud_Provider:Host_destination>, indicating that the virtual machine VM is to be migrated from source host Cloud_Provider:Host_source to the destination host Cloud_Provider:Host_destination. For instance, if currently VM_1 was in Cloud_Provider_A:Host_1, and the optimized placement requiring VM_1 to be in Cloud_Provider_B:Host_4, a migration is required for VM_1 from Cloud_Provider_A:Host_1 to Cloud_Provider_B:Host_4. This migration can be represented step as a tuple <VM_1, Cloud_Provider_A:Host_1, Cloud_Provider_B:Host_4>. A series of migrations can include a set of such tuples {<VM_1, Cloud_Provider_A:Host_1, Cloud_Provider_B:Host_4>, <VM_4, Cloud_Provider_B:Host_2, Cloud_Provider_A:Host_2>, <VM_7, Cloud_Provider_A:Host_3, Cloud_Provider_A:Host_4> . . . }


With the series of migrations, the migrations enforcer 118 can communicate with services in respective clouds to enable the migrations. For instance, for virtual machine migrations in OpenStack Clouds, the migrations enforcer 118 can communicate migration request to compute service Nova, and use the Nova virtual machine live migration application programming interfaces, to trigger the migrations. In some cases, after some cloud resource migrations are executed, the resources of a physical host may get used up completely, even if there were additional migrations that would free up the physical host. This situation happens because the cloud resource placement optimizer 116 determines a “global” solution, and doesn't determine a migration plan. To address this issue, migrations enforcer 118 can determine an ordered migration plan for the optimized placement of cloud resources based on the optimized placement of cloud resources the state information (task 210 of FIG. 2). Determining an ordered migration plan (from the series of migrations) includes determining a sequence of migrations of cloud resources from source physical hosts to destination physical hosts which does not violate capacity requirements of the destination physical hosts during the sequence of migrations. Migration enforcer 118 can implement a method which ensures there is capacity for each physical host during the sequence of migrations as each cloud resource is migrated one by one. Specifically, migration enforcer 118 solves for a valid ordered migration plan to migrate cloud resources one by one to achieve the final optimized placement of cloud resources from the cloud resource placement optimizer 116. After the migration plan is determined, migrations enforcer 118 can transmit one or more requests to place or migrate cloud resources in the plurality of clouds in the federated cloud according to the ordered migration plan (task 212 of FIG. 2).


To illustrate, FIGS. 4-10 outlines executing the method for determining a sequence of migrations, i.e., the migration plan, in a simplified example. The simplified example involves three virtual machines (VM-1, VM-2, and VM-3) and three physical hosts (HOST-1, HOST-2, and HOST-3). FIG. 4 shows initial virtual machine placements, according to some embodiments of the disclosure. VM-1 is placed on HOST-1. VM-2 is placed on HOST-2. VM-3 is placed on HOST-3. Suppose the constraints-driven optimization cloud resource placement solver determines an optimized placement, referred to as the “desired virtual machine placements”. FIG. 5 shows desired virtual machine placements, according to some embodiments of the disclosure. VM-1 is to be placed on HOST-3. VM-2 is to be placed on HOST-1. VM-3 is to be placed on HOST-2. In this example, all virtual machines are being migrated. The series of migrations can be represented as {<VM-1, Host-1, Host-3>, <VM-2, Host-2, Host-1>, <VM-3, Host-3, Host-2>}. The series of migrations is not ordered. FIG. 6 shows resource requirements associated with the virtual machines, according to some embodiments of the disclosure. VM-1 requires 200 units of resources. VM-2 requires 100 units of resources, VM-3 requires 300 units of resources. FIG. 7 shows host capacities associated with physical hosts, according to some embodiments of the disclosure. The physical host capacities are initial (free) capacities of the physical hosts (amount of resources available when the virtual machines are still in their initial virtual machine placements). VM-1 has 100 units of resources. VM-2 requires 200 units of resources, VM-3 requires 100 units of resources.


Determining the ordered migration plan can include determining a series of migrations from the optimized placement of cloud resources. Furthermore, determining the ordered migration plan includes determining capacities of physical hosts (e.g., FIG. 7) and requirements of cloud resources (e.g., FIG. 6) associated cloud resources and physical hosts of the series of migrations based on the state information. Migration enforcer 118 can execute a backtracking-based method to determine the ordered migration plan based on the series of migrations and associated state information.


In some embodiments, the backtracking-based method includes: (1) determining if a current capacity of a particular destination physical host for a particular migration accommodates requirement of a particular cloud resource for the particular migration, (2) if the current capacity accommodates the requirement, adding the particular migration from the series of migrations to the ordered migration plan and updating the current capacity of the particular destination physical host and a particular source physical host for the particular migration based on the requirement, and (3) if the current capacity does not accommodate the requirement, repeat steps (1) and (2) for other migration(s) in the series of migrations which have not been added to the ordered migration plan based on current capacities of physical hosts until all migrations in the series of migrations are added to the ordered migration plan. The backtracking-based method can return an ordered migration plan, i.e., an ordered sequence of migrations, if a valid sequence exists. The backtracking-based method avoids random migration and determines a concrete and valid series of migrations to be executed. After an ordered migration plan is determined, migration enforcer 118 can communicate to respective services of the respective clouds (e.g., cloud Infrastructure application programming interfaces such as the OpenStack Nova migration application programming interface to trigger the migrations one by one in the order as specified by the ordered migration plan. The following is pseudocode for the backtracking-based method which recursively backtracks ordering of migrations if a capacity requirement is violated.














Variable Description








  1.
current_hosts_capacity : Existing Host Capacity


  2.
current_vm_host_mapping : Current VM to its Host mapping


  3.
proposed_migration_plan : The new set of proposed migration







  mappings of the form { <VM-i, Host_source, Host_destination>,.... }


  as a result of the cloud rebalancing








  4.
vm_requirement : Resource requirements of the VM







 Order = [ ]


     bool FindOrder(current_hosts_capacity, current_vm_host_


     mapping, proposed_migration_plan, vm_requirement):


If all new hosts mapping have been ordered:


   return success


For each mapping i in proposed_migration_plan:


   v = VM in mapping i


   new_host = Host to which v is mapped


   curren_host = current_vm_host_mapping[v]


   If mapping [i] not in Order:









if Host new_host has enough capacity for VM v:







      // Update old and new host


      Consume vm_requirement[v] capacity from new_host


      Add capacity to current_host


      // Update current_mapping


      Change current_host to new_host


      // Append to order


      Append mapping to Order


      //Make recursive call


       result  =  FindOrder(current_hosts_capacity,


      current_vm_host_mapping,  proposed_migration_plan,


      vm_requirement)


      if result is True:


       return True


      else:


       // Revert the changes made before recursive call


       Revert current_mapping[v] to its old mapping


       Revert capacity changes


       Remove this mapping from order


// backtrack to earlier level of recursion since none of new mapping could


lead a


// successful ordering


return False










FIGS. 8-10 illustrate an example implementing a backtracking-based method for determining a sequence of migrations, according to some embodiments of the disclosure. Using the same example as before, the series of migrations is represented by {<VM-1, HOST-1, HOST-3>, <VM-2, HOST-2, HOST-1>, <VM-3, HOST-3, HOST-2>}. In FIG. 8, the method tries to migrate VM-1 from HOST-1 to HOST-3, but HOST-3 having a current capacity of 100 units of resources cannot accommodate VM-1, which requires 200 units of resources. The method backtracks to try a different virtual machine migration in the series. In FIG. 9, the method tries to migrate VM-2 from HOST-2 to HOST-1 and succeeds because HOST-1 having a current capacity of 100 units of resources can accommodate VM-2, which requires 100 units of resources. The current capacities of HOST-1 (destination physical host) and HOST-2 (source physical host) are updated based on the requirement of VM-2: {HOST-1: 0, HOST-2: 300, HOST-3: 100}. In FIG. 10, based on the updated current capacity, the method tries to migrate VM-1 from HOST-1 to HOST-3 but fails again because the migration would violate capacity requirements. The method backtracks and tries to migrate VM-3 to HOST-2 and succeeds because HOST-2 having current capacity of 300 units of resources can accommodate VM-3, which requires 300 units of resources. The current capacities of HOST-2 (destination physical host) and HOST-3 (source physical host) are updated based on the requirement of VM-3: {HOST-1: 0, HOST-2: 0, HOST-3: 400}. Based on the updated current capacity, the method tries to migrate VM-1 from HOST-1 to HOST-3 and succeeds (finally) because HOST-3 having a current capacity of 400 units of resources can accommodate VM-1, which requires 200 units of resources. If desired, the current capacities of HOST-2 (destination physical host) and HOST-1 (source physical host) are updated based on the requirement of VM-1: {HOST-1: 200, HOST-2: 0, HOST-3: 200}. The method ends because all of the migrations are now ordered in a migration plan, which can be represented by {<VM-2, HOST-2, HOST-1>, <VM-3, HOST-3, HOST-2>, <VM-1, HOST-1, HOST-3>}. As explained in a previous section, the namespace identifying the cloud provider can be used in the host identifier to identify the host and the cloud provider to which the host belongs.


Recursive Method for Treating a Cloud as an Aggregated Physical Host


When operating in a federated cloud scenario, there are additional unique challenges to optimizing placement and rebalancing the cloud resources across the clouds. For instance, some cloud providers may not expose or provide access to execute migrations within a cloud (e.g., some cloud providers may not have an application programming interface for executing migrations within the cloud). FIG. 11 shows an aggregated physical host in a federated cloud, according to some embodiments of the disclosure. In this example, the first cloud 122 may not allow migrations to be executed by external requests. In some cases, the first cloud 122 may not provide host-by-host state information to resources monitor 112 of FIGS. 1 and 3. In another instance, there can be numerous physical hosts when many clouds are in a federated cloud. The constraints-driven optimization cloud resource placement solver increases in complexity significantly when the number of physical hosts (and the number of cloud resources even) increases.


To address these issues, the disclosed mechanisms for cloud resource placement and rebalancing can be implemented as a recursive placement decision scheme. When determining the optimized placement of cloud resources, cloud resource placement optimizer 116 and/or resources monitor 112 can aggregate physical hosts managed by a first cloud provider as an aggregated physical host. Defining assignment variables and cost variables can include defining assignment variables and cost variables based on the aggregated physical host and other physical hosts managed by cloud providers different from the first cloud provider.


In some embodiments, the decision scheme can pool capacities of physical hosts of a cloud managed by a particular cloud provider and logically present the collective capacity available as a single (aggregate) physical host. The optimization can determine that some cloud resources is to be migrated to or from this logical aggregate physical host. The particular cloud provider can then internally execute those migrations.


In some embodiments, the recursive placement decision scheme can be viewed as hierarchical scheduling, where a high level scheduling is first performed according to aggregated information from each cloud in the federated cloud. First decision involves optimizing placement of a particular cloud resource at the cloud level (e.g., deciding which cloud should the cloud resource be placed). Second decision involves optimizing placement of the particular cloud resource at the physical host level within the optimal cloud (e.g., deciding which physical host should the cloud resource be placed in the optimal cloud). Both of these decisions can be performed by cloud resource placement optimizer 116 of FIGS. 1 and 3.


In the federated cloud scenario, some cloud providers do not allow tenants to request or demand a specific order for migrating cloud resources. To address this issue, the same recursive scheme can also be applied in the migrations enforcer 118. The backtracking-based method can treat physical hosts of a particular cloud as a single physical host. In some embodiments, determining the ordered migration plan comprises determining host capacities based on the state information, wherein determining the host capacities comprises aggregating state information associated with physical hosts managed by a first cloud provider as an aggregated physical host, and determining a sequence of migrations of cloud resources from source physical hosts (including the aggregated physical host) to destination physical hosts (including the aggregated physical host) which does not violate capacity requirements of the destination physical hosts (including the aggregated physical host) during the sequence of migrations. The same backtracking-based method is applied, but the method treats physical hosts of a particular cloud as a single aggregated physical host. The migrations enforcer 118 can still transmit requests to migrate cloud resources to or from the particular cloud, but the specific ordering of migrations from one physical host to another physical host within the particular cloud is decided by the cloud provider of the particular cloud.


Advantages


The present disclosure describes systems and methods for enabling a smart and optimized monitoring data driven cloud rebalancing via cloud resource migration designed specifically for the scenario of dealing with resources from federated cloud providers. When compared to conventional solutions, the systems and methods described herein greatly improves upon the migration process. In one aspect, a resources monitor collects information across the federated cloud. In another aspect, a rebalance trigger triggers the cloud rebalancing with comprehensive support for reactive, proactive, and periodic triggering. For instance, the rebalance trigger can respond to events or alarms, or when some monitoring data crosses the thresholds to trigger a rebalance of the cloud (reactive triggering). The rebalance trigger can also study and analyze the historical data, and also monitor the user loads, to predict the rebalances (proactive trigger). The rebalance trigger can also allow for periodic scheduling rebalances (scheduled triggering). In yet another aspect, an optimizer determines optimized placement of cloud resources across the clouds. The optimization can ensure all the existing placement constraints or policies imposed by tenants and/or cloud providers are satisfied, while optimizing all the costs. The optimization advantageously enables the required cloud resource migrations to be determined, and optimizes these migrations such that the physical hosts are optimally used by the cloud resources, and also such that the cost and impact of migration is minimized (e.g., keeping the number of migrations to a minimum). In yet another aspect, a migration enforcer implements a migration ordering mechanism to calculate a feasible ordering of the migrations. Advantageously, migrations can be executed without service disruption. Smarter rebalancing can help federated clouds guarantee quality of service and other service level agreements.


Variations and Implementations


Some examples herein are related to virtual machine placement and virtual machine migrations. These examples are serve to illustrate how the constraints-driven optimization cloud resource placement solver 310 operates; these examples are not meant to be limiting. The present disclosure encompasses other types of placements involving other types of cloud resources, such as storage resources and network resources. The teachings herein easily extends to the other cloud resource migrations, in terms of the Storage (logical storage volumes placement) or the network (logical networks distribution). Storage and Network resources are other resources that can also be balanced in the cloud, based on their utilizations. For instance, the teachings extend to migrations of logical virtual storage volumes from one host disks to another host disk. This can involve detaching the storage volumes and then migrating the storage volumes. Storage cloud metrics can be monitored, and the cloud metrics can include such as Storage IOPS (IO operations per second), storage capacity, etc., and optimized migrations can be determined in a similar manner.


Within the context of the disclosure, a cloud of physical hosts generally includes physical hosts communicably connected over a network. A network used herein represents a series of points, nodes, or network elements of interconnected communication paths for receiving and transmitting packets of information that propagate through a communication system. A network offers communicative interface between sources and/or hosts, and may be any local area network (LAN), wireless local area network (WLAN), metropolitan area network (MAN), Intranet, Extranet, Internet, WAN, virtual private network (VPN), or any other appropriate architecture or system that facilitates communications in a network environment depending on the network topology. A network can comprise any number of hardware or software elements coupled to (and in communication with) each other through a communications medium.


As used herein in this Specification, the term ‘network element’ or parts shown in FIGS. 1, 3, and 11, are meant to encompass suitable elements such as servers (physical or virtually implemented on physical hardware), machines (physical or virtually implemented on physical hardware), end user devices, routers, switches, cable boxes, gateways, bridges, loadbalancers, firewalls, inline service nodes, proxies, processors, modules, or any other suitable device, component, element, proprietary appliance, or object operable to exchange, receive, and transmit information in a network environment. These network elements or parts shown in FIGS. 1 and 4-9 may include any suitable hardware, software, components, modules, interfaces, or objects that facilitate the virtual machine placement operations thereof. This may be inclusive of appropriate algorithms and communication protocols (which can be carried out by one or more processors) that allow for the effective exchange of data or information.


In some implementations, elements including the cloud resource placement and rebalancing system for a federated cloud and any parts therein may include software to achieve (or to foster) the functions discussed herein where the software is executed on one or more processors to carry out the functions. This could include the implementation of instances of resources monitor, rebalance trigger, cloud resource placement optimizer, migrations enforcer, and/or any other suitable part that would foster the activities discussed herein. Additionally, each of these elements can have an internal structure (e.g., one or more suitable processors, one or more memory elements, processor 108 of FIG. 1, memory 110 of FIG. 1, etc.) to facilitate some of the operations described herein. In other embodiments, these functions for cloud resource placement and rebalancing may be executed externally to these elements, or included in some other network element to achieve the intended functionality. Alternatively, the cloud resource placement and rebalancing system for a federated cloud and any parts therein may include software (or reciprocating software) that can coordinate with other network elements in order to achieve the functions described herein. In still other embodiments, one or several devices may include any suitable algorithms, hardware, software, components, modules, interfaces, or objects that facilitate the operations thereof.


In certain example implementations, the cloud resource placement and rebalancing functionalities outlined herein may be implemented by logic encoded in one or more non-transitory, tangible media (e.g., embedded logic provided in an application specific integrated circuit [ASIC], digital signal processor [DSP] instructions, software [potentially inclusive of object code and source code] to be executed by one or more processors, or other similar machine, etc.). In some of these instances, one or more memory elements can store data used for the operations described herein. This includes the memory element being able to store instructions (e.g., software, code, etc.) that are executed to carry out the activities described in this Specification. The memory element is further configured to store databases/data structures related to costs, constraints, rules, host states, etc. The processor can execute any type of instructions associated with the data to achieve the operations detailed herein in this Specification. In one example, the processor could transform an element or an article (e.g., data) from one state or thing to another state or thing. In another example, the activities outlined herein may be implemented with fixed logic or programmable logic (e.g., software/computer instructions executed by the processor) and the elements identified herein could be some type of a programmable processor, programmable digital logic (e.g., a field programmable gate array [FPGA], an erasable programmable read only memory (EPROM), an electrically erasable programmable ROM (EEPROM)) or an ASIC that includes digital logic, software, code, electronic instructions, or any suitable combination thereof.


Any of these elements (e.g., the cloud resource placement and rebalancing system for a federated cloud and any parts therein, etc.) can include memory elements for storing information to be used in cloud resource placement and rebalancing, as outlined herein. Additionally, each of these devices may include a processor that can execute software or an algorithm to perform the cloud resource placement and rebalancing activities as discussed in this Specification. These devices may further keep information in any suitable memory element [random access memory (RAM), ROM, EPROM, EEPROM, ASIC, etc.], software, hardware, or in any other suitable component, device, element, or object where appropriate and based on particular needs. Any of the memory items discussed herein should be construed as being encompassed within the broad term ‘memory element.’ Similarly, any of the potential processing elements, modules, and machines described in this Specification should be construed as being encompassed within the broad term ‘processor.’ Each of the network elements can also include suitable interfaces for receiving, transmitting, and/or otherwise communicating data or information in a network environment.


Additionally, it should be noted that with the examples provided above, interaction may be described in terms of two, three, or four network elements or parts shown in FIGS. 1, 3, and 11. However, this has been done for purposes of clarity and example only. In certain cases, it may be easier to describe one or more of the functionalities of a given set of flows by only referencing a limited number of network elements. It should be appreciated that the systems described herein are readily scalable and, further, can accommodate a large number of components, as well as more complicated/sophisticated arrangements and configurations. Accordingly, the examples provided should not limit the scope or inhibit the broad techniques of cloud resource placement and rebalancing, as potentially applied to a myriad of other architectures.


It is also important to note that the steps/tasks illustrated by the FIGS. 2 and 8-10 (or any steps/tasks described herein) illustrate only some of the possible scenarios that may be executed by, or within, the cloud resource placement and rebalancing system described herein. Some of these steps may be deleted or removed where appropriate, or these steps may be modified or changed considerably without departing from the scope of the present disclosure. In addition, a number of these operations have been described as being executed concurrently with, or in parallel to, one or more additional operations. However, the timing of these operations may be altered considerably. The preceding operational flows have been offered for purposes of example and discussion. Substantial flexibility is provided by the cloud resource placement and rebalancing system (and any parts therein) in that any suitable arrangements, chronologies, configurations, and timing mechanisms may be provided without departing from the teachings of the present disclosure.


Numerous other changes, substitutions, variations, alterations, and modifications may be ascertained to one skilled in the art and it is intended that the present disclosure encompass all such changes, substitutions, variations, alterations, and modifications as falling within the scope of the appended claims. In order to assist the United States Patent and Trademark Office (USPTO) and, additionally, any readers of any patent issued on this application in interpreting the claims appended hereto, Applicant wishes to note that the Applicant: (a) does not intend any of the appended claims to invoke paragraph six (6) of 35 U.S.C. section 112 as it exists on the date of the filing hereof unless the words “means for” or “step for” are specifically used in the particular claims; and (b) does not intend, by any statement in the specification, to limit this disclosure in any way that is not otherwise reflected in the appended claims.

Claims
  • 1. A method for cloud resource placement and migration optimization for a federated cloud, the method comprising: monitoring state information associated with cloud resources and physical hosts in the federated cloud having a plurality of clouds managed by a plurality of cloud providers;triggering, based on one or more conditions, a rebalancing request to initiate cloud resource placement optimization;determining, by a constraints-driven optimization cloud resource placement solver, an optimized placement of cloud resources on physical hosts across the plurality of clouds in the federated cloud based on (1) costs including migration costs, (2) the state information, and (3) constraints, wherein each physical host is identified in the constraints-driven optimization cloud resource placement solver by an identifier of a respective cloud provider and an identifier of the physical host, comprising: defining M×N number of assignment variables indicating whether a particular cloud resource is to be placed on a particular physical host, wherein M is the number of cloud resources and N is the number of available physical hosts in the federated cloud;defining N×M number of cost variables indicating cost of migrating a particular cloud resource from a current physical host to another physical host in the federated cloud and/or cost of placing the particular cloud resource on a particular physical host; andsolving for the optimized placement of cloud resources based on the assignment variables and the cost variables;determining an ordered migration plan for the optimized placement of cloud resources based on the optimized placement of cloud resources and the state information; andtransmitting one or more requests to place or migrate cloud resources in the plurality of clouds in the federated cloud according to the ordered migration plan.
  • 2. The method of claim 1, wherein monitoring the state information in the federated cloud comprises: normalizing different types of state information associated with different cloud providers to a common schema.
  • 3. The method of claim 1, wherein monitoring the state information in the federated clouds comprises: receiving state information from respective agents deployed in respective clouds in the federated cloud.
  • 4. The method of claim 1, wherein state information comprises one or more of the following: current placements of cloud resources to physical hosts;number of cloud resources;resource requirements of cloud resources;number of workloads;number of physical hosts; andcapacities of physical hosts.
  • 5. The method of claim 1, wherein state information comprises one or more of the following: one or more events that occurred in the federated cloud;one or more alarms in the federated cloud;one or more metrics associated with application(s) running on the federated cloud;one or more metrics associated with physical hosts in the federated cloud; andone or more metrics associated with network resources in the federated cloud.
  • 6. The method of claim 1, wherein state information associated with resources in the federated cloud comprises time-series information.
  • 7. The method of claim 6, further comprising: applying a predictive model on the time-series information to determine predicted state information;wherein the one or more conditions include the predicted state information meeting a predetermined criteria.
  • 8. The method of claim 1, wherein the one or more conditions include a scheduled time condition.
  • 9. The method of claim 1, wherein the one or more conditions include the state information meeting a predetermined criteria.
  • 10. The method of claim 1, wherein determining the optimized placement of cloud resources comprises: defining constraints, in terms of the assignment variables and/or the cost variables, based on one or more of the following: the state information, one or more policies, one or more business rules, one or more affinity rules, and one or more anti-affinity rules; andwherein the solving comprises solving for the optimized placement of cloud resources based on the constraints and an objective function in terms of the assignment variables and cost variables.
  • 11. The method of claim 10, wherein determining the optimized placement of cloud resources comprises: aggregating physical hosts managed by a first cloud provider as an aggregated physical host; andwherein defining the assignment variables and the cost variables comprises defining assignment variables and cost variables based on the aggregated physical host and other physical hosts managed by cloud providers different from the first cloud provider.
  • 12. The method of claim 1, wherein determining the ordered migration plan comprises: determining a sequence of migrations of cloud resources from source physical hosts to destination physical hosts which does not violate capacity requirements of the destination physical hosts during the sequence of migrations.
  • 13. The method of claim 1, wherein determining the ordered migration plan includes: determining a series of migrations from the optimized placement of cloud resources;determining capacities of physical hosts and requirements of cloud resources associated cloud resources and physical hosts of the series of migrations based on the state information; andexecuting a backtracking-based method comprising:(1) determining if a current capacity of a particular destination physical host for a particular migration accommodates requirement of a particular cloud resource for the particular migration;(2) if the current capacity accommodates the requirement, adding the particular migration from the series of migrations to the ordered migration plan and updating the current capacity of the particular destination physical host and a particular source physical host for the particular migration based on the requirement; and(3) if the current capacity does not accommodate the requirement, repeat steps (1) and (2) for other migration(s) in the series of migrations which have not been added to the ordered migration plan based on current capacities of physical hosts until all migrations in the series of migrations are added to the ordered migration plan.
  • 14. The method of claim 1, wherein determining the ordered migration plan comprises: determining host capacities based on the state information, wherein determining the host capacities comprises aggregating state information associated with physical hosts managed by a first cloud provider as an aggregated physical host; anddetermining a sequence of migrations of cloud resources from source physical hosts including the aggregated physical host to destination physical hosts including the aggregated physical host which does not violate capacity requirements of the destination physical hosts including the aggregated physical host during the sequence of migrations.
  • 15. A cloud resource placement and rebalancing system for a federated cloud, the system comprising: one or more memory elements;one or more processors coupled to one or more memory elements; anda resources monitor that when executed by the at least one processor is configured to monitor state information associated with cloud resources and physical hosts in the federated cloud having a plurality of clouds managed by a plurality of cloud providers;a rebalance trigger that when executed by the at least one processor is configured to trigger, based on one or more conditions, a rebalancing request to initiate cloud resource placement optimization;a cloud resource placement optimizer that when executed by the at least one processor is configured to determine an optimized placement of cloud resources on physical hosts across the plurality of clouds in the federated cloud based on (1) costs including migration costs, (2) the state information, and (3) constraints, wherein each physical host is identified in the constraints-driven optimization cloud resource placement solver by an identifier of a respective cloud provider and an identifier of the physical host, comprising: defining M×N number of assignment variables indicating whether a particular cloud resource is to be placed on a particular physical host, wherein M is the number of cloud resources and N is the number of available physical hosts in the federated cloud;defining N×M number of cost variables indicating cost of migrating a particular cloud resource from a current physical host to another physical host in the federated cloud and/or cost of placing the particular cloud resource on a particular physical host; andsolving for the optimized placement of cloud resources based on the assignment variables and the cost variables; anda migrations enforcer that when executed by the at least one processor is configured to: determine an ordered migration plan for the optimized placement of cloud resources based on the optimized placement of cloud resources and the state information; andtransmit one or more requests to place or migrate cloud resources in the plurality of clouds in the federated cloud according to the ordered migration plan.
  • 16. The cloud resource placement and rebalancing system of claim 15, wherein monitoring the state information in the federated cloud comprises: normalizing different types of state information associated with different cloud providers to a common schema.
  • 17. The cloud resource placement and rebalancing system of claim 15, wherein: state information associated with resources in the federated cloud comprises time-series information;the rebalance trigger is further configured to apply a predictive model on the time-series information to determine predicted state information; andthe one or more conditions include the predicted state information meeting a predetermined criteria.
  • 18. A computer-readable non-transitory medium comprising one or more instructions, for cloud resource placement and migration optimization for a federated cloud, that when executed on a processor configure the processor to perform one or more operations comprising: monitoring state information associated with cloud resources and physical hosts in the federated cloud having a plurality of clouds managed by a plurality of cloud providers;triggering, based on one or more conditions, a rebalancing request to initiate cloud resource placement optimization;determining, by a constraints-driven optimization cloud resource placement solver, an optimized placement of cloud resources on physical hosts across the plurality of clouds in the federated cloud based on (1) costs including migration costs, (2) the state information, and (3) constraints, wherein each physical host is identified in the constraints-driven optimization cloud resource placement solver by an identifier of a respective cloud provider and an identifier of the physical host, comprising: defining M×N number of assignment variables indicating whether a particular cloud resource is to be placed on a particular physical host, wherein M is the number of cloud resources and N is the number of available physical hosts in the federated cloud;defining N×M number of cost variables indicating cost of migrating a particular cloud resource from a current physical host to another physical host in the federated cloud and/or cost of placing the particular cloud resource on a particular physical host; andsolving for the optimized placement of cloud resources based on the assignment variables and the cost variables;determining an ordered migration plan for the optimized placement of cloud resources based on the optimized placement of cloud resources and the state information; andtransmitting one or more requests to place or migrate cloud resources in the plurality of clouds in the federated cloud according to the ordered migration plan.
  • 19. The computer-readable non-transitory medium of claim 18, wherein: determining the optimized placement of cloud resources comprises: aggregating physical hosts managed by a first cloud provider as an aggregated physical host; andwherein defining assignment variables and cost variables comprises defining the assignment variables and the cost variables based on the aggregated physical host and other physical hosts managed by cloud providers different from the first cloud provider;defining constraints, in terms of the assignment variables and/or cost variables, based on one or more of the following: the state information, one or more policies, one or more business rules, one or more affinity rules, and one or more anti-affinity rules; andwherein the solving comprises solving for the optimized placement of cloud resources based on the constraints and an objective function in terms of the assignment variables and cost variables.
  • 20. The computer-readable non-transitory medium of claim 18, wherein determining the ordered migration plan comprises: determining a sequence of migrations of cloud resources from source physical hosts to destination physical hosts which does not violate capacity requirements of the destination physical hosts during the sequence of migrations.
US Referenced Citations (427)
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
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 Andries 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
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
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
20030212598 Raman Nov 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
20100050172 Ferris 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
20120089726 Doddavula 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
20120290348 Hackett 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
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 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
20150127834 Udupi 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
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
20160188355 Cao 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
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
20170264663 Bicket et al. Sep 2017 A1
20170339070 Chang et al. Nov 2017 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 (73)
Entry
“OpenStack Cloud Administrator Guide,” Cloud Administrator Guide, Jul. 20, 2015, 333 pages.
Al-Haj, et al., “A Formal Approach for Virtual Machine Migration Planning,” 9th International Conference on Network and Service Management (CNSM), Oct. 14-18, 2013, Zurich, Switzerland; 8 pages.
Changbin, et al., “Cologne: A Declarative Distributed Constraint Optimization Platform,” University of Pennsylvania, Department of Computer and Information Science, Jan. 1, 2012, 14 pages.
Bari, et al., “CQNCR: Optimal VM Migration Planning in Cloud Data Centers,” David R. Cheriton School of Computer Science, IEEE, Jun. 2, 2014, 9 pages.
Jain, et al., “Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks,” 39th International Colloquium Conference on Automata, Languages, and Programming (ICALP'12) , Riga, Latvia, Jul. 9-13, 2012, 36 pages.
Wang, et al., “Virtual Machine Migration Planning in Software-Defined Networks,” Tsinghua National Laboratory for Information Science and Technology Department of Electronic Engineering, Tsinghua University, Dec. 16, 2014, 10 pages.
“VMware vSphere Training: Migration Hot & Cold Migration-DRS,” 2015, first published on or about Aug. 2, 2014; 5 pages.
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.
Related Publications (1)
Number Date Country
20170149687 A1 May 2017 US