File Restore Sequence Optimization via Location Data

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current methods for restoring physical or virtual machine files from archive storage devices are hindered by high latency and network limitations, leading to prolonged recovery times, which can disrupt business continuity.

Innovation Solution

A method that determines a file restoration sequence based on file location data, prioritizing files with adjacent locations to reduce the number of requests and optimize the order of file restoration, thereby minimizing recovery time.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If files are restored in original sequence from archive storage device, then file restoration can be performed systematically, but recovery time is prolonged due to high latency and network limitations

Engineering Contradiction:
Improvefile restoration timeVSAvoidrestore speed
Core Design Contradiction:
Loss of timeVSProductivity

Solution Approach 1:

The system performs preliminary analysis of file location data before restoration begins, determining the optimal restoration sequence in advance. By pre-processing the file list and analyzing storage locations, the system prepares a optimized restoration plan that minimizes latency impacts during actual file recovery operations.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The restoration sequence is dynamically adjusted based on file location data rather than following a static original sequence. The system adapts the restoration order to account for storage device characteristics, network conditions, and file proximity, making the restoration process responsive to changing conditions and optimizing overall recovery time.

Inventive Principle:
Principle #15Dynamics

2Reliability

If multiple file requests are sent to archive storage device, then all required files can be restored, but the number of requests increases recovery time due to network latency

Engineering Contradiction:
Improvefile restoration completenessVSAvoidrecovery time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system merges multiple file requests by analyzing file location data to identify files that can be retrieved in sequential operations. By combining requests for files located in adjacent storage blocks or contiguous regions, the system reduces the total number of separate I/O operations required while ensuring all necessary files are restored.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The restoration process maintains continuous useful action by minimizing idle time between requests. The optimized sequence ensures that each request builds on the previous one, keeping the storage device and network connection continuously utilized without unnecessary gaps, thereby reducing overall recovery time while maintaining completeness.

Inventive Principle:
Principle #20Continuity of useful action

Data Source

PatentUS10152390B1Increasing speed of file restore
Publication Date: 2018.12.11 ACRONIS INT
  • US10152390B1 patent drawing
  • US10152390B1 patent drawing
  • US10152390B1 patent drawing

AI summary

A method, computer program product, computing system, and system for increasing speed of a file restore from an archive storage device are described. The method may include receiving, at a computing device, a list of files to be restored from the archive storage device and file location data associated with one or more files from the list of files to be restored. The method may further include determining, at the computing device, a file restoration sequence for the one or more files from the list of files to be restored based upon, at least in part, the file location data. The method may also include restoring, from the archive storage device, the one or more files from the list of files to be restored based upon, at least in part, the file restoration sequence.