Bit Indexed Explicit Replication Forwarding Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional multicast systems face challenges with high computational costs and inefficiencies due to excessive control plane information and unnecessary packet delivery, which burdens network performance.
Innovation Solution
Bit Indexed Explicit Replication (BIER) reduces state information by attaching receiver information to packets as bits and using bit-indexed forwarding tables to forward packets only to specified nodes, eliminating the need for multicast distribution trees and per-group state information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional multicast systems are used to forward packets to multiple receivers, then packet delivery is achieved, but control plane information becomes excessive and computational costs increase
Solution Approach 1:
The patent extracts the receiver identification information from complex control plane data structures and encodes it directly into packet headers as bit strings. This removes the burden of maintaining extensive multicast state information in network nodes while preserving the ability to deliver packets to multiple receivers efficiently.
Solution Approach 2:
The patent changes the representation parameter of receiver information from traditional multicast group addresses and distribution tree structures to compact bit strings where each bit position corresponds to a specific receiver or receiver group. This parameter transformation dramatically reduces the amount of control plane information required.
2Productivity
If traditional multicast forwarding is used, then packets are delivered to multiple nodes, but packets are sometimes forwarded to locations where they were not desired
Solution Approach 1:
The patent implements a feedback mechanism where receivers send join messages that set specific bits in a bit string at the source node. This feedback loop ensures that packets are only forwarded to locations where receivers have explicitly indicated they want to receive them, eliminating unnecessary packet delivery while maintaining comprehensive delivery coverage.
3Productivity
If multicast distribution trees and per-group state information are maintained, then packet forwarding is enabled, but computational burdens increase
Solution Approach 1:
The patent enables packet forwarding capability without requiring network nodes to maintain per-group state information. The bit string carried in each packet contains all the necessary forwarding information, allowing nodes to make forwarding decisions based solely on the packet contents rather than consulting external state tables, thereby significantly reducing computational burden.
Data Source
AI summary
Disclosed is the generation of a bit-indexed forwarding table (BIFT) that can include a plurality of entries, each such entry corresponding to a bit position of a plurality of bit positions, where each such bit position represents an egress network node of a plurality of egress network nodes, and the generating configures the BIFT to be used in forwarding a packet to one or more of the plurality of egress network nodes, based at least in part on a bit string in the packet. The generating includes selecting a bit position of the plurality of bit positions as a selected bit position, creating an entry of the plurality of entries (where the entry corresponds to the selected bit position), identifying a neighbor node associated with the selected bit position, and updating one or more fields of the entry with neighbor information regarding the neighbor node.