Hierarchical BIER Multicast Replication for Scalable Router Domains
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In existing Bit Index Explicit Replication (BIER) architectures, the ingress router replicates multicast packets linearly with the number of subdomain and router set combinations, leading to bandwidth waste and computational burden, while control and data plane tables grow linearly with the number of routers, increasing convergence time.
Innovation Solution
Implementing a hierarchical BIER architecture that segregates egress routers into groups based on their location, limiting packet replications to three copies, and using separate routing and forwarding tables to manage multicast packets efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the ingress router replicates multicast packets for each subdomain and router set combination, then all egress routers can receive the multicast packet, but the number of packet replications grows linearly with the number of subdomain and router set combinations, leading to bandwidth waste and computational burden
Solution Approach 1:
The network is divided into multiple BIER domains, each managing a subset of egress routers. This segmentation allows packet replication to be performed locally within each domain rather than globally across all domains, reducing the total number of replications from linear growth to a fixed number regardless of network size.
Solution Approach 2:
Border BFRs (Bit Forwarding Routers) act as intermediaries between different BIER domains. They receive multicast packets from ingress BFRs, perform localized replication to reach egress BFRs within their domain, and forward packets to other domains as needed. This intermediary mechanism eliminates the need for the ingress router to replicate packets to every possible destination across all domains.
2Reliability
If control plane and data plane state information is maintained for each multicast flow and router, then multicast packet routing can be tracked, but the tables grow linearly with the number of routers, increasing convergence time
Solution Approach 1:
The control plane and data plane tables are segmented by BIER domain rather than being global across the entire network. Each border BFR maintains tables only for its local domain, reducing table size from linear growth with total router count to a fixed size determined by domain configuration. This segmentation enables faster convergence when network changes occur.
3Device complexity
If a flat BIER architecture is used, then implementation is simpler, but packet replication and table entries grow linearly with network size, reducing scalability
Solution Approach 1:
The architecture transitions from a flat two-dimensional structure (ingress to egress across all routers) to a hierarchical multi-dimensional structure with BIER domains, border BFRs, and local egress BFRs. This dimensional change introduces domain boundaries that limit replication scope and table size, enabling the network to scale without linear growth in resource consumption.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A hierarchical domain includes egress routers, an ingress router, set gateway routers, and subdomain gateway routers. The ingress router receives a multicast packet in a flow associated with the egress routers. The ingress router is in a first set of egress routers in a first subdomain of the hierarchical domain. The set gateway routers provide gateways to second sets of the plurality of egress routers in the first subdomain. The subdomain gateway routers provide gateways to second subdomains that includes sets of the plurality of egress routers. The ingress router generates a first copy of the multicast packet for transmission to the first set of egress routers based on a first bitstring, a second copy of the multicast packet for transmission to the set gateway routers based on a second bitstring, and a third copy of the multicast packet to the subdomain gateway routers based on a third bitstring.