Multicast Data Frame Bitmap Encoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional network communication methods, such as unicast and multicast, are inefficient for high-bandwidth services like TV streaming, as they require multiple data frames and frequent recalculation of multicast spanning trees, leading to increased network traffic and bandwidth consumption.

Innovation Solution

The generation and routing of modified multimedia data frames that use a compact addressing scheme to encode destination addresses into a bitmap, allowing a single data frame to transmit content to multiple nodes, reducing network traffic and increasing available bandwidth by avoiding the need for frequent recalculation of multicast trees.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional unicast communication is used to transmit multimedia content to multiple nodes, then each node receives individual data frames, but network traffic increases and bandwidth consumption increases

Engineering Contradiction:
Improvedata delivery reliabilityVSAvoidnetwork traffic volume
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent combines multiple unicast data frames into a single modified multicast data frame by merging destination address fields into a bitmap format. This allows one data frame to carry content that would otherwise require multiple separate unicast frames, directly reducing network traffic volume while maintaining reliable delivery to multiple nodes

Inventive Principle:
Principle #5Merging (Combining)

2Quantity of substance

If conventional multicast communication is used to transmit content to multiple nodes, then network traffic is reduced, but frequent recalculation of multicast spanning trees increases processing complexity and time

Engineering Contradiction:
Improvenetwork traffic volumeVSAvoidrouting recalculation time
Core Design Contradiction:
Quantity of substanceVSLoss of time

Solution Approach 1:

The patent performs preliminary action by pre-calculating and storing routing information in forwarding tables before it is needed. When multicast content needs to be transmitted, the pre-computed routing information is directly used without requiring real-time recalculation of spanning trees, thus eliminating routing recalculation time delays while maintaining efficient traffic delivery

Inventive Principle:
Principle #10Preliminary action

3Use of energy by moving object

If conventional multicast communication is used, then bandwidth is utilized efficiently, but device complexity increases due to spanning tree calculation and maintenance

Engineering Contradiction:
Improvebandwidth utilization efficiencyVSAvoidrouting calculation complexity
Core Design Contradiction:
Use of energy by moving objectVSDevice complexity

Solution Approach 1:

The patent introduces forwarding tables as an intermediary layer between the multicast source and destination nodes. These tables store pre-computed routing information and act as a mediator that simplifies the forwarding process, eliminating the need for complex real-time spanning tree calculations at each node while maintaining efficient bandwidth utilization through multicast-style transmission

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentEP3552349B1Enhanced multicast network communications
Publication Date: 2024.05.01 GOOGLE LLC
  • EP3552349B1 patent drawingFigure 1
  • EP3552349B1 patent drawingFigure 2
  • EP3552349B1 patent drawingFigure 3

AI summary

Methods, systems, apparatus, including computer programs encoded on computer storage media, for generating and routing modified multimedia data frames. In one aspect, the method includes maintaining, by a first network node, channel membership data that includes data indicating, for each channel of a plurality of channels, leaf node membership for a plurality of channels, and for each channel of the plurality of channels: determining, based on the channel membership data, the leaf nodes that are subscribed to access the channel, generating, based on the leaf nodes that are subscribed to access the channel, a modified multimedia data frame for the channel that includes (i) a hub node identifier, (ii) data that describes a destination address of each leaf node that is subscribed to access the channel and (iii) a payload, and transmitting, by the first network node, the generated modified multimedia data frame to a second network node.