Core-Network Data Storage Using Distributed Hash Routing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Enterprises face challenges in securely storing large amounts of data while maintaining proprietorship and ensuring rapid access, particularly when using third-party cloud storage systems.

Innovation Solution

A data center storage system integrated into a core network, utilizing a distributed hash table and optical fiber communication links to store data across multiple geographically dispersed data centers, enabling content addressing and dynamic link rerouting to enhance security and accessibility.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If enterprises store data in third-party cloud storage systems, then storage capacity is improved, but data proprietorship and security are worsened

Engineering Contradiction:
Improvestorage capacityVSAvoiddata proprietorship
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The system segments data storage across multiple independent data centers (at least 10 miles apart) rather than using a single third-party cloud provider. Each data center stores portions of enterprise data, and the distributed hash table tracks file locations across these segmented storage nodes. This segmentation restores proprietorship by giving enterprises direct control over distributed storage infrastructure while maintaining large aggregate capacity.

Inventive Principle:
Principle #1Segmentation

2Speed

If data is stored in a single location for rapid access, then access speed is improved, but vulnerability to hacking is worsened

Engineering Contradiction:
Improvedata access speedVSAvoidvulnerability to hacking
Core Design Contradiction:
SpeedVSObject-affected harmful factors

Solution Approach 1:

Data is segmented and distributed across multiple geographically separated data centers. The distributed hash table enables rapid location lookup of file segments, allowing quick reconstruction and access of complete data sets while the physical distribution across 10+ miles apart locations reduces vulnerability to single-point hacking attacks.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The distributed hash table acts as an intermediary layer between data access requests and physical storage locations. It enables rapid logical access to data segments while the physical distribution provides security buffering, resolving the contradiction between fast access and security.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Speed

If data centers are located close together for fast communication, then communication speed is improved, but vulnerability to simultaneous failures is worsened

Engineering Contradiction:
Improvecommunication speedVSAvoidresilience to failure
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The system applies different quality characteristics to different parts of the network: data centers within the same region provide fast local access (high communication speed), while geographically dispersed data centers (10+ miles apart) provide resilience to regional failures (high reliability). This local quality differentiation resolves the contradiction between speed and resilience.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS20260044617A1Data Center Storage Integration with Core Network
Publication Date: 2026.02.12 T MOBILE INNOVATIONS LLC
  • US20260044617A1 patent drawing
  • US20260044617A1 patent drawing
  • US20260044617A1 patent drawing

AI summary

A data center storage system integrated into a core network. The system comprises a plurality of data centers that each provides a memory storage; a plurality of optical fiber communication links, wherein each optical communication link communicatively couples two of the data centers to each other, wherein the memory storage of the data centers stores a plurality of files, wherein each file is identified by a hash calculated over the content of the file, wherein a distributed hash table is stored in the memory storage of each data center that associates hashes of files to a memory storage location where the files are stored, and wherein at least some of the files are distributed across each of the plurality of data centers, whereby a vulnerability to hacking the files is decreased, and wherein each data center is connected to the core network.