BIER-TE Header Multiple Bitstring Sets
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing BIER-TE techniques are inadequate for handling paths with multiple sets of bitstrings, leading to inefficiencies and difficulties in computing and setting up paths, such as point-to-multipoint paths, due to the inability of conventional BIER-TE headers to accommodate more than one set of bitstrings.
Innovation Solution
The introduction of a BIER-TE header capable of accommodating multiple sets of bitstrings, along with updated bit index forwarding tables (BIFTs) and an enhanced forwarding procedure, allows for efficient processing and routing of packets within the BIER-TE domain by using indicators for the number of bitstrings and set identifiers, and employing second-level BIFTs for specific bitstring processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional BIER-TE header is used, then the structure is simple, but it cannot accommodate multiple sets of bitstrings
Solution Approach 1:
The BIER-TE header is segmented into multiple independent bitstring sets, where each set contains a bitstring and its corresponding set identifier. This segmentation allows the header to accommodate multiple sets of bitstrings while maintaining a structured and manageable format, directly resolving the contradiction between adaptability and complexity.
Solution Approach 2:
The patent introduces a new dimension to the BIER-TE header by adding set identifiers and organizing bitstrings into multiple sets. This dimensional expansion transforms the single-bitstring structure into a multi-set structure, enabling the header to handle complex paths with multiple bitstring sets without excessive complexity.
2Adaptability or versatility
If conventional BIER-TE forwarding procedure is used, then the processing is simple, but it cannot handle paths with multiple sets of bitstrings
Solution Approach 1:
The forwarding procedure is segmented into distinct steps: extracting set identifiers, validating bitstrings against the BIFT, and processing each bitstring set independently. This segmentation enables the procedure to handle multiple bitstring sets while keeping each processing step manageable and systematic.
Solution Approach 2:
The patent performs preliminary actions by pre-computing and storing multiple bitstring sets in the BIFT before actual packet forwarding. This preliminary preparation allows the forwarding router to efficiently validate and process bitstrings during packet transmission without complex real-time computations, resolving the contradiction between adaptability and procedural complexity.
3Adaptability or versatility
If conventional BIER-TE header is used, then the header size is small, but it cannot represent complex paths
Solution Approach 1:
The path representation is segmented into multiple bitstring sets, where each set is identified by a unique set identifier. This segmentation allows complex paths to be represented by organizing bitstrings into manageable sets within the header, enabling comprehensive path representation while controlling header length through structured organization.
Solution Approach 2:
The extended BIER-TE header structure serves multiple functions: it can represent both simple single-path scenarios and complex multi-path scenarios using the same multi-set framework. This universal structure accommodates various path complexities without requiring different header formats, resolving the contradiction between adaptability and header length.
4Manufacturing precision
If updated BIFT with multiple bitstring sets is used, then the forwarding accuracy is improved, but the table complexity increases
Solution Approach 1:
The BIFT is segmented into multiple entries, each associated with a specific set identifier and containing relevant bitstrings. This segmentation allows the forwarding table to accurately match packets to the correct bitstring sets based on set identifiers, improving forwarding accuracy while maintaining an organized and manageable table structure.
Solution Approach 2:
The patent uses copying by replicating bitstring sets across multiple BIFT entries with different set identifiers. This copying approach enables the forwarding table to handle multiple bitstring sets efficiently, improving forwarding accuracy for complex paths while avoiding the need for a single overly complex table entry.
Data Source
AI summary
A method implemented by a BFR in a BIER-TE domain. The method includes receiving a packet with a BIER-TE header, where the BIER-TE header includes an indicator indicating a number of the bitstrings in the BIER-TE header, and a set identifier for each of the bitstrings; checking whether a bitstring identified by the set identifier in the BIER-TE header and a bitstring identified by the set identifier in a top level BIFT each contain an adjacency bit position of the BFR with a same value; and processing the packet using a second level BIFT that a pointer for the set identifier in the top level BIFT points to when the two bitstrings each contain the adjacency bit position of the BFR with the same value.