Data Placement in Linked Node Systems Using DPD
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Computing devices face data loss due to persistent storage failures, and existing solutions lack efficient methods for managing data across multiple nodes to ensure data protection and availability.
Innovation Solution
A system using aggregated data protection domain (DPD) information to identify nodes and distribute data across a cluster, employing replication and erasure coding to ensure data protection, with dynamic updating of DPD information based on node state changes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is stored in persistent storage of computing devices, then data availability is improved, but data loss risk increases due to storage failure
Solution Approach 1:
The patent divides data into multiple chunks and distributes them across different nodes in a cluster. Each node stores only a portion of the data, so that if one node fails, the remaining nodes still contain parts of the data that can be used for recovery through erasure coding.
Solution Approach 2:
The patent implements node-specific data protection domains where each node has customized protection characteristics. Different nodes can have different levels of redundancy or protection strategies based on their individual reliability, capacity, or failure characteristics, allowing localized optimization of data protection.
2Reliability
If data is replicated across multiple nodes, then data protection is improved, but system complexity increases
Solution Approach 1:
The patent enables nodes to autonomously manage their own data protection domains and make independent decisions about data placement and recovery. Each node maintains local DPD information and can independently determine where to store data chunks and how to participate in recovery operations, reducing the need for centralized coordination and simplifying overall system management.
Solution Approach 2:
The patent pre-computes and stores data protection domain information for each node, including predetermined relationships between nodes and data chunks. When data needs to be stored or recovered, the system uses these pre-established relationships to quickly determine placement without complex real-time calculations, reducing operational complexity.
3Reliability
If DPD information is dynamically updated based on node state changes, then data protection effectiveness is improved, but processing overhead increases
Solution Approach 1:
The patent implements periodic monitoring and updating of node state changes within data protection domains. Instead of continuous monitoring, the system checks node states at regular intervals or triggers updates only when specific events occur (such as node addition, removal, or failure), reducing processing overhead while maintaining data protection effectiveness.
Data Source
AI summary
In general, embodiments of the invention relate to storing data and managing the stored data in linked nodes. More specifically, embodiments of the invention relate to nodes linked together in a daisy chain configuration such as, but not limited to, a single-chain configuration and a dual-chain configuration, which use data protection domain (DPD) information to determine where and/or how to store the data.


