Data-Centric Routing Using Hierarchical ID Conversion

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data-centric networks face inefficiencies in data communications when data locations are frequently updated, as existing methods either require prior name resolution, leading to delayed communication, or result in massive forwarding tables that bottleneck performance.

Innovation Solution

A data-centric communications system that uses hierarchical routing, where nodes forward requests using object IDs initially and then convert them to location IDs for efficient retrieval, reducing the need for frequent name resolution and minimizing forwarding table updates.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If name resolution is performed before data communication, then the location ID is accurately identified, but communication latency increases

Engineering Contradiction:
Improvelocation ID identification accuracyVSAvoidcommunication latency
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The system performs name resolution in advance and caches the mapping between object IDs and location IDs in forwarding tables at multiple nodes. This preliminary action allows subsequent data communications to use the cached location IDs directly without performing name resolution again, thus reducing communication latency while maintaining accurate location identification.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system dynamically updates forwarding tables when object locations change. Instead of performing name resolution for every communication request, the system adapts by refreshing the cached location information periodically or on-demand, balancing between the accuracy of location identification and the latency of communication.

Inventive Principle:
Principle #15Dynamics

2Reliability

If location ID is updated frequently to track moving data, then data communication accuracy is maintained, but forwarding table storage and processing load increases

Engineering Contradiction:
Improvedata communication accuracyVSAvoidforwarding table storage load
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The system segments the forwarding table into multiple distributed tables across different nodes in the network. Each node maintains a portion of the location mappings, which reduces the storage burden on individual nodes and distributes the processing load. This segmentation allows the system to maintain accurate location tracking without overwhelming any single node with excessive storage requirements.

Inventive Principle:
Principle #1Segmentation

3Measurement precision

If name resolution system is used for every data request, then accurate routing is achieved, but system complexity and processing overhead increases

Engineering Contradiction:
Improverouting accuracyVSAvoidsystem complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The system performs name resolution in advance and caches the mapping between object IDs and location IDs in forwarding tables at multiple nodes. This preliminary action allows subsequent data communications to use the cached location IDs directly without performing name resolution again, thus reducing communication latency while maintaining accurate location identification.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system introduces forwarding tables as intermediary structures that store pre-resolved location mappings. These tables act as mediators between the name resolution system and the data communication process, eliminating the need for frequent name resolution queries and reducing system complexity for routine communications.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentEP2802108B1Data-centric communications system and data forwarding method
Publication Date: 2019.08.28 HITACHI LTD
  • EP2802108B1 patent drawingFigure 1
  • EP2802108B1 patent drawingFigure 2
  • EP2802108B1 patent drawingFigure 3

AI summary

A node (1), when an object request message includes a location ID of a forwarding destination, sets the location ID of the forwarding destination as a search key to search the location-ID forwarding table (13) thereof and forwards the object request message to a node (1) that is a next hop obtained as the search result; and when the object request message does not include the location ID of the forwarding destination, sets the object ID included in the object request message as a search key to search the object-ID forwarding table (11) thereof to forward the object request message to the node (1) that is the next hop obtained as the search result.