BIER Forwarding Table Generation with Duplicate BFR-ID Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing technologies for generating forwarding tables in BIER networks lead to unnecessary occupation of network bandwidth, device overload, and packet loss due to excessive advertisement.
Innovation Solution
A method and apparatus for generating forwarding tables that judge the presence of duplicate BFR-IDs, determine a target BFR-Prefix from existing prefixes, and generate the forwarding table based on this prefix, thereby reducing redundant entries and advertisements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If protocols such as OSPF and ISIS are used to advertise BIER information by extension, then all nodes in the BIER domain receive BIER information of other nodes and construct BIER forwarding table entries, but this causes unnecessary occupation of network bandwidth, increases device burden, and leads to packet loss due to excessive advertisement
Solution Approach 1:
The patent extracts and removes redundant BIER advertisement information from the network. Specifically, it identifies that BFER nodes do not need to advertise their BIER information to other BFER nodes, and only BFIR nodes should perform advertisements. This extraction of unnecessary advertisement traffic directly reduces network bandwidth occupation while maintaining reliable forwarding table construction for nodes that actually need the information.
Solution Approach 2:
The patent inverts the traditional flooding mechanism by which all nodes receive all BIER advertisements. Instead of having every node advertise to every other node, the invention reverses this by having only BFIR nodes advertise to BFER nodes, and preventing BFER-to-BFER advertisements. This inversion fundamentally changes the advertisement pattern from universal flooding to targeted notification, reducing bandwidth consumption while maintaining forwarding reliability.
2Reliability
If protocols such as OSPF and ISIS are used to advertise BIER information by extension, then all nodes in the BIER domain receive BIER information of other nodes, but this causes device overload and increases the burden of devices
Solution Approach 1:
The patent extracts and removes the requirement for BFER nodes to perform BIER information advertisements. By identifying that BFER nodes only need to receive advertisements (not send them), the invention eliminates the computational burden of advertisement generation and processing from BFER devices. This extraction reduces device complexity and operational burden while maintaining the reliability of forwarding table construction through preserved BFIR advertisements.
Solution Approach 2:
The patent inverts the advertisement role assignment in the BIER domain. Traditionally, all nodes including BFERs perform advertisements, but the invention reverses this by designating only BFIR nodes as advertisement sources. This role inversion significantly reduces the number of devices actively participating in advertisement processes, thereby reducing overall device burden and complexity while maintaining reliable forwarding table construction at receiving nodes.
3Loss of information
If all nodes advertise their BIER information to all other nodes, then complete routing information is available, but this causes packet loss due to the excessive huge amount of advertisement
Solution Approach 1:
The patent extracts and removes redundant advertisement transmissions from the system. By identifying that BFER nodes do not need to advertise their presence or capabilities to other BFER nodes (since they only receive traffic), the invention eliminates this redundant information flow. This extraction reduces total advertisement volume and bandwidth consumption while preserving complete forwarding information availability through targeted advertisements from BFIR nodes to BFER nodes.
Solution Approach 2:
The patent inverts the advertisement directionality and participation model. Instead of all nodes advertising to all nodes (universal flooding), the invention reverses this to have only BFIR nodes advertising to BFER nodes (targeted notification). This inversion maintains complete forwarding information availability because BFIR nodes are the only ones that need to know BFER locations, while eliminating excessive advertisement traffic that would cause packet loss and bandwidth exhaustion.
Data Source
AI summary
The present disclosure provides a method and apparatus for generating a forwarding table, a storage medium, and an electronic apparatus. Said method includes: judging, when a target forwarding table is to be generated on the basis of a received first advertisement message, whether there is a second BFR-ID same as a first BFR-ID in existing BFR-IDs in the target forwarding table, wherein the first advertisement message is used for advertising the first BFR-ID of a first BFER; determining, when it is determined that there is the second BFR-ID, a target BFR-Prefix from a first BFR-Prefix corresponding to the first BFR-ID and a second BFR-Prefix corresponding to the second BFR-ID; and generating the target forwarding table on the basis of the target BFR-Prefix. The present solves the problems of unnecessary occupation of network bandwidth, overload of devices, and packet loss due to an excessively large amount of advertisement existing.