# US 12,764,635 B2 · 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 12,764,635 B2 - Document ID: US12764635B2 - Status: Granted - Kind: B2 - Application number: 18/430,463 - Filed: 2024-02-01 - Published: 2024-06-20 - Granted: 2026-10-13 - 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/US12764635B2 ## CPC - H04W 40/32: for defining a routing cluster membership - H04W 40/28: for reactive routing - H04W 40/34: Modification of an existing route - 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, wherein the determining, by the boundary node, the ownership of the destination node of the packet based on the 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 2 (depends on 1) The data routing method according to claim 1, 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 3 (depends on 1) The data routing method according to claim 1, wherein the determining, by the boundary node, the ownership of the destination node of the packet based on the first information in the 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 4 (depends on 1) The data routing method according to claim 1, wherein the determining, by the boundary node, the ownership of the destination node of the packet based on the first information in the 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 5 (depends on 1) A non-transitory readable storage medium, wherein a program or an instruction is stored on the non-transitory readable storage medium, and the program or the instruction is executed by a processor of a boundary node to implement the steps of the data routing method according to claim 1. ### Claim 6 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, wherein in a case that the destination node of the packet belongs to a second topology, the generating, by the generation node in the first topology, the packet comprises: generating, by the generation node, the packet, wherein a backhaul adaptation protocol (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 7 (depends on 6) The data routing method according to claim 6, wherein in a case that the destination node of the packet is the boundary node, the generating, by the generation node in the first topology, the 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 8 (depends on 6) The data routing method according to claim 6, 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. ### Claim 9 (depends on 6) A generation node, comprising a processor, a memory, and a program or an instruction that is stored in the memory and executable on the processor, wherein the program or the instruction is executed by the processor to implement the steps of the data routing method according to claim 6. ### Claim 10 (depends on 6) A non-transitory readable storage medium, wherein a program or an instruction is stored on the non-transitory readable storage medium, and the program or the instruction is executed by a processor of a generation node to implement the steps of the data routing method according to claim 6. ### Claim 11 A boundary node, comprising a processor, a memory, and a program or an instruction that is stored in the memory and executable on the processor, wherein the program or the instruction is executed by the processor to implement: receiving, by the 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, wherein the determining, by the boundary node, the ownership of the destination node of the packet based on the 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 12 (depends on 11) The boundary node according to claim 11, 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 13 (depends on 11) The boundary node according to claim 11, wherein the determining, by the boundary node, the ownership of the destination node of the packet based on the first information in the 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 program or the instruction is further executed by the processor to implement: 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 14 (depends on 11) The boundary node according to claim 11, wherein the determining, by the boundary node, the ownership of the destination node of the packet based on the first information in the 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 program or the instruction is further executed by the processor to implement: transmitting the packet according to a routing rule specified in a protocol.