Dynamic Data Storage Segmentation Roaming

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current data storage solutions face high vulnerability due to the inherent coupling between data integrity, availability, and security, making them susceptible to hacks and data theft, as static data locations are easily targeted, and compromising on availability or performance is often less preferable.

Innovation Solution

A method for dynamically storing files by shredding them into segments, wrapping each with a unique code containing destination storage locations and a timer, and autonomously roaming them between locations, decoupling the link between data integrity, availability, and security requirements, while maintaining data integrity and security through a Software as a Service (SAAS) system.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If data is stored at static locations to ensure availability and performance, then data accessibility is improved, but security vulnerability increases due to easy targeting

Engineering Contradiction:
Improvedata accessibilityVSAvoidsecurity vulnerability
Core Design Contradiction:
ProductivityVSObject-affected harmful factors

Solution Approach 1:

The patent applies dynamics by making data storage locations mobile rather than static. Data segments continuously change their storage location through autonomous roaming of code segments, making the storage system dynamic and adaptive. This resolves the contradiction by maintaining availability through continuous access capability while improving security through constant location changes that prevent targeting.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent divides data into multiple segments and distributes them across different storage locations. Each segment is independently managed with its own code, allowing the system to maintain data availability while securing it against targeted attacks. Even if one segment is compromised, the complete data remains protected due to the segmentation.

Inventive Principle:
Principle #1Segmentation

2Object-affected harmful factors

If data is fragmented and dynamically stored to improve security, then security against targeted attacks is improved, but system complexity increases

Engineering Contradiction:
Improvesecurity against targeted attacksVSAvoidsystem complexity
Core Design Contradiction:
Object-affected harmful factorsVSDevice complexity

Solution Approach 1:

The patent implements self-service through autonomous code segments that independently manage their own storage locations without requiring centralized coordination. Each code segment autonomously roams to and from storage locations, making decisions independently. This reduces system complexity despite data fragmentation by eliminating the need for complex centralized management mechanisms.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The code segments serve multiple functions: they encrypt data, manage their own storage locations, handle autonomous roaming, and enable data reconstruction. This multi-functionality reduces overall system complexity by consolidating multiple security and management functions into single autonomous units rather than requiring separate systems for each function.

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Object-affected harmful factors

If data segments autonomously roam between locations to maintain security, then security is improved by eliminating single-point targeting, but data integrity management becomes more challenging

Engineering Contradiction:
Improvesecurity by eliminating single-point targetingVSAvoiddata integrity management
Core Design Contradiction:
Object-affected harmful factorsVSReliability

Solution Approach 1:

The patent implements feedback mechanisms where code segments continuously monitor their environment and adjust their storage locations based on security conditions and system state. This feedback loop ensures that data integrity is maintained while segments autonomously roam, as the system can detect and correct any integrity issues that arise during dynamic storage operations.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11586512B2Dynamic data storage
Publication Date: 2023.02.21 SPECTERX N D LTD
  • US11586512B2 patent drawing
  • US11586512B2 patent drawing
  • US11586512B2 patent drawing

AI summary

A method for dynamically storing files/data, comprising: a) acquiring the file/data by an initial random Virtual Machine (r VM); b) shredding the file/data to a plurality of segments; c) wrapping, in a standalone state, each of the remaining segments with a unique code comprised of at least one or more destination storage locations, a pointer to a following segment in the file/data, and a timer; d) autonomously and independently roaming each segment to the destination storage location appearing in its unique code; and e) periodically, according to the timer, continuously roaming segments between storage locations until receiving a request for retrieving of the dynamically stored file/data.