BIER Multicast Steering via Tree Identity Bit Arrays

Resolve Bottlenecks,
Find Innovative Solutions
Generate 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

The implementation of Bit Indexed Explicit Replication (BIER) reduces state information by encoding receiver information in a bit array carried by packets, using bit indexed forwarding tables to determine intended destinations and route packets efficiently without extensive table lookups, and the introduction of tree-based BIER (BIER-Tr) for traffic engineering, which employs a tree identifier and message bit array for explicit path definition.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If traditional multicast systems are used to forward data to multiple receivers, then multicast functionality is achieved, but control plane information complexity and resource requirements increase significantly

Engineering Contradiction:
Improvemulticast functionalityVSAvoidcontrol plane information complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent extracts receiver identification information from complex control plane data structures and embeds it directly in the packet header as a bit array. Each bit position in the array corresponds to a specific receiver, allowing the packet to carry explicit replication instructions without requiring extensive control plane state at intermediate nodes.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the representation of receiver information from traditional complex data structures to a compact bit array format. This parameter transformation reduces the information density and simplifies the forwarding logic at each network node, as they only need to check bit positions rather than process complex control plane entries.

Inventive Principle:
Principle #35Parameter changes

2Productivity

If traditional multicast forwarding tables are maintained to route packets to multiple destinations, then packet delivery to multiple receivers is enabled, but memory resources and processing overhead increase

Engineering Contradiction:
Improvepacket delivery capabilityVSAvoidcontrol plane information volume
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The patent uses a copy of the bit array at each forwarding node to determine which packets need to be replicated. Instead of maintaining complex multicast forwarding tables, each node creates copies of the packet for destinations indicated by set bits in the local bit array copy, then clears those bits to prevent further replication of the same packet along the same path.

Inventive Principle:
Principle #26Copying

Solution Approach 2:

The patent segments the multicast forwarding function into individual bit position checks at each network node. Rather than processing the entire multicast group list at every node, each node only evaluates the specific bit positions relevant to its local routing decisions, dividing the complex forwarding task into simple, independent bit-level operations.

Inventive Principle:
Principle #1Segmentation

3Adaptability or versatility

If extensive control plane information is used to manage multicast traffic in large networks, then comprehensive traffic management is achieved, but network performance and scalability deteriorate

Engineering Contradiction:
Improvetraffic management capabilityVSAvoidnetwork performance
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent enables packets to carry their own routing information through the bit array in the header. Each packet essentially services its own forwarding needs by presenting the bit array to intermediate nodes, which independently determine replication decisions based on local bit positions without requiring centralized control plane intervention for each packet.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent performs preliminary encoding of the multicast group membership information into the bit array format at the source node before packet transmission. This pre-processing action consolidates all routing decisions into the packet header itself, eliminating the need for intermediate nodes to perform complex control plane lookups and improving overall network performance.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10985942B2Multicast traffic steering using tree identity in bit indexed explicit replication (BIER)
Publication Date: 2021.04.20 CISCO TECHNOLOGY INC
  • US10985942B2 patent drawing
  • US10985942B2 patent drawing
  • US10985942B2 patent drawing

AI summary

Methods and network devices are disclosed for multicast traffic steering in a communications network. In one embodiment, a method includes receiving, at a node in a network, a multicast message comprising an incoming message bit array and a tree identifier value. The embodiment further includes selecting a bit indexed forwarding table stored at the node and corresponding to the tree identifier value, accessing within the selected forwarding table an entry corresponding to an intended destination node for the message, and forwarding, to a neighboring node identified in the accessed entry, a copy of the message comprising a forwarded message bit array in place of the incoming message bit array. An embodiment of a network device includes one or more network interfaces and a processor adapted to perform steps of the method.