Segmented SID List Forwarding for Long Network Paths

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Data transmission networks face issues with normal data transmission due to excessively long target forwarding paths exceeding the maximum path length supported by devices, leading to failed data transmission.

Innovation Solution

The method involves classifying M nodes in the target forwarding path into at least two subpaths, with the head node generating a first SID list based on the first N nodes, and intermediate nodes replacing this list with a second SID list generated from the (N+1)th to Mth nodes, ensuring the maximum quantity of SIDs supported by devices is not exceeded.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Area of stationary object

If the target forwarding path is extended to cover more nodes, then the data transmission coverage is improved, but the path length exceeds the maximum SID depth supported by devices

Engineering Contradiction:
Improvedata transmission coverageVSAvoidSID list length
Core Design Contradiction:
Area of stationary objectVSDevice complexity

Solution Approach 1:

The patent divides the complete SID list representing the entire target forwarding path into multiple sub-SID lists, each containing SIDs for a subset of nodes. The head node encapsulates only the first sub-SID list in the packet header, and intermediate nodes sequentially replace sub-SID lists as packets traverse different path segments. This segmentation reduces the SID list length at any single node to within the maximum SID depth limit while maintaining end-to-end path coverage.

Inventive Principle:
Principle #1Segmentation

2Length of stationary object

If the maximum SID depth is increased to support longer paths, then the path length capacity is improved, but the device complexity and memory requirements increase

Engineering Contradiction:
Improvemaximum path lengthVSAvoiddevice memory requirements
Core Design Contradiction:
Length of stationary objectVSDevice complexity

Solution Approach 1:

Instead of increasing the maximum SID depth in devices, the patent segments the SID list into multiple sub-SID lists distributed across different nodes. Each node only needs to store and process a portion of the complete path (one sub-SID list), dramatically reducing individual device memory requirements while collectively supporting arbitrarily long paths through coordinated replacement operations.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Intermediate nodes act as mediators that receive packets with one sub-SID list, replace it with the next sub-SID list in the sequence, and forward packets继续沿 the path. This intermediary mechanism enables long path support without requiring any single device to store the complete path, distributing the memory burden across multiple nodes.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Manufacturing precision

If the complete SID list is encapsulated in the packet header, then the forwarding accuracy is improved, but the packet header size exceeds device processing capabilities

Engineering Contradiction:
Improveforwarding accuracyVSAvoidpacket header size
Core Design Contradiction:
Manufacturing precisionVSVolume of moving object

Solution Approach 1:

The complete SID list is segmented into multiple sub-SID lists that are sequentially activated. The packet header contains only the current active sub-SID list rather than the complete path, keeping header size within processing capabilities. Each intermediate node replaces the active sub-SID list with the next segment, ensuring forwarding accuracy is maintained through precise node identification while avoiding header size limitations.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentEP3907942B1Data forwarding method and related device
Publication Date: 2024.09.18 HUAWEI TECH CO LTD
  • EP3907942B1 patent drawingFigure 1
  • EP3907942B1 patent drawingFigure 2A
  • EP3907942B1 patent drawingFigure 2B

AI summary

This application provides a data forwarding method and a related apparatus. The method includes: A head node obtains to-be-forwarded data; obtains a first segment identifier SID list corresponding to the to-be-forwarded data, where the first SID list is generated based on SIDs of a part of nodes in a target forwarding path; encapsulates, in front of the to-be-forwarded data, a packet header including the first SID list, to obtain a to-be-forwarded packet; and sends the to-be-forwarded packet based on the first SID list, where the target forwarding path includes M nodes, the first SID list is generated based on first N nodes in the M nodes, the first SID list is replaced with a second SID list at an intermediate node, and the second SID list is generated based on an Xth node to a Yth node in the M nodes, where M is greater than N, N is greater than or equal to 1, X is greater than or equal to N, and Y is less than or equal to M. The technical solutions provided in this application can resolve a problem that data information fails to be normally transmitted in a data transmission network because a target forwarding path is excessively long.