BIER Consolidation Encoding for Sparse Multicast Receiver Representation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current packet switching technologies, particularly in BIER networks, face scalability issues due to the use of full-size BitStrings in headers, which are not efficient when only a small subset of egress edge routers receive multicast packets, and non-contiguous BIER addresses complicate bit string representation.

Innovation Solution

The method involves selecting a consolidation encoding based on the sparseness of bit positions within a bit string for designated receiving packet switching devices, using either uniform or varying encoding manners to efficiently represent the subset of receivers, reducing the header size and improving scalability.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If full-size BitStrings are used in packet headers to represent all possible receivers, then all receivers can be represented, but the header size increases and scalability decreases

Engineering Contradiction:
Improvereceiver representation capabilityVSAvoidheader size
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent extracts only the necessary bit information from the full BitString based on the actual receiver addresses involved in each packet. Instead of always using the full 4096-bit string, the system extracts and transmits only the minimal required bits to represent the actual receivers, thereby reducing header overhead while maintaining complete receiver representation capability.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent dynamically changes the parameter of bit string length based on the sparseness of receiver addresses. When receiver addresses are sparse (few actual receivers), the system uses a compressed representation with fewer bits. When receivers are dense, the full BitString is used. This parameter adaptation resolves the contradiction between representation completeness and header size.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If full-size BitStrings are used to ensure all receivers are represented, then complete receiver information is provided, but packet processing efficiency decreases

Engineering Contradiction:
Improvereceiver information completenessVSAvoidpacket processing efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent applies partial action by processing only the necessary bits required for the actual receivers rather than always processing the full BitString. The system determines the minimal bit representation needed based on receiver address sparseness and processes only that portion, improving processing efficiency while maintaining complete receiver information for the actual recipients.

Inventive Principle:
Principle #16Partial or excessive action

Solution Approach 2:

The patent makes the bit string processing dynamic by adapting the processing length based on the actual receiver addresses in each packet. The system dynamically determines how many bits need to be processed based on the sparseness metric, allowing efficient processing when receivers are sparse while ensuring complete information processing when necessary.

Inventive Principle:
Principle #15Dynamics

3Adaptability or versatility

If non-contiguous BIER addresses are used to represent receivers, then flexible receiver selection is enabled, but bit string representation becomes more complex

Engineering Contradiction:
Improvereceiver selection flexibilityVSAvoidbit string representation
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments the BitString into manageable portions based on the actual receiver addresses. Instead of treating the 4096-bit string as a single complex unit, the system identifies and processes only the relevant segments corresponding to actual receivers, simplifying the representation of non-contiguous addresses while maintaining selection flexibility.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a compression mechanism as an intermediary between the full BitString and the packet header. This intermediary layer translates the complex non-contiguous address representations into compact encoded forms that can be efficiently stored and processed, resolving the complexity issue while preserving address representation flexibility.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS9712458B2Consolidation encodings representing designated receivers in a bit string
Publication Date: 2017.07.18 CISCO TECHNOLOGY INC
  • US9712458B2 patent drawing
  • US9712458B2 patent drawing
  • US9712458B2 patent drawing

AI summary

In one embodiment, for each particular multicast flow of a plurality of multicast flows of packets a particular consolidation encoding of a plurality of consolidation encodings is selected based on the sparseness of bit positions within a bit string corresponding to designated receiving packet switching devices of the particular multicast flow. The packet switching device sends one or more packets corresponding to said particular packet, with each of these one or more packets including designated receiving packet switching devices of the particular multicast flow in the header of said particular packet according to the particular consolidation encoding. In one embodiment, different consolidation encodings of the plurality of consolidation encodings are used for at least two different multicast flows of the plurality of multicast flows of packets. In one embodiment, each of said receiving packet switching devices is Bit Index Explicit Replication (BIER) Bit-Forwarding Router (BFR).