Blockchain Proposal Delivery with Adaptive Retransmission Intervals

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current proposal retransmission methods in blockchain systems cause network congestion due to frequent retransmissions of large data proposals, affecting overall system performance.

Innovation Solution

The leader node in a blockchain system records the quantity of transmissions to each follower node and determines a time interval for retransmission based on this quantity, increasing the interval with each retransmission to alleviate network congestion.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the leader node retransmits the proposal to follower nodes not receiving the proposal every one second, then the consensus performance of the regional chain system is ensured, but network congestion occurs due to frequent retransmission of large data proposals

Engineering Contradiction:
Improveconsensus performanceVSAvoidnetwork congestion
Core Design Contradiction:
ReliabilityVSObject-generated harmful factors

Solution Approach 1:

The patent applies dynamics by making the retransmission time interval variable rather than fixed. The leader node adjusts the retransmission interval dynamically based on the number of times the proposal has been retransmitted to each follower node. Specifically, the time interval increases with each retransmission attempt, transforming the static one-second interval into a dynamic adaptive interval that responds to transmission history and network conditions.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent implements parameter changes by modifying the time interval parameter for retransmission. The leader node changes the retransmission interval parameter from a constant value (1 second) to a variable value that depends on the retransmission count. This parameter transformation allows the system to balance between ensuring consensus reliability and avoiding network congestion by adjusting the timing parameter based on actual transmission needs.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If the leader node frequently retransmits large data proposals to ensure delivery, then all follower nodes receive the proposal, but bandwidth occupation increases and overall system performance decreases

Engineering Contradiction:
Improveproposal delivery reliabilityVSAvoidoverall system performance
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The system dynamically adjusts the retransmission strategy by varying the time interval based on transmission history. Instead of continuously retransmitting at fixed intervals, the leader node implements a dynamic approach where the waiting period between retransmissions increases with each attempt. This dynamic adjustment maintains proposal delivery reliability while reducing the overall frequency of retransmissions, thereby preserving system productivity.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent applies periodic action with increasing periods. The leader node performs retransmission operations periodically, but the period (time interval) between operations increases with each retransmission attempt. This creates a pattern of periodic retransmission actions where the frequency naturally decreases over time, balancing reliable delivery with reduced network load and improved system performance.

Inventive Principle:
Principle #19Periodic action

Data Source

PatentUS20250266936A1Data transmission method and apparatus, device, and storage medium
Publication Date: 2025.08.21 TENCENT TECHNOLOGY (SHENZHEN) CO LTD
  • US20250266936A1 patent drawing
  • US20250266936A1 patent drawing
  • US20250266936A1 patent drawing

AI summary

A data transmission method includes: transmitting, by a leader node, a generated proposal to N follower nodes in a regional chain system, and recording a quantity of transmissions of the proposal from the leader node to each of the N follower nodes; receiving node state information transmitted by M follower nodes of the N follower nodes, and determining a first node of the N follower nodes not receiving the proposal based on the node state information of the M follower nodes; obtaining a quantity of transmissions of the proposal from the leader node to the first node, and determining a time interval before a next transmission of the proposal to the first node based on the quantity of transmissions of the proposal to the first node, the time interval being positively correlated with the quantity of transmissions; and retransmitting the proposal to the first node based on the time interval.