IP Library › Granted Patent US 12,574,329
Granted Patent B2
US 12,574,329 · App. 18/763,855 · Granted Mar 10, 2026

Data exchange method and apparatus

Inventors: Qiuhong Ye (Shenzhen, CN); Zijian He (Beijing, CN); Wan Lam (Shenzhen, CN)
Assignee: Huawei Technologies Co., Ltd.
H04L47/265H04L45/122H04L47/6255
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,574,329
App. No.
18/763,855
Granted
Mar 10, 2026
Kind
B2
Abstract

A data exchange method and apparatus. The method includes: A source node receives flow indication information from a first switching node, where the flow indication information indicates that congestion occurs in a target data flow, and the first switching node is a node in a switching path of the target data flow. The source node sends multiple pieces of write data information and multiple data blocks of the target data flow to multiple switching nodes, where the multiple pieces of write data information indicate the multiple switching nodes to store the multiple data blocks and stop forwarding the multiple data blocks. The multiple switching nodes store the multiple data blocks. The multiple switching nodes receive multiple pieces of scheduling information from a destination node, where the multiple pieces of scheduling information are used to schedule the multiple data blocks.

Claims (30)

1 . A data exchange method, wherein the method comprises:

receiving, by a source node, flow indication information from a first switching node, wherein the flow indication information indicates that congestion occurs in a target data flow, and the first switching node is a node in a switching path of the target data flow; and

sending, by the source node, multiple pieces of write data information and multiple data blocks of the target data flow to multiple switching nodes, wherein the multiple pieces of write data information indicate to the multiple switching nodes to store the multiple data blocks and to stop forwarding the multiple data blocks.

2 . The method according to claim 1 , wherein after the sending, by the source node, multiple pieces of write data information and multiple data blocks of the target data flow to multiple switching nodes, the method further comprises:

receiving, by the source node, multiple pieces of block description information from the multiple switching nodes, wherein the multiple pieces of block description information correspond one-to-one to the multiple data blocks, and each piece of block description information indicates information about a node that stores a corresponding data block; and

sending, by the source node, the multiple pieces of block description information to a destination node.

3 . The method according to claim 1 , wherein before the sending, by the source node, multiple pieces of write data information and multiple data blocks of the target data flow to multiple switching nodes, the method further comprises:

dividing, by the source node, to-be-exchanged data in the target data flow into the multiple data blocks, wherein a quantity of the multiple data blocks is greater than or equal to a quantity of the multiple switching nodes.

4 . The method according to claim 1 , wherein a ranking of a data block corresponding to one switching node in the multiple switching nodes in the multiple data blocks is consistent with a ranking of a distance corresponding to the switching node in multiple distances arranged in ascending order, the distance corresponding to the switching node is a distance between the switching node and the first switching node, and the multiple distances comprise distances between the multiple switching nodes and the first switching node.

5 . A data exchange method, wherein the method comprises:

sending, by a switching node, flow indication information to a source node, wherein the flow indication information indicates that congestion occurs in a target data flow, and the switching node is a node in a switching path of the target data flow;

receiving, by the switching node, write data information and a data block of the target data flow from the source node, wherein the write data information indicates to the switching node to store the data block and to stop forwarding the data block;

storing, by the switching node, the data block based on the write data information;

receiving, by the switching node, scheduling information from a destination node, wherein the scheduling information is used to schedule the data block; and

sending, by the switching node, the data block to the destination node.

6 . The method according to claim 5 , wherein after the storing, by the switching node, the data block based on the write data information, the method further comprises:

sending, by the switching node, block description information of the data block to the destination node: or

sending, by the switching node, block description information of the data block to the source node, wherein

the block description information indicates information about a node that stores the data block.

7 . A data exchange apparatus, wherein the apparatus serves as a source node and comprises:

at least one processor and one or more memories, wherein the one or more memories are configured to store instructions or program code; and

the at least processor is configured to execute the instructions or the program code in the one or more memories, to enable the apparatus to:

receive flow indication information from a first switching node, wherein the flow indication information indicates that congestion occurs in a target data flow, and the first switching node is a node in a switching path of the target data flow; and

send multiple pieces of write data information and multiple data blocks of the target data flow to multiple switching nodes, wherein the multiple pieces of write data information indicate to the multiple switching nodes to store the multiple data blocks and to stop forwarding the multiple data blocks.

8 . The apparatus according to claim 7 , wherein the at least processor is further configured to execute the instructions or the program code in the one or more memories, to enable the apparatus to:

receive multiple pieces of block description information from the multiple switching nodes, wherein the multiple pieces of block description information correspond one-to-one to the multiple data blocks, and each piece of block description information indicates information about a node that stores a corresponding data block; and

send the multiple pieces of block description information to a destination node.

9 . The apparatus according to claim 7 , wherein the at least processor is configured to execute the instructions or the program code in the one or more memories, to enable the apparatus to:

divide to-be-exchanged data in the target data flow into the multiple data blocks, wherein a quantity of the multiple data blocks is greater than or equal to a quantity of the multiple switching nodes.

10 . The apparatus according to claim 7 , wherein a ranking of a data block corresponding to one switching node in the multiple switching nodes in the multiple data blocks is consistent with a ranking of a distance corresponding to the switching node in multiple distances arranged in ascending order, the distance corresponding to the switching node is a distance between the switching node and the first switching node, and the multiple distances comprise distances between all of the multiple switching nodes and the first switching node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 14, 2026
From: YE, QIUHONG; HE, ZIJIAN; LAM, WAN
To: HUAWEI TECHNOLOGIES CO., LTD.
Reel/Frame 073472/0696 →
Priority Claims (1)
CN 202210010085.6 · Jan 5, 2022 · national
Continuity (2)
Continuation PCTCN2022131459 · Nov 11, 2022
Related Publication 20240364636A1 · Oct 31, 2024
References Cited (1)
US 8248930B2 · Felderman · 2012 [cited by examiner]