BIER-TE Packet Forwarding via Multiple BST Sub-Packages
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The Bit Indexed Explicit Replication-traffic Engineering (BIER-TE) technology faces limitations in network scalability and message forwarding efficiency due to the rigid bit string length (BSL) and the requirement for all bit positions to belong to the same set, leading to potential message forwarding interruptions and inefficiencies when network scale is extended.
Innovation Solution
The method involves acquiring and forwarding multiple Bit String (BST) sub-package structures from a BIER-TE message, allowing for a new message package format that carries multiple BSTs, thereby overcoming the limitations of a single index parameter and BST, enhancing flexibility and efficiency in message forwarding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Area of stationary object
If the BIER domain is divided into sub-domains and multiple BSTs are used to accommodate large network scale, then network scalability is improved, but message forwarding efficiency deteriorates due to increased replication and forwarding times
Solution Approach 1:
The patent segments the single BST into multiple BST sub-packages, each handling a specific set of adjacencies. This allows the message to be forwarded using multiple specialized BSTs simultaneously, maintaining efficiency while supporting large network scales through sub-domain division.
Solution Approach 2:
The patent introduces a new dimension by allowing multiple BSTs to coexist in a single message, transitioning from a single-dimension BST structure to a multi-dimension structure. This enables parallel forwarding paths and reduces the need for sequential replication, thereby improving forwarding efficiency in large networks.
2Ease of operation
If all BPs are required to belong to the same set for message forwarding, then forwarding simplicity is improved, but adaptability deteriorates when network scale is extended
Solution Approach 1:
The patent segments the adjacency sets into multiple groups, with each BST sub-package handling a specific group. This segmentation allows different sets of BPs to be distributed across multiple BSTs while maintaining the simplicity of set-based forwarding within each subset, thereby improving adaptability to large networks.
Solution Approach 2:
The patent introduces dynamic selection of BST sub-packages based on the message's destination requirements. The system dynamically determines which BSTs to use based on the specific adjacency set needed, providing both simplicity for common cases and adaptability for extended network scenarios.
3Device complexity
If a single BST is used to identify adjacencies, then message package structure is simplified, but resource allocation flexibility deteriorates
Solution Approach 1:
The patent segments the single BST resource into multiple BST sub-packages, each dedicated to specific adjacency sets. This segmentation provides flexible resource allocation by allowing different BSTs to be optimized for different network regions or traffic patterns, while the overall package structure remains manageable through standardized sub-package formatting.
Data Source
AI summary
Provided are a packet forwarding method based on BIER-TE, a node device and a storage medium. The method includes: acquiring X bit string sub-package structures from a BIER-TE based message; and forwarding the message according to the X bit string sub-package structures, where X is greater than or equal to 1.