BIER-TE Multicast Forwarding via Bit Array Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional multicast systems in networks face scalability limitations due to the complexity and resource intensity of maintaining control plane information, particularly in large networks with many multicast sources and groups, which hampers network performance.
Innovation Solution
Bit Indexed Explicit Replication with Traffic Engineering (BIER-TE) reduces multicast state information by encoding receiver information in packet bit arrays, allowing for explicit path definition and efficient forwarding without the need for extensive table lookups, using bit positions to represent links within the network path.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional multicast systems are used to deliver data to multiple receivers, then data delivery to multiple receivers is achieved, but control plane information complexity and computing resource consumption increase significantly
Solution Approach 1:
The patent segments the multicast forwarding function by separating the control plane (ingress router) from the data plane (egress routers). The ingress router performs complex control operations including receiving multicast data, determining egress routers, and generating BIER packets with bit arrays. Egress routers only perform simple bit array matching and data forwarding, eliminating the need for complex control plane information at each node.
Solution Approach 2:
The patent introduces BIER bit arrays as an intermediary mechanism between the ingress router and egress routers. The bit array encodes receiver information in a compact form that can be efficiently processed. Each bit position represents a specific egress router, allowing the ingress router to specify multiple destinations without requiring complex control plane state at intermediate nodes.
2Adaptability or versatility
If traditional multicast systems maintain control plane information for many multicast sources and groups, then comprehensive multicast support is achieved, but computing resources are excessively consumed
Solution Approach 1:
The patent extracts the complex control plane information requirements from individual network nodes and consolidates them at the ingress router only. The BIER mechanism allows any number of multicast groups and sources to be supported by encoding receiver information in bit arrays, while egress routers maintain minimal state by only needing to match their own bit positions in incoming packets.
Solution Approach 2:
The patent changes the representation of receiver information from complex control plane data structures to compact BIER bit arrays. Each bit position in the array represents a specific egress router, allowing efficient encoding of multiple destinations. This parameter change enables scalable multicast support where the complexity does not grow linearly with the number of multicast groups and sources.
3Reliability
If extensive table lookups are performed for multicast forwarding, then accurate routing is achieved, but forwarding efficiency decreases
Solution Approach 1:
The patent uses bit array copying and matching instead of extensive table lookups. The BIER bit array is copied from the ingress router and matched against bit arrays stored at egress routers. This copying mechanism maintains routing accuracy by preserving the exact receiver specification while enabling fast processing through simple bit-wise operations rather than complex table searches.
Solution Approach 2:
The patent replaces the mechanical table lookup process with bit array matching operations. Instead of searching through complex forwarding tables at each node, the system uses bitwise AND operations between the incoming packet's bit array and stored bit arrays at egress routers. This substitution dramatically reduces processing time while maintaining accurate routing to the correct destinations.
Data Source
AI summary
Methods, network devices and computer readable media are disclosed for traffic-engineered forwarding through a new form of bit indexed explicit replication. In one embodiment, a method includes receiving, at an ingress node of a network, a message associated with a message flow, obtaining a message bit array corresponding to the message flow, encapsulating the message with the message bit array to form an encapsulated message, and forwarding the encapsulated message into the network. Bit positions in the message bit array are assigned to separate segments of a path or tree in the network, and an explicit path or tree for the message flow is defined as an end to end connection of multiple segments assigned bit positions having a first bit value in the message bit array.