RELOAD Protocol Data Storage Access Right Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In distributed systems using the RELOAD protocol, race conditions occur when multiple nodes simultaneously access and update data, leading to errors due to the inability of RELOAD storage nodes to identify requesting applications and manage access rights effectively.
Innovation Solution
A data storage method where each requesting node writes a register identifier and time into a target data table, checks for access rights, computes and updates data, and verifies the validity of results, ensuring that only one node with the latest access right can write to the storage node, thus avoiding race conditions without requiring a centralized coordinator or changing storage node mechanisms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple requesting nodes simultaneously access and update data in a distributed system using RELOAD protocol, then data accessibility and system operation are maintained, but race conditions occur leading to data errors
Solution Approach 1:
The patent applies preliminary action by having requesting nodes register their access intentions and obtain access rights before actually accessing or updating data. The system pre-allocates access rights to specific nodes for specific data, ensuring that only the authorized node can perform updates. This prevents race conditions by establishing access permissions in advance, before the actual data access occurs.
Solution Approach 2:
The patent introduces an access right management mechanism as an intermediary between requesting nodes and data storage nodes. This intermediary system manages and distributes access rights, controlling which nodes can access which data. By inserting this intermediary layer, the system maintains data integrity while still allowing multiple nodes to access data through properly managed access rights.
2Reliability
If a centralized coordinator is introduced to manage access rights in a distributed system, then race conditions are avoided, but system complexity and operational constraints increase
Solution Approach 1:
The patent extracts the access right management function from the data storage node itself and implements it as a separate mechanism within requesting nodes. Instead of requiring storage nodes to identify and manage access rights for different applications, the system extracts this functionality to the requesting nodes, which obtain and manage their own access rights independently. This reduces the complexity burden on storage nodes while maintaining reliable access control.
Solution Approach 2:
The patent implements self-service by enabling requesting nodes to independently obtain, manage, and verify their own access rights without requiring centralized coordination or communication with other requesting nodes. Each node autonomously manages its access rights to data, reducing system complexity while ensuring data integrity through decentralized self-management of access control.
3Reliability
If access right management is implemented at the storage node level, then data integrity is maintained, but storage node operational mechanisms must be altered
Solution Approach 1:
The patent extracts the access right management functionality from the storage node and relocates it to the requesting node. Instead of modifying storage nodes to identify applications and manage access rights, the system extracts this capability to the requesting nodes, which obtain access rights through registration and independently verify them before data access. This maintains data integrity while preserving storage node operational flexibility.
Data Source
AI summary
The present disclosure provides a data storage method, a data storage system and a requesting node. The data storage method includes the following steps. A register identifier and a register time are written into a target data table. The target data table is read to look for a register time record, such that an access right of the storage node is determined. A requesting node having the access right computes result data, and writes a usage identifier and the result data in the target data table. The target data table is read to judge the validity of the result data.