BIER Replication Path Cache for Multicast Forwarding

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

The repeated inspection and modification of bit strings in Bit Index Explicit Replication (BIER) packets on each forwarding router lead to time-consuming processing, resource wastage, and degraded network performance for multicast transport.

Innovation Solution

Implementing a Bit Index Explicit Replication Path Cache Table (BRCT) to store computed replication paths, allowing data packets to be forwarded based on pre-calculated next-hop lists, reducing the need for bit string modifications and improving processing efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If bit string inspection and modification is performed on each BFR, then correct multicast forwarding is achieved, but processing time increases and network performance degrades

Engineering Contradiction:

Improvecorrect multicast forwardingVSAvoidprocessing time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The patent pre-calculates and stores the replication path (next-hop BFR list) in a BIER forwarding table before packets arrive. When a BIER packet arrives, the BFR performs a simple table lookup using the bit string as index to retrieve the pre-computed next-hop list, avoiding repeated bit string inspection and modification operations on each packet.

Inventive Principle:

Principle #10Preliminary action

2Reliability

If bit string modification is performed on each BFR, then looping and duplication are prevented, then multicast forwarding accuracy is improved, but resource consumption increases

Engineering Contradiction:

Improvemulticast forwarding accuracyVSAvoidresource consumption

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The replication path that prevents looping and duplication is pre-calculated during table construction. The BIER forwarding table stores the finalized next-hop list that already accounts for loop prevention, eliminating the need for repeated bit string modification operations on each packet while maintaining forwarding accuracy.

Inventive Principle:

Principle #10Preliminary action

3Measurement precision

If repeated bit string inspection is performed on each BFR, then correct next-hop determination is achieved, but multicast transport speed decreases

Engineering Contradiction:

Improvenext-hop determination accuracyVSAvoidmulticast transport speed

Core Design Contradiction:

Measurement precisionVSSpeed

Solution Approach 1:

The BIER forwarding table pre-stores the mapping between bit string indices and next-hop BFR lists. This allows O(1) table lookup operations instead of repeated bit string inspection, significantly improving packet forwarding speed while maintaining next-hop determination accuracy through the pre-computed replication paths.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS9832031B2Bit index explicit replication forwarding using replication cache

Publication Date: 2017.11.28 FUTUREWEI TECHNOLOGIES INC

AI summary

A data packet forwarding method including receiving, by a network node, a data packet that comprises a bit string, a BFIR identifier (ID), and a multicast replication path (MRP) ID, wherein the BFIR ID identifies an ingress network node for a multicast group, and wherein the MRP ID identifies the multicast group, identifying an entry in a BIER Replication Path Cache Table (BRCT) using the BFIR ID and the MRP ID, wherein the entry identifies a replication neighbor (NBR) list associated with the BFIR ID and the MRP ID, and forwarding the data packet in accordance with the replication NBR list.