MPLS Manage Header for Flexible Ancillary Data Indication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing MPLS architectures face challenges in efficiently indicating and analyzing ancillary data carried at the stack bottom, leading to high complexity and low data processing efficiency, particularly in scenarios where data size changes or multiple pieces of data are involved, and current solutions like IPv6 expansion headers or indicator labels result in increased label stack depth and processing costs.
Innovation Solution
Introduce an MPLS manage header located after the stack bottom label and prior to ancillary data, which includes data type and offset length information, allowing nodes to determine required data types without reading ancillary data, thereby reducing indication complexity and enabling efficient processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If indicator labels are used to indicate ancillary data at stack bottom, then data carrying capability is improved, but label stack depth increases and processing complexity increases
Solution Approach 1:
The patent extracts the indication function from the label stack by introducing a separate manage header structure. The manage header contains a data structure identifier that points to ancillary data, separating the indication mechanism from the label stack itself. This allows ancillary data to be indicated without increasing label stack depth, as the indication is handled through the manage header's data structure identifier rather than additional labels.
Solution Approach 2:
The manage header acts as an intermediary between the label stack and ancillary data. It contains a data structure identifier that mediates the connection between the MPLS message and the ancillary data, allowing nodes to access ancillary data information without traversing through multiple indicator labels. This intermediary structure reduces processing complexity while maintaining data carrying capability.
2Adaptability or versatility
If IPv6 expansion header mode is used for ancillary data, then data flexibility is improved, but message processing efficiency deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-defining the manage header structure with a data structure identifier that directly references ancillary data. This allows nodes to quickly identify and access ancillary data without performing chained analysis similar to IPv6 expansion headers. The manage header is prepared in advance with the necessary identification information, enabling efficient direct access to ancillary data while maintaining flexibility.
3Ease of operation
If offset information is stored in label stack, then ancillary data accessibility is improved, but solution expansibility deteriorates due to susceptibility to label stack changes
Solution Approach 1:
The patent inverts the traditional approach by placing the data structure identifier in the manage header rather than in the label stack. Instead of storing offset information that is susceptible to label stack changes, the manage header contains a stable identifier that independently references ancillary data. This inversion makes the solution more expandable, as the identifier remains valid even when the label stack structure changes, while still maintaining easy access to ancillary data.
Data Source
AI summary
Provided in the embodiments of the present disclosure is an MPLS message encapsulation method. The method comprises: setting an MPLS manage header in a stack bottom structure of an MPLS label stack, where the MPLS manage header is located after a stack bottom label and prior to ancillary data; the MPLS manage header includes: a data type and offset length information of the ancillary data; and the stack bottom structure includes: the MPLS manage header and the ancillary data. By means of the technical solution, the problems in the related art of high complexity, low efficiency, etc. of an indication mode of an MPLS label stack are solved.