# US 2024/0205794 A1 · Data routing method and apparatus, node, and storage medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0205794 A1
- Document ID: US20240205794A1
- Status: Published application
- Kind: A1
- Application number: 18/430,463
- Filed: 2024-02-01
- Published: 2024-06-20
- Earliest claimed: 2021-08-04
- Assignees: Vivo Mobile Communication Co., Ltd.
- Applicants: Vivo Mobile Communication Co., Ltd.
- Inventors: Ming WEN; Jinhua LIU
- Web page: https://patentgrep.com/patent/US20240205794A1

## CPC

- H04L 45/74: Address processing for routing
- H04W 40/32: for defining a routing cluster membership
- H04L 45/00: Routing or path finding of packets in data switching networks (routing or path finding in wireless networks H04W40/00)
- H04L 45/02: Topology update or discovery
- H04L 45/04: {Interdomain routing, e.g. hierarchical routing}
- H04L 45/745: Address table lookup; Address filtering
- H04W 40/248: {Connectivity information update}
- H04W 40/28: for reactive routing
- H04W 40/34: Modification of an existing route
- H04W 84/04: Large scale networks; Deep hierarchical networks
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A data routing method and apparatus, a node, and a storage medium, and belongs to the field of communication technologies. The data routing method in this embodiment of this application includes: receiving, by a boundary node, a packet in a first topology. Determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet; and in a case that a destination node of the packet belongs to the second topology, re-writing, by the boundary node, a header of the packet based on the first information; and transmitting, by the boundary node, the re-written packet to the destination node in the second topology.

## Claims

### Claim 1

A data routing method, comprising:
receiving, by a boundary node, a packet in a first topology;
determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet;
in a case that the destination node of the packet belongs to a second topology, re-writing, by the boundary node, the header of the packet based on the first information; and
transmitting, by the boundary node, a re-written packet to the destination node in the second topology.

### Claim 2 (depends on 1)

The data routing method according to claim 1, wherein the determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet comprises:
in a case that the boundary node determines that a backhaul adaptation protocol (BAP) destination address in the first information is the same as a first BAP virtual address of the boundary node, determining that the destination node of the packet belongs to the second topology, wherein
there is a mapping relationship between the first BAP virtual address and a first destination node information group of the packet, the first destination node information group comprises a first destination address and a first path identifier path ID of the destination node in the second topology, and the first path ID is used to indicate a routing path from the boundary node to the destination node in the second topology.

### Claim 3 (depends on 2)

The data routing method according to claim 2, wherein the re-writing, by the boundary node, the header of the packet based on the first information comprises:
determining, by the boundary node based on a local second mapping table and the first BAP virtual address, the first destination node information group that has the mapping relationship with the first BAP virtual address; and
re-writing the header of the packet based on the first destination address and the first path ID in the second topology in the first destination node information group, wherein
the second mapping table comprises at least one second BAP virtual address and at least one second destination node information group, there is a mapping relationship between one second BAP virtual address and one or more second destination node information groups, there is a mapping relationship between different second BAP virtual addresses and different second destination node information groups, the first BAP virtual address is one of the at least one second BAP virtual address, and the first destination node information group is one of the at least one second destination node information group; and the at least one second BAP virtual address is configured for the boundary node by a first centralized unit (CU) in the first topology or a second CU in the second topology.

### Claim 4 (depends on 2)

The data routing method according to claim 2, wherein the determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet further comprises:
in a case that the boundary node determines that the BAP destination address in the first information is the same as a real address of the boundary node, determining that the destination node of the packet is the boundary node; and
the method further comprises:
removing the header of the packet; and
delivering the packet after the removal of the header to an upper layer of a BAP layer of the boundary node.

### Claim 5 (depends on 1)

The data routing method according to claim 1, wherein the determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet comprises:
in a case that the boundary node determines that a BAP destination address in the first information is the same as a real address of the boundary node and the first information comprises first indication information, determining that the destination node of the packet belongs to the second topology, wherein
the first indication information is used to directly indicate that cross-topology routing needs to be performed for the packet.

### Claim 6 (depends on 5)

The data routing method according to claim 5, wherein the first information further comprises a second path ID, and the second path ID is used to indicate a routing path from the boundary node to the destination node in the second topology.

### Claim 7 (depends on 6)

The data routing method according to claim 6, wherein the re-writing, by the boundary node, the header of the packet based on the first information comprises:
determining, by the boundary node, a second destination address of the destination node in the second topology based on a local third mapping table and the second path ID; and
re-writing the header of the packet based on the second path ID and the second destination address, wherein
the third mapping table comprises at least one third path ID and at least one third destination address, there is a mapping relationship between one third path ID and one or more third destination addresses, there is a mapping relationship between different third path IDs and different third destination addresses, the second path ID is one of the at least one third path ID, and the second destination address is one of the at least one third destination address.

### Claim 8 (depends on 5)

The data routing method according to claim 5, wherein the determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet further comprises:
in a case that the boundary node determines that the BAP destination address in the first information is the same as the real address of the boundary node and the first information comprises second indication information, determining that the destination node of the packet is the boundary node, wherein the second indication information is used to directly indicate that cross-topology routing does not need to be performed for the packet; and
the method further comprises:
removing the header of the packet; and
delivering the packet after the removal of the header to an upper layer of a BAP layer of the boundary node.

### Claim 9 (depends on 1)

The data routing method according to claim 1, wherein the determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet comprises:
in a case that the boundary node determines that a backhaul adaptation protocol BAP destination address in the first information is the same as a third BAP virtual address of the boundary node, determining that the destination node of the packet belongs to the second topology, wherein
the third BAP virtual address is used to indicate that cross-topology routing needs to be performed for the packet, and the third BAP virtual address is configured for the boundary node by a first CU in the first topology or a second CU in the second topology.

### Claim 10 (depends on 9)

The data routing method according to claim 9, wherein the first information further comprises a fourth path ID, and the fourth path ID is used to indicate a routing path from the boundary node to the destination node in the second topology; and
the re-writing, by the boundary node, the header of the packet based on the first information comprises:
determining, by the boundary node, a fourth destination address of the destination node in the second topology based on a local fourth mapping table and the fourth path ID; and
re-writing the header of the packet based on the fourth path ID and the fourth destination address, wherein
the fourth mapping table comprises at least one fifth path ID and at least one fifth destination address, there is a mapping relationship between one fifth path ID and one or more fifth destination addresses, there is a mapping relationship between different fifth path IDs and different fifth destination addresses, the fourth path ID is one of the at least one fifth path ID, and the fourth destination address is one of the at least one fifth destination address.

### Claim 11 (depends on 9)

The data routing method according to claim 9, wherein the determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet comprises:
in a case that the boundary node determines that the BAP destination address in the first information is the same as a real address of the boundary node, determining that the destination node of the packet is the boundary node; and
the method further comprises:
removing the header of the packet; and
delivering the packet after the removal of the header to an upper layer of a BAP layer of the boundary node.

### Claim 12 (depends on 2)

The data routing method according to claim 2, wherein the determining, by the boundary node, ownership of a destination node of the packet based on first information in a header of the packet further comprises:
in a case that the boundary node determines that the BAP destination address in the first information is different from all addresses of the boundary node, determining that the destination node of the packet does not belong to the second topology; and
the method further comprises:
transmitting the packet according to a routing rule specified in a protocol.

### Claim 13

A data routing method, comprising:
generating, by a generation node in a first topology, a packet, wherein a header of the packet comprises first information, and the first information is used to indicate ownership of a destination node of the packet; and
sending, by the generation node, the packet to a boundary node.

### Claim 14 (depends on 13)

The data routing method according to claim 13, wherein in a case that the destination node of the packet belongs to a second topology, before the generating, by a generation node in a first topology, a packet, the method further comprises:
determining, by the generation node, a first destination address of the packet on the destination node in the second topology;
determining, by the generation node, a first path ID based on the first destination address, wherein the first path ID is used to indicate a routing path from the boundary node to the destination node in the second topology; and
determining, by the generation node, a first BAP virtual address in the first information based on a local first mapping table and first mapping information; and
the generating, by a generation node in a first topology, a packet comprises:
generating, by the generation node, the packet, wherein a BAP destination address in the first information in the header of the packet is the same as the first BAP virtual address, wherein
the first mapping information comprises any one or any combination of the following:
a real address of the boundary node;
the first destination address; and
the first path ID, wherein
the first mapping table comprises at least one fourth BAP virtual address and at least one piece of second mapping information, there is a mapping relationship between one piece of second mapping information and one fourth BAP virtual address, there is a mapping relationship between different second mapping information and different fourth BAP virtual addresses, the first BAP virtual address is one of the at least one fourth BAP virtual address, and the first mapping information is one of the at least one piece of second mapping information; and the at least one fourth BAP virtual address is configured for the boundary node by a first CU in the first topology or a second CU in the second topology.

### Claim 15 (depends on 14)

The data routing method according to claim 14, wherein in a case that the destination node of the packet is the boundary node, the generating, by a generation node in a first topology, a packet comprises:
generating, by the generation node, the packet, wherein the BAP destination address in the first information in the header of the packet is the same as the real address of the boundary node.

### Claim 16 (depends on 13)

The data routing method according to claim 13, wherein in a case that the destination node of the packet belongs to a second topology, the generating, by a generation node in a first topology, a packet comprises:
generating, by the generation node, the packet, wherein a BAP destination address in the first information in the header of the packet is the same as a real address of the boundary node, the first information comprises first indication information, and the first indication information is used to directly indicate that cross-topology routing needs to be performed for the packet.

### Claim 17 (depends on 16)

The data routing method according to claim 16, wherein in a case that the destination node of the packet is the boundary node, the generating, by a generation node in a first topology, a packet comprises:
generating, by the generation node, the packet, wherein
the BAP destination address in the first information in the header of the packet is the same as the real address of the boundary node, the first information comprises second indication information, and the second indication information is used to directly indicate that cross-topology routing does not need to be performed for the packet.

### Claim 18 (depends on 13)

The data routing method according to claim 13, wherein in a case that the destination node of the packet belongs to a second topology, the generating, by a generation node in a first topology, a packet comprises:
generating, by the generation node, the packet, wherein a BAP destination address in the first information in the header of the packet is the same as a third BAP virtual address, and the third BAP virtual address is used to indicate that cross-topology routing needs to be performed for the packet; and the third BAP virtual address is configured for the boundary node by a first CU in the first topology or a second CU in the second topology.

### Claim 19 (depends on 18)

The data routing method according to claim 18, wherein in a case that the destination node of the packet is the boundary node, the generating, by a generation node in a first topology, a packet comprises:
generating, by the generation node, the packet, wherein the BAP destination address in the first information in the header of the packet is the same as a real address of the boundary node.

### Claim 20 (depends on 14)

The data routing method according to claim 14, wherein in a case that the destination node of the packet does not belong to the second topology, the generating, by a generation node in a first topology, a packet comprises:
generating, by the generation node, the packet, wherein the BAP destination address in the first information in the header of the packet is different from all addresses of the boundary node.
