P2P Data Distribution Paths for Bottleneck-Aware Multi-Party Delivery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In P2P-based data distribution, network congestion and resource waste occur due to repeated transmission of the same communication data on the same P2P channel, especially in multi-party communication scenarios, without considering channel bottlenecks.
Innovation Solution
A P2P channel-based data distribution method that utilizes a pre-generated acyclic graph to determine next-hop devices for data distribution, avoiding repeated transmissions by using a server to manage and update the distribution path based on quality of service (QoS) information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If each device sends communication data to all other devices via P2P channels in a multi-party communication scenario, then complete data distribution is achieved, but network congestion and resource waste occur due to repeated transmission on bottleneck channels
Solution Approach 1:
The patent segments the data distribution process into hierarchical levels: a first device (coordinator) distributes data to second devices, which then distribute to third devices, and so on. This segmentation eliminates redundant transmissions by ensuring each data packet travels through each P2P channel only once, while still achieving complete distribution across all devices in the network.
Solution Approach 2:
The patent implements preliminary action by having the first device determine the distribution sequence and identify target devices before actual data transmission begins. The coordinator device pre-calculates which devices should receive data from which sources, preventing redundant transmissions and optimizing the distribution path before any data packets are sent.
2Adaptability or versatility
If P2P channels are established between all devices for direct communication, then communication flexibility is improved, but channel bottlenecks cause network congestion
Solution Approach 1:
The patent applies dynamics by making the data distribution path adaptive rather than static. The first device dynamically determines the distribution sequence based on current network conditions and device capabilities. Devices can dynamically assume different roles (coordinator or participant) based on network state, allowing the system to adapt to changing conditions while maintaining efficient data flow and avoiding channel bottlenecks.
Data Source
Figure 1
Figure 2
Figure 3a
AI summary
This application provides a P2P-based data distribution method, apparatus, and system, to resolve a problem of network congestion and a waste of network resources in a multi-party communication scenario, caused by repeated transmission of same communication data on a same P2P channel without considering a bottleneck problem of some P2P channels in the conventional technology. The method is applied to a data distribution system, where the data distribution system includes at least three devices and a server. The method includes: Any one of the at least three devices sends request information to the server, and receives response information sent by the server. The any device determines a first target device set from adjacent devices based on the response information, and sends first data to a device in the first target device set, where the first data carries identification information of the any device, and the identification information is used to indicate the device in the first target device set to distribute the first data to a device in a second target device set when determining the first data as to-be-distributed data.