SR-BE Path Overlap Detection for Network Slice Computation Load

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In network technologies, the existing methods for determining forwarding paths in network slicing with SRv6 protocols lead to high computation loads for nodes, resulting in performance deterioration due to the need for extensive path computation across all nodes in logical topologies.

Innovation Solution

A method that involves a path computation node determining SR-BE and SR-TE forwarding paths within virtual and physical networks, respectively, to identify overlapping paths and select the appropriate path as the target forwarding path, thereby reducing the computation burden on forwarding nodes and ensuring performance by using SR-BE or SR-TE paths based on overlap conditions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If all nodes in each logical topology perform path computation to determine forwarding paths, then forwarding path accuracy is improved, but node computation load increases and performance deteriorates

Engineering Contradiction:
Improveforwarding path accuracyVSAvoidnode performance
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent segments the network nodes into two distinct roles: path computation nodes (PCNs) that perform path computation, and forwarding nodes that only execute forwarding based on received instructions. This segmentation allows path computation to be concentrated on specific nodes with sufficient computational resources, while forwarding nodes can operate with minimal computation load, thus resolving the contradiction between path accuracy and node performance.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces path computation nodes as intermediary entities that act as mediators between the control plane and forwarding nodes. These PCNs receive path computation requests, calculate optimal forwarding paths, and distribute forwarding instructions to relevant nodes. This intermediary mechanism centralizes computation tasks, preventing performance deterioration at forwarding nodes while maintaining accurate path determination.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If path computation is performed by all nodes in logical topologies, then forwarding path optimization is improved, but computation time increases

Engineering Contradiction:
Improveforwarding path optimizationVSAvoidcomputation time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

By segmenting computation responsibilities and assigning them only to designated path computation nodes rather than all nodes, the patent reduces the total number of nodes performing computation. This segmentation maintains path optimization quality while significantly reducing overall computation time in the network.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements preliminary action by having path computation nodes pre-calculate and store forwarding paths and instructions before actual data transmission occurs. When forwarding requests are received, nodes can quickly retrieve pre-computed instructions rather than performing real-time computation, thus maintaining optimization while reducing computation time.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentEP3905614B1Method, device and system for determining forwarding path
Publication Date: 2024.09.04 HUAWEI TECH CO LTD
  • EP3905614B1 patent drawingFigure 1A~1C
  • EP3905614B1 patent drawingFigure 2
  • EP3905614B1 patent drawingFigure 3

AI summary

A forwarding path determining method, an apparatus, and a system are provided, and relate to the field of network technologies, to reduce a computation amount of a forwarding node and ensure forwarding performance of the forwarding node. The method includes: determining, by a path computation node, a first SR-BE forwarding path from a first node to a second node in a first virtual network; determining, by the path computation node, a second SR-BE forwarding path from the first node to the second node in a physical network, where the first virtual network is a virtual network established over the physical network; and when the first SR-BE forwarding path completely overlaps the second SR-BE forwarding path, determining, by the path computation node, the first SR-BE forwarding path as a target forwarding path from the first node to the second node in the first virtual network; or when the first SR-BE forwarding path does not completely overlap the second SR-BE forwarding path, determining, by the path computation node, a first SR-TE forwarding path according to the physical network and the first virtual network, and determining the first SR-TE forwarding path as a target forwarding path from the first node to the second node in the first virtual network.