Dynamic Virtual Machine Placement in Distributed Cloud Data Centers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In cloud data centers, existing technologies face challenges in optimally placing and migrating virtual machines (VMs) to minimize latency and communication traffic, especially in geographically distributed environments, which affects service performance and network congestion.
Innovation Solution
A method and system for identifying and placing VMs based on their characteristics and the current system state, determining an updated placement, and creating a migration sequence to optimize VM placement and minimize backbone network traffic, using a combination of optimization models and heuristic solutions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If virtual machines are placed in geographically distributed data centers to serve worldwide users, then service availability and reliability are improved, but network traffic volume and latency increase
Solution Approach 1:
The system segments the geographically distributed data center infrastructure into multiple placement zones and groups VMs by their communication patterns. By dividing the system into manageable segments (data centers, VM groups, placement zones), it can optimize traffic routing within each segment while maintaining overall system reliability across distributed locations.
Solution Approach 2:
The patent applies local quality by placing VMs that communicate frequently together in the same or nearby data centers based on their specific communication patterns. This creates localized VM groups where traffic remains within the same geographic region, reducing long-distance network traffic while maintaining service availability through strategic distribution of these local groups across multiple data centers.
2Loss of time
If virtual machines are placed close to end-users to maintain service performance, then latency is reduced, but network congestion and traffic management complexity increase
Solution Approach 1:
The system dynamically adjusts VM placement based on changing communication patterns and system state. The placement optimization is not static but adapts to temporal variations in traffic demands, allowing the system to maintain low latency by continuously positioning VMs optimally close to their communication partners while managing complexity through automated dynamic adjustment rather than manual configuration.
Solution Approach 2:
The patent changes the parameter of VM placement location based on communication patterns and system state. By varying the placement parameters (which data center to place VMs in) according to measured traffic characteristics, the system optimizes latency performance while the automated parameter adjustment reduces the perceived complexity of traffic management.
3Reliability
If virtual machine migration is performed to optimize placement, then service performance is improved, but additional network traffic is generated during migration
Solution Approach 1:
The system performs preliminary analysis of communication patterns and determines optimal placement configurations before executing migrations. By pre-calculating the benefits of migration versus the cost of migration traffic, the system only initiates migrations when the performance improvement justifies the traffic cost, and sequences migrations to minimize overall migration traffic impact.
Solution Approach 2:
The patent converts the harmful effect of migration traffic into a beneficial outcome by strategically timing and sequencing migrations. Migrations are performed in a sequence that minimizes total migration traffic while achieving the performance benefits of optimized placement. The system accepts temporary migration traffic as a necessary cost that is converted into long-term performance improvement and reduced operational traffic.
4Productivity
If optimization models are used to determine VM placement, then placement efficiency is improved, but computational complexity and processing time increase
Solution Approach 1:
The system applies optimization models selectively rather than continuously, and focuses on optimizing specific aspects of placement (such as communication-aware grouping) rather than all parameters simultaneously. This partial optimization approach maintains good placement efficiency for the most critical factors while avoiding the computational complexity of exhaustive optimization of every placement parameter.
Solution Approach 2:
The system uses self-service mechanisms where the optimization model learns from historical data and communication patterns to make placement decisions with reduced computational overhead. The model adapts to common patterns and can make quick decisions for routine placement scenarios without requiring complex real-time computation, thereby maintaining efficiency while reducing processing complexity.
Data Source
AI summary
A computer-implemented method according to one embodiment includes identifying a set of virtual machines to be placed within a system, receiving characteristics associated with the set of virtual machines, determining characteristics associated with a current state of the system, determining a placement of the set of virtual machines within the system, based on the characteristics associated with the set of virtual machines and the characteristics associated with a current state of the system, determining an updated placement of all virtual machines currently placed within the system, based on the characteristics associated with the set of virtual machines and the characteristics associated with a current state of the system, and determining a migration sequence within the system in order to implement the updated placement of all virtual machines currently placed within the system.


