Distributed Agent Architecture for Scalable Data Relocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data relocation methods in data centers are centrally driven, labor-intensive, non-scalable, difficult to monitor, and lack standardization, often relying on ad hoc solutions due to their manual and inefficient nature.
Innovation Solution
A distributed agent-based architecture within data storage nodes facilitates automated and scalable data relocation by establishing peer-to-peer data transmission pathways, managing relocation operations, and monitoring availability to ensure efficient and reliable data transfer across clusters.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If a centralized dedicated server is used to manage data relocation, then data relocation can be performed, but the system becomes non-scalable and difficult to monitor
Solution Approach 1:
The patent divides the centralized relocation management system into distributed agent components deployed at each storage node. Each agent independently handles relocation tasks locally, segmenting the monolithic management function into modular units that can operate autonomously, thereby improving scalability and reducing central management complexity.
Solution Approach 2:
Storage nodes are equipped with self-service capabilities through embedded agents that automatically perform relocation decisions and executions based on local policies and conditions. This eliminates the need for manual human intervention and reduces dependency on centralized control, enabling the system to scale without proportionally increasing management overhead.
2Reliability
If manual human operators are involved in data relocation, then relocation can be controlled, but the process becomes labor-intensive and non-scalable
Solution Approach 1:
The system implements self-service automation where agents at storage nodes autonomously execute relocation operations based on predefined policies and real-time conditions. This eliminates manual human labor while maintaining reliable control through automated decision-making logic, thereby significantly improving productivity without sacrificing reliability.
Solution Approach 2:
The patent incorporates feedback mechanisms where agents continuously monitor system state, relocation progress, and performance metrics. This feedback loop enables automated adjustments and corrections during relocation operations, ensuring reliable control while maintaining high productivity through continuous optimization without human intervention.
3Adaptability or versatility
If ad hoc solutions are used for data relocation, then flexibility is achieved, but standardization is lost making monitoring difficult
Solution Approach 1:
The patent implements a universal agent architecture that can handle multiple relocation scenarios and policies through a common standardized interface. This multi-functional design provides flexibility to adapt to different relocation needs while maintaining standardized monitoring and control mechanisms, thereby resolving the contradiction between adaptability and monitorability.
4Reliability
If data is relocated across geographically distributed storage nodes, then data center resilience is improved, but transmission complexity increases
Solution Approach 1:
The patent segments the geographically distributed storage system into autonomous nodes, each equipped with intelligent agents that independently manage their own data relocation. This segmentation simplifies transmission pathways by enabling direct peer-to-peer transfers between nodes without requiring complex centralized routing, thereby maintaining resilience while reducing transmission complexity.
Data Source
AI summary
Data is relocated among data storage nodes in a data center by using distributed agents. An agent at a first data storage node manages the relocation of associated data to a second data storage node, as well as the relocation of a mirror copy of the data at a third data storage node to a fourth data storage node, by receiving status information, such as via a publish-subscribe technique. The first agent may provide an identifier with a relocation request to the third data storage node which is relayed to the fourth data storage node, and used in status messages provided by the third and fourth data storage nodes. The received status information is then associated with the relocation request. Agents for each pair of sending and receiving data storage nodes can monitor their availability for servicing the relocation to negotiate an acceptable transmission rate.