Data transmission method, communication apparatus, and system

Abstract

A data transmission method, an apparatus and a system, applicable to the technical field of communications. The method comprises: an access communication-computing node acquires a first computing task identifier, wherein the first computing task identifier is used for identifying a first computing task; the access communication-computing node determines a first data bearer identifier on the basis of the first computing task identifier; the access communication-computing node receives a first data packet from a terminal device by means of a first air interface bearer indicated by the first data bearer identifier, wherein the first data packet carries first data and information of the first computing task; the access communication-computing node transmits the first data packet to a first instance on the basis of the information of the first computing task, and the first instance provides computing resources for operation of the first computing task. According to the technical solution of the present application, when computing power service is executed or called, transmission resources and computing resources can be flexibly allocated on the basis of the granularity of the computing task (execution of one-time computing power service), so that the resource utilization rate can be improved while the performance of the computing task is ensured.

Description

Data transmission method, communication device and system

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on April 3, 2024, with application number 202410406855.8 and invention name “Data transmission method, communication device and system”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communication technology, and more specifically, to a data transmission method, a communication device, and a system. Background Art

[0003] When an application client in a terminal device schedules software program code in a cloud server to execute computing services, this can be achieved by developing its own services (over the top, or OTT) based on the operator's broadband network. In this scenario, the network device only provides the Internet Protocol (IP) packet forwarding function required during the software program code call process and does not manage and / or schedule the computing resources of the compute nodes.

[0004] With the standardization of hardware computing devices and algorithm models, and the maturation of software technologies such as artificial intelligence and cloud computing, data volumes have exploded, and the demand for computing power has also increased. This has also led to the problem of uneven distribution of computing resources. To address this uneven distribution of computing resources, utilizing networks to schedule and allocate computing resources has become a current development trend. In the current technological context, computing-first networking (CFN) can be used to schedule and / or allocate computing resources. Through computing power routing, computing services requested by terminal devices are routed to the most suitable computing power location (or computing node).

[0005] However, when selecting computing nodes for computing services requested by terminal devices, routing devices in CFNs typically only consider whether each computing node has the software program corresponding to the computing function required by the terminal device, as well as the single-hop network transmission performance from the current node to the next hop node in the routing network. As a result, the routing devices fail to consider the overall communication performance from the terminal device to different computing nodes when selecting computing nodes. For example, if the communication delay between the terminal and each computing node is too long, the delay in the terminal receiving the output of the computing service will not meet the service requirements.

[0006] In view of this, a user-side data transmission solution that can guarantee the performance of computing services (such as shorter latency) and flexibly allocate resources required for data transmission and computing is urgently needed to be developed. Summary of the Invention

[0007] The present application provides a data transmission method, communication device and system, which, when scheduling computing tasks (i.e., executing a computing service), can realize flexible allocation of transmission resources and computing resources for computing task data while ensuring the performance of the computing tasks, thereby improving resource utilization.

[0008] In a first aspect, a data transmission method is provided. The method can be executed by a network device with computing capabilities or a component (such as a chip or module) of a network device with computing capabilities. For example, the network device can be an access network device, or an access computing node. Alternatively, the method can be executed by a computing device with communication capabilities or a component (such as a chip or module) of a computing device with communication capabilities. The following description uses the access computing node as an example. In actual implementation, the method can be executed by other names.

[0009] The method includes: obtaining a first computing task identifier, which is used to identify the first computing task; determining a first data bearer identifier based on the first computing task identifier; receiving a first data packet from a terminal device through a first air interface bearer indicated by the first data bearer identifier, wherein the first data packet carries first data and information about the first computing task; and sending the first data packet to a first instance based on the information about the first computing task, wherein the first instance provides computing resources for the operation of the first computing task.

[0010] The first data may be data to be processed by the first computing task, and the first data packet may be an IP data packet. The first instance providing computing resources for the execution of the first computing task may be understood as: scheduling and using computing resources required by the first computing task through the first instance.

[0011] In some implementations, the first data bearer identifier is used to identify a bearer or resource associated with the first computing task, and the bearer or resource can be used to carry data required to be transmitted for the current call of the first computing task. Exemplarily, the bearer or resource may include a data radio bearer (DRB), or a data radio bearer may include multiple bearers associated with the first computing task, or may also include other bearers or resources for carrying data.

[0012] In some implementations, before sending the first data packet to the first instance, the access computing node has determined the node that provides the first instance based on the communication resources used for the first computing task. For example, if the access computing node determines that the first instance is provided by itself, the access computing node sends the first data packet directly to the first instance; or if the access computing node determines that the first instance is provided by its own neighboring node (such as a collaborative node), the access computing node sends the first data packet to the neighboring node so that it sends the first data packet to the first instance. The communication resources used for the first computing task can be understood as: the communication resources pre-allocated to the first computing task by the access computing node, or the communication resources pre-reserved for the first computing task by the access computing node, or the communication resources authorized for the first computing task. For example, the access computing node obtains the computing power QoS information associated with the first computing task, and pre-allocates or pre-reserves communication resources for the first computing task based on the computing power QoS information. It should be noted that the above-mentioned pre-allocated or pre-reserved communication resources may not actually be applied to the first computing task, and will only be applied to the first computing task when the terminal device requests to execute the first computing task. That is, when the first computing task is actually executed, the pre-allocated or pre-reserved communication resources can be used to receive the function call and / or data of the first computing task.

[0013] In the above technical solution, a data bearer identifier can be assigned to a specific computing task, thereby allocating the air interface bearer required for data transmission for the current scheduling of the computing task. A first instance can also be allocated (for example, when the access computing node or the collaborative node can provide multiple instances for the computing task, the first instance can be selected from the multiple instances and allocated to the computing task). When the computing task ends, the corresponding air interface bearer and / or the first instance can be released, which helps to improve resource utilization. In addition, the access computing node can directly send (or route) relevant data to the first instance determined based on the communication resources used for the first computing task, avoiding the situation where the communication resources of the node providing the first instance cannot meet the performance of the first computing task, thereby helping to ensure the performance of the first computing resources.

[0014] In combination with the first aspect, in some implementations of the first aspect, obtaining the first computing task identifier includes: receiving a first request message from a terminal device, the first request message includes the first computing task identifier, and the first request message is used to request scheduling of the first computing task.

[0015] In the above technical solution, the air interface bearer required for transmitting data when scheduling the first computing task is allocated to the terminal device according to its request, thereby avoiding resource waste caused by the air interface bearer allocated to the first computing task being idle for too long.

[0016] In combination with the first aspect, in certain implementations of the first aspect, the information of the first computing task includes a unicast address, and the method further includes: allocating a unicast address to the first computing task based on the first request information, or requesting a unicast address from the first node based on the first request information; and sending information about the unicast address to the terminal device.

[0017] Exemplarily, the first node may be a neighboring node of the current node, such as a collaborative node. Requesting a unicast address from the first node according to the first request information may include: sending a request information to the first node to request the first node to allocate a unicast address for the first computing task; and receiving the unicast address from the first node.

[0018] In combination with the first aspect, in certain implementations of the first aspect, the first computing task identifier is information of the first computing task, and obtaining the first computing task identifier includes: receiving a second data packet from the terminal device through the second air interface, the second data packet carrying second data and information of the first computing task.

[0019] In some implementations, the second air interface bearer may be a DRB, or a signaling radio bearer (SRB), or other bearers.

[0020] For example, the second air interface bearer may be a bearer allocated in the past when the first computing task is called, or the second air interface bearer may be determined by the terminal device itself. The second air interface bearer may be the same as or different from the first air interface bearer.

[0021] In the above technical solution, the air interface bearer required for transmitting data when the first computing task is allocated and scheduled according to the terminal's data packet avoids waste of resources caused by the air interface bearer allocated to the first computing task being idle for too long, and the data of the first computing task and the first computing task identifier are transmitted together through the data packet, which helps to save communication overhead and can further reduce the delay required for updating transmission resources compared to independent signaling scheduling.

[0022] In combination with the first aspect, in some implementations of the first aspect, the method further includes: sending the second data packet to the first instance.

[0023] In combination with the first aspect, in some implementation methods of the first aspect, the first computing task identifier is a computing power quality of service (QoS) flow identifier, and obtaining the first computing task identifier includes: receiving a third data packet from the terminal device through a third air interface, the third data packet carrying third data and a computing power QoS flow identifier.

[0024] In some implementations, the computing power QoS flow identifier is associated with a third air interface bearer. For example, the third air interface bearer is the air interface bearer indicated by the data bearer identifier corresponding to the computing power QoS flow identifier. The third air interface bearer may be the same as or different from the first air interface bearer.

[0025] In the above technical solution, the computing power QoS flow identifier and the computing task of the UE can be mapped one to one. Different computing tasks can use different computing power QoS flow identifiers, and different QoS flow identifiers can have the same transmission service quality (QoS) requirements. The access computing node can allocate an air interface bearer for the first computing task requested for scheduling by the terminal device only when it receives a data packet carrying the computing power QoS flow identifier. At other times, the air interface bearer can be used for other computing tasks or services, which helps to improve the utilization of the air interface bearer. In other words, the allocation of the air interface bearer required for the data transmission associated with the computing task can also be achieved through the user plane data packet.

[0026] In combination with the first aspect, in some implementations of the first aspect, obtaining the first computing task identifier includes: receiving the first computing task identifier from a core network.

[0027] In combination with the first aspect, in certain implementations of the first aspect, the method also includes: obtaining computing power QoS information, the computing power QoS information indicating at least one of the following information associated with the first computing task: computing power QoS configuration (profile), computing power QoS requirement (requirement), or a set of computing power QoS parameters; determining the first data bearer identifier based on the first computing task identifier, including: allocating the first data bearer identifier associated with the computing power QoS information to the first computing task based on the computing power QoS information and the first computing task identifier.

[0028] In the above technical solution, the access computing node allocates air interface bearer for the scheduling of the first computing task based on the computing power QoS configuration and computing power QoS requirements required by the first computing task, which helps to ensure the performance of the first computing task and meet the requirements of the first computing task (such as latency requirements, etc.).

[0029] In combination with the first aspect, in some implementations of the first aspect, the method further includes: sending a first data bearer identifier to the terminal device.

[0030] In combination with the first aspect, in some implementations of the first aspect, the information of the first computing task includes an anycast address of the first computing task.

[0031] In combination with the first aspect, in certain implementations of the first aspect, the method further includes: receiving a second request message from a terminal device, the second request message being used to request termination of scheduling of the first computing task; and controlling the release of resources associated with the first computing task based on the second request message.

[0032] Exemplarily, the resources associated with the first computing task include computing resources required for running the first computing task, such as a first instance; and may also include communication resources required for transmitting data related to the first computing task, such as a first air interface bearer.

[0033] In the above technical solution, when a request to end scheduling of the first computing task is received, the resources related to the first computing task are controlled to be released, which helps to improve the utilization rate of communication resources and computing resources.

[0034] In combination with the first aspect, in certain implementations of the first aspect, the first data packet also carries first indication information, and the first indication information is used to distinguish different scheduling of computing power services associated with the first computing task; the method also includes: receiving a fourth data packet from the terminal device, the fourth data packet carries fourth data of the second computing task and the first indication information, and the second computing task and the first computing task are associated with the same computing power service; when the first indication information carried by the fourth data packet changes relative to the first indication information carried by the first data packet, updating the resources required for scheduling the computing power service.

[0035] The computing service associated with the first computing task can be understood as scheduling the computing service to process the data and obtain the processing result. In other words, the essence of scheduling the computing task is to schedule the computing service so that the computing service processes the data and obtains the processing result.

[0036] In the above technical solution, the access computing node determines whether the previous scheduling of the first computing task has ended based on the first indication information carried in the data packet. When it is determined that the previous scheduling has ended, the relevant resources are updated for the new scheduling of the first computing task. That is, the end of the previous computing task scheduling can be indicated through the data packet, and the resource allocation of a new computing task can also be triggered, which helps to save the communication overhead required for resource updates.

[0037] In combination with the first aspect, in some implementations of the first aspect, the first indication information includes a first value or a second value, and the first value and the second value are used to distinguish different scheduling of computing power services.

[0038] In combination with the first aspect, in certain implementations of the first aspect, updating the resources required for scheduling the first computing task includes at least one of the following: sending a fourth data packet to a second instance, the second instance providing computing resources for the operation of the second computing task; allocating a second data bearer identifier to the second computing task, the second data bearer identifier and the first data bearer identifier corresponding to the same computing power QoS information as the first computing task; releasing the first air interface bearer; or releasing the first instance.

[0039] In some implementations, the second instance and the first instance may be the same instance or different instances. Furthermore, the node providing the second instance and the first instance may be the same node or different nodes. The air interface bearer indicated by the second data bearer identifier and the air interface bearer indicated by the first data bearer identifier may be the same bearer or different bearers.

[0040] In the above technical solution, before receiving the fourth data packet, the computing resources and / or communication resources allocated by the access computing node for the previous scheduling of the first computing task may have been released or occupied by other services or terminal users. Therefore, reallocating instances and air interface bearers for the current scheduling of the first computing task helps to ensure the performance of the first computing task.

[0041] In combination with the first aspect, in certain implementations of the first aspect, the first data packet also includes first address information, the first address information indicates that the source address of the first data packet is the address of the terminal device, and when the first node provides a first instance for the first computing task, the first data packet is sent to the first instance according to the information of the first computing task, including: determining the first node according to the information of the first computing task; replacing the source address of the first data packet with a temporary address to obtain a fifth data packet, the temporary address being associated with the current node and the terminal device; and sending the fifth data packet to the first node.

[0042] In the above technical solution, when the first node provides computing resources for the first computing task, the terminal device can route the first data packet to the first node via the access computing node. Furthermore, the access computing node replaces the source address of the data packet received from the terminal device so that when the first node sends a downlink data packet associated with the first computing task, it can route the downlink data packet to the terminal device via the access computing node. This means that the routing path of the data packet between the access computing node and the first node is fixed, which helps reduce the computational complexity required to determine the routing path during data packet routing.

[0043] In combination with the first aspect, in certain implementations of the first aspect, the method also includes: receiving a first downlink data packet from a first node, the first downlink data packet including fifth data and second address information, the second address information indicating that the target address of the first downlink data packet is a temporary address; replacing the destination address of the first downlink data packet with the address of the terminal device according to the temporary address to obtain a second downlink data packet; and sending the second downlink data packet to the terminal device via the first air interface.

[0044] In combination with the first aspect, in certain implementations of the first aspect, the method also includes: receiving a third downlink data packet from the first instance, the third downlink data packet including sixth data and third address information, the third address information indicating that the target address of the third downlink data packet is the address of the terminal device; and sending the third downlink data packet to the terminal device via the first air interface according to the third address information.

[0045] In the above technical solution, when the access computing node provides the first instance, the data packet is routed to the terminal device according to the destination address and the first data bearer identifier carried by the downlink data packet.

[0046] In combination with the first aspect, in some implementations of the first aspect, the method further includes: receiving a network access request from a terminal device, where the network access request is used to request access to a current node.

[0047] In a second aspect, a data transmission method is provided, which can be executed by a terminal device, or by a component (such as a chip or module) of the terminal device.

[0048] The method includes: receiving a first data bearer identifier from a second node, the first data bearer identifier is associated with a first computing task identifier, and the first computing task identifier is used to identify a first computing task; sending a first data packet to the second node via a first air interface bearer indicated by the first data bearer identifier, the first data packet carrying first data and information about the first computing task.

[0049] In combination with the second aspect, in some implementations of the second aspect, the method further includes: sending first request information to the second node, the first request information is used to request scheduling of the first computing task, and the first request information includes a first computing task identifier.

[0050] In combination with the second aspect, in some implementations of the second aspect, the information of the first computing task includes a unicast address allocated to the first computing task, and the method further includes: receiving the unicast address from the second node.

[0051] In combination with the second aspect, in certain implementations of the second aspect, the first computing task is identified as information of the first computing task, and the method also includes: sending a second data packet to the second node via the second air interface, the second data packet carrying second data and information of the first computing task.

[0052] In combination with the second aspect, in certain implementations of the second aspect, the first computing task identifier is a computing power service quality QoS flow identifier, and the method also includes: sending a third data packet to the second node via a third air interface bearer, the third data packet carrying third data and a computing power QoS flow identifier.

[0053] In combination with the second aspect, in some implementations of the second aspect, the information of the first computing task includes an anycast address of the first computing task.

[0054] In combination with the second aspect, in some implementations of the second aspect, the method further includes: sending second request information to the second node, where the second request information is used to request termination of scheduling of the first computing task.

[0055] In combination with the second aspect, in certain implementations of the second aspect, the first data packet also carries first indication information, and the first indication information is used to distinguish different scheduling of the first computing task; the method also includes: sending a fourth data packet to the second node, the fourth data packet carries fourth data of the first computing task and the first indication information, and the first indication information carried by the fourth data packet is different from the first indication information carried by the first data packet.

[0056] In combination with the second aspect, in some implementations of the second aspect, the first indication information includes a first value or a second value, and the first value and the second value are used to distinguish different scheduling of the first computing task.

[0057] In combination with the second aspect, in some implementations of the second aspect, the method further includes: receiving a downlink data packet from the second node via the first air interface, where the downlink data packet carries data of the first computing task.

[0058] In combination with the second aspect, in some implementations of the second aspect, the method further includes: sending a network access request to the second node, where the network access request is used to request access to the second node.

[0059] In a third aspect, a data transmission method is provided. This method can be performed by a network device with computing capabilities, or a component (such as a chip or module) of a network device with computing capabilities. For example, the network device can be a network device adjacent to the network device performing the method in any implementation of the first aspect, such as a neighboring node of an access node. Alternatively, the method can be performed by a computing device with communication capabilities, or a component (such as a chip or module) of a computing device with communication capabilities.

[0060] The method includes: receiving a fifth data packet from a second node, the fifth data packet carrying first data, information about a first computing task, and fourth address information, the fourth address information indicating that the source address of the fifth data packet is a temporary address, the temporary address is associated with the second node and the terminal device, and the first computing task is requested for scheduling by the terminal device; sending the fifth data packet to the first instance based on the information about the first computing task, the first instance providing computing resources for the operation of the first computing task.

[0061] In combination with the third aspect, in certain implementations of the third aspect, the method further includes: sending a first downlink data packet to the second node, the first downlink data packet including fifth data and second address information, the second address information indicating that the target address of the first downlink data packet is a temporary address.

[0062] In combination with the third aspect, in certain implementations of the third aspect, the information of the first computing task includes a unicast address allocated to the first computing task.

[0063] In combination with the third aspect, in certain implementations of the third aspect, the information of the first computing task includes an anycast address of the first computing task.

[0064] In the fourth aspect, an embodiment of the present application provides a communication device. The communication device may be a device or apparatus with a chip, or a device or apparatus integrated with a circuit, or a chip, chip system, module or control unit in the aforementioned device or apparatus, and this application does not limit it. It should be noted that, in this application, when referring to a communication device, it may refer to the communication device itself, or to a chip, functional module or integrated circuit in the communication device that completes the method provided in this application, and this application does not limit it. The device is used to execute the method provided in any one of the first to fourth aspects above. Specifically, the device may include units and / or modules for executing the method provided in any one of the implementation modes of the first to third aspects.

[0065] When the device is used to perform the method provided in any one of the implementations of the first aspect, the device may include an acquisition unit (or acquisition module) and a processing unit (or processing module). Optionally, the device may also include a transceiver unit (or transceiver module). In some implementations, the transceiver unit includes an acquisition unit, and the acquisition unit may be a receiving unit in the transceiver unit.

[0066] When the device is used to execute the method provided in any one of the implementations of the second aspect or the third aspect, the device may include a transceiver unit and a processing unit.

[0067] In some implementations, the processing unit may be at least one processor. The transceiver unit may be a transceiver or an input / output interface. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input / output interface may be an input / output circuit.

[0068] In some implementations, the communication device is a chip, chip system, or circuit in a terminal device or network device (such as an access node, core network, or collaboration node). The transceiver unit can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip, chip system, or circuit. The processing unit can be at least one processor, processing circuit, or logic circuit.

[0069] In a fifth aspect, embodiments of the present application provide a processor for executing the methods provided in the above aspects. For operations such as sending and receiving involved in the processor, unless otherwise specified, or unless otherwise inconsistent with its actual function or inherent logic in the relevant description, it can be understood as operations such as processor output, reception, and input, and can also be understood as sending and receiving operations performed by the radio frequency circuit and antenna.

[0070] In combination with the fifth aspect, in certain implementations of the fifth aspect, the processor is arranged in a communication device, and the communication device is any one of a terminal device, an access node, a core network or a collaborative node.

[0071] In the sixth aspect, an embodiment of the present application provides a communication system, which includes a terminal device and an access communication node. The access communication node can execute the method provided by any one of the implementation methods in the above-mentioned first aspect; the terminal device can execute the method provided by any one of the implementation methods in the above-mentioned second aspect.

[0072] In combination with the sixth aspect, in certain implementations of the sixth aspect, the communication system further includes a cooperation node, which can execute the method provided in any one implementation of the third aspect.

[0073] In a seventh aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium stores instructions or program codes, which, when executed by a processor, can implement the method provided in any one of the implementations of the first to third aspects above.

[0074] In an eighth aspect, an embodiment of the present application provides a computer program product comprising instructions. When the computer program product is run on a computer, the computer is caused to execute the method provided in any one of the implementations of the first to third aspects above.

[0075] In a ninth aspect, an embodiment of the present application provides a chip. The chip includes a processor and a communication interface, wherein the processor reads instructions stored in a memory through the communication interface and executes the method provided in any one of the implementation modes of the first to third aspects above.

[0076] Optionally, as an implementation method, the chip also includes a memory, in which a computer program or instruction is stored, and the processor is used to execute the computer program or instruction stored in the memory. When the computer program or instruction is executed, the processor is used to execute the method provided in any one of the implementation methods of the first to third aspects above.

[0077] The beneficial effects brought about by the second to ninth aspects mentioned above can be specifically referred to the description of the beneficial effects in the first aspect, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0078] FIG1 is a schematic diagram of a communication system used in an embodiment of the present application.

[0079] FIG2 is a schematic diagram of another communication system applied in an embodiment of the present application.

[0080] FIG3 is a schematic block diagram of a general computing node and an end-to-end protocol stack provided in an embodiment of the present application.

[0081] FIG4 is a schematic flowchart of a data transmission method provided in an embodiment of the present application.

[0082] FIG5 is another exemplary flowchart of the data transmission method provided in an embodiment of the present application.

[0083] FIG6 is another exemplary flowchart of the data transmission method provided in an embodiment of the present application.

[0084] FIG7 is another exemplary flowchart of the data transmission method provided in an embodiment of the present application.

[0085] FIG8 is a schematic diagram of a communication device provided in an embodiment of the present application.

[0086] FIG9 is another schematic diagram of a communication device provided in an embodiment of the present application.

[0087] FIG10 is another schematic diagram of the communication device provided in an embodiment of the present application.

[0088] FIG11 is a schematic diagram of a chip system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0089] The technical solution in this application will be described below with reference to the accompanying drawings.

[0090] In order to facilitate understanding of the embodiments of the present application, the following points are first explained.

[0091] 1. Unless otherwise specified, “plurality” means two or more.

[0092] 2. Unless otherwise specified or there is no logical conflict, the terms and / or descriptions between different embodiments of this application are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments based on their internal logical relationships.

[0093] 3. The various numerical numbers involved in this application are only used for the convenience of description and are not used to limit the scope of protection of this application. The size of the serial numbers involved in this application does not mean the order of execution. The order of execution of each process should be determined by its function and internal logic. For example, the terms "first", "second", "third", "fourth" and other various terminology labels (if any) in the specification and claims and drawings of this application are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. Among them, the data used in this way can be interchangeable where appropriate, so that the embodiments described here can be implemented in an order other than what is illustrated or described here.

[0094] At the same time, any embodiment or design described in this application as "exemplary" or "for example" should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.

[0095] 4. The terms "comprise" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such process, method, product or apparatus.

[0096] 5. In this application, "used to indicate" can be understood as "enabling," and "enabling" can include direct enabling and indirect enabling. When describing that certain information is used to enable A, it can include that the information directly enables A or indirectly enables A, and does not necessarily mean that the information contains A.

[0097] The information enabled by the information is called information to be enabled. In the specific implementation process, there are many ways to enable the enabled information, such as but not limited to, directly enabling the information to be enabled, such as the information to be enabled itself or the index of the information to be enabled. The information to be enabled can also be indirectly enabled by enabling other information, wherein there is an association between the other information and the information to be enabled. It is also possible to enable only a part of the information to be enabled, while the other parts of the information to be enabled are known or agreed in advance. For example, it is also possible to enable specific information with the help of the arrangement order of each piece of information agreed in advance (such as specified in the protocol), thereby reducing the enabling overhead to a certain extent. At the same time, it is also possible to identify the common parts of each piece of information and enable them uniformly to reduce the enabling overhead caused by enabling the same information separately.

[0098] 6. In this application, "pre-configuration" may include pre-definition, such as protocol definition. "Pre-definition" may be implemented by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in a device (e.g., including each network element). This application does not limit the specific implementation method.

[0099] 7. "Storage" or "saving" as used in this application may refer to storage in one or more memories. The one or more memories may be provided separately or integrated into an encoder or decoder, a processor, or a communication device. The one or more memories may also be provided in part separately and in part integrated into a decoder, processor, or communication device. The type of memory may be any form of storage medium and is not limited thereto.

[0100] 8. The “protocol” referred to in this application may refer to a standard protocol in the field of communications, such as the fourth generation (4G) th generation, 4G) network, fifth generation (5 th generation, 5G) network protocol, new radio (NR) protocol, 5.5G network protocol, and related protocols used in future communication systems.

[0101] 9. The arrows or boxes indicated by dotted lines in the schematic diagrams in the accompanying drawings of this specification represent optional steps or optional modules.

[0102] 10. Unless otherwise specified, “ / ” indicates that the objects associated with each other are in an “or” relationship. For example, A / B can mean A or B. “And / or” in this application is only a description of the association relationship between the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. A and B can be singular or plural.

[0103] For ease of understanding, the communication system shown in FIG1 is used as an example to describe the communication system applicable to various embodiments of the present application.

[0104] As shown in Figure 1 , the communications system includes a radio access network (RAN) 100 and a core network (CN) 200. RAN 100 includes at least one RAN node (e.g., 110a and 110b in Figure 1 , collectively referred to as 110) and at least one terminal device (e.g., 120a-120j in Figure 1 , collectively referred to as 120). The RAN may also include other RAN nodes, such as wireless relay devices and / or wireless backhaul devices (not shown in Figure 1 ). Terminal device 120 is wirelessly connected to RAN node 110. RAN node 110 is wirelessly or wiredly connected to core network 200. The core network devices in core network 200 and RAN node 110 in RAN 100 may be separate physical devices, or they may be a single physical device that integrates core network logical functions and radio access network logical functions.

[0105] The RAN 100 may be a cellular system related to the Third Generation Partnership Project (3GPP), such as a 4G, 5G, future communication system, non-terrestrial network (NTN) system, or a future evolution system. The RAN 100 may also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (Wi-Fi) system, or a communication system that integrates two or more of the above systems.

[0106] In a communication system, a device can send signals to or receive signals from another device. Signals can include information, signaling, or data. Devices can also be replaced by entities, network entities, communication devices, communication modules, nodes, communication nodes, etc. The embodiments of this application are described using devices as an example.

[0107] In an embodiment of the present application, the terminal device 120 is a device with wireless transceiver functions, which may refer to user equipment (UE), access terminal, subscriber unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user device.

[0108] In the embodiment of the present application, the terminal device 120 may also be a satellite phone, a cellular phone, a smart phone, a wireless data card, a wireless modem, a machine type communication device, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a customer-premises equipment (CPE), a smart point of sale (POS) machine, a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an on-board device, a communication device carried on a high-altitude aircraft, a wearable device, a drone, a robot, a terminal in device-to-device (D2D) communication, a terminal in vehicle-to-everything (V2X), a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self-driving, a remote medical device, or a similar device. In the embodiments of the present application, the device for realizing the function of the terminal device may be a terminal device, or a device capable of supporting the terminal device to realize the function, such as a chip system or a chip, which may be installed in the terminal device. In the embodiments of the present application, the chip system may be composed of chips, or may include chips and other discrete devices.

[0109] In the embodiment of the present application, the terminal device 120 may also be a device with communication functions in a future communication system, and the form or type of the terminal device in other future communication systems is not limited.

[0110] In the embodiments of the present application, the RAN node 110 may also be referred to as an access network device, an access node, or a RAN entity, and is used to help terminal devices achieve wireless access. Multiple RAN nodes 110 may be nodes of the same type or different types. In some scenarios, the roles of the RAN node 110 and the terminal device 120 are relative. For example, the network element 120i in Figure 1 may be a helicopter or a drone, which may be configured as a mobile base station. For terminal devices 120j that access the RAN 100 through the network element 120i, the network element 120i is a base station; but for the base station 110a, the network element 120i is a terminal device. The RAN node 110 and the terminal device 120 are sometimes referred to as communication devices. For example, 110a and 110b in Figure 1 may be understood as communication devices with base station functions, and the network elements 120a-120j may be understood as communication devices with terminal functions.

[0111] In one possible scenario, the RAN node 110 may be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next generation NodeB (gNB), a base station in a future mobile communication system, or an access node in a WiFi system. The RAN node may be a macro base station (such as 110a in FIG1 ), a micro base station or an indoor station (such as 110b in FIG1 ), a relay node or a donor node, or a wireless controller in a CRAN scenario. Optionally, the RAN node may also be a server, a wearable device, a vehicle, or an onboard device. For example, the access network device in the vehicle to everything (V2X) technology may be a road side unit (RSU).

[0112] In another possible scenario, multiple RAN nodes collaborate to assist terminals in achieving wireless access, with different RAN nodes implementing portions of the base station's functionality. For example, a RAN node can be a centralized unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). The CU and DU can be separate or included in the same network element, such as the baseband unit (BBU). The CU and DU nodes split the gNB's protocol layers, centrally controlling some protocol layer functions within the CU and distributing some or all of the remaining protocol layer functions within the DU, which is then centrally controlled by the CU. As an implementation method, the CU is deployed with the radio resource control (RRC) layer, the packet data convergence protocol (PDCP) layer, and the service data adaptation protocol (SDAP) layer in the protocol stack; the DU is deployed with the radio link control (RLC) layer, the medium access control (MAC) layer, and the physical layer (PHY) in the protocol stack. Thus, the CU has the processing capabilities of RRC, PDCP, and SDAP. The DU has the processing capabilities of RLC, MAC, and PHY. It will be understood that the above functional division is only an example and does not constitute a limitation on the CU and DU. The RU may be included in a radio frequency device or a radio frequency unit, for example, in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0113] In different systems, CU (or CU-CP and CU-UP), DU or RU may also have different names, but those skilled in the art can understand their meanings. For example, in the ORAN system, CU may also be called O-CU (Open CU), DU may also be called O-DU, CU-CP may also be called O-CU-CP, CU-UP may also be called O-CU-UP, and RU may also be called O-RU. For the convenience of description, this application uses CU, CU-CP, CU-UP, DU and RU as examples for description. Any unit of CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0114] In the embodiment of the present application, the core network 200 refers to the equipment in the core network (CN) that provides service support for the terminal device 120. At present, some examples of core network equipment are: access and mobility management function (AMF) entity, session management function (SMF) entity, user plane function (UPF) entity, etc., which are not listed here one by one. Among them, the AMF entity can be responsible for access management and mobility management of terminal devices; the SMF entity can be responsible for session management, such as user session establishment, etc.; the UPF entity can be a functional entity of the user plane, mainly responsible for connecting to the external network. It should be noted that the entities in this application can also be referred to as network elements or functional entities. For example, the AMF entity can also be referred to as AMF network element or AMF functional entity. For another example, the SMF entity can also be referred to as SMF network element or SMF functional entity, etc.

[0115] In the embodiments of the present application, the device for implementing the functions of the network device can be a network device; it can also be a device that can support the network device to implement the functions, such as a chip system, a hardware circuit, a software module, or a hardware circuit and a software module. The device can be installed in the network device or used in conjunction with the network device. In the embodiments of the present application, only the device for implementing the functions of the network device is used as an example to illustrate, and does not constitute a limitation on the solutions of the embodiments of the present application.

[0116] It should be noted that the embodiments of the present application do not limit the scenarios in which the network device is located. In addition, the network device can be a hardware device, or a software function running on dedicated hardware, or a software function running on general-purpose hardware, for example, an entity including dedicated or general-purpose hardware devices and software functions. The present application does not limit the specific form of the network device.

[0117] In order to facilitate understanding of the technical solution of this application, the relevant terms involved in this application are introduced below.

[0118] 1. Communication computing node: hereinafter referred to as a communication computing node, is a network device that has computing capabilities and can provide communication functions.

[0119] 2. Computing power function: a way to run code snippets (functions) as services without having to worry about the management of servers and infrastructure. Developers only need to write business logic code and upload it to the function computing platform provided by the cloud service provider to quickly deploy and run applications. It is a serverless computing model that usually consists of a series of configurations and a series of executable codes / software packages. Business logic code is software program code written to support the computational processing of input data or events according to a specified algorithm. For example, the above-mentioned computational processing may include: transcoding of video streams, image rendering, image detection, artificial intelligence (AI) computing, etc.

[0120] 3. Computing Service: Also known as a computing service, this is an independent application process that implements a set or a specific computing function to solve a specific problem. Computing services use a lightweight application programming interface (API) to communicate through a well-defined interface. Generally, a computing service corresponds to one or more computing functions that provide the same functionality. This means that multiple different computing functions implementing the same functionality can provide the same computing service. Generally, the functionality implemented by a computing function can be encapsulated as a service and made available to external entities through an API.

[0121] 4. Computing Function Instance: This is an application created by installing the computing function code onto a general computing node, hereafter referred to as a function instance. A function instance can be understood as an entity that can run a computing function. For example, it can be hosted by a container that provides the computing function's runtime environment, processes the function's input, executes the code logic, and produces output results. A computing function instance can also be referred to as a computing service instance.

[0122] 5. Computing function scheduling: This involves using a function instance to perform computations on specified data. This is referred to as function scheduling. The same computing function can be scheduled multiple times, with the inputs for each scheduling being the same or different. Consequently, the outputs for each scheduling can be the same or different. Computing function scheduling can also be understood as computing task scheduling.

[0123] 6. Computing Task: Also known as a computing task, this involves executing a computing function call (invoke) or computing service to obtain a result in order to complete a business logic transaction. For example, to perform video transcoding on specified data, a computing function call / computing service can be executed for a video clip or video code segment. This process uses the video clip or video code segment as input for the computing function / computing service until the computing function / computing service executes and obtains the complete transcoded clip or code segment. This is called a computing task. To process the next different video clip or video code segment, a new computing task must be executed, i.e., the computing function / computing service is called again or executed. In other words, different calls / executions of the computing function / computing service are called different computing tasks.

[0124] 7. Scheduling Compute Tasks: Prepare transmission resources for the task, or prepare both computing and transmission resources for the task, and begin executing the computing service call until the computing function / computing service runs and obtains data processing results. It should be noted that if the computing resources required for the task are already prepared, only transmission resources are prepared for the task; if the computing resources required for the task are not yet prepared, both transmission and computing resources are prepared for the task.

[0125] 8. Computing network: abbreviated as computing network, is a new type of information infrastructure that connects multiple computing nodes based on mobile communication networks, IP networks, and other networks, thereby scheduling computing tasks to computing nodes that can execute the computing tasks based on the resources required by the tasks.

[0126] 9. Computing function identifier, a global identifier that uniquely identifies a computing function. The computing function identifier can be an identifier in any of the following formats: ① a globally unique identifier, for example, composed of one or more combinations of letters, numbers, and special characters; ② an identifier in the format of a uniform resource locator (URL); ③ a fully qualified domain name (FQDN); or, ④ an IP address, for example, an IP anycast address or an IP unicast address; ⑤ an IP address + port number. In this application, unless otherwise specified, computing service and computing function can be used interchangeably, and computing function identifier and computing service identifier can be used interchangeably.

[0127] 10. Computing power session: also known as computing session, computing network session, the computing nodes in the computing network can complete the authorization of computing tasks through computing power sessions, determine the nodes that provide computing resources for the computing tasks, and prepare computing power function instances for the computing tasks. Among them, authorizing the computing task can be understood as: the computing node subsequently provides computing resources and / or communication resources for the computing task. Preparing a computing power function instance for the computing task may include: triggering the instantiation of the computing power function and / or activating the computing processing function of the computing power function instance, so that when the computing power function instance receives the data to be processed of the computing task, it can process the data to be processed in a timely manner. Triggering the instantiation of the computing power function can be understood as: when the computing node does not have an available computing power function instance, downloading or obtaining the code of the computing power function required for the computing task, initiating a suitable container, and installing the computing power function code on the computing node.

[0128] 11. Computing power QoS: also known as computing network QoS, includes transmission QoS and computing QoS. It is a parameter used to ensure communication (or information transmission) and computing characteristics. It may include at least one of the following: transmission resource type, priority, packet delay budget, packet error rate, packet loss rate, default maximum data burst size, default averaging window, etc. It may also include computing resource types, such as central processing unit (CPU) resources, graphics processing unit (GPU) resources, neural network processing unit (NPU) resources, tensor processing unit (TPU) resources, deep learning processing unit (DPU) resources, field programmable gate array (FPGA) resources, memory resources, storage resources, etc. It may also include resource consumption granularity and computing power requirements, such as at least one of the following: floating point operations per second (FLOPS) and operations per second (OPS).

[0129] 12. Computing QoS Flow: This is used to transmit computing task data and meet the computing QoS requirements. The computing task data includes the data to be processed by the computing task and / or the processing results of the computing task.

[0130] 13. Computing Service Quality of Service (QoS Class Identifier, QCI): Identifies at least one of a computing QoS configuration, a computing QoS requirement, or a set of computing QoS parameters, representing computing QoS requirements and guarantees of the same level or level. As described above, the routing device in the CFN cannot obtain the status of the radio bearer between the terminal device and the computing node. As a result, when selecting a computing node, the routing device only considers the balance of the network load or the distance of the communication path, and fails to consider the overall communication performance from the terminal device to different computing nodes. As a result, the selected computing node may not be the node with better computing resources, resulting in a long delay in scheduling computing services. To address the above problems, a network device (hereinafter referred to as an access computing node) or core network with computing capabilities that can provide access services to terminal devices has been developed. The access computing node or core network can determine whether the access computing node or its neighboring nodes can provide computing resources for the execution of the computing service based on the performance requirements of the computing service requested by the terminal device and the wireless communication resources that the access computing node can provide for the computing service. Furthermore, selecting nodes whose available computing resources can support the performance requirements of the computing service to provide computing resources for the execution of the computing service can ensure the performance of the computing service.

[0131] However, the above scheme focuses on how to allocate inter-computing nodes for the execution of computing power services, and does not consider how the data associated with the computing power services (such as data to be processed or processed data) is transmitted between the terminal device and the inter-computing nodes. For example, how to allocate communication resources between the terminal device and the inter-computing nodes for the data associated with the computing power services, and how to release the communication resources allocated for the data associated with the computing power services.

[0132] In view of this, the embodiments of the present application provide a data transmission method, a communication device and a system, which can realize the transmission of data associated with computing tasks between the computing node and the terminal device, thereby realizing the coupling of communication and computing based on the granularity of computing tasks.

[0133] Figure 2 shows another schematic block diagram of a communication system provided by an embodiment of the present application. As shown in Figure 2, the system may include a terminal device 10, a service access computing node 20, and a core network 30. Optionally, the communication system may further include at least one collaborative access computing node (such as collaborative access computing nodes 21 to 2n, where n is a positive integer); the communication system may further include at least one collaborative core computing node (such as collaborative core computing nodes 31 to 3n, where n is a positive integer). The terminal device 10 may include any of the terminal devices 120 shown in FIG1 . If the terminal device 10 includes any of the terminal devices 120a, 120b, 120c, and 120i shown in FIG1 , the service access computing node 20 may include the RAN node 110a shown in FIG1 , and the at least one collaborative access computing node may also include the RAN node 110b shown in FIG1 . Alternatively, if the terminal device 10 includes any of the terminal devices 120f, 120g, and 120h shown in FIG1 , the service access computing node 20 may include the RAN node 110b shown in FIG1 , and the at least one collaborative access computing node may also include the RAN node 110a shown in FIG1 . In some implementations, the at least one collaborative access computing node may also include a UPF entity adjacent to the service access computing node 20. The at least one collaborative core computing node may include the core network 200 shown in FIG1 . The core network 30 may communicate with each computing node via a control plane, and the control plane may include one or more control plane function entities in the core network 200.

[0134] In actual implementation, the above-mentioned inter-computing nodes (such as service access inter-computing nodes, collaborative access inter-computing nodes, and collaborative core inter-computing nodes) may have, in addition to the communication function, some or all of the following functions:

[0135] 1) Computing task decision-making function, that is, determining whether its own computing resources are sufficient to perform local computing tasks. The above local computing tasks can be computing tasks requested by terminal devices or other general computing nodes, or they can also be computing tasks assigned by the core network.

[0136] 2) Control functions of function instances, including deploying function instances to virtualized hardware platforms and / or managing virtualized resources.

[0137] 3) Provide the virtualized resources required to run the computing function. These virtualized resources include communication resources, computing resources, and storage resources. More specifically, computing resources include virtualized CPU resources, GPU resources, NPU resources, TPU resources, FPGA resources, DPU resources, memory resources, and storage resources.

[0138] In particular, the service access computing node 20 is further configured to establish a communication connection with the terminal device 10 according to a computing task scheduling request from the terminal device 10. The communication connection is used to carry function scheduling or computing task data.

[0139] The core network 30 is used to perform one or more of the following: processing computing task scheduling requests of the terminal device 10 to implement identity authentication and authorization; deploying overall management and control strategies on each computing node for computing tasks; determining collaborative nodes based on computing tasks, for example, selecting one or more collaborative nodes from at least one collaborative access computing node and / or at least one collaborative core computing node as collaborative nodes.

[0140] It should be noted that the communication delay between at least one collaborative access computing node and at least one collaborative core computing node and the service access computing node 20 meets the delay requirement. For example, the communication delay between at least one collaborative access computing node or at least one collaborative core computing node and the service access computing node 20 is less than or equal to the delay threshold. The delay threshold can be 1 millisecond, 2 milliseconds, 5 milliseconds, or other values.

[0141] It should also be noted that the functions of each of the above computing nodes can be implemented or completed by a logical network element or a group of co-deployed logical network elements. For example, a service access computing node, a collaborative access computing node or a collaborative core computing node can be composed of a traditional base station plus a group of edge computing servers. The embodiment of the present application does not impose specific restrictions on the functional division of traditional base stations and edge computing servers. For another example, as shown in (a) in Figure 3, the computing nodes in the embodiment of the present application (such as service access computing nodes, collaborative access computing nodes, collaborative core computing nodes) can also be implemented by a computing platform and a virtualized hardware platform independent of the computing platform (such as a virtual machine, a container, etc.). Among them, the computing platform provides communication functions and function instance management functions. The communication function is used to realize communication with terminal devices and / or other computing nodes, and the function instance management function is used to realize dynamic management of function instances in computing nodes, such as computing power function instantiation, function instance activation, function instance release, etc., thereby realizing dynamic expansion or contraction of virtualized resources in the virtualized hardware platform. In addition, when the inter-computing node is a service access inter-computing node, the computing platform may also include a centralized control unit for determining the computing resources allocated for the computing task, or determining the collaborative node that provides computing resources for the computing task. The virtualized hardware platform is used to provide the virtualized resources required for the function instance to run, or the virtualized hardware platform also provides resources for implementing the user plane functions of the inter-computing node (such as user plane data transmission).

[0142] (b) and (c) in Figure 3 show a schematic diagram of the end-to-end protocol stack in the computing power service scheduling process provided by an embodiment of the present application. Among them, the data to be processed by the computing power service of the terminal device is encapsulated via the application layer, transmission control protocol (TCP) / user datagram protocol (UDP) / quick UDP Internet connections (QUIC) layer, and IP layer to obtain an IP layer data packet, and then add a layer 2 (layer 2 such as SDAP layer, PDCP layer, MAC layer) header to obtain an air interface data packet, which is transmitted to the access computing node through the air interface. The access computing node parses the air interface data packet to obtain an IP layer data packet, as shown in (b) in Figure 3. When the access computing node provides a function instance corresponding to the computing power service, the access computing node sends the IP layer data packet to the function instance through IP routing; as shown in (c) in Figure 3, when the collaborative node provides a function instance, the access computing node sends the IP layer data packet to the collaborative node through IP routing, and the collaborative node sends the IP layer data packet to the function instance through IP routing. Furthermore, the function instance parses the IP layer data packet to obtain the data to be processed by the computing service and processes the data. Optionally, data packets can be transmitted between the access node and the function instance, or between the collaboration node and the function instance, using other transport protocols, such as L2 or L2.

[0143] The system provided by the present application is introduced above in conjunction with Figures 1 to 3. The following is a detailed introduction to the data transmission method performed based on the communication system shown in Figure 2 in conjunction with Figures 4 to 8. Among them, Figures 4 to 6 are illustrated by taking the terminal device request scheduling computing function 1 as an example. The method shown in Figures 4 to 6 can be executed by the terminal device and the access computing node. In some scenarios, the method shown in Figures 4 to 6 also requires the participation of the collaborative node and the core network. Among them, the terminal device may include the terminal device 10 in Figure 2, the access computing node may include the service access computing node 20 in Figure 2, the core network may include the core network 30 in Figure 2, and the collaborative node may include at least one collaborative access computing node and / or at least one collaborative core computing node in Figure 2.

[0144] It should be noted that before executing the methods shown in Figures 4 to 6, a general computing node that provides computing resources may have been allocated for the operation of computing task 1. Specifically, the allocation of the general computing node that provides computing resources for computing task 1 may include the following three situations: ① The access general computing node determines that it provides computing resources for computing task 1; ② The access general computing node determines that the collaborative node provides computing resources for computing task 1; or ③ The core network determines that the access general computing node and / or the collaborative node provide computing resources for computing task 1.

[0145] It should also be noted that before executing the method shown in Figure 4 or Figure 6, the access node can pre-acquire or store computing power QoS information, and the computing power QoS information can indicate the correspondence between at least one computing task and its corresponding computing power QoS, and the above-mentioned at least one computing task includes computing task 1. Exemplarily, the correspondence between a computing task and computing power QoS may include: the correspondence between the information of the computing task (such as computing power service identification) and a set of computing power QoS (such as computing power QoS configuration, computing power QoS requirements, and at least one of a set of computing power QoS parameters). Among them, a set of computing power QoS may include a parameter set of transmission QoS and computing QoS, and a set of computing power QoS may be represented by a computing power QCI. Exemplarily, the access computing node can obtain computing power QoS information in any of the following ways: ① The operation administration and maintenance (OAM) network element pre-configures (such as static configuration) computing power QoS information in the access computing node; ② Obtain computing power QoS information during the initial connection establishment phase (such as the N2 setup phase) between the access computing node and the core network; ③ During the establishment of the computing power session of the terminal device, the access computing node can obtain computing power QoS information applicable to or effective for the terminal device from the core network; or ④ When the terminal device requests to join the established computing power session, or when the terminal device requests to schedule a computing power function, the access computing node can obtain computing power QoS information applicable to or effective for the terminal device from the core network. Before executing the method shown in Figure 5, the core network can pre-acquire or store the above-mentioned computing power QoS information. It should be noted that the computing power QoS information involved in this application can also be called QoS information, or may be called other names in the future, and this application does not specifically limit its name.

[0146] Figure 4 shows a schematic flow chart of a data transmission method provided in an embodiment of the present application. In this embodiment of the present application, each scheduling of a computing task is associated with an air interface bearer indicated by a data bearer identifier. The data bearer identifiers corresponding to the scheduling of different computing tasks and the air interface bearers they indicate may be the same or different. Specifically, method 400 may include some or all of the following steps.

[0147] S401: The terminal device sends a scheduling request for computing task 1 to the access computing node.

[0148] Among them, the scheduling request carries the computing power service identifier of computing task 1. The specific form of the computing power service identifier can be referred to the description in the above embodiment and will not be repeated here. As mentioned above, computing task 1 can be understood as a scheduling of a computing power service (such as computing power service 1) or a computing power function (such as computing power function 1). The computing power service identifier of computing task 1 can be understood as: the identifier of computing power service 1 or computing power function 1 corresponding to computing task 1.

[0149] Exemplarily, the scheduling request may be air interface control signaling, such as access stratum (AS) signaling. More specifically, the scheduling request may be RRC layer signaling, or MAC layer signaling.

[0150] In some implementations, before the access intermediary computing node receives the scheduling request for computing task 1, no node providing computing resources has been assigned to computing task 1. In this case, the scheduling request is further used to request the access intermediary computing node to assign a node providing computing resources to computing task 1. Furthermore, the access intermediary computing node may determine whether it or a cooperating node will provide computing resources for computing task 1.

[0151] Optionally, after receiving the scheduling request for computing task 1, the access node may further execute S402 and S403 before executing S404:

[0152] S402: Access the common computing node to perform authorization verification.

[0153] In this example, the access computing node can verify the scheduling request of computing task 1 based on the computing power QoS information. For example, if the computing power QoS information includes computing power QoS information corresponding to computing task 1, the access computing node can authorize the scheduling request of computing task 1. It should be understood that after authorizing the scheduling request of computing task 1, the access computing node can provide computing resources for the execution of computing task 1 and / or send data related to computing task 1 to the collaborative node to enable computing task 1 to run.

[0154] S403: Access the general computing node and prepare function instance 1.

[0155] In one example, if the access computing node provides computing resources (i.e., function instance 1) for computing task 1, the access computing node performs at least one of the following: activating the computing processing function of function instance 1 corresponding to computing task 1, and / or triggering the instantiation of computing task 1 to obtain function instance 1.

[0156] In another example, if the collaborative node provides computing resources (i.e., function instance 1) for computing task 1, the access computing node sends a request message to the collaborative node, which carries the computing power service identifier of computing task 1, to trigger the collaborative node to prepare function instance 1. Alternatively, the access computing node sends a request message to the collaborative node through the core network to request the collaborative node to prepare function instance 1. After receiving the request message, the collaborative node can perform at least one of the following: activate the computing processing function of function instance 1 corresponding to computing task 1, and / or trigger the instantiation of computing task 1 to obtain function instance 1.

[0157] S404: The access computing node determines the air interface bearer configuration information of computing task 1 according to the computing power service identifier and computing power QoS information.

[0158] Exemplarily, the air interface bearer configuration information may include a data bearer identifier assigned to computing task 1, or may also include the computing power QCI corresponding to computing task 1 and / or the logical channel configuration information corresponding to the air interface bearer identifier, etc. Among them, the logical channel refers to the channel between the MAC sublayer and the RLC sublayer, and the logical channel configuration information may include but is not limited to the logical channel guaranteed rate, logical channel priority, and logical channel packet delay. The data bearer identifier may be a DRB identifier, or a data bearer identifier with finer granularity than the existing DRB, such as a DRB can carry multiple of the aforementioned air interface bearers. It should be noted that different computing tasks correspond to different data bearer identifiers, but different computing tasks can also share the same DRB.

[0159] In one implementation, the data bearer identifier assigned to computing task 1 can be bound to the computing power service 1 associated with computing task 1, that is, no matter which access node the terminal device accesses, no matter in which scheduling of computing power service 1 (computing task 1, computing task 2,... computing task n), since any computing task from computing tasks 1 to n is associated with computing power service 1, the data bearer identifier is assigned to each computing task from computing tasks 1 to n.

[0160] In another implementation, the data bearer identifier allocated to computing task 1 can indicate the currently available air interface bearer, that is, when the terminal device schedules computing power services associated with computing task 1 at different times, or when the terminal device accesses different access nodes to schedule computing power services, the data bearer identifiers allocated for scheduling different times of computing power services (or different times of computing tasks) are different.

[0161] It should be noted that in the above two implementation methods, the data bearer identifiers allocated to different computing tasks associated with the same computing power service are all associated with a computing power QCI corresponding to the computing power service.

[0162] S405: The access computing node sends a scheduling response of computing task 1 to the terminal device.

[0163] The scheduling response includes the air interface bearer configuration information of computing task 1, more specifically, the data bearer identifier allocated to computing task 1; or it may also include the computing power QCI corresponding to computing task 1 and / or the logical channel configuration information corresponding to the data bearer identifier.

[0164] Exemplarily, the scheduling response may be air interface control signaling, such as AS signaling. More specifically, the scheduling response may be RRC layer signaling, or MAC layer signaling, etc.

[0165] S406: The terminal device sends uplink data packet 1 of computing task 1 to the access computing node.

[0166] The terminal device sends an uplink data packet 1 on the air interface bearer (such as air interface bearer 1) indicated by the data bearer identifier allocated to the computing task 1. The uplink data packet may include data to be processed by the computing task 1. The uplink data packet 1 may be an IP layer data packet, or the uplink data packet 1 may also be a non-IP layer data packet, for example, any one of an SDAP layer data packet, a PDCP layer data packet, and a MAC control element (CE) layer data packet. Exemplarily, after the terminal device encapsulates the IP layer data packet, it adds an air interface protocol layer header to the uplink data packet 1.

[0167] Specifically, the uplink data packet 1 carries IP information 1 associated with computing task 1. The IP information 1 may include the destination IP address of the uplink data of computing task 1 (hereinafter referred to as the address of computing task 1), and the address of computing task 1 may be an anycast address associated with computing task 1 (for example, the anycast address of computing power service 1 corresponding to computing task 1), or the address of computing task 1 may also be an access unicast IP address allocated to computing task 1 by a node (such as an access node or a collaborative node) that provides computing resources (i.e., a function instance) for computing task 1, and the address is used for terminal devices to access the function instance.

[0168] Exemplarily, the access unicast IP address allocated to computing task 1 may be allocated to computing task 1 by the access computing node or the collaboration node when preparing function instance 1. Furthermore, the access computing node notifies the terminal device of the access unicast IP address through the scheduling response of S405. The access unicast IP address may be the public IP address of function instance 1, or the private IP address of function instance 1, or the unicast IP address of the node providing function instance 1 (such as the access computing node or the collaboration node), or a virtual IP address, which is an IP address that has not been previously allocated to any host.

[0169] Exemplarily, the terminal device fills the destination IP address of the IP layer of the uplink data packet 1 with the address of the above-mentioned computing task 1; fills the source IP address of the IP layer with the IP of the terminal device (recorded as UE IP); further, the terminal device also fills in the destination port number and source port number of the transport layer protocol. It should be understood that the above-mentioned destination port number is the port number associated with computing task 1 (such as the port number of function instance 1), and the source port number is the port number used by the terminal device to schedule computing task 1. The above-mentioned UE IP can be an address or identifier assigned by the core network to identify the terminal device, and the UE IP will not change during the execution of computing task 1 or in a computing power session cycle or during a computing power session registration period.

[0170] Optionally, a reserved bit in the IP header of the uplink data packet is reused to indicate the scheduling, switching, or start and end of different computing tasks for the same computing power service. For example, the highest bit of the segmentation flag field flag in the multiplexed IP header is initially set to 0 to identify the first computing task scheduling of the computing power service. When the next computing task of the computing power service is scheduled, the value is flipped to 1. Alternatively, the Option field of the IP extension item is used to indicate the scheduling, switching, or start and end of different computing tasks for the same computing power service. For example, for the first computing task scheduling corresponding to computing power service 1, the Option field is set to all 0, and for the next computing task scheduling corresponding to computing power service 1, the Option field is set to all 1. The field indicating the scheduling (or switching, start and end) of different computing tasks for the same computing power service is hereinafter referred to as a flip bit.

[0171] In summary, the IP layer information carried by uplink data packet 1 can be in any of the following forms:

[0172] "Src=UE IP, Dst=anycast#1",

[0173] "Src = UE IP, Dst = unicast IP #1",

[0174] "Src=UE IP, Dst=anycast#1, flip bit=0", or

[0175] "Src=UE IP, Dst=Unicast IP#1, Toggle Bit=0".

[0176] Among them, Src and Dst represent the source IP address and destination IP address respectively, "Src=UE IP" means that the source IP address is UE IP, "Dst=anycast#1" means that the destination IP address is the anycast address associated with computing task 1, "Dst=unicast IP#1" means that the destination IP address is the access unicast IP address assigned to computing task 1, and "flip bit=0" means that this is a scheduling of computing power service 1 associated with a certain computing task 1. When the flip bit is 1, it means that the scheduling of computing power service 1 at that time is not the same scheduling as the scheduling when the flip bit is 0.

[0177] After the access computing node receives the uplink data packet 1, it decapsulates the uplink data packet 1, obtains the destination IP address of the uplink data packet 1 (ie, the address of the computing task 1), and optionally also obtains the destination port number.

[0178] In some implementations, if the IP layer information includes a flip bit, the access intermediary node also sets the flip bit to zero, meaning only the access intermediary node perceives the flip bit information. Alternatively, if the IP layer information includes a flip bit, and the collaborating node provides computing resources for computing task 1, the access intermediary node may not process the flip bit, allowing the collaborating node to perceive the flip bit information and determine whether to update the computing resources (i.e., function instance) based on the flip bit information.

[0179] Furthermore, based on the nodes that provide computing resources for computing task 1 determined in the early stage, the subsequent data transmission can be divided into the following two cases:

[0180] Case 1:

[0181] The access computing node provides computing resources for computing task 1, and the access computing node sends uplink data packet 1 to the local function instance 1, and receives downlink data packet of computing task 1 from the local function instance 1. Specifically, it may include S407 and S408:

[0182] S407 , the access computing node sends the uplink data packet 2 to the function instance 1 according to the IP information 1 .

[0183] The access computing node sends the uplink data packet 2 to the function instance 1 according to the IP information 1, including: the access computing node sends the uplink data packet 2 to the function instance 1 according to the address of the computing task 1 included in the IP information 1. The data to be processed by the computing service 1 carried by the uplink data packet 2 is consistent with the data to be processed by the computing service 1 carried in the uplink data packet 1. In some implementations, the uplink data packet 2 can be obtained by the access computing node processing the uplink data packet 1, and the processing of the uplink data packet 1 can include: parsing the uplink data packet 1 to obtain an IP data packet as the uplink data packet 2; or can also include: replacing or changing the IP address in the IP data packet included in the uplink data packet 1 to obtain the uplink data packet 2. More specifically, it can be divided into the following three cases:

[0184] (1) When the address of computing task 1 is the unicast IP address of the access computing node, the access computing node determines that the computing service corresponding to computing task 1 is computing service 1 through the unicast IP address, selects function instance 1 corresponding to computing service 1, and obtains the communication address of function instance 1 (the communication address of function instance 1 can also be selected and obtained when the access computing node allocates the unicast IP address of the access computing node). The access computing node and function instance 1 can communicate based on IP, in which case the communication address of function instance 1 is the unicast IP address of function instance 1, or the access computing node and function instance 1 can exchange data based on other transmission protocols such as remote direct memory access (RDMA) protocol, in which case the communication address of function instance 1 is the unicast RDMA address of function instance 1. Optionally, the access computing node replaces the destination IP address of uplink data packet 1 (i.e., the unicast IP address of the access computing node) with the communication address of function instance 1, i.e., the destination IP address of uplink data packet 2 is the communication address of function instance 1. Furthermore, the access computing node sends the uplink data packet 2 to the communication address of the function instance 1, so that the function instance 1 processes the data to be processed in the uplink data packet 2.

[0185] (2) When the address of computing task 1 is the communication address of function instance 1 (for example, a unicast IP address), the access node sends the uplink data packet 2 to the communication address of function instance 1 according to the address of computing task 1, so that function instance 1 processes the data to be processed in the uplink data packet 2.

[0186] (3) When the address of computing task 1 is the anycast address or virtual IP address associated with computing task 1, the access computing node determines that the computing service corresponding to computing task 1 is computing service 1 through the anycast address or virtual IP address, selects the function instance 1 corresponding to computing service 1 and obtains the communication address (for example, unicast IP address) of function instance 1 (the communication address of function instance 1 can also be determined when the access computing node receives the scheduling request of the terminal device). Furthermore, the access computing node sends the uplink data packet 2 to the communication address of function instance 1, so that function instance 1 processes the data to be processed in the uplink data packet 2 (at this time, the destination IP address of the uplink data packet 2 is the anycast address associated with computing task 1). Optionally, the access computing node can also replace the destination IP address of the uplink data packet 1 (that is, the anycast address or virtual IP address associated with computing task 1) with the communication address of function instance 1, that is, the destination IP address of the uplink data packet 2 is the unicast IP address of function instance 1.

[0187] Optionally, the access computing node generates and saves uplink routing information of the terminal device toward function instance 1 (which can be determined based on IP layer information of uplink data packet 1). For example, the uplink routing information may include any of the following:

[0188] "Src = UE IP, Dst = access node unicast IP address #1"

[0189] "Src=UE IP, Dst=anycast#1";

[0190] "Src = UE IP, Dst = virtual IP address"; or

[0191] "Src=UE IP, Dst=unicast IP address #1 of function instance 1".

[0192] Furthermore, for each subsequently received data packet whose destination IP address is the address of computing task 1, the access computing node sends it to the communication address of function instance 1 according to the above-mentioned uplink routing information, so that function instance 1 can process it. It should be noted that before the access computing node sends a data packet to the communication address of function instance 1, it may change the destination IP address in the received data packet, for example, changing the unicast address of the access computing node to the unicast IP address of function instance 1, or changing the anycast address of computing service 1 to the unicast IP address of function instance 1; or changing the virtual IP address to the unicast IP address of function instance 1. Furthermore, the access computing node sends a data packet with the changed destination IP address to the communication address of function instance 1. It should also be noted that when the IP layer information of uplink data packet 1 includes a flip bit, if the flip bit in each subsequently received data packet whose destination IP address is the address of computing task 1 is the same as the flip bit in uplink data packet 1, the access computing node sends it to the address of function instance 1 for processing. When the flip bit changes, the access node can reselect another function instance 2 and update the uplink routing rules. For example:

[0193] Routing rules before update:

[0194] When the IP information of the data packet is "Src = UE IP, Dst = access node unicast IP address #1, flip bit = 0", the data packet is sent to the communication address of function instance 1 (such as unicast IP address #1); or

[0195] When the IP information of the data packet is "Src=UE IP, Dst=anycast#1, flip bit=0", the data packet is sent to the communication address of function instance 1 (such as unicast IP address #1);

[0196] Updated routing rules:

[0197] When the IP information of the data packet is "Src = UE IP, Dst = access node unicast IP address #1, flip bit = 1", the data packet is sent to the communication address of function instance 2 (such as unicast IP address #2); or

[0198] When the IP information of the data packet is "Src=UE IP, Dst=anycast#1, flip bit=1", the data packet is sent to the communication address of function instance 2 (such as unicast IP address #2);

[0199] Correspondingly, function instance 1 stores the downlink routing information for each terminal device, for example, "Src = UE IP," and then function instance 1 sends the downlink data packet associated with the terminal device whose IP address is UE IP to the access computing node. Furthermore, the downlink data packet is sent to the network port (or port or MAC address) corresponding to the unicast IP address of the access computing node.

[0200] In addition, the access computing node also generates and saves the downlink routing information of function instance 1 in the direction of the terminal device, that is, the destination IP address is UE IP. When the access computing node receives a data packet with a destination IP address of UE IP, it sends it to the terminal device on the air interface bearer (such as air interface bearer 1) according to the air interface transmission protocol. Optionally, the downlink routing information also includes information that the source IP address is the address of computing task 1. Further, when the access computing node receives a data packet with a destination IP address of UE IP and a source IP address of computing task 1, it sends it to the terminal device on the corresponding air interface bearer according to the air interface transmission protocol.

[0201] It should be noted that the unicast IP address of the above-mentioned function instance 1 can be the public IP address, private IP address or local area network IP address of the function instance 1.

[0202] S408 , the access general computing node receives downlink data packet 1 of function instance 1.

[0203] In some implementations, downlink data packet 1 includes the result of processing the data to be processed by function instance 1. For example, if uplink data packet 1 includes a frame of an image to be processed, downlink data packet 1 includes the data of the image processed by function instance 1. Downlink data packet 1 may be an IP data packet.

[0204] Exemplarily, the source IP address in the IP layer information of downlink data packet 1 can be the address of computing task 1, the source port is the port number of function instance 1, the destination IP address is UE IP, and the destination port number is the port number used by the terminal device to schedule computing task 1.

[0205] Case 2:

[0206] The collaboration node provides computing resources (i.e., function instance) for computing task 1. The access computing node sends uplink data packet 1 to the collaboration node. The collaboration node sends the data packet to the function instance. The function instance sends downlink data to the collaboration node. The access computing node receives the downlink data packet of computing task 1 from the collaboration node. Specifically, this may include S409a to S409d:

[0207] S409a: The access computing node sends the uplink data packet 2' of the computing task 1 to the collaboration node.

[0208] Exemplarily, the uplink data packet 2' carries IP information 2 associated with computing task 1, and the IP information 2 can be obtained based on IP information 1, for example, the source IP address in IP information 1 is changed to obtain IP information 2. In some implementations, the access computing node allocates a temporary UE IP to the terminal device, and then replaces the source IP address of the IP data packet included in the uplink data packet 1 from UE IP to temporary UE IP to obtain uplink data packet 2', and sends the uplink data packet 2' to the collaboration node. It should be noted that the access computing node saves the relationship between the UE IP and the temporary UE IP, and the collaboration node saves the relationship between the temporary UE IP and the access computing node (such as downlink routing information <temporary UE IP, access computing node>). In this way, the collaboration node can send the data associated with the temporary UE IP to the access computing node based on the temporary UE IP.

[0209] More specifically, the access node sends the uplink data packet 2' of computing task 1 to the collaboration node, which can be divided into the following four cases:

[0210] (1) When the address of computing task 1 is the unicast IP address of the access computing node, the access computing node determines the collaborative node to provide computing resources for computing task 1 through the unicast IP address, and then determines the collaborative node that provides computing resources for computing task 1. The access computing node sends an uplink data packet 2' to the collaborative node through the unicast IP address of the collaborative node. Optionally, the unicast IP address of the collaborative node corresponds to an outbound interface (interface) of the access computing node. Optionally, the access computing node can replace the destination IP address of the IP data packet included in the uplink data packet 1 (i.e., the unicast IP address of the access computing node) with the anycast address of the computing service 1, and obtain the uplink data packet 2', i.e., the destination IP address of the uplink data packet 2' is the anycast address of the computing service 1. That is, at this time, the source IP address and the destination IP address in the IP information 2 are different from those in the IP information 1.

[0211] (2) When the address of computing task 1 is the unicast IP address of function instance 1, the access node determines to send uplink data packet 2' to the collaboration node according to the unicast IP address of function instance 1.

[0212] (3) When the address of computing task 1 is the access unicast IP address assigned by the coordination node, the access computing node determines to send an uplink data packet 2' to the coordination node according to the access unicast IP address assigned by the coordination node.

[0213] (4) When the address of computing task 1 is the anycast address (or virtual IP address) associated with computing task 1, the access computing node determines that the computing service associated with the computing task is computing service 1 through the anycast address (or virtual IP address), and then determines the collaborative node that provides computing resources for computing task 1 and the address of the collaborative node (e.g., the unicast IP address of the collaborative node). The access computing node sends an uplink data packet 2' to the collaborative node through the unicast IP address of the collaborative node. Optionally, the unicast IP address of the collaborative node corresponds to an outbound interface of the access computing node.

[0214] In some further implementations, the access computing node communicates with the collaboration node based on Internet Protocol version 6 (IPv6), or both the access computing node and the collaboration node support segment routing (SRv6) based on the IPv6 forwarding plane. The access computing node adds a segment routing header (SRH) list to the uplink data packet 1 to obtain an uplink data packet 2. The SRH list includes the IP address of the collaboration node and the final destination IP address (i.e., the address of computing task 1). For example, IP information 2 may include information in the SRH list.

[0215] S409b, the collaboration node sends the uplink data packet 3 to the function instance 1 according to the IP information 2.

[0216] Exemplarily, the collaborative node sends the uplink data packet 3 to the function instance 1 according to the IP information 2, including: the collaborative node sends the uplink data packet 3 to the function instance 1 according to the destination IP address included in the IP information 2. The data to be processed by the computing power service 1 carried by the uplink data packet 3 is consistent with the data to be processed by the computing power service 1 carried in the uplink data packet 2'. In some implementations, the uplink data packet 3 can be obtained by the collaborative node processing the uplink data packet 2', and the processing of the uplink data packet 2' can include: replacing or changing the IP address of the uplink data packet 2' to obtain the uplink data packet 3. In some other implementations, the uplink data packet 2' and the uplink data packet 3 are the same IP data packet. More specifically, it can be divided into the following three cases:

[0217] (1) When the destination IP address of the uplink data packet 2' is the unicast IP address of the collaboration node, the collaboration node determines that the computing service corresponding to the computing task 1 is computing service 1 through the unicast IP address, selects the function instance 1 corresponding to computing service 1 and obtains the communication address of function instance 1 (the communication address of function instance 1 can also be selected and obtained when the collaboration node allocates the unicast IP address of the collaboration node). The collaboration node and function instance 1 can communicate based on IP, and the communication address of function instance 1 is the unicast IP address of function instance 1 (such as the public IP address, private IP address or local area network IP address of function instance 1), or the collaboration node and function instance 1 can exchange data based on other transmission protocols such as RDMA protocol, and the communication address of function instance 1 is the unicast RDMA address of function instance 1. Optionally, the collaboration node replaces the destination IP address of the uplink data packet 2' (i.e., the unicast IP address of the collaboration node) with the communication address of function instance 1, that is, the destination IP address of the uplink data packet 3 is the communication address of function instance 1. Furthermore, the collaboration node sends the uplink data packet 3 to the communication address of the function instance 1 , so that the function instance 1 processes the data to be processed in the uplink data packet 3 .

[0218] (2) When the destination IP address of the uplink data packet 2' is the communication address of the function instance 1, the uplink data packet 3 can be regarded as consistent with the uplink data packet 2', and the collaborative node sends the uplink data packet 2' to the communication address of the function instance 1 so that the function instance 1 processes the data to be processed in the uplink data packet 2'.

[0219] (3) When the destination IP address of the uplink data packet 2' is the anycast address (or virtual IP address) of the computing service 1, the collaborative node determines that the computing service corresponding to the computing task 1 is the computing service 1 through the anycast address (virtual IP address), selects the function instance 1 corresponding to the computing service 1 and obtains the communication address of the function instance 1. Furthermore, the collaborative node sends the uplink data packet 3 to the communication address of the function instance 1, so that the function instance 1 processes the data to be processed in the uplink data packet 3 (at this time, the destination IP address of the uplink data packet 3 is the anycast address (or virtual IP address) of the computing service 1). Optionally, the collaborative node can also replace the destination IP address of the uplink data packet 2' (that is, the anycast address (or virtual IP address) of the computing service 1) with the communication address of the function instance 1, that is, the destination IP address of the uplink data packet 3 is the unicast IP address of the function instance 1.

[0220] In addition, the collaboration node can generate and save uplink and downlink routing information, where the uplink routing information is the routing information for the terminal device to transmit the data of computing task 1 to function instance 1, and the downlink routing information is the routing information for the function instance 1 to transmit data to the terminal device:

[0221] 1. Uplink routing information includes: the destination IP address is the address of computing task 1. For example:

[0222] "Src=UE IP, Dst=anycast#1, function instance 1", indicating that the next hop node is the communication address of function instance 1 (such as the unicast IP address of function instance 1); or

[0223] "Src = UE IP, Dst = unicast IP address #1 of function instance 1, function instance 1", indicating that the next hop node is the unicast IP address of function instance 1;

[0224] “Src=UE IP, Dst=virtual IP address #1, function instance 1” indicates that the next hop node is the communication address of function instance 1.

[0225] 2. Downlink routing information includes: the destination IP address is UE IP or temporary UE IP.

[0226] “Src=UE IP” (or it can be understood that the next hop node is the IP address of the access node, or the outbound interface corresponding to the unicast IP address of the access node and the cooperation node).

[0227] "Src=temporary UE IP" (or it can be understood that the next hop node is the IP address of the access node, or the outbound interface corresponding to the unicast IP address of the access node and the cooperation node).

[0228] It should be understood that the collaborative node can subsequently send the uplink data packet whose destination IP address is the address of computing task 1 to the communication address of function instance 1 according to the uplink routing information; and can send the downlink data packet whose destination IP is UE IP or temporary UE IP to the access computing node according to the downlink routing information.

[0229] In some implementations, the collaboration node can sense the aforementioned flip bit information, that is, if the IP layer information of the uplink data packet 2' includes a flip bit, then when the flip bit in each subsequent data packet received with the destination IP address of the computing task 1 is the same as the flip bit in the uplink data packet 2', the collaboration node will send it to the address of the function instance 1 for processing. When the flip bit changes, the collaboration node can reselect another function instance 2 and update the uplink routing rules. For example:

[0230] Routing rules before update:

[0231] When the IP information of the data packet is "Src = UE IP, Dst = access node unicast IP address #1, flip bit = 0", the data packet is sent to the communication address of function instance 1 (such as unicast IP address #1); or

[0232] When the IP information of the data packet is "Src=UE IP, Dst=anycast#1, flip bit=0", the data packet is sent to the communication address of function instance 1 (such as unicast IP address #1);

[0233] Updated routing rules:

[0234] When the IP information of the data packet is "Src = UE IP, Dst = access node unicast IP address #1, flip bit = 1", the data packet is sent to the communication address of function instance 2 (such as unicast IP address #2); or

[0235] When the IP information of the data packet is "Src=UE IP, Dst=anycast#1, flip bit=1", the data packet is sent to the communication address of function instance 2 (such as unicast IP address #2);

[0236] Correspondingly, function instance 1 stores the downlink routing information of each terminal device, for example, "Src = Temporary UE IP," and then function instance 1 sends the downlink data packet associated with the terminal device whose IP address is the temporary UE IP to the collaboration node. Furthermore, the downlink data packet is sent to the network port (or port or MAC address) corresponding to the unicast IP address of the collaboration node.

[0237] S409c, the coordinating node receives the downlink data packet 1' of the computing task 1.

[0238] Illustratively, the source IP address in the IP layer of the downlink data packet 1' may be the communication address of the function instance 1, the source port may be the port number of the function instance 1, the destination IP address may be the UE IP or temporary UE IP, and the destination port number may be the port number of the terminal device used to schedule the computing task 1. The downlink data packet 1' may be an IP data packet.

[0239] S409d, the collaboration node sends the downlink data packet 2 of the computing task 1 to the access common computing node.

[0240] In one implementation, the downlink data packet 2 is identical to the downlink data packet 1 ′, and the coordination node directly sends the downlink data packet 2 to the access computing node according to the downlink routing information.

[0241] In another implementation, the IP information of the downlink data packet 2 and the downlink data packet 1' is different. For example, the collaborative node communicates with the access computing node based on IPv6, or both the access computing node and the collaborative node support SRv6. The collaborative node adds the SRH list to the downlink data packet 1' to obtain the downlink data packet 2, and sends the downlink data packet 2 to the access computing node. The SRH list includes the IP address of the access computing node and the final destination IP address (i.e., UE IP).

[0242] S410, the access computing node sends the downlink data packet 3 of the computing task 1 to the terminal device.

[0243] Exemplarily, downlink data packet 3 may be an IP layer data packet, or may be a non-IP layer data packet. For example, downlink data packet 3 may be any one of an SDAP layer data packet, a PDCP layer data packet, and a MAC CE layer data packet. For the above-mentioned case 1, downlink data packet 3 is obtained based on downlink data packet 1; for the above-mentioned case 2, downlink data packet 3 is obtained based on downlink data packet 2. For example, downlink data packet 3 is obtained by adding an SDAP header, a PDCP header, or a MAC CE header to downlink data packet 1 or downlink data packet 2. For another example, if the service access computing node previously replaced the IP address of the terminal device in the uplink data packet (such as replacing the UE IP with a temporary UE IP), then the IP address of the terminal device in the downlink data packet 2 received by the access computing node is the temporary UE IP, and the access computing node replaces the destination IP address of the received downlink data packet 2 with the original IP address of the terminal device (i.e., the UE IP) to obtain downlink data packet 3. For another example, if the downlink data packet carries an SRH list, then the SRH list of downlink data packet 2 is removed to obtain downlink data packet 3.

[0244] Exemplarily, the access computing node determines computing task 1 based on the source IP address (i.e., the address of computing task 1) carried by downlink data packet 1 (or downlink data packet 2), and further determines the data bearer identifier associated with the terminal device and computing task 1 based on the destination IP (UE IP or temporary UE IP) of downlink data packet 1 or downlink data packet 2. Furthermore, the access computing node sends downlink data packet 3 to the terminal device via the air interface bearer indicated by the data bearer identifier associated with computing task 1.

[0245] It should also be noted that the above S406 and S407, or S406, S409a, and S409b, describe the transmission of an uplink data packet in a computing task scheduling. The data to be processed in a computing task scheduling can be carried by one or more uplink data packets. For each subsequent uplink data packet, the terminal device, access computing node, and collaborative node can use S406 and S407, or S406, S409a, and S409b, similar encapsulation and routing forwarding operations. Similarly, the above S408 and S410, or S409c, S409d, and S410, describe the transmission of a downlink data packet in a computing task scheduling. For each subsequent downlink data packet, the terminal device, access computing node, and collaborative node can use S408 and S410, or S409c, S409d, and S410, similar encapsulation and routing forwarding operations.

[0246] When the scheduling of computing task 1 ends, resources associated with computing task 1, such as communication resources (such as air interface bearers) and computing resources (such as function instances), can be released. The scheduling of computing task 1 can be ended in either of the following ways:

[0247] Method 1:

[0248] S411, the terminal device sends a scheduling stop request for computing task 1 to the access computing node.

[0249] Exemplarily, the scheduling stop request is used to indicate the completion / end / termination / stop / termination / suspension of the scheduling of computing task 1. The scheduling stop request may be AS signaling, an RRC layer message, or a MAC layer message. For example, the scheduling stop request may be an RRC release signaling, or a DRB release request.

[0250] S412: The access general computing node releases or controls the release of resources associated with computing task 1.

[0251] In one example, the access computing node provides computing resources for the operation of computing task 1, that is, the access computing node provides function instance 1 resources, then the access computing node releases function instance 1 resources and the air interface bearer used to transmit data associated with computing task 1.

[0252] In another example, the collaborative node provides computing resources for the operation of computing task 1, that is, the collaborative node provides function instance 1 resources, and the access computing node controls the release of resources associated with computing task 1. For example, the access computing node instructs the collaborative node to release function instance 1 resources, and the access computing node releases the air interface bearer used to transmit data associated with computing task 1. More specifically, when the collaborative node is a collaborative access computing node, the access computing node can send information instructing the collaborative node to release function instance 1 resources to the collaborative node through an interface with the collaborative access computing node (or a reference point, such as an Xn interface); when the collaborative node is a collaborative core computing node, the access computing node can send information instructing the collaborative node to release function instance 1 resources to the collaborative node through the core network (more specifically, the core network control plane function), or through control plane signaling between the collaborative core computing node (such as GPRS tunneling protocol-control (GTP-C) signaling).

[0253] In some implementations, upon receiving a request or message to release the resources of Function Instance 1, the access node or collaborative node may immediately release the resources of Function Instance 1. Alternatively, upon receiving a request or message to release the resources of Function Instance 1, Timer 1 may be started. After Timer 1 expires, if no data packet from the same computing service (i.e., the destination IP address is the address of Compute Task 1) is received, the resources of Function Instance 1 are released. If a data packet from the same computing service (perhaps the next Compute Task 2) is received before Timer 1 expires, Timer 1 is cleared, i.e., Timer 1 is not started.

[0254] Optionally, after executing S412, the method further includes: S413, the access node sends a scheduling stop response for computing task 1 to the terminal device. This allows the terminal device to re-execute S401 to S405 when scheduling the next computing task 2 for the same computing service. The scheduling stop response may indicate that resources associated with computing task 1 have been released.

[0255] Optionally, when the access common computing node or the collaborative node releases the function instance 1 resource based on timer 1, the terminal device may start timer 2 when sending a scheduling stop request for computing task 1, and the duration of timer 2 is less than or equal to the duration of timer 1. If the terminal device needs to schedule the next computing task 2 of the same computing power service after timer 2 expires, S401 to S405 need to be re-executed; if the terminal device needs to schedule the next computing task 2 of the same computing power service before timer 2 expires, data transmission of computing task 2 can also be performed based on S406 to S410.

[0256] Method 2:

[0257] S414, the terminal device sends an uplink data packet 4 of the computing task 2 of the same computing power service to the access computing node.

[0258] More specifically, the terminal device sends the uplink data packet 4 to the access computing node through the air interface bearer (such as air interface bearer 1) indicated by the data bearer identifier included in the air interface bearer configuration information in S405.

[0259] For example, uplink data packet 4 includes IP information 3, which includes a flip bit. If uplink data packet 4 corresponds to a different scheduling of the same computing power service, the terminal device sets the flip bit carried by uplink data packet 4 to be different from the flip bit carried by uplink data packet 1, and the destination IP address of the two is the same.

[0260] It should be noted that the data processed by the terminal device for different scheduling of the same computing power service may be different. For example, different scheduling of the computing power service can be used to process different frame images.

[0261] S416 , the access computing node updates the local context and routing information of the computing task data according to IP information 3 .

[0262] Exemplarily, the access computing node determines that the last scheduling (i.e., the scheduling of computing task 1 corresponding to uplink data packet 1) has ended based on the flip bit included in IP information 3, and can then update the local context and routing information of the computing task data. For example, the access computing node can trigger the current call for computing power service, i.e., reselection of the function instance that provides computing resources for computing task 2 and / or allocate a new air interface bearer (such as air interface bearer 2) to computing task 2; and / or repeat steps S406 to S410 to rebuild new routing information, etc.

[0263] It should be noted that if the access computing node allocates a new air interface bearer for computing task 2, the data associated with computing task 2 is subsequently transmitted between the terminal device and the access computing node via the new air interface bearer.

[0264] Optionally, before executing S416, the method further includes: S415, the access computing node releases the last scheduled context according to IP information 3. Exemplarily, the last scheduled context includes function instance 1 resources, routing information of last function-related data, and the like.

[0265] In the data transmission method provided in the embodiment of the present application, resources (such as air interface bearers) can be allocated to the terminal device according to the granularity of the computing task (i.e., the call or execution of a computing service). When the terminal device needs to transmit the data packet of the computing task with the access computing node, the access computing node can allocate air interface bearers (such as DRB resources) for the data transmission in the scheduling process of computing task 1 in response to the request of the terminal device. At the end of the scheduling of computing task 1, the corresponding air interface bearer can be released according to the request of the terminal device or according to the flip bit carried in the data packet, which helps to improve the utilization rate of air interface resources. In addition, before the access computing node sends the data packet of computing task 1 to function instance 1, the access computing node has determined the computing node that provides function instance 1 based on the communication resources used for computing task 1. When the access computing node receives a data packet of computing task 1 from a terminal device, the access computing node can determine the access computing node that provides function instance 1 based on the IP information in the data packet. For example, if the access computing node determines that function instance 1 is provided by itself based on the IP information in the data packet, the access computing node will directly send the data packet of computing task 1 to function instance 1; or if the access computing node determines that function instance 1 is provided by its own neighboring node (such as a collaborative node) based on the IP information in the data packet, the access computing node will send the data packet of computing task 1 to the collaborative node, so that the collaborative node will send the data packet of computing task 1 to function instance 1. In other words, the access computing node can directly send (or route) relevant data to function instance 1 determined based on the communication resources used for computing task 1. On the one hand, this can avoid the communication resources of the access computing node that provides function instance 1 from failing to meet the performance of computing task 1. On the other hand, it can ensure that the data packet of the computing task is quickly routed to the function instance that provides computing resources for the computing task, thereby helping to ensure the performance of the computing task.

[0266] FIG5 shows another schematic flow chart of a data transmission method provided in an embodiment of the present application. In this embodiment, each computing task scheduling is associated with a computing power QoS flow identifier (QFI). The QFIs corresponding to the scheduling of different computing tasks may be the same or different. Specifically, method 500 may include some or all of the following steps.

[0267] S501, the terminal device sends a scheduling request for computing task 1 to the core network.

[0268] The scheduling request carries the computing power service identifier of computing task 1. The scheduling request is used to request scheduling of computing task 1. The scheduling request is also used to request the core network to allocate or create a computing power QoS flow for computing task 1. For example, the specific form of the computing power service identifier can be referred to the description in the above embodiment and will not be repeated here.

[0269] Exemplarily, the scheduling request may be carried by a non-access stratum (NAS) message or other communication protocol message between the core network and the terminal device. More specifically, the scheduling request may be carried by a PDU session establishment message or a PDU session modification message, or may be an independent NAS message.

[0270] In some implementations, the terminal device may also send a scheduling request for computing task 1 to the access computing node to request scheduling of computing task 1. After receiving the scheduling request, the access computing node sends a request to allocate or establish a computing power QoS flow to the core network. Optionally, after receiving the scheduling request for computing task 1, the access computing node may verify the scheduling request for computing task 1. For details, please refer to the description in S402 and will not be repeated here.

[0271] S502: The core network allocates computing power QoS flow to computing task 1.

[0272] Exemplarily, the core network allocates computing power QoS flow to computing task 1 based on the computing power QoS information and the identifier of computing task 1.

[0273] S503: The core network sends instruction information to the access computing node.

[0274] Exemplarily, the indication information may only carry the computing power QCI allocated to computing task 1; or, the indication information may also carry the computing power service identifier and QFI of computing task 1.

[0275] In one implementation, if the connected general computing node or the collaborative node is a node that provides computing resources for the execution of computing task 1, S504 is executed:

[0276] S504: Access the general computing node and prepare function instance 1.

[0277] The specific implementation of the access general computing node preparation function instance 1 can refer to the description in S403 and will not be repeated here.

[0278] At this time, the instruction information is also used to request the access unicast IP address of computing task 1. The access computing node determines the access unicast IP address (allocates it by itself or obtains its access unicast IP address by selecting a function instance) and sends the access unicast IP address to the core network.

[0279] In another implementation, if the collaboration node is a node that provides computing resources for the execution of computing task 1, after executing S502, S503' and S504' may be executed:

[0280] S503': The core network sends instruction information to the coordination node.

[0281] Exemplarily, the indication information may carry the computing power QFI allocated to computing task 1 and the computing power service identifier of computing task 1.

[0282] S504 ′, the collaboration node prepares function instance 1 .

[0283] The collaboration node may prepare function instance 1 according to the computing power QFI so that the computing resources provided by function instance 1 meet the computing power QoS requirements and / or configuration of computing task 1 indicated by the computing power QFI. The specific implementation method of preparing function instance 1 can be referred to the description in S403 and will not be repeated here.

[0284] At this time, the instruction information is also used to request the access unicast IP address of computing task 1. The collaboration node determines the access unicast IP address (allocates it by itself or obtains its access unicast IP address by selecting a function instance) and sends the access unicast IP address to the core network.

[0285] S505: The access computing node determines the air interface bearer configuration information of computing task 1 according to the computing power service identifier and computing power QCI.

[0286] Exemplarily, the data bearer identifier allocated to computing task 1 is determined based on the computing power service identifier and the computing power QCI. It should be noted that the data bearer identifier can correspond to multiple computing power QoS flows (i.e., multiple computing power QFIs), that is, the data bearer identifier can correspond to one or more computing tasks of the same computing power service, or it can correspond to multiple computing tasks of multiple computing power services. In other words, the resources indicated by the data bearer identifier allocated to computing task 1 at this time can be used for data transmission of multiple computing tasks.

[0287] Exemplarily, at this time, the air interface bearer configuration information may include a data bearer identifier allocated to computing task 1 .

[0288] It should be noted that the Compute Power QFI can be equivalent to the Compute Power QCI, in which case the Compute Power QFI for each computing task may be different. Alternatively, the Compute Power QFI simply represents a globally unique identifier, and multiple Compute Power QFIs can correspond to the same Compute Power QCI. In other words, the Compute Power QFI assigned to multiple computing tasks may correspond to the same Compute Power QCI.

[0289] S506: The access computing node sends a scheduling response of computing task 1 to the terminal device.

[0290] The scheduling response includes the air interface bearer configuration information for computing task 1, more specifically, the data bearer identifier allocated for computing task 1 and the computing capacity QFI allocated for computing task 1 received from the core network. Optionally, the scheduling response also includes the access unicast IP address allocated for computing task 1. For more specific implementation methods for allocating the access unicast IP address for computing task 1, please refer to the description in S406 and will not be repeated here.

[0291] In some implementations, the scheduling response may include only the data bearer identifier allocated for computing task 1. After the access computing node allocates an access unicast IP address to computing task 1, it sends the access unicast IP address allocated to computing task 1 to the core network. The core network sends the access unicast IP address allocated to computing task 1 and the computing power QFI allocated to computing task 1 to the terminal device via a NAS message.

[0292] S507, the terminal device sends an uplink data packet A of computing task 1 to the access computing node.

[0293] The terminal device sends an uplink data packet A on the resource indicated by the data bearer identifier allocated for computing task 1. The uplink data packet may include data to be processed by computing task 1.

[0294] Specifically, the uplink data packet A carries IP information 1 associated with computing task 1. The type and content of IP information 1, and the specific implementation of the terminal device encapsulating IP layer data, can be found in the description of S406 and will not be repeated here.

[0295] Furthermore, after encapsulating the IP layer data, the terminal device adds computing power QFI to the air interface protocol layer to obtain an uplink data packet A. The air interface protocol layer includes but is not limited to the SDAP layer, the PDCP layer, and the MAC CE.

[0296] For the specific implementation of sending uplink data packets and receiving downlink data packets by the access computing node in S508 to S510d, reference may be made to the description in S407 to S409d, which will not be repeated here.

[0297] S511, the access computing node sends a downlink data packet C of computing task 1 to the terminal device.

[0298] Exemplarily, the access computing node adds the computing power QFI allocated to the computing task 1 at the air interface protocol layer on the basis of the downlink data packet 3 described in S410 to obtain the downlink data packet to be finally sent.

[0299] For more detailed information, please refer to the description of method 400, which will not be repeated here.

[0300] When the scheduling of computing task 1 ends, resources associated with computing task 1, such as communication resources (such as air interface bearers) and computing resources (such as function instances), can be released. The scheduling of computing task 1 can be ended in either of the following ways:

[0301] Method A:

[0302] S512, the terminal device sends a scheduling stop request for computing task 1 to the core network.

[0303] Exemplarily, the scheduling stop request is used to indicate that the scheduling of computing task 1 is completed / ended / terminated / stopped / terminated / suspended, and the scheduling stop request is also used to indicate the release of the computing power QoS flow allocated for the scheduling of the current computing task 1. The scheduling stop request may be NAS signaling, such as a protocol data unit (PDU) session modification message.

[0304] S513: The core network controls the release of resources associated with computing task 1.

[0305] In one example, the access computing node provides computing resources for the operation of computing task 1, that is, the access computing node provides function instance 1 resources, then the core network sends an indication message to the access computing node to instruct the access computing node to release function instance 1 resources and the computing power QoS flow resources allocated to computing task 1.

[0306] In another example, the collaborative node provides computing resources for the operation of computing task 1, that is, the collaborative node provides function instance 1 resources, then the core network sends an indication message to the collaborative node to instruct the collaborative node to release function instance 1 resources and the computing power QoS flow resources allocated to computing task 1.

[0307] In some implementations, upon receiving a request or message to release the resources of function instance 1, the access node or collaboration node may immediately release the resources of function instance 1. Alternatively, upon receiving a request or message to release the resources of function instance 1, the access node or collaboration node may start timer 1. After timer 1 expires, if no data packet from computing task 1 (i.e., the destination IP address is the address of computing task 1) is received, the resources of function instance 1 are released. If a data packet from computing task 1 is received before timer 1 expires, timer 1 is cleared, i.e., timer 1 is not started.

[0308] Optionally, after executing S513, the method further includes: S514, the core network sending a scheduling stop response for computing task 1 to the terminal device. This causes the terminal device to re-execute S501 to S506 the next time it needs to schedule computing task 1. The scheduling stop response may indicate that resources associated with computing task 1 have been released. The scheduling stop response may be a PDU session modification notification.

[0309] Optionally, when the access common computing node or the collaborative node releases the resources of function instance 1 based on timer 1, the terminal device may start timer 2 when sending a scheduling stop request for computing task 1, and the duration of timer 2 is less than or equal to the duration of timer 1. If the terminal device needs to schedule computing task 1 after timer 2 expires, steps S501 to S506 need to be re-executed; if the terminal device needs to schedule computing task 1 before timer 2 expires, data transmission for computing task 1 may be performed based on steps S507 to S511.

[0310] Method B:

[0311] S515, the terminal device sends an uplink data packet D of computing task 1 to the access computing node.

[0312] Exemplarily, uplink data packet D includes the computing power QFI obtained in S506 and IP information 3, where the IP information 3 includes a flip bit. If the scheduling of computing task 1 corresponding to uplink data packet D is different from the scheduling of computing task 1 corresponding to uplink data packet A, the terminal device sets the flip bit carried by uplink data packet D to be different from the flip bit carried by uplink data packet A, and the destination IP addresses of the two are the same.

[0313] S517 , the access computing node updates the local context and routing information of the computing task data according to IP information 3 .

[0314] For example, the access computing node determines that the last scheduling (i.e., the scheduling of computing task 1 corresponding to uplink data packet A) has ended based on the flip bit included in IP information 3, and can then update the local context and routing information of the computing task data. For example, the access computing node can trigger the reselection of the node that provides computing resources for the current call of the computing power service (such as computing task 2), repeat steps S507 to S511, and rebuild new routing information.

[0315] Optionally, before executing S517, the method further includes: S516, the access computing node releases the last scheduled context according to IP information 3. Exemplarily, the last scheduled context includes function instance 1 resources, routing information of last function-related data, and the like.

[0316] In some implementations, the access computing node determines, based on the flip bit included in IP information 3, that the previous scheduling (i.e., the scheduling of computing task 1 corresponding to uplink data packet A) has ended. The access computing node then sends a scheduling stop request to the core network. Furthermore, the core network controls the release of resources associated with computing task 1 and / or reestablishes new routing information. The specific implementation of the core network controlling the release of resources associated with computing task 1 can be found in S513; the specific implementation of the core network reestablishing new routing information can be found in S507 to S511, and will not be repeated here.

[0317] In the data transmission method provided in the embodiment of the present application, the core network can allocate corresponding computing power QoS for data transmission during the scheduling process of computing task 1 in response to the request of the terminal device, and notify the access computing node thereof. Furthermore, the access computing node allocates air interface bearer for the computing task based on the computing power QoS. In the embodiment of the present application, the access computing node does not need to store computing power QoS information, nor does it need to allocate corresponding computing power QoS flows for computing tasks, which helps to reduce the processing complexity of the access computing node and save computing overhead.

[0318] FIG6 shows another schematic flow chart of a data transmission method provided in an embodiment of the present application. In some implementations, method 600 may be performed after S410 or S511. Method 600 may include some or all of the following steps.

[0319] S601: The terminal device sends an uplink data packet a of computing task 1 to the access computing node.

[0320] More specifically, the uplink data packet a carries information of computing task 1 and / or computing power QFI-1.

[0321] Exemplarily, the terminal device encapsulates an uplink data packet a, wherein in the IP layer of the uplink data packet a, the source IP address is the IP address of the terminal device (such as UE IP), and the destination IP address is the address of computing task 1. The air interface protocol layer of the uplink data packet can carry computing power QFI-1. If the terminal device has not previously obtained the pre-authorized computing power QFI of computing task 1, the computing power QFI-1 can be the computing power QFI calculated by the terminal device itself. Alternatively, if the terminal device has previously obtained one or more computing power QFIs corresponding to computing task 1, the terminal device can select one from them as QFI-1. Among them, the address of computing task 1 can be regarded as an example of information of computing task 1.

[0322] In some implementations, the computing power QFI-1 in S601 can also be mapped to a computing power scheduling identifier of a lower layer (e.g., a physical layer). Before executing S601, the method further includes: the terminal device sends a physical layer scheduling request to the access computing node, requesting the access computing node to allocate an air interface bearer for the transmission of the data packet of the computing task 1, and the scheduling request carries the computing power scheduling identifier (or computing power index); the access computing node authorizes the air interface bearer corresponding to the computing power scheduling identifier according to the scheduling request, and sends the information of the authorized air interface bearer to the terminal device, so that the terminal device sends the uplink data of the computing task 1 (e.g., uplink data packet a) in the authorized air interface bearer. The information of the authorized air interface bearer may include: resource indication of the physical uplink shared channel (PUSCH), coding and modulation mode, and other information.

[0323] In an exemplary embodiment, the terminal device may obtain the computing power QFI from the core network and / or obtain the computing power scheduling identifier from the access node during the computing power session establishment phase. The computing power scheduling identifier may correspond to one or more data bearer identifiers.

[0324] Optionally, when the access computing node receives uplink data packet a, it may also send the IP layer data packet included in uplink data packet a to function instance 1 associated with computing task 1. For example, if uplink data packet a is any one of an SDAP layer data packet, a PDCP layer data packet, or a MAC CE layer data packet, the access computing node parses uplink data packet a to obtain the IP layer data packet, and function instance 1 sends the IP layer data packet. The specific sending method can be found in the description of S407 and is not repeated here.

[0325] In some implementations, after receiving the information about the authorized air interface bearer, the terminal device may execute S604 , ie, send the uplink data packet b through the authorized air interface bearer.

[0326] In some further implementations, the terminal device sends an uplink data packet a through a default air interface bearer. After receiving the uplink data packet a, the access computing node further executes S602 and S603:

[0327] S602: The access computing node determines the air interface bearer configuration information of computing task 1 according to the computing power QFI-1 and / or the information of computing task 1.

[0328] In one example, the access computing node allocates a new data bearer identifier and its corresponding configuration information to computing task 1 based on the information of computing task 1 (such as the address of computing task 1) and computing power QoS information.

[0329] In another example, the access computing node determines whether the computing power QFI-1 meets the requirements of computing task 1 based on the computing power QFI-1 and the computing power QoS information. When the computing power QFI-1 meets the requirements of computing task 1, the data bearer identifier corresponding to the computing power QFI-1 is allocated to computing task 1; otherwise, a new data bearer identifier is allocated to computing task 1 based on the computing power QoS information.

[0330] S603: The access computing node sends the air interface bearer configuration information of computing task 1 to the terminal device.

[0331] Exemplarily, the air interface bearer configuration information may include a data bearer identifier allocated to the computing task 1; or the air interface bearer configuration information may further include logical channel configuration information corresponding to the data bearer identifier.

[0332] Exemplarily, the air interface bearer configuration information may be carried by air interface control signaling (eg, AS signaling). More specifically, the air interface bearer configuration information may be carried by RRC layer signaling, or MAC layer signaling.

[0333] S604: The terminal device sends an uplink data packet b to the access computing node.

[0334] Exemplarily, the terminal device may send the uplink data packet a on the air interface bearer indicated by the data bearer identifier included in the air interface bearer configuration information.

[0335] In some implementations, the air interface protocol layer of the uplink data packet b may carry computing power QFI-1.

[0336] For the specific implementation of sending uplink data packets and receiving downlink data packets by the access computing node in S605 to S607d, reference may be made to the description in S407 to S409d, which will not be repeated here.

[0337] S608: The access computing node sends a downlink data packet c of computing task 1 to the terminal device.

[0338] In some implementations, when the computing power QFI-1 is carried in the uplink data packet b, the downlink data packet c of the computing task 1 sent by the access node to the terminal device also carries the computing power QFI-1.

[0339] When the scheduling of computing task 1 ends, the resources associated with computing task 1, such as communication resources (such as computing power QoS flow resources and DRB resources) and computing resources (such as function instances), can be released. The scheduling of computing task 1 can be ended in either of the following ways:

[0340] Method a:

[0341] S609: The access general computing node releases or controls the release of resources associated with computing task 1.

[0342] For example, the specific implementation method of the access general computing node releasing or controlling the release of resources associated with computing task 1 can be referred to the description in S412 and will not be repeated here.

[0343] Method b:

[0344] S610, the terminal device sends an uplink data packet e of computing task 1 to the access computing node.

[0345] For example, uplink data packet e includes IP information d, which includes a flip bit. If the scheduling of computing task 1 corresponding to uplink data packet e and the scheduling of computing task 1 corresponding to uplink data packet b are different schedulings for computing service 1, then the terminal device sets the flip bit carried by uplink data packet e to be different from the flip bit carried by uplink data packet b, and the destination IP addresses of the two are the same.

[0346] S612: The access computing node updates the local context and routing information of the computing task data according to the IP information d.

[0347] For example, the access node determines that the last computing service scheduling (i.e., the scheduling of computing task 1 corresponding to uplink data packet b) has ended based on the flip bit included in IP information d, and can then update the local context and routing information of the computing task data. For example, the access node can trigger the reselection of the node used to provide computing resources for the current call of computing service 1 (such as computing task 2), repeat steps S604 to S508, and rebuild new routing information.

[0348] Optionally, before executing S612, the method further includes: S611: the access computing node releases the context of the last computing service scheduling according to the IP information d. Exemplarily, the context of the last function scheduling includes the resources of function instance 1, routing information of the last function-related data, etc.

[0349] The data transmission method provided in the embodiment of the present application can allocate air interface bearer to computing task 1 through the computing task identifier carried by the data packet (such as the address or computing power QFI of computing task 1), which helps to save the communication overhead required in the air interface bearer allocation process for computing task scheduling.

[0350] Figure 7 shows another exemplary flow chart of the data transmission method provided in an embodiment of the present application, in which method 700 is performed by a terminal device and a second node. The terminal device may include a terminal device or a component (such as a chip or module) in a terminal device in any of methods 400 to 600, and the second node may include an access computing node or a component (such as a chip or module) in an access computing node in any of methods 400 to 600. In some scenarios, method 700 also requires the participation of a collaborative node (such as a first node), and the collaborative node may include a collaborative node or a component (such as a chip or module) in a collaborative node in any of methods 400 to 600. The method may include S710 to S740, specifically:

[0351] S710: The second node obtains a first computing task identifier, where the first computing task identifier is used to identify the first computing task.

[0352] Taking the first computing task as the above-mentioned computing task 1 as an example, the first computing task identifier may include the computing power service identifier in the aforementioned embodiment (such as the anycast address, unicast address, globally unique identifier, URL identifier, FQDN, etc. of computing task 1), or may also include the computing power QFI in the aforementioned embodiment (such as computing power QFI-1).

[0353] Optionally, a specific implementation of the second node obtaining the first computing task identifier may include the following examples:

[0354] Example 1: As shown in S710', the second node receives a first request message from a terminal device, the first request message being used to request scheduling of a first computing task, the first request message carrying a first computing task identifier. For example, the first request message may include the scheduling request in S401, and the first computing task identifier may include a computing power service identifier.

[0355] Example 2: As shown in S710", the second node receives a second data packet or a third data packet from the terminal device. The second data packet includes information carrying the second data and the first computing task (such as a computing power service identifier); the third data packet carries the third data and a computing power QoS flow identifier (such as computing power QFI-1 in S601); the second data and the third data may be data to be processed by the first computing task. Exemplarily, the second node may receive the second data packet or the third data packet through a DRB or an SRB. The second data packet or the third data packet may be the uplink data packet a in method 600. For a more specific implementation method of receiving the uplink data packet a, reference may be made to the description in S601 and will not be repeated here.

[0356] Example 3: The second node receives the first computing task identifier (such as computing power QCI / QFI and computing power service identifier) ​​from the core network. For a more detailed description, please refer to the description in S503, which will not be repeated here.

[0357] S720: The second node determines a first data bearer identifier according to the first computing task identifier.

[0358] In some implementations, the second node obtains computing power QoS information, where the computing power QoS information indicates at least one of the following information associated with the first computing task: a computing power QoS configuration, a computing power QoS requirement, or a set of computing power QoS parameters. Furthermore, S720 may be further refined to: assigning, based on the computing power QoS information and the first computing task identifier, a first data bearer identifier associated with the computing power QoS information to the first computing task.

[0359] Illustratively, the first data bearer identifier may be the data bearer identifier in methods 400 to 600. For a more specific implementation of determining the first data bearer identifier, reference may be made to the description in S404, which will not be repeated here.

[0360] S730: The second node receives a first data packet from the terminal device through the first air interface bearer indicated by the first data bearer identifier.

[0361] More specifically, the first data packet includes first data and information about the first computing task. The first data may be data to be processed by the first computing task. For example, if the first computing task is to render an image, the first data may be data of the image to be rendered. The information about the first computing task may include a computing service identifier, such as an anycast address associated with the first computing task, or a unicast address assigned to the first computing task by the first node or the second node.

[0362] When the information of the first computing task is the address of the first computing task (such as the address of computing task 1 mentioned above), the information of the first computing task can be included in the IP layer of the first data packet. In the embodiment of the present application, the first data packet can be an IP layer data packet. For example, when the first data packet is the IP layer data packet in the uplink data packet 1 in S406, the information of the first computing task can be included in IP information 1; or when the first data packet is the IP layer data packet of the uplink data packet A in S507, the information of the first computing task can be included in IP information 1; or when the first data packet is the IP layer data packet of the uplink data packet b in S604, the information of the first computing task can be included in IP information b.

[0363] If in S710, the second node obtains the first computing task identifier from the second data packet or the third data packet received through the air interface bearer, the air interface bearer for receiving the second data packet or the third data packet and the first air interface bearer may be the same bearer, or may be different bearers.

[0364] Optionally, before executing S730, the method further includes: the second node sending a first data bearer identifier to the terminal device.

[0365] S740: The second node sends the first data packet to the first instance.

[0366] Illustratively, the first instance may include function instance 1 in the aforementioned embodiment.

[0367] In some implementations, the second node provides the first instance (such as Case 1 in the aforementioned embodiment), and the second node sends the first data packet to the first instance. For specific implementation, please refer to the description in S407 and will not be repeated here.

[0368] In the above implementation, the second node also receives a third downlink data packet from the first instance. The third downlink data packet includes the sixth data and third address information. The third address information indicates that the destination address of the third downlink data packet is the address of the terminal device. The second node sends the third downlink data packet to the terminal device via the first air interface bearer based on the third address information. The specific implementation of the second node sending the third downlink data packet can be referred to the description in S410 and is not repeated here.

[0369] In some other implementations, a neighboring node of the second node, such as the first node, provides a first instance, and the second node sends the first data packet to the first node. Specifically, the first data packet also includes first address information, and the first address information indicates that the source address of the first data packet is the address of the terminal device. S740 can be refined as follows: determine the first node according to the information of the first computing task; replace the source address of the first data packet with a temporary address to obtain a fifth data packet, and send the fifth data packet to the first node. The temporary address (such as a temporary UE IP) is associated with the current node and the terminal device. The fifth data packet can be the uplink data packet 2 in S409a, or the fifth data packet can also be the uplink data packet B in S510a, or the fifth data packet can also be the uplink data packet c in S607. A more specific method for the second node to send the first data packet to the first node can be described in S409a and S409b.

[0370] In the above implementation, the second node receives a first downlink data packet from the first node, the first downlink data packet including the fifth data and second address information, the second address information indicating that the destination address of the first downlink data packet is a temporary address; the second node replaces the destination address of the first downlink data packet with the address of the terminal device based on the temporary address, thereby obtaining a second downlink data packet; and the second node sends the second downlink data packet to the terminal device via the first air interface bearer. The specific implementation of the second node receiving the first downlink data packet and sending the second downlink data packet can be referenced to the description in S409d and S410 and is not further described here.

[0371] Optionally, if in S710, the second node obtains the first computing task identifier through the second data packet or the third data packet, the second node may also send the second data or the third data to the first instance.

[0372] When the scheduling of the first computing task ends, the resources associated with the first computing task may be released. The scheduling of the first computing task may be ended in either of the following two ways:

[0373] Method 1 includes:

[0374] S760: The second node receives second request information from the terminal device, where the second request information is used to request termination of scheduling of the first computing task.

[0375] Exemplarily, the second request information may include the scheduling stop request in S411.

[0376] S770: The second node controls the release of resources associated with the first computing task according to the second request information.

[0377] For the specific implementation of the second node controlling the release of resources associated with the first computing task, reference may be made to the descriptions in S411 and S412 of method 400 .

[0378] Method 2 includes:

[0379] S760', the second node receives a fourth data packet from the terminal device, where the fourth data packet carries fourth data of the second computing task and the first indication information.

[0380] The first data packet also carries the first indication information. If the first indication information carried by the fourth data packet is different from the first indication information carried by the first data packet, S770' is executed. The first indication information is used to distinguish different scheduling times of the computing service associated with the first computing task. The first computing task and the second computing task are associated with the same computing service. If the first computing task is the aforementioned computing task 1, then the computing service corresponding to the first computing task is the aforementioned computing service 1, and the second computing task can be the aforementioned computing task 2.

[0381] Exemplarily, the first indication information includes a first value or a second value, and the first value and the second value are used to distinguish different scheduling times of the computing power service corresponding to the first computing task. Exemplarily, the first indication information may include the flip bit in the aforementioned embodiment, where the first value may be 0 for the flip bit, and the second value may be 1 for the flip bit.

[0382] S770', update the resources required for scheduling computing power services.

[0383] Exemplarily, S770' specifically includes at least one of the following: sending a fourth data packet to a second instance, the second instance providing computing resources for the execution of a second computing task; allocating a second data bearer identifier to the second computing task, the second data bearer identifier and the first data bearer identifier corresponding to the same computing power QoS information as the first computing task; releasing the first air interface bearer; or releasing the first instance.

[0384] The second instance and the first instance may be the same instance or different instances. Furthermore, the node providing the second instance and the first instance may be the same node or different nodes. The air interface bearer indicated by the second data bearer identifier and the air interface bearer indicated by the first data bearer identifier may be the same bearer or different bearers.

[0385] In some implementations, before executing S730, the method further includes: the terminal device sending a network access request to the second node, the network access request being used to request access to the second node. After the terminal device accesses the second node, the terminal device may send a first data packet to the second node. Exemplarily, the network access request may be a random access request, or may be other request information for accessing a network device.

[0386] The data transmission method provided in the embodiment of the present application can allocate air interface bearers according to the granularity of the computing task (i.e., the call or execution of a computing service). More specifically, a data bearer identifier can be allocated for a specific computing task, thereby allocating the air interface bearer required for data transmission for the current scheduling of the computing task. When the computing task ends, the corresponding air interface bearer can be released, which helps to improve resource utilization. In addition, the access computing node can directly send (or route) relevant data to the first instance determined according to the communication resources used for the first computing task, so as to avoid the communication resources of the node providing the first instance being unable to meet the performance of the first computing task, thereby helping to ensure the performance of the first computing resource. When the first node provides computing resources for the first computing task, the terminal device can route the first data packet to the first node via the access computing node. In addition, the access computing node replaces the source address of the data packet received from the terminal device, so that when the first node sends the downlink data packet associated with the first computing task, it can route the downlink data packet to the terminal device via the access computing node, that is, the routing path of the data packet between the terminal device and the first node is fixed, which helps to reduce the computational complexity required to determine the routing path during data packet routing.

[0387] The above, in combination with Figures 1 to 7, illustrates the communication method provided in the embodiments of the present application. In the various embodiments of the present application, unless otherwise specified or there is a logical conflict, the terms and / or descriptions between the various embodiments are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments according to their internal logical relationships.

[0388] The communication device provided in the embodiment of the present application is described in detail below with reference to Figures 8 to 11. It should be understood that the description of the device embodiment corresponds to the description of the method embodiment. Therefore, for matters not described in detail, reference can be made to the method embodiment above. For the sake of brevity, they will not be repeated here.

[0389] Figure 8 is a schematic block diagram of a communication device 2000 provided in an embodiment of the present application. Communication device 2000 may be an access computing node, or a chip or module within an access computing node, configured to implement the actions performed by the access computing node in the embodiments shown in Figures 4 to 7 . For details, please refer to the relevant descriptions in the above method embodiments.

[0390] Communication device 2000 includes an acquisition unit 2010 (or acquisition module) and a processing unit 2020 (or processing module). The following provides an exemplary description of transceiver unit 2010'. Acquisition unit 2010 can be used to implement corresponding information reception or acquisition functions, such as acquiring computing task information. Processing unit 2020 can be used to implement corresponding processing functions, such as determining a target node based on a first computing resource required for a first computing task.

[0391] In some implementations, the communication device 2000 may further include a transceiver unit (or transceiver module), and the transceiver unit may include a sending unit and a receiving unit. The sending unit is used to perform the sending action of the communication device, and the receiving unit is used to perform the receiving action of the communication device. For ease of description, the embodiment of the present application combines the sending unit and the receiving unit into one transceiver unit. A unified explanation is given here and will not be repeated later. The transceiver unit can implement corresponding communication functions, such as executing the information receiving and / or information sending actions performed by the access computing node in the above-mentioned embodiment. Exemplarily, the transceiver unit can be used to: send a first request information to the core network or the second node, etc. In some implementations, the transceiver unit includes the above-mentioned acquisition unit.

[0392] Optionally, the communication device 2000 also includes a storage unit, which can be used to store instructions and / or data, and the processing unit 2020 can read the instructions and / or data in the storage unit so that the device implements the relevant actions performed by the access computing node in the aforementioned various method embodiments.

[0393] The specific implementation method can refer to the detailed description of the embodiments shown in Figures 4 to 7 above, which will not be repeated here. It should be understood that the specific process of each component performing the above corresponding process has been described in detail in the above method embodiment, and for the sake of brevity, it will not be repeated here.

[0394] Figure 9 is a schematic block diagram of a communication device 2000' provided in an embodiment of the present application. Communication device 2000' may be a collaborative node or terminal device, or a component (e.g., a chip or module) within a collaborative node or terminal device, configured to implement the methods described in the embodiments of Figures 4 to 7. For details, please refer to the relevant descriptions of the aforementioned method embodiments. The chip may be, for example, a system on chip (SoC).

[0395] The communication device 2000' includes a transceiver unit 2010'. The transceiver unit 2010' is described below by way of example.

[0396] The transceiver unit 2010' may include a transmitting unit and a receiving unit. The transmitting unit is used to perform the transmitting operation of the communication device, and the receiving unit is used to perform the receiving operation of the communication device. For ease of description, the embodiment of the present application combines the transmitting unit and the receiving unit into a single transceiver unit. This is described here as a unified description and will not be repeated later. The transceiver unit 2010' can implement corresponding communication functions. The transceiver unit 2010' may also be referred to as a communication interface or communication module.

[0397] It should be noted that the communication device 2000' may include a sending unit but not a receiving unit. Alternatively, the communication device 2000' may include a receiving unit but not a sending unit. The specific method may depend on whether the above solution executed by the communication device 2000' includes a sending action and a receiving action.

[0398] Optionally, the communication device 2000' further includes a storage unit configured to store a program or code for executing the aforementioned method. Alternatively, the storage unit may be configured to store instructions and / or data, and the processing unit 2020' may read the instructions and / or data from the storage unit to enable the communication device 2000' to implement the aforementioned method embodiment. For example, the communication device 2000' may be configured to execute the solution illustrated in FIG. 7 .

[0399] It should be understood that the specific process of each unit executing the above corresponding steps has been described in detail in the above method embodiment, and for the sake of brevity, it will not be repeated here.

[0400] It should also be understood that the above-mentioned device 2000 and device 2000' are embodied in the form of functional units. The term "unit" here may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a dedicated processor or a group processor, etc.) and a memory for executing one or more software or firmware programs, a combined logic circuit and / or other suitable components that support the described functions. In an optional example, those skilled in the art will understand that the device 2000 or the device 2000' can be specifically the communication device in the above-mentioned embodiment, and can be used to execute the various processes and / or steps corresponding to the communication device in the above-mentioned method embodiments. In order to avoid repetition, they will not be described here.

[0401] The device 2000 or device 2000' of the above-mentioned solution has the function of implementing the corresponding steps performed by the communication device (such as terminal equipment, access communication node, and cooperation node) in the above-mentioned method. The functions can be implemented by hardware, or the corresponding software can be implemented by hardware. The hardware or software includes one or more modules corresponding to the above-mentioned functions; for example, the transceiver unit can be replaced by a transceiver (for example, the sending unit in the transceiver unit can be replaced by a transmitter, and the receiving unit in the transceiver unit can be replaced by a receiver), and other units, such as the processing unit, can be replaced by a processor to respectively perform the sending and receiving operations and related processing operations in each method embodiment.

[0402] In addition, the above-mentioned transceiver unit may also be a transceiver circuit (for example, may include a transmitting circuit, or may also include a receiving circuit), and the processing unit may be a processing circuit.

[0403] FIG10 is a schematic diagram of another communication device 2100 provided in an embodiment of the present application. The device 2100 includes a processor 2110, which is coupled to a memory 2120. The memory 2120 is configured to store computer programs or instructions and / or data. The processor 2110 is configured to execute the computer programs or instructions stored in the memory 2120, or read data stored in the memory 2120, to perform the methods described in the above method embodiments.

[0404] Optionally, there are one or more processors 2110 .

[0405] Optionally, the memory 2120 is one or more.

[0406] Optionally, the memory 2120 may also be referred to as a storage medium or a storage device. The memory 2120 may be integrated with the processor 2110 or may be separately provided.

[0407] Optionally, as shown in Figure 11, the apparatus 2100 further includes a transceiver 2130, which is configured to receive and / or transmit signals. For example, the processor 2110 is configured to control the transceiver 2130 to receive and / or transmit signals.

[0408] As an example, the processor 2110 may have the function of the processing unit 2020 shown in Figure 8, or the processing unit 2020' shown in Figure 9, the memory 2120 may have the function of a storage unit, and the transceiver 2130 may have the function of the transceiver unit (or acquisition unit 2010) shown in Figure 8, or the transceiver unit 2010' shown in Figure 9.

[0409] As a solution, the device 2100 is used to implement the operations performed by the communication device (such as terminal equipment, access node, and collaboration node) in the above method embodiments.

[0410] For example, the processor 2110 is configured to execute computer programs or instructions stored in the memory 2120 to implement relevant operations of the communication device in the above various method embodiments.

[0411] In some implementations, when the apparatus 2100 is a terminal device, the transceiver 2130 may include a transmitter, a receiver, a radio frequency circuit, an antenna, and input / output devices. The processor 2110 is primarily used to process communication protocols and communication data, control the terminal device, execute software programs, and process data in software programs. The memory 2120 is primarily used to store software programs and data. Specifically:

[0412] Radio frequency circuits are mainly used for conversion between baseband signals and radio frequency signals and for processing radio frequency signals.

[0413] Antennas are mainly used to send and receive radio frequency signals in the form of electromagnetic waves.

[0414] Input and output devices (eg, touch screen, display screen, keyboard, etc.) are mainly used to receive data input by the user and output data to the user.

[0415] It should be noted that some types of terminal devices may not have input and output devices.

[0416] When data needs to be sent, the processor performs baseband processing on the data to be transmitted and outputs the baseband signal to the RF circuit. The RF circuit then performs RF processing on the baseband signal and transmits it via the antenna in the form of electromagnetic waves. When data is sent to a terminal device, the RF circuit receives the RF signal via the antenna, converts it into a baseband signal, and outputs the baseband signal to the processor, which converts the baseband signal into data and processes it.

[0417] In other implementations, when the apparatus 2100 is a network device (such as an access node or a collaborative node), the processor 2110 is mainly used for baseband processing, controlling the network device, etc.; the processor 2110 is usually the control center of the network device, used to control the network device to perform the processing operations on the network device side in the above method embodiment, such as determining the computing resources required for the computing task, determining the node that provides computing resources for the computing task, etc. The memory 2120 is mainly used to store computer program code and data. The transceiver 2130 is mainly used for transmitting and receiving radio frequency signals and converting radio frequency signals into baseband signals; the transceiver 2130 may include an antenna and a radio frequency circuit (not shown in the figure), wherein the radio frequency circuit is mainly used for radio frequency processing.

[0418] The processor 2110 and the memory 2120 may include one or more boards, each of which may include one or more processors and one or more memories. The processor is used to read and execute programs in the memory to implement baseband processing functions and control the device 2100. If multiple boards are present, the boards may be interconnected to enhance processing capabilities. As an optional embodiment, multiple boards may share one or more processors, multiple boards may share one or more memories, or multiple boards may simultaneously share one or more processors.

[0419] In the embodiment of the present application, the antenna and radio frequency circuit with transceiver functions can be regarded as the transceiver module of the terminal device or network device, and the processor with processing function can be regarded as the processing module of the terminal device or network device.

[0420] In some implementations, the processor 2110 may also be referred to as a processing unit, a processing board, a processing module, a processing device, etc. The transceiver 2130 may also be referred to as a transceiver unit, a transceiver, a transceiver device, etc.

[0421] When the device 2100 is a chip, the chip includes a processor, memory, and a transceiver. The transceiver can be an input / output circuit or a communication interface; the processor can be a processing module, microprocessor, or integrated circuit integrated on the chip. The sending operation of the terminal device in the above method embodiment can be understood as the chip's output, and the receiving operation of the terminal device in the above method embodiment can be understood as the chip's input.

[0422] It should be understood that the processor mentioned in the embodiments of the present application may be a central processing unit (CPU), or may be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc.

[0423] It should also be understood that the memory mentioned in the embodiments of the present application may be a volatile memory and / or a non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory may be a random access memory (RAM). For example, RAM can be used as an external cache. By way of example and not limitation, RAM includes the following forms: static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM).

[0424] It should be noted that when the processor is a general-purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, the memory (storage module) can be integrated into the processor.

[0425] It should also be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0426] 11 is a schematic diagram of a chip system 2200 provided in an embodiment of the present application. The chip system 2200 (or also referred to as a processing system) includes a logic circuit 2210 and an input / output interface 2220 .

[0427] Logic circuit 2210 may be a processing circuit within chip system 2200. Logic circuit 2210 may be coupled to a storage unit and invoke instructions within the storage unit, enabling chip system 2200 to implement the methods and functions of various embodiments of the present application. Input / output interface 2220 may be an input / output circuit within chip system 2200, outputting information processed by chip system 2200 or inputting data or signaling information to be processed into chip system 2200 for processing.

[0428] As a solution, the chip system 2200 is used to implement the operations performed by the communication device (such as terminal equipment, access computing node, and collaboration node) in the above various method embodiments.

[0429] For example, the logic circuit 2210 is used to implement the processing-related operations performed by the communication device (such as terminal equipment, access communication node, collaborative node) in the above method embodiments; the input / output interface 2220 is used to implement the sending and / or receiving-related operations performed by the communication device (such as terminal equipment, access communication node, collaborative node or core network) in the above method embodiments.

[0430] The present application also provides a processor for coupling with a memory, and for executing the methods and functions involving a terminal device, an access node, a collaborative node or a core network in any of the above embodiments.

[0431] In another embodiment of the present application, a computer program product including a computer program or instructions is provided. When the computer program product is run on a computer, the method of the aforementioned embodiment is implemented.

[0432] An embodiment of the present application also provides a computer-readable storage medium on which computer instructions are stored for implementing the methods executed by a communication device (such as a terminal device, an access node, and a collaboration node) in the above-mentioned method embodiments.

[0433] For example, when the computer program is executed by a computer, the computer can implement the methods performed by the communication device (such as terminal equipment, access node, and collaboration node) in each embodiment of the above method.

[0434] An embodiment of the present application also provides a computer program product comprising instructions, which, when executed by a computer, implement the methods performed by a communication device (such as a terminal device, an access node, or a collaborative node) in the above-mentioned method embodiments.

[0435] An embodiment of the present application also provides a communication system, which includes the terminal device and access communication node in the above embodiment, and the terminal device and access communication node are used to execute the method in any one of the embodiments shown in Figures 4 to 7.

[0436] In some implementations, the communication system may further include a cooperation node, which is configured to perform the actions performed by the cooperation node in any one of the embodiments shown in FIG. 4 to FIG. 7 .

[0437] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0438] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0439] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0440] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0441] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0442] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory ROM, a random access memory RAM, a magnetic disk, or an optical disk.

[0443] The above description is merely a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A data transmission method, characterized in that: include: Obtaining a first computing task identifier, where the first computing task identifier is used to identify the first computing task; Determine a first data bearer identifier according to the first computing task identifier; receiving a first data packet from a terminal device through a first air interface bearer indicated by the first data bearer identifier, where the first data packet carries first data and information about the first computing task; The first data packet is sent to a first instance according to information of the first computing task, and the first instance provides computing resources for running the first computing task.

2. The method according to claim 1, characterized in that The obtaining of the first computing task identifier includes: A first request message is received from the terminal device, where the first request message includes the first computing task identifier, and the first request message is used to request scheduling of the first computing task.

3. The method according to claim 2, characterized in that The information of the first computing task includes a unicast address, and the method further includes: Allocating the unicast address to the first computing task according to the first request information, or requesting the unicast address from the first node according to the first request information; Send the unicast address information to the terminal device.

4. The method according to claim 1, wherein The first computing task identifier is information about the first computing task, and obtaining the first computing task identifier includes: A second data packet is received from the terminal device via the second air interface, where the second data packet carries second data and information about the first computing task.

5. The method according to claim 4, characterized in that The method further comprises: The second data packet is sent to the first instance.

6. The method according to claim 1, characterized in that The first computing task identifier is a computing power service quality QoS flow identifier, and obtaining the first computing task identifier includes: A third data packet is received from the terminal device via the third air interface, and the third data packet carries third data and the computing power QoS flow identifier.

7. The method according to claim 1, characterized in that The obtaining of the first computing task identifier includes: receiving the first computing task identifier from the core network.

8. The method according to any one of claims 2 to 7, characterized in that The method further comprises: Obtain computing power QoS information, where the computing power QoS information indicates at least one of the following information associated with the first computing task: computing power QoS configuration, computing power QoS requirement, or a set of computing power QoS parameters; The determining the first data bearer identifier according to the first computing task identifier includes: According to the computing power QoS information and the first computing task identifier, the first data bearer identifier associated with the computing power QoS information is allocated to the first computing task.

9. The method according to any one of claims 1 to 8, characterized in that The method further comprises: Send the first data bearer identifier to the terminal device.

10. The method according to any one of claims 1 to 9, characterized in that The information of the first computing task includes an anycast address associated with the first computing task.

11. The method according to any one of claims 1 to 10, characterized in that The method further comprises: receiving a second request message from the terminal device, where the second request message is used to request termination of scheduling of the first computing task; According to the second request information, control the release of resources associated with the first computing task.

12. The method according to any one of claims 1 to 11, characterized in that The first data packet further carries first indication information, where the first indication information is used to distinguish different scheduling times of the computing power service associated with the first computing task; The method further comprises: receiving a fourth data packet from the terminal device, the fourth data packet carrying fourth data of a second computing task and the first indication information, where the second computing task and the first computing task are associated with the same computing power service; When the first indication information carried by the fourth data packet changes relative to the first indication information carried by the first data packet, the resources required for scheduling the computing power service are updated.

13. The method according to claim 12, characterized in that The first indication information includes a first value or a second value, and the first value and the second value are used to distinguish different scheduling times of the computing power service.

14. The method according to claim 12 or 13, characterized in that The updating and scheduling of resources required for the computing service includes at least one of the following: Sending the fourth data packet to a second instance, where the second instance provides computing resources for running the second computing task; Allocate a second data bearer identifier for the second computing task, where the second data bearer identifier, the first data bearer identifier, and the second computing task correspond to the same computing power QoS information; releasing the first air interface bearer; or Release the first instance.

15. The method according to any one of claims 1 to 14, characterized in that The first data packet further includes first address information, where the first address information indicates that a source address of the first data packet is an address of the terminal device. When the first node provides the first instance for the first computing task, sending the first data packet to the first instance according to the information of the first computing task includes: Determine the first node according to information of the first computing task; Replacing the source address of the first data packet with a temporary address to obtain a fifth data packet, wherein the temporary address is associated with the current node and the terminal device; The fifth data packet is sent to the first node.

16. The method according to claim 15, characterized in that The method further comprises: receiving a first downlink data packet from the first node, where the first downlink data packet includes fifth data and second address information, where the second address information indicates that a destination address of the first downlink data packet is the temporary address; Replacing the destination address of the first downlink data packet with the address of the terminal device according to the temporary address to obtain a second downlink data packet; The second downlink data packet is sent to the terminal device via the first air interface.

17. The method according to any one of claims 1 to 16, characterized in that The method further comprises: receiving a third downlink data packet from the first instance, the third downlink data packet including sixth data and third address information, the third address information indicating that a destination address of the third downlink data packet is an address of the terminal device; According to the third address information, the third downlink data packet is sent to the terminal device through the first air interface.

18. A data transmission method, characterized in that: include: receiving a first data bearer identifier from a second node, where the first data bearer identifier is associated with a first computing task identifier, and the first computing task identifier is used to identify a first computing task; A first data packet is sent to the second node through the first air interface bearer indicated by the first data bearer identifier, where the first data packet carries first data and information about the first computing task.

19. The method according to claim 18, characterized in that The method further comprises: A first request message is sent to the second node, where the first request message is used to request scheduling of the first computing task, and the first request message includes the first computing task identifier.

20. The method according to claim 18, wherein The first computing task identifier is information about the first computing task, and the method further includes: A second data packet is sent to the second node via the second air interface, where the second data packet carries second data and information about the first computing task.

21. The method according to claim 18, wherein The first computing task identifier is a computing power service quality QoS flow identifier, and the method further includes: A third data packet is sent to the second node via the third air interface bearer, where the third data packet carries third data and the computing power QoS flow identifier.

22. The method according to any one of claims 18 to 21, characterized in that The method further comprises: Sending second request information to the second node, where the second request information is used to request termination of scheduling of the first computing task.

23. The method according to any one of claims 18 to 22, characterized in that The first data packet further carries first indication information, where the first indication information is used to distinguish different scheduling times of the computing power service associated with the first computing task; The method further comprises: A fourth data packet is sent to the second node, where the fourth data packet carries fourth data of the second computing task and the first indication information, and the first indication information carried by the fourth data packet is different from the first indication information carried by the first data packet, and the second computing task and the first computing task are associated with the same computing power service.

24. The method according to any one of claims 18 to 23, characterized in that The method further comprises: A downlink data packet is received from the second node via the first air interface, where the downlink data packet carries data of the first computing task.

25. A communication device, characterized in that: The method comprises a module for executing the method according to any one of claims 1 to 17 or a module for executing the method according to any one of claims 18 to 24.

26. A communication device, characterized in that: The device comprises at least one processor coupled to at least one memory, wherein the at least one processor is configured to execute a computer program or instruction stored in the at least one memory so as to cause the communication device to perform the method according to any one of claims 1 to 17, or to perform the method according to any one of claims 18 to 24.

27. A communication system, characterized in that: Including terminal equipment and access computing nodes; The access computing node is configured to execute the data transmission method according to any one of claims 1 to 17; The terminal device is used to execute the data transmission method according to any one of claims 18 to 24.

28. A computer-readable storage medium, characterized in that Instructions or program codes are stored thereon, and when the instructions or program codes are executed by a processor, the processor implements the method according to any one of claims 1 to 17, or the method according to any one of claims 18 to 24.

29. A computer program product, characterized in that The computer program product comprises: a computer program code, and when the computer program code is executed, the method according to any one of claims 1 to 17 or the method according to any one of claims 18 to 24 is implemented.

30. A chip, characterized in that: The chip includes a processor and a communication interface, the communication interface is used to send information to other communication devices other than the communication device including the chip and / or receive information from the other communication devices, and the processor is used to execute the method as described in any one of claims 1 to 17, or to execute the method as described in any one of claims 18 to 24.

Images