Gateway Priority Routing for Dynamic 3D Network Stability

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current routing protocols in dynamic 3D networks, such as those involving satellites and mobile platforms, fail to adapt quickly to frequent topology changes, leading to routing shocks due to the overwhelming number of updates, which destabilizes the network and prevents accurate routing information from being available.

Innovation Solution

Implementing priority information at network nodes to manage routing decisions, allowing multiple routes to be evaluated based on priority, and maintaining priority information to avoid deleting inactive links, thereby reducing routing shocks.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional routing protocols are used to propagate topology changes across the network, then routing information can be updated, but the frequent topology changes in dynamic 3D networks cause routing shock and network instability

Engineering Contradiction:
Improvenetwork stabilityVSAvoidrouting update frequency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent applies preliminary action by pre-calculating and storing multiple alternative routes (primary and secondary routes) before topology changes occur. When a topology change happens, the network node can immediately switch to a pre-calculated secondary route without waiting for routing protocol convergence, thus avoiding routing shock and maintaining network stability despite frequent topology changes

Inventive Principle:
Principle #10Preliminary action

2Measurement precision

If routing information is frequently updated to reflect dynamic topology changes, then routing accuracy improves, but processing cannot be finalized before further updates are received causing routing shock

Engineering Contradiction:
Improverouting information accuracyVSAvoidrouting convergence time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The system performs preliminary calculations of multiple alternative routes in advance, storing them with their respective metrics. This allows the network to have accurate routing information ready before topology changes occur, eliminating the need for time-consuming recalculation during changes and ensuring both accuracy and timely response

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements dynamics by maintaining multiple routing entries (primary and secondary routes) that can dynamically switch based on topology changes. The routing table is structured to accommodate dynamic changes, allowing rapid transition between pre-calculated routes without requiring complete recalculation, thus reducing convergence time while maintaining accuracy

Inventive Principle:
Principle #15Dynamics

3Speed

If multiple routes to the same destination are maintained with priority information, then routing decisions can be made quickly, but device complexity increases

Engineering Contradiction:
Improverouting decision speedVSAvoidrouting table complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The patent applies segmentation by dividing the routing table into structured segments: primary routes and secondary routes, each with assigned priorities. This segmentation allows for efficient organization and quick access to routes based on priority levels, enabling fast routing decisions while maintaining manageable complexity through systematic categorization

Inventive Principle:
Principle #1Segmentation

Data Source

PatentEP4683291A1Method, computer program, and apparatus for routing data at a network node and route configuration at a network gateway
Publication Date: 2026.01.21 DEUTSCHE TELEKOM AG
  • EP4683291A1 patent drawingFigure 1
  • EP4683291A1 patent drawingFigure 2~3
  • EP4683291A1 patent drawingFigure 4~5

AI summary

Examples relate to a method (10), a computer program, and an apparatus (30) for routing data at a network node (300) and relate to a method (20), a computer program, and an apparatus (40) for route configuration at a gateway (400). The method (10) for routing data at a network node (300) comprises receiving (11), by the network node (300), first priority update information for a first link to a destination from a first gateway (400), wherein the first gateway (400) is on the first link and the network node (300) and the first gateway (400) are in one same domain. The method (10) further comprises updating (12), by the network node (300), first priority information of first routing information used to direct data to the destination via the first link based on the received first priority update information, wherein the network node (300) comprises second routing information used to direct data to the destination via a second link, and wherein the second routing information comprises second priority information. The method (10) further comprises receiving (13), by the network node (300), data destined for the destination and determining (14), by the network node (300), a transmission link for the data based on the updated first priority information and the second priority information. The method (10) comprises sending (15), by the network node (300), the data via the transmission link.