Flexible-Algorithm Label Deduction for Segment Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As computer networks scale, the number of labels advertised and stored increases, leading to inefficient network resource consumption due to the need for routers to advertise and store node labels for each flexible-algorithm they participate in, which can result in significant resource wastage.
Innovation Solution
Implementing a method where routers advertise only a base node label, allowing receiving routers to deduce node labels for other flexible-algorithms, thereby constructing label stacks to steer packets along segment routing paths without the need for redundant label advertisements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If routers advertise node labels for each flexible-algorithm they participate in, then routing accuracy and flexibility are improved, but network resource consumption increases
Solution Approach 1:
A single base node label is designed to serve multiple flexible-algorithms simultaneously. Instead of creating dedicated labels for each algorithm, the base node label becomes a universal identifier that receiving routers can interpret across different flexible-algorithm contexts, thereby reducing the total number of labels while maintaining routing flexibility.
Solution Approach 2:
The patent changes the parameter approach from having multiple distinct label values to having a single base label with varying algorithm parameters. By changing how routers interpret the same label across different algorithm contexts rather than using different label values, the system reduces label quantity while preserving adaptability.
2Measurement precision
If routers store multiple node labels for different flexible-algorithms, then path computation accuracy is improved, but memory consumption and processing overhead increase
Solution Approach 1:
The base node label serves as a universal key that routers use across multiple flexible-algorithms. Instead of storing separate label entries for each algorithm, routers store the base label once and derive algorithm-specific information through parameter interpretation, significantly reducing memory requirements and processing overhead while maintaining path computation accuracy.
Solution Approach 2:
Instead of storing actual duplicate label data for each flexible-algorithm, the system creates virtual copies through parameter derivation. Routers generate algorithm-specific label interpretations on-demand from the base node label, avoiding the need to physically store multiple redundant label sets while maintaining the appearance of having complete label information for each algorithm.
3Adaptability or versatility
If the network scale increases with more devices and slices, then network capability and coverage are improved, but label advertisement overhead and resource consumption increase
Solution Approach 1:
The base node label acts as a universal identifier that scales efficiently across the network. Whether the network has a few devices or many, each device advertises a single base label that can be used across all flexible-algorithms, preventing label advertisement overhead from increasing linearly with network scale while maintaining full network capability and coverage.
Data Source
AI summary
A flexible-algorithm routing method comprises: receiving, by a first router, a route advertisement including a base node label, for a second router, associated with a segment routing path without flexible-algorithm, wherein the second router participates in a flexible-algorithm; deducing, by the first router and from the base node label, a node label, for the second router, associated with a segment routing path with the flexible-algorithm; and constructing, by the first router, a label stack including the node label for the second router to steer a packet to the second router via the segment routing path with the flexible-algorithm.