SRv6 Path Computation Using Network State Prediction

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current mobile communication systems face challenges in dynamically managing network resources and setting optimal paths for user data traffic due to complex protocol stacks and the difficulty in integrating network programming with traffic engineering and in-network computing, especially with the advent of new services like 5G and IoT.

Innovation Solution

A network function within the mobile core network that receives state measurement and prediction values of network resources, computes paths based on these values, and requests resource management to optimize network paths, utilizing segment routing IPv6 (SRv6) for flexible network programming and resource allocation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If GTP-U tunneling protocol is used to ensure mobility, then mobility management is achieved, but path setting for PDU session traffic through traffic engineering becomes difficult

Engineering Contradiction:
Improvemobility managementVSAvoidprotocol stack complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the network path into multiple可控 segments using SRv6, allowing independent control of each segment while maintaining overall mobility management. This enables traffic engineering at the segment level without disrupting the GTP-U tunneling framework.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent merges SRv6 segment routing with the existing GTP-U tunneling protocol, combining the mobility management capabilities of GTP-U with the flexible path control of SRv6. This integration allows both functions to operate together without requiring complete protocol replacement.

Inventive Principle:
Principle #5Merging (Combining)

2Reliability

If complex protocol stack with GTP-U tunneling is used, then mobility is ensured, but dynamic in-network computing processing cannot be performed

Engineering Contradiction:
ImprovemobilityVSAvoidin-network computing capability
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent introduces dynamic path selection capabilities through SRv6, allowing the network to adaptively compute and switch paths based on real-time conditions. This enables in-network computing processing to be dynamically routed through appropriate network functions while maintaining mobility.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent uses SRv6 segment routing as an intermediary layer between the GTP-U tunneling protocol and the underlying transport network, enabling in-network computing operations without disrupting the existing mobility management framework.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Adaptability or versatility

If SRv6 is used for network programming, then path flexibility and programmability are improved, but integration with existing transport network becomes challenging

Engineering Contradiction:
Improvenetwork programmabilityVSAvoidnetwork integration complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent leverages the universal nature of SRv6, which can operate over various transport networks (IP, MPLS, etc.), allowing a single SRv6 implementation to provide network programming capabilities across different underlying transport technologies without requiring separate solutions for each.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent establishes SRv6 segment routing as a pre-configured framework that can be applied to existing transport networks, allowing network programming capabilities to be introduced in advance before full network migration, thereby simplifying integration with legacy infrastructure.

Inventive Principle:
Principle #10Preliminary action

4Speed

If path computation is based only on current network state, then responsiveness is improved, but future network conditions cannot be anticipated

Engineering Contradiction:
Improvepath computation speedVSAvoidreaction time to future conditions
Core Design Contradiction:
SpeedVSLoss of time

Solution Approach 1:

The patent performs preliminary path computation based on predicted future network states, allowing the system to pre-establish optimal paths before actual conditions arise. This predictive approach maintains fast response times while anticipating future network conditions.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements dynamic path computation that adapts between reactive (current-state-based) and proactive (prediction-based) modes, allowing the system to switch between immediate responsiveness and future-oriented planning depending on network conditions and service requirements.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS20240073775A1Apparatus and method for determining a path based on prediction
Publication Date: 2024.02.29 ELECTRONICS & TELECOMM RES INST
  • US20240073775A1 patent drawing
  • US20240073775A1 patent drawing
  • US20240073775A1 patent drawing

AI summary

Provided are an apparatus and a method for computing a path for forwarding user data through the following steps: receiving a state measurement value or a state prediction value corresponding to the state measurement value of a state of a plurality of network resources within a mobile core network and a transport network; and computing the path for forwarding the user data, on the basis of either the state measurement value or the state prediction value, and topology of the mobile core network and topology of the transport network.