Hierarchical Node Content Prediction for Mobile Connectivity

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data communication systems face challenges in providing continuous and reliable content access due to unreliable wireless connectivity, low data rates, and high latency, which hinder effective content interest prediction and pre-fetching for mobile users.

Innovation Solution

A hierarchical system of interconnected nodes, including a root node and child nodes, that predict and maintain content lists based on user mobility and geographic location, allowing for efficient content interest prediction and pre-fetching even in areas with limited connectivity by distributing content lists and pre-fetching data to nodes along the user's predicted path.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If pre-fetching content data is employed to improve Quality of Experience, then user content access reliability is improved, but network resource consumption increases and system complexity increases

Engineering Contradiction:
Improvecontent access reliabilityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system divides the content delivery function into multiple distributed nodes (root nodes and child nodes) organized in a hierarchical structure. Each node independently maintains content lists and performs pre-fetching operations for its local user群体, rather than relying on a centralized system. This segmentation reduces the complexity burden on any single component while collectively improving content access reliability across the network.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system performs pre-fetching of content data in advance based on predicted user interests and mobility patterns. Content lists are maintained and updated proactively at distributed nodes before users actually request the content, ensuring that content is readily available when needed. This preliminary action improves access reliability by preparing content ahead of time while distributing the computational load across multiple nodes.

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If content interest prediction is performed based on past web clicks and historical access patterns, then content recommendation accuracy is improved, but prediction reliability deteriorates when wireless connectivity is interrupted

Engineering Contradiction:
Improvecontent prediction accuracyVSAvoidprediction reliability
Core Design Contradiction:
Measurement precisionVSReliability

Solution Approach 1:

The system enables each distributed node to perform content interest prediction using local historical data (past web clicks and access patterns) stored at that node. This local prediction capability ensures that content recommendations continue to work accurately even when wireless connectivity is interrupted, as each node operates independently with its own data cache. The local quality approach maintains prediction reliability while preserving accuracy.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

Distributed nodes act as intermediaries between the user and the central server. These nodes cache content lists and prediction data locally, serving as mediators that can provide content recommendations even when the connection to the central server is unavailable. This intermediary layer protects against connectivity interruptions while maintaining prediction accuracy through local data processing.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Device complexity

If content lists are maintained centrally at a root node, then system simplicity is improved, but network resource utilization deteriorates and access reliability worsens in areas with limited connectivity

Engineering Contradiction:
Improvesystem simplicityVSAvoidnetwork resource utilization
Core Design Contradiction:
Device complexityVSLoss of energy

Solution Approach 1:

The centralized content list management is segmented into a hierarchical distributed structure with root nodes and child nodes. Each node maintains local content lists and serves local users, reducing the need for continuous network communication. This segmentation improves network resource utilization by localizing data access while maintaining relatively simple operations at each node through standardized protocols.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system transitions from a single-dimensional centralized architecture to a multi-dimensional hierarchical distributed architecture. Content lists are replicated across multiple nodes in different geographic locations, enabling users in areas with limited connectivity to access content from the nearest available node. This dimensional change reduces network resource consumption by eliminating long-distance transmissions while distributing system complexity across multiple simple nodes.

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

Data Source

PatentUS10504034B2Systems, devices and methods for distributed content interest prediction and content discovery
Publication Date: 2019.12.10 HUAWEI TECH CO LTD
  • US10504034B2 patent drawing
  • US10504034B2 patent drawing
  • US10504034B2 patent drawing

AI summary

There is disclosed a system for maintaining content lists. The system includes nodes interconnected by at least one data network. The nodes are organized hierarchically to comprise a root node and at least two child nodes. The root node stores a list of content items expected to be of interest to a particular user; transmits data reflective of an update for a subset of the list to at least one of the child nodes, the subset selected based on at least a predicted future location of the particular user and a geographic location of that child node; and receives data reflective of an update for the subset of the list from at least one of the child nodes. The at least one of the child nodes stores the subset of the list; determines an update for the subset of the list; and transmits data reflective of the update to the root node.