Data transmission method and communication apparatus

Patent metadata

Field	Value
Publication number	US-12580983-B2
Application number	US-202318314342-A
Country	US
Kind code	B2
Filing date	May 9, 2023
Priority date	Nov 10, 2020
Publication date	Mar 17, 2026
Grant date	Mar 17, 2026

Abstract

Embodiments of this application disclose a data transmission method and a communication apparatus. The method may be applied to a data transmission or data distribution scenario in a peer-to-peer P2P network. The method includes: A first end node sends delayed transmission information to a second end node, where the delayed transmission information indicates time information at which the first end node delays sending first data to the second end node. When determining that the second end node accepts the delayed transmission information, the first end node delays sending the first data to the second end node, to alleviate a load of the first end node, so that a network congestion problem caused by a large-scale concurrent data request can be resolved.

First claim

What is claimed is:

1 . A data transmission method, comprising:
sending, by a first end node, delayed transmission information to a second end node, wherein the delayed transmission information indicates first time information at which the first end node sends first data to the second end node, wherein, before sending the delayed transmission information, the method further comprises:
determining, by the first end node, first delay time information based on a load amount, wherein the first delay time information is obtained based on the load amount and, if the first end node stores the first data and the load amount is greater than a load threshold, the first time information is based on the load amount;
determining, by the first end node, that the second end node accepts the delayed transmission information; and sending, by the first end node, the first data to the second end node at target time based on the first time information, wherein the target time is determined based on the first time information; or determining, by the first end node, that the second end node refuses the delayed transmission information, and canceling, by the first end node, transmitting the first data.

2 . The method according to claim 1 , wherein
the determining, by the first end node, that the second end node accepts the delayed transmission information comprises: receiving, by the first end node, a first message from the second end node, wherein the first message is sent by the second end node after the delayed transmission information is received; and the first message comprises first indication information, and the first indication information indicates that the second end node allows the first end node to send the first data.

3 . The method according to claim 1 , wherein the determining, by the first end node, that the second end node refuses the delayed transmission information comprises:
receiving, by the first end node, a second message from the second end node, wherein the second message is sent by the second end node after the delayed transmission information is received; and the second message comprises second indication information, and the second indication information indicates that the second end node refuses to allow the first end node to send the first data.

4 . The method according to claim 1 , wherein the delayed transmission information is a data credential, the data credential indicates the first time information at which the first end node sends the first data to the second end node, and the data credential is further used to verify an identity of the first end node.

5 . The method according to claim 1 , wherein before the sending, by the first end node, the delayed transmission information to the second end node, the method further comprises:
generating, by the first end node, the delayed transmission information based on the first delay time information, wherein the first time information is obtained based on the first delay time information.

6 . The method according to claim 1 , wherein before the sending, by the first end node, the delayed transmission information to the second end node, the method further comprises:
generating, by the first end node, the delayed transmission information based on second time information, wherein the first time information is obtained based on the second time information, and the second time information is estimated time information at which the first end node obtains the first data.

7 . A data transmission method, comprising:
sending, by a second end node, a first message, wherein the first message is sent after delayed transmission information is received, the delayed transmission information is sent by a first end node, the delayed transmission information indicates first time information at which the first end node sends first data to the second end node, the first message comprises first indication information, and the first indication information indicates that the second end node allows the first end node to send the first data and, before the first end node sends the delayed transmission information, the first end node determines first delay time information based on a load amount, wherein the first delay time information is obtained based on the load amount and, if the first end node stores the first data and the load amount is greater than a load threshold, the first time information is based on the load amount; or sending, by the second end node, a second message, wherein the second message is sent after the delayed transmission information is received, the second message comprises second indication information, and the second indication information indicates that the second end node refuses to allow the first end node to send the first data.

8 . The method according to claim 7 , wherein the delayed transmission information is a data credential, the data credential indicates the first time information at which the first end node sends the first data to the second end node, and the data credential is further used to verify an identity of the first end node.

9 . The method according to claim 7 , wherein before the sending, by the second end node, the first message, the method further comprises:
when a credit value of the first end node is greater than a credit value of a third end node, determining, by the second end node, to send the first message, wherein the third end node is an end node allowed by the second end node to send the first data to the second end node.

10 . The method according to claim 7 , wherein before the sending, by the second end node, the first message, the method further comprises:
determining, by the second end node, to send the first message when first time is earlier than second time, wherein the first time is time at which the first end node sends the first data to the second end node, the second time is a time at which a fourth end node sends the first data to the second end node, and the fourth end node is an end node allowed by the second end node to send the first data to the second end node.

11 . The method according to claim 7 , wherein before the sending, by the second end node, the second message, the method further comprises:
when a credit value of the first end node is not greater than a credit value of a fifth end node, determining, by the second end node, to send the second message, wherein the fifth end node is an end node allowed by the second end node to send the first data to the second end node.

12 . The method according to claim 7 , wherein before the sending, by the second end node, the second message, the method further comprises:
determining to send the second message when first time is not earlier than third time, wherein the first time is time at which the first end node sends the first data to the second end node, the third time is a time at which a sixth end node sends the first data to the second end node, and the sixth end node is an end node allowed by the second end node to send the first data to the second end node.

13 . The method according to claim 9 , wherein after the second end node receives the delayed transmission information from the first end node, the method further comprises:
if the second end node receives the first data from the first end node in a target time period, increasing the credit value of the first end node, wherein the target time period is obtained based on the first time information; or if the second end node does not receive the first data from the first end node in the target time period, decreasing the credit value of the first end node.

14 . The method accordi

Assignees

• Huawei Tech Co Ltd

Inventors

• Tang Feilong
• Li Xu
• Zhang Haibo
• Zhang Huimin

Classifications

• H04L67/1061 Primary

  using node-based peer discovery mechanisms (static access to replicated servers H04L67/1006; service discovery H04L67/51) · CPC title

• H04L67/62

  Establishing a time schedule for servicing the requests · CPC title

• H04L67/1078 Primary

  Resource delivery mechanisms · CPC title