Distributed Data Storage Location-Based Affinity

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current distributed data storage systems lack the ability to enhance data affinity beyond the initial distribution key, leading to inefficiencies in resiliency and data duplication.

Innovation Solution

A method and system that dynamically allocate data elements based on both a distribution key and the geographic location of assets, creating a bi-dimensional affinity by associating data elements with affinity groups based on their current and home locations, and replicating data elements when the location changes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is distributed using a traditional hashing algorithm based on a distribution key, then uniform distribution of data across nodes is achieved, but the ability to enhance data affinity and improve resiliency is lost

Engineering Contradiction:
Improvedata affinity enhancement capabilityVSAvoiddata distribution system complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent introduces a second dimension to data distribution by combining traditional hashing with geographic location information. Instead of relying solely on distribution key hashing, the system creates affinity groups based on both hash values and geographic proximity, enabling enhanced data affinity and resiliency while maintaining manageable system complexity through structured organization of assets and affinity groups

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Reliability

If data elements are replicated across multiple nodes to improve resiliency, then system reliability increases, but data duplication increases storage requirements

Engineering Contradiction:
Improvesystem resiliencyVSAvoiddata duplication
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent applies local quality by creating geographically-based affinity groups where data is replicated only to nodes within the same or adjacent affinity groups. This ensures that data duplication occurs locally within geographic proximity rather than uniformly across all nodes, improving resiliency for location-specific failures while minimizing overall data duplication and storage requirements

Inventive Principle:
Principle #3Local quality

3Adaptability or versatility

If data is statically allocated based on initial distribution key definition, then system simplicity is maintained, but adaptability to location changes and mobile assets is reduced

Engineering Contradiction:
Improvelocation-based data allocation adaptabilityVSAvoiddata management complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent implements dynamics by enabling data elements to be dynamically reallocated based on changing geographic locations of assets. When assets move between affinity groups, the system automatically updates data element associations and triggers appropriate replication or migration operations, providing adaptability to location changes while maintaining manageable complexity through automated management processes

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS11275761B2Distributed data storage
Publication Date: 2022.03.15 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US11275761B2 patent drawing
  • US11275761B2 patent drawing
  • US11275761B2 patent drawing

AI summary

Proposed are concepts for managing the distribution of data elements in a distributed data storage system comprising: a plurality of distributed assets; and a mobile asset associated with a home location. A proposed method comprises: allocating a data element based on a current location of the mobile asset. If the current location of the mobile asset differs from the home location associated with the mobile asset, a replica of the data element is allocated to another asset.