P2P Derivative Generation Reducing Client CPU Load
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data storage systems using (n,k) schemes face high overhead costs and network load due to the need for clients to be online and perform CPU-intensive operations for creating new derivatives, which is inefficient and resource-expenditive.
Innovation Solution
A peer-to-peer encryption mode system and method that generates new derivatives by accessing existing derivatives on servers, modifying them through a series of steps across multiple servers, and uploading the final derivative to an optimal server for storage, optimizing assembly time and network load without requiring the client to be online.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the client performs CPU-intensive operations to create new derivatives, then the data integrity can be maintained, but the resource expenditure and computational burden on clients increases
Solution Approach 1:
The patent introduces servers as intermediaries that perform the CPU-intensive derivative creation operations. Instead of clients directly computing new derivatives, the system uses server resources to generate and store these derivatives, thereby maintaining data integrity while significantly reducing the computational burden on client devices.
Solution Approach 2:
The patent creates copies of derivative data on servers rather than requiring clients to perform all computational operations. By storing pre-computed derivatives on server infrastructure, the system enables clients to access and verify data integrity without expendng significant computational resources.
2Adaptability or versatility
If the client is required to be online for creating new derivatives, then the data can be updated, but the network load and operational complexity increases
Solution Approach 1:
Servers act as intermediaries that handle data update operations asynchronously. The system can create and store new derivatives on servers even when clients are offline, then make these updates available to clients when they come online, thereby maintaining adaptability while reducing operational complexity.
Solution Approach 2:
The system performs preliminary actions by pre-computing and storing derivatives on servers before clients need them. This allows the system to maintain data update capability without requiring clients to be continuously online, as all necessary computational operations are completed in advance on server infrastructure.
3Reliability
If the client collects all derivatives and performs assembly operations locally, then the data can be reconstructed, but the network load and time consumption increases
Solution Approach 1:
Servers serve as intermediaries that store and manage derivative data, enabling clients to retrieve only the necessary information for reconstruction. This distributed approach reduces the network load and time required for assembly compared to clients collecting all derivatives locally.
Solution Approach 2:
The patent segments the data into distributed derivatives stored across multiple servers. Instead of clients assembling all data locally, the system divides the reconstruction task across the network, allowing clients to retrieve and assemble only the necessary segments, thereby reducing assembly time and network load.
Data Source
AI summary
A system and method is disclosed for using encryption algorithms in peer-to-peer encryption mode to restore the integrity of data. An example method is provided for generating a new derivative for a file that has a plurality of existing derivatives that have been stored on servers using an (n,k) algorithm, where the (n,k) algorithm provides that a minimum number k of the derivatives required to restore the file. The method includes accessing, on a server, a first derivative of the existing derivatives and forming a blob for the new derivative based on a modification operation that uses the first derivative. Moreover, the method includes determining a number of times the modification operation has been performed, and if the number of times the modification operation has been performed is equal to the minimum number k, uploading the blob to a server for storage thereon.