Data routing method and related apparatus

Patent metadata

Field	Value
Publication number	US-12250149-B2
Application number	US-202217740974-A
Country	US
Kind code	B2
Filing date	May 10, 2022
Priority date	Apr 28, 2020
Publication date	Mar 11, 2025
Grant date	Mar 11, 2025

Abstract

Data routing with a forwarding process of service data can avoid problems of offline nodes. The forwarding process for data routing can also improve the fault tolerance and service data can be quickly transmitted to a corresponding data pool. Using consensus nodes and a target data pool with routing and forwarding tables along with subtrees from a trie tree can improve the routing. Subtrees may be obtained by splitting the trie tree from a root node by using a first leaf node as a benchmark, which correspondingly represents a data pool of the consensus node. The routing and forwarding table is configured to record addresses of data pools correspondingly represented by a preset quantity of leaf nodes in a corresponding subtree.

First claim

What is claimed is:

1. A data routing method comprising:
determining, by a first consensus node and in response to service data being received, a target data pool corresponding to the service data, wherein the first consensus node is any one of a plurality of consensus nodes, wherein the plurality of consensus nodes maintaining respectively a corresponding data pools;
obtaining, by the first consensus node, an address of a second data pool from a plurality of routing and forwarding tables according to a shortest prefix of the target data pool, the plurality of routing and forwarding tables corresponding to a plurality of subtrees of a trie tree and the trie tree comprising a plurality of leaf nodes corresponding to data pools of the consensus nodes, wherein a leaf node corresponding to the second data pool and a leaf node corresponding to the target data pool are in a same subtree, further wherein the plurality of subtrees is obtained by splitting the trie tree from a root node by using a first leaf node corresponding to a data pool of the first consensus node as a benchmark, and the routing and forwarding tables are configured to record addresses of data pools represented by a preset quantity of leaf nodes in the corresponding subtrees; and
transmitting, by the first consensus node, the service data to one of the consensus nodes corresponding to the address of the second data pool.

2. The method according to claim 1 , wherein the obtaining further comprises:
obtaining, by the first consensus node, the shortest prefix of the target data pool;
determining, by the first consensus node, a target routing and forwarding table from the plurality of routing and forwarding tables according to the shortest prefix of the target data pool; and
obtaining, by the first consensus node, the address of the second data pool from the target routing and forwarding table.

3. The method according to claim 2 , wherein the target routing and forwarding table comprises addresses of a plurality of second data pools, and the transmitting further comprises:
determining, by the first consensus node, target consensus nodes respectively corresponding to the addresses of the plurality of second data pools; and
transmitting, by the first consensus node, the service data to the target consensus nodes.

4. The method according to claim 1 , wherein before the determining, the method comprises:
splitting, by the first consensus node, the trie tree, to obtain a plurality of subtrees which do not comprise the first leaf node;
for any subtree in the plurality of subtrees, determining, by the first consensus node, a preset quantity of leaf nodes from leaf nodes comprised by the any subtree; and
generating, by the first consensus node, a routing and forwarding table corresponding to the any subtree according to the addresses of the data pools correspondingly represented by the preset quantity of leaf nodes.

5. The method according to claim 4 , wherein the splitting further comprises:
splitting, by the first consensus node, the trie tree layer by layer from the root node of the trie tree by using the first leaf node as a benchmark;
determining, by the first consensus node, whether each layer of subtrees obtained in a splitting process comprises the first leaf node, splitting continuously subtrees which comprise the first leaf node, and stopping splitting until the trie tree is split to the first leaf node; and
obtaining, by the first consensus node, the plurality of subtrees which do not comprise the first leaf node during stopping splitting.

6. The method according to claim 1 , wherein the determining, by a first consensus node in response to service data being received, a target data pool corresponding to the service data comprises:
obtaining, by the first consensus node in the case that the service data is received, a hash value of the service data; and
querying, by the first consensus node, a second leaf node corresponding to the hash value from the trie tree, and using a data pool correspondingly represented by the second leaf node as the target data pool, wherein the second leaf node comprises at least one leaf node.

7. The method according to claim 1 , wherein the addresses comprise at least one of an Internet Protocol (IP) address or a port number.

8. The method according to claim 1 , wherein the preset quantity is greater than or equal to 2.

9. The method according to claim 1 , wherein the plurality of subtrees do not comprise the first leaf node.

10. A computer device, comprising:
a processor, a communication interface, a memory, and a communication bus,
the processor, the communication interface, and the memory communicating with each other by using the communication bus; the communication interface being an interface of a communication module;
the memory being configured to store program code and transmit the program code to the processor; and
the processor being configured to invoke instructions of the program code in the memory to perform the data routing method according to claim 1 .

11. The method according to claim 1 , wherein the method is applicable to a blockchain network, the blockchain network comprising the plurality of consensus nodes.

12. A non-transitory computer-readable storage medium, the computer storage medium storing a computer program, the computer program comprising program instructions, the program instructions, when executed by a processor, being configured to perform a data routing method comprising:
determining, by a first consensus node and in response to service data being received, a target data pool corresponding to the service data, wherein the first consensus node is any one of a plurality of consensus nodes, wherein the plurality of consensus nodes maintaining respectively a corresponding data pools;
obtaining, by the first consensus node, an address of a second data pool from a plurality of routing and forwarding tables according to a shortest prefix of the target data pool, the plurality of routing and forwarding tables corresponding to a plurality of subtrees of a trie tree and the trie tree comprising a plurality of leaf nodes corresponding to data pools of the consensus nodes, wherein a leaf node corresponding to the second data pool and a leaf node corresponding to the target data pool are in a same subtree, further wherein the plurality of subtrees is obtained by splitting the trie tree from a root node by using a first leaf node corresponding to a data pool of the first consensus node as a benchmark, and the routing and forwarding tables are configured to record addresses of data pools represented by a preset quantity of leaf nodes in the corresponding subtrees; and
transmitting, by the first consensus node, the service data to one of the consensus nodes corresponding to the address of the second data pool.

13. The computer-readable storage medium of claim 12 , wherein the obtaining further comprises:
obtaining, by the first consensus node, the shortest prefix of the target data pool;
determining, by the first consensus node, a target routing and forwarding table from the plurality of routing and forwarding tables according to the shortest prefix of the target data pool; and
obtaining, by the first consensus node, the address of the second data pool from the target routing and forwarding table.

14. The computer-readable storage medium of claim 13 , wherein the target routing and forwarding table comprises addresses of a plurality of second data pools, and the transmitting further comprises:
determining, by the first consensus node, target consensus nodes respectively corresponding to the addresses

Assignees

• Tencent Tech Shenzhen Co Ltd

Inventors

• Li Maocai
• Wang Zongyou
• Zhang Jinsong
• Huang Huankun
• Zhou Kaiban
• Shi Yifang
• Liu Qucheng
• Liu Pan
• Lan Hu
• Yang Changqing
• Zhu Gengliang
• Kong Li

Classifications

• H04L45/48 Primary

  Routing tree calculation · CPC title

• H04L45/748 Primary

  using longest matching prefix · CPC title

• G06Q20/02 Primary

  involving a neutral party, e.g. certification authority, notary or trusted third party [TTP] · CPC title