Compressed Trie Virtual Disk Migration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Cloud systems face inefficiencies due to redundant virtual disks distributed across different computing environments, leading to suboptimal storage resource utilization.
Innovation Solution
A system and method that utilize a compressed trie to migrate partial tree structures of virtual disks between sites, calculating a cost value for each candidate target site to select the most efficient migration option, thereby reducing storage resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If virtual disks are distributed across multiple computing environments, then service availability and flexibility are improved, but storage resource efficiency deteriorates due to redundancy
Solution Approach 1:
The patent merges redundant virtual disk data across multiple computing environments by identifying duplicate disk chains and consolidating them into a single copy. The system combines the disk chain strings from different environments, detects redundancies, and consolidates the data to eliminate waste while maintaining service availability across all environments.
2Quantity of substance
If all virtual disks are migrated to a single location, then storage efficiency is improved, but service availability and access flexibility deteriorate
Solution Approach 1:
The patent segments the virtual disk data into hierarchical components (disk chains, disk chain strings, and individual virtual disks) that can be independently managed. By segmenting the data structure, the system can selectively migrate only the necessary portions while maintaining multiple access points, thus preserving service availability while improving storage efficiency through consolidated storage of redundant segments.
3Ease of operation
If virtual disk migration is performed without optimization, then migration simplicity is maintained, but storage resource waste increases due to redundant data copying
Solution Approach 1:
The patent performs preliminary analysis of virtual disk structures by constructing and comparing disk chain strings before migration. The system pre-identifies redundant data patterns and plans the migration strategy in advance, which allows for optimized migration that reduces storage waste while maintaining operational simplicity through automated decision-making.
Data Source
AI summary
System and computer-implemented method for migrating partial tree structures of virtual disks for virtual computing instances between sites in a computer system uses a compressed trie, which is created from target tree structures of virtual disks at a plurality of target sites in the computer system. For a virtual computing instance selected, the compressed trie is used to find candidate target sites based on a disk chain string of the virtual computing instance. For each candidate target site, a cost value for migrating the virtual computing instance along with a partial source tree structure of virtual disks corresponding to the virtual computing instance from the source site to the candidate target site is calculated to select a target site with a lowest cost value as a migration option to reduce storage resource usage in the computer system.