BIER Boundary Nodes Bridge Non-Capable Subnetworks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional multicast routing protocols in networks require extensive control plane information, leading to complexity and high computing resource costs, which limits network performance, especially in scenarios with many multicast sources and groups.
Innovation Solution
The implementation of Bit Indexed Explicit Replication (BIER) reduces state information by encoding receiver information in packet bit arrays, allowing nodes to determine reachable destinations without table lookups, and the use of bit indexed forwarding tables to replicate and forward multicast packets efficiently across networks, including non-BIER-capable subnetworks through tree configuration and ingress filtering.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional multicast routing protocols are used, then multicast data can be delivered to multiple receivers, but extensive control plane information is required leading to high complexity and computing resource costs
Solution Approach 1:
The patent extracts the receiver group information from the control plane and embeds it directly into the data packet header as a bit array. This allows receivers to be identified through packet inspection rather than maintaining extensive control plane state information, thereby reducing device complexity while preserving multicast delivery capability
Solution Approach 2:
The patent creates a compact copy of receiver group information in the form of a bit array that is attached to each data packet. This copied information enables receivers to determine whether they should process the packet without requiring the network infrastructure to maintain complex routing state, thus reducing control plane overhead
2Productivity
If traditional multicast routing protocols are used, then multicast data can be delivered to multiple receivers, but computing resources are consumed heavily which limits network performance
Solution Approach 1:
The patent extracts the computationally intensive receiver matching function from the control plane and implements it at the receiver end through simple bit array inspection. This shifts the computational burden from network infrastructure to end devices, significantly reducing computing resource consumption in the network while maintaining multicast delivery capability
Solution Approach 2:
The patent enables receivers to independently determine whether they should process incoming packets by inspecting the bit array in the packet header. This self-service mechanism eliminates the need for receivers to query network infrastructure or maintain complex subscription state, thereby reducing overall computing resource consumption in the network
3Productivity
If BIER is implemented across the entire network, then efficient multicast forwarding is achieved, but non-BIER-capable subnetworks cannot be traversed
Solution Approach 1:
The patent introduces BIER-capable boundary nodes as intermediaries between BIER domains and non-BIER subnetworks. These boundary nodes perform the complex BIER forwarding operations and translate between BIER bit arrays and traditional multicast routing protocols, allowing efficient BIER forwarding within capable domains while maintaining compatibility with non-BIER subnetworks
Solution Approach 2:
The patent segments the network into BIER-capable domains and non-BIER subnetworks, with each segment operating using its native protocol. BIER is implemented only within capable domains where it can provide efficiency benefits, while non-BIER subnetworks continue to use traditional protocols, thus maintaining overall network adaptability while achieving localized performance improvements
Data Source
AI summary
Methods and network devices are disclosed for traversal, within a network configured for bit indexed forwarding, of a subnetwork having nodes not configured for bit indexed forwarding. In one embodiment, a method includes receiving, from a next-hop upstream node configured for bit indexed forwarding, an incoming tree descriptor message comprising a tree identifier and a descriptor bit array. Bit values in the descriptor bit array identify intended destination nodes to be reached via a network tree identified by the tree identifier. The embodiment further includes replicating and modifying the incoming tree descriptor message to generate an outgoing tree descriptor message for a next-hop downstream node within the network tree. In addition, the embodiment includes sending the outgoing tree descriptor message to the next-hop downstream node and sending to the next-hop upstream node a local label allocated to the tree identifier.