A data packet routing method performed by a local node, wherein the method comprises the steps of: • when a data packet of a computation task type is received, determining a first computation task type corresponding to the data packet; • determining, based on a pre-obtained first correspondence between a computation task type, other nodes, and a computing performance of the other nodes, at least one other node able to perform the first computation task type, wherein the pre-obtained first correspondence indicates an ability of the other nodes to perform computation tasks of the computation task type, wherein the computing performance comprises a computation delay; • determining a target node from the at least one other node based on the computing performance of the at least one other node and based on a link status between the local node and each of the at least one other node, the link status comprising a data packet round-trip delay, wherein the determining the target node from the at least one other node based on the computing performance of the at least one other node and based on the link status between the local node and each of the at least one other node comprises: o for each of the other nodes, determining a sum of a computation delay corresponding to the other node and a data packet round-trip delay between the local node and the other node; and o determining, from the at least one other node, a node corresponding to a smallest sum as the target node; and • determining an address of the target node as a destination address of the data packet, and forwarding the data packet based on the destination address. • when a data packet of a computation task type is received, determining a first computation task type corresponding to the data packet; • determining, based on a pre-obtained first correspondence between a computation task type, other nodes, and a computing performance of the other nodes, at least one other node able to perform the first computation task type, wherein the pre-obtained first correspondence indicates an ability of the other nodes to perform computation tasks of the computation task type, wherein the computing performance comprises a computation delay; • determining a target node from the at least one other node based on the computing performance of the at least one other node and based on a link status between the local node and each of the at least one other node, the link status comprising a data packet round-trip delay, wherein the determining the target node from the at least one other node based on the computing performance of the at least one other node and based on the link status between the local node and each of the at least one other node comprises: o for each of the other nodes, determining a sum of a computation delay corresponding to the other node and a data packet round-trip delay between the local node and the other node; and o determining, from the at least one other node, a node corresponding to a smallest sum as the target node; and o for each of the other nodes, determining a sum of a computation delay corresponding to the other node and a data packet round-trip delay between the local node and the other node; and o determining, from the at least one other node, a node corresponding to a smallest sum as the target node; and • determining an address of the target node as a destination address of the data packet, and forwarding the data packet based on the destination address.