Dynamic Storage Resource Graph Discovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing storage management techniques fail to provide an accurate representation of changing storage structures, requiring frequent re-writing and re-testing of implementations to maintain accuracy, and are specific to certain types of storage resources, limiting their adaptability.
Innovation Solution
Dynamic determination generates a storage resource graph and operation graph to traverse an arbitrary storage stack, assigning restore scope designations and ranking restore operations based on cost and duration, allowing for flexible and efficient restore operations without the need for re-compilation or re-testing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If existing techniques are used to obtain storage representation, then implementation is specific to certain storage types, but accuracy of storage stack representation cannot be maintained when structure changes
Solution Approach 1:
The patent implements dynamic discovery by using handlers that can adapt to different storage resource types and structures at runtime. The discovery process dynamically traverses the storage stack through handlers that respond to changing structures without requiring pre-defined static implementations, enabling accurate representation to be maintained as storage structures evolve.
Solution Approach 2:
The patent creates a universal discovery mechanism through a generic discovery process that works across multiple storage resource types. Handlers are designed to be polymorphic and can discover various storage structures (volumes, files, snapshots, clones) through a common interface, eliminating the need for separate implementation for each storage type while maintaining accuracy for each specific structure.
2Reliability
If existing techniques are used for storage discovery, then implementation is specific to certain storage resources, but re-writing and re-testing is required when storage structure changes
Solution Approach 1:
The dynamic discovery system uses runtime-adaptive handlers that automatically adjust to changing storage structures without requiring code modifications. When storage structures change, the discovery process continues to work correctly because the handlers dynamically respond to the current structure rather than relying on static pre-programmed logic, eliminating re-writing and re-testing requirements.
Solution Approach 2:
The discovery mechanism is self-adjusting through handlers that automatically adapt to storage structure changes. The system serves itself by dynamically discovering the current storage topology without external intervention or manual updates, maintaining reliability while eliminating the need for maintenance re-work.
3Adaptability or versatility
If dynamic determination generates storage resource graph and operation graph, then restore operations can handle arbitrary storage complexities, but system complexity increases
Solution Approach 1:
The patent segments the storage management system into distinct components: a discovery process, handlers for different storage types, and restore operations. This segmentation allows each component to be independently developed and tested while working together to handle arbitrary storage complexities through composition rather than monolithic complexity.
Solution Approach 2:
The patent introduces an intermediary layer of handlers that mediate between the discovery process and storage resources. These handlers simplify the interaction by providing a standardized interface for discovering storage structures, reducing the complexity burden on the restore operations while maintaining the ability to handle arbitrary storage topologies.
Data Source
AI summary
In one aspect, dynamic determination generates a storage resource graph corresponding to a storage topology. The generating may comprise iterating through storage resources in the storage topology and using a discovery handler to generate a node in the storage resource graph corresponding to each of the iterated storage resources. Dynamic determination generates an operation graph by iterating through nodes in the storage resource graph and using an operating handler to generate operation-specific metadata corresponding to each iterated node of the storage resource graph. Dynamic generating executes the operation graph in a way specific to the operation.