Dynamic Lock Extension for Deduplicated Storage Cost Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The challenge in cloud storage is managing costs associated with storing deleted data, as locked data cannot be removed until the protection duration expires, leading to unnecessary storage costs and increased costs from frequent lock extension cycles.
Innovation Solution
A method to dynamically set and adjust the lock extension value based on parameters such as garbage collection operations, storage costs, and data ingestion, optimizing the balance between garbage collection, lock extension, and storage costs by determining a new lock extension value that minimizes overall costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the protection duration is extended to prevent premature data deletion, then data protection reliability is improved, but storage costs increase due to retained deleted data
Solution Approach 1:
The patent applies dynamics by making the protection duration adjustable rather than fixed. The system dynamically modifies the lock extension value based on real-time conditions including data access patterns, garbage collection schedules, and storage costs, allowing the protection duration to adapt between shorter and longer periods as needed to balance reliability and cost.
Solution Approach 2:
The patent changes the parameter of protection duration by introducing a configurable lock extension value that can be modified based on system conditions. Instead of using a static protection duration, the system adjusts this parameter dynamically to optimize between data protection needs and storage cost minimization.
2Quantity of substance
If the protection duration is shortened to reduce storage costs, then storage cost is reduced, but data protection reliability deteriorates due to premature deletion
Solution Approach 1:
The system dynamically adjusts the protection duration based on actual data access patterns and garbage collection schedules. When data is accessed frequently or garbage collection is infrequent, shorter protection durations reduce costs. When data is less accessed or garbage collection is frequent, longer protection durations prevent premature deletion, thus balancing cost and reliability.
Solution Approach 2:
The patent implements feedback mechanisms where the system monitors data access patterns, garbage collection schedules, and storage costs to continuously adjust the protection duration. This feedback loop ensures the protection duration is optimized based on real-time conditions, preventing both premature deletion and unnecessary cost accumulation.
3Reliability
If lock extension operations are performed frequently to maintain data protection, then data protection reliability is maintained, but compute-related costs increase
Solution Approach 1:
The system dynamically adjusts the frequency and duration of lock extension operations based on data access patterns and garbage collection schedules. Instead of performing frequent lock extensions, the system optimizes the lock extension value to extend protection for longer periods when data is less accessed, reducing the frequency of compute-intensive lock extension operations while maintaining reliability.
Solution Approach 2:
The patent changes the parameter of lock extension value to optimize the balance between data protection and compute costs. By adjusting this parameter based on system conditions, the system reduces the number of lock extension operations performed, thereby reducing compute-related costs while maintaining adequate data protection reliability.
4Quantity of substance
If garbage collection is performed frequently to remove deleted data, then storage cost is reduced, but data protection reliability deteriorates due to locked data retention
Solution Approach 1:
The system dynamically adjusts the protection duration based on garbage collection schedules and data access patterns. When garbage collection is frequent, the system shortens the protection duration to allow deleted data to be removed sooner. When garbage collection is infrequent, the system extends protection duration to prevent premature deletion. This dynamic adjustment balances storage cost reduction with data protection reliability.
Solution Approach 2:
The patent implements feedback mechanisms where the system monitors garbage collection schedules and data access patterns to continuously adjust the protection duration. This feedback loop ensures the protection duration is optimized based on real-time conditions, allowing frequent garbage collection when costs are prioritized while maintaining reliability when data protection is prioritized.
Data Source
AI summary
Dynamically selecting a protection duration for locking objects in a storage. A garbage collection deletes objects over time. The objects may not be removed from storage until associated locks have expired. The length of the lock may impact the cost. A new lock extension value is selected each time a lock extension operation is performed. The lock extension value selection process accounts for a garbage collection operation cycle, an amount of deleted objects that are stored because of being locked, and a garbage collection churn. This allows an optimum lock extension value to be selected dynamically and repeatedly to control costs automatically.