T-CAM BIER Bit-String Lookups for Multicast Forwarding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional multicast forwarding methods, such as IP multicast, require significant computing resources and create network performance burdens due to the need for maintaining per-flow state information and multicast-specific tree building protocols, which is not efficient in all network environments.
Innovation Solution
Implementing Bit Index Explicit Replication (BIER) with ternary content-addressable memory (T-CAM) to store neighboring network nodes as bitmaps, allowing for efficient packet forwarding without per-flow entries by using a BIER header that identifies egress nodes and flooding IGP with a unique LSA, thereby reducing the complexity and resource requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional IP multicast forwarding is used, then packets can be forwarded along multicast trees, but significant computing resources are consumed and per-flow state information must be maintained
Solution Approach 1:
The patent extracts the flow-specific state information from the forwarding process by using BIER bitstrings that encode destination sets directly in the packet header. This eliminates the need for per-flow forwarding entries in router memory, removing the computational burden of maintaining multicast trees while preserving packet forwarding capability.
Solution Approach 2:
The patent uses bitstring copies to represent destination sets. Instead of maintaining complex tree structures, the destination information is copied into compact bitstring format in the BIER header, allowing efficient replication and forwarding without recalculating paths for each flow.
2Reliability
If per-flow state information is maintained for multicast forwarding, then accurate packet delivery is achieved, but resource requirements increase significantly
Solution Approach 1:
The patent merges multiple destination addresses into a single BIER bitstring where each bit position represents a potential egress router. This consolidation allows the router to handle multiple destinations simultaneously using a single forwarding entry rather than maintaining separate per-flow states, reducing memory resources while preserving delivery accuracy.
Solution Approach 2:
The patent changes the representation parameter from detailed per-flow state information to a compact bitstring format. By encoding destination sets as bit patterns where bit positions correspond to router identifiers, the system achieves the same packet delivery accuracy with dramatically reduced memory requirements.
3Reliability
If multicast-specific tree building protocols are implemented, then proper packet routing is achieved, but device complexity and operational complexity increase
Solution Approach 1:
The patent makes the BIER bitstring representation universal across all multicast flows within a domain. The same bitstring encoding scheme and forwarding mechanism work for all destination sets, eliminating the need for flow-specific tree building protocols. Routers use standard IGP protocols rather than multicast-specific protocols, simplifying operation while maintaining routing correctness.
4Reliability
If traditional multicast forwarding methods are used, then packets reach all intended destinations, but network performance is burdened by control information overhead
Solution Approach 1:
The patent segments the control plane and data plane by separating destination identification (in the BIER header bitstring) from path determination (handled by standard IGP protocols). This segmentation eliminates the need for routers to process multicast-specific control information for each packet, reducing overhead and improving network performance while ensuring complete delivery to all destinations indicated by set bits in the bitstring.
Data Source
AI summary
In one embodiment of a system, apparatus, and method the system, apparatus, and method including a table of neighboring network nodes stored in a ternary content-addressable memory (T-CAM), each one of the neighboring network nodes being indexed as a Bit Index Explicit Replication (BIER) bitmap, a plurality of selector lines in the T-CAM, each selector line associated with one neighboring network node, a bit set in the T-CAM for one single selector line among the plurality of selector lines such that the set bit is associated with a single match line, the single match line to be set high when an input on the selector line matches the set bit and otherwise to be set low, and a plurality of bits set to do not care for other selector lines, beside the one single selector line, associated with the single match line. Related systems, apparatuses, and methods are also described.