Data transmission method and apparatus

Abstract

The present application belongs to the technical field of communications. Provided are a data transmission method and apparatus. The method comprises: mapping M tasks of a first service onto N logical channels, wherein M and N are positive integers greater than or equal to 2, and each of the M tasks comprises one or more messages; and executing logical channel prioritization (LCP), wherein the logical channels for executing the LCP comprise L logical channels among the N logical channels, L being a positive integer less than or equal to N. The method can improve the data transmission performance.

Description

Data transmission method and apparatus

[0001] The present application claims priority to the Chinese patent application No. 202410650685.8, filed on May 23, 2024, entitled “Data transmission method and apparatus”, the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication, in particular to a data transmission method and apparatus. BACKGROUND

[0003] Currently, devices can transmit data of various services. For example, in a cloud photographing scenario, after a local photographing by a mobile phone, the mobile phone can send photograph data to a server, multiple GPUs can be deployed on the server to perform image processing, so as to improve the processing quality of the photograph. After the server processes the photograph data, the server returns the processed photograph data to the mobile phone.

[0004] Services such as cloud photographing can be triggered randomly, and the data volume can be large, for example, 50M or 100M. How to guarantee the transmission requirement of the service and improve the transmission performance is a technical problem to be solved. SUMMARY

[0005] Embodiments of the present application provide a data transmission method and apparatus, which are used to improve the data transmission performance.

[0006] To achieve the above-mentioned purpose, the present application adopts the following technical solutions:

[0007] In a first aspect, the present application provides a data transmission method. The method can be applied to a terminal side, for example, a terminal or a communication module in the terminal, or a circuit or chip responsible for communication function in the terminal (such as a modem chip, also known as a baseband chip, or a system on chip (SoC) chip or system in package (SIP) chip containing a modem core). Taking the case that the method is applied to a first terminal, in the method, M tasks of a first service are mapped to N logical channels, M and N are positive integers greater than or equal to 2; each task of the M tasks includes one or more packets; a logical channel priority (LCP) is executed, and the logical channels for which the LCP is executed include L logical channels of the N logical channels, and L is a positive integer less than or equal to N.

[0008] By using the method, overuse of uplink resources by the first service can be avoided, data of other services can be ensured to obtain necessary uplink resources as much as possible, and overall service transmission performance of the terminal can be improved.

[0009] In a possible design, all packets of one task in the M tasks are mapped to one logical channel in the N logical channels. In this way, at any moment, each LCH stores or processes at most one task. Overmuch data stored on a LCH with a higher priority is avoided, so as to reduce the probability that the LCH occupies too much uplink resources.

[0010] In a possible design, N tasks in the M tasks are mapped to the N logical channels sorted in a first order. In this way, the tasks can be mapped to the corresponding LCHs in order, so as to avoid data transmission imbalance caused by mapping multiple tasks to few LCHs.

[0011] In a possible design, M is greater than N, and an (N+1)th task in the M tasks is mapped to a first logical channel sorted in the first order among the N logical channels. When the number of tasks is greater than the number of LCHs, the terminal performs round-robin mapping in the first order. In this way, more tasks can be mapped by using fewer LCHs, which helps to reduce the implementation complexity of the terminal.

[0012] In a possible design, the method further includes:

[0013] When a second task in the M tasks arrives, the second task is mapped to a first empty logical channel sorted in the first order among the N logical channels, or the second task is mapped to a first empty logical channel starting from a first logical channel sorted in the first order among the N logical channels, where the first logical channel is a logical channel in the N logical channels that has the latest mapped task sorted in the first order.

[0014] Then, mapping orders of the N logical channels are recorded, where a mapping order of a logical channel with an earlier mapping time is prior to a mapping order of a logical channel with a later mapping time.

[0015] In some embodiments, the terminal can dynamically create the LCHs and map the M tasks to the LCHs. For example, when the first task of the first service arrives, the terminal creates a first LCH and maps the task to the first LCH. When the second task arrives, if the first LCH still has data of the first task, the terminal creates a second LCH and maps the task to the second LCH; if the first LCH has no data of the first task, the terminal maps the task to the first LCH, and so on. Alternatively, the pre-creation and dynamic creation methods can be used in combination. For example, three LCHs are pre-created, and the corresponding tasks are mapped according to the method of the embodiments of the present application. Subsequently, when a new task arrives and there is no emptied LCH, the terminal dynamically creates an LCH for mapping the new task. The embodiments of the present application do not limit the specific mapping manner of the M tasks to the N logical channels.

[0016] For another example, the terminal maps the second task to the N logical channels, and the next logical channel of the first emptied logical channel starting from the first logical channel is arranged in the first order.

[0017] In a possible design, the first parameter of the second logical channel is determined according to the first parameter of each of the N logical channels; the first parameter is related to LCP; and the second logical channel is any of the N logical channels.

[0018] In a possible design, the first parameter of the second logical channel is determined according to the first parameter of each of the N logical channels, including that the value of the first parameter of the second logical channel is the sum of the values of the first parameters of each of the N logical channels.

[0019] In this way, during LCP, the task on the second logical channel can obtain more resources, so that the data in the LCH1 is transmitted faster.

[0020] In a possible design, when performing LCP, at most one of the N logical channels performs new transmission of a task. In this way, in some cases, it can be ensured that, during each LCP, not too many LCHs participate in the LCP, so as to prevent too many resources being preempted by the task during each LCP. This makes the multiple tasks of the first service be dispersedly transmitted within a time period allowed by a transmission delay.

[0021] In a possible design, the first condition comprises at least one of the following conditions: completion of the new transmission of the first task on the fourth logical channel; completion of the new transmission of the first task on the fourth logical channel and end of the current LCP.

[0022] In this way, different LCHs can be switched for new transmission in different LCPs, so that too many LCHs can be prevented from participating in LCP in one LCP.

[0023] In a possible design, the first condition comprises at least one of the following conditions: completion of the new transmission of the first task on the fourth logical channel; completion of the new transmission of the first task on the fourth logical channel and end of the current LCP.

[0024] In a possible design, the first condition comprises at least one of the following conditions: completion of the new transmission of the first task on the fourth logical channel; completion of the new transmission of the first task on the fourth logical channel and end of the current LCP.

[0025] In this way, by using different dequeuing manners, tasks mapped earlier can be transmitted earlier, so that the first-in first-out of tasks can be implemented.

[0026] In a possible design, at the first time, the fourth logical channel of the N logical channels performs new transmission of a first task, and the method further includes the following steps.

[0027] obtaining a first resource; determining that a logical channel performing new transmission of a task is a third logical channel of the N logical channels; and if the first transmission of the fourth logical channel fails, determining that retransmission data of the first task is preferentially used to the first resource compared with new transmission data of the third logical channel.

[0028] Considering the urgency and importance of the retransmission data, by using the method, the retransmission data can be given priority to use the first resource over the new transmission data, so that the terminal can use the first resource to transmit important retransmission data first, which helps to improve the data transmission quality of the terminal. Moreover, the uplink resources competed by the third LCH in the LCH group can be used by the retransmission data of one or more LCHs (such as the fourth LCH).

[0029] In addition, in this way, the retransmission data can still be transmitted by the fourth logical channel that fails in retransmission.

[0030] In a possible design, at the first time, the fourth logical channel in the N logical channels performs new transmission of the first task, and further includes: acquiring the first resource; determining that the logical channel performing new transmission of the task is the third logical channel in the N logical channels; and if the first task transmission of the fourth logical channel fails, transmitting retransmission data of the first task and first information through the third logical channel, where the first information indicates that the retransmission data belongs to the fourth logical channel.

[0031] In a possible design, after the third logical channel in the N logical channels performs new transmission of the first task, further includes:

[0032] updating a value of the first parameter of the third logical channel to a first value; and the updated value of the first parameter is a current value of the first parameter minus a second value, and the second value is an amount of resource used for transmitting the first task.

[0033] In a possible design, the first parameter includes Bj.

[0034] The above takes the case that only one LCH in the group participates in LCP each time as an example. In a possible design, the LCHs participating in the current LCP can also be multiple each time. As long as the M tasks can be dispersed for transmission, for example, the terminal maps the first task 1-task 3 of the first service to the LCH 1-LCH 3. At a certain LCP, the uplink resource is relatively large, and the data amount of the second service on the LCH 4 and the LCH 5 is relatively small, so the LCH 1, the LCH 2, the LCH 4, and the LCH 5 all participate in the current LCP. For another example, at a certain LCP, the uplink resource is relatively small, and the priority of the data of the second service on the LCH 4 and the LCH 5 is relatively high, so the LCH 1, the LCH 4, and the LCH 5 participate in the current LCP.

[0035] In a possible design, the terminal can flexibly switch a first parameter used by the LCH in the LCP. For example, when the priority of the task 1 of the LCH 1 is high and needs to be urgently transmitted, the Bj used by the LCH 1 in the LCP can be the sum of the Bj of all LCHs in the LCH group to which the LCH 1 belongs. When the priority of the task 1 of the LCH 1 is low or there is no high requirement on the transmission delay, the Bj used by the LCH 1 in the LCP can be the Bj of the LCH 1 itself.

[0036] In a possible design, the first order is configured by a network device or configured or preconfigured by the terminal.

[0037] In a second aspect, a communication apparatus is provided, which includes:

[0038] a processing module, configured to map M tasks of a first service to N logical channels, where M and N are positive integers greater than or equal to 2, each of the M tasks includes one or more packets, and perform logical channel prioritization (LCP), and the LCP is performed on L logical channels of the N logical channels, where L is a positive integer less than or equal to N.

[0039] In a possible design, all packets of one of the M tasks are mapped to one of the N logical channels.

[0040] In a possible design, N of the M tasks are mapped to the N logical channels sorted in a first order.

[0041] In a possible design, M is greater than N, and N+1 of the M tasks are mapped to a first logical channel sorted in the first order.

[0042] In a possible design, the processing module is further configured to:

[0043] when a second task of the M tasks arrives, map the second task to a first logical channel sorted in the first order and emptied among the N logical channels, or map the second task to a first logical channel sorted in the first order and emptied among the N logical channels starting from a first logical channel, where the first logical channel is a logical channel to which a task is most recently mapped among the N logical channels sorted in the first order, and record mapping orders of the N logical channels, where a mapping order of a logical channel mapped earlier in time is prior to a mapping order of a logical channel mapped later in time.

[0044] In a possible design, the first parameter of the second logical channel is determined according to the first parameter of each of the N logical channels; the first parameter is related to LCP; and the second logical channel is any one of the N logical channels.

[0045] In a possible design, the first parameter of the second logical channel is determined according to the first parameter of each of the N logical channels, including: the value of the first parameter of the second logical channel is the sum of the values of the first parameters of the N logical channels.

[0046] In a possible design, when performing LCP, at most one of the N logical channels performs new transmission of a task.

[0047] In a possible design, the processing module is further configured to:

[0048] the first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; and the new transmission of the first task on the fourth logical channel is completed and the current LCP is ended.

[0049] The first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; and the new transmission of the first task on the fourth logical channel is completed and the current LCP is ended.

[0050] In a possible design, the first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; and the new transmission of the first task on the fourth logical channel is completed and the current LCP is ended.

[0051] If the first condition is met, the logical channel performing the new transmission of the task is determined to be the third logical channel according to the mapping order of the N logical channels; and the mapping order of the third logical channel is after that of the fourth logical channel.

[0052] The first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; and the new transmission of the first task on the fourth logical channel is completed and the current LCP is ended.

[0053] In a possible design, the first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; and the new transmission of the first task on the fourth logical channel is completed and the current LCP is ended.

[0054] The first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; and the new transmission of the first task on the fourth logical channel is completed and the current LCP is ended.

[0055] In a possible design, at the first moment, the fourth logical channel of the N logical channels performs new transmission of the first task, and the processing module is further configured to: acquire the first resource; and determine that the logical channel performing new transmission of the task is the third logical channel of the N logical channels.

[0056] If the first task transmission of the fourth logical channel fails, the retransmission data of the first task is determined to be preferentially used in comparison with the new transmission data of the third logical channel.

[0057] In a possible design, at the first moment, the fourth logical channel of the N logical channels performs new transmission of the first task, and the processing module is further configured to: acquire the first resource; and determine that the logical channel performing new transmission of the task is the third logical channel of the N logical channels. If the first task transmission of the fourth logical channel fails, the processing module is further configured to: send, through the third logical channel, the retransmission data of the first task and first information, where the first information indicates that the retransmission data belongs to the fourth logical channel.

[0058] In a possible design, after the third logical channel of the N logical channels performs new transmission of the first task, the processing module is further configured to: update a value of a first parameter of the third logical channel to a first value; and the updated value of the first parameter is a current value of the first parameter minus a second value, where the second value is an amount of resource used for transmitting the first task.

[0059] In a possible design, the first parameter includes Bj.

[0060] A function module for performing the method in any possible design of any aspect of the present application can be implemented by software or hardware, or in a combination of software and hardware. For example, the function module can include a processing unit and a communication unit.

[0061] In a third aspect, a communication apparatus is provided, which includes a processor configured to perform the method in any design of any aspect of the present application.

[0062] Optionally, the apparatus further includes the memory or the communication interface.

[0063] The communication interface is coupled to the processor, and the communication interface is configured to input or output information.

[0064] The memory is configured to store a computer program, and the processor is configured to perform the method in any design of any aspect of the present application, which can be implemented by executing the computer program stored in the memory to perform the method in any design of any aspect of the present application.

[0065] Alternatively, the processor can also be a hardware-implemented circuit, such as an artificial intelligence (AI) processor, to improve the running speed. The present application does not limit the specific implementation manner of the processor.

[0066] Optionally, the communication apparatus can be a whole device or a module in the device, such as a chip.

[0067] In a fourth aspect, the present application provides a computer readable storage medium, including computer instructions, when the computer instructions run on a device, causing the device to execute the method in any possible design of any of the aspects.

[0068] In a fifth aspect, the present application provides a computer program product, when the computer program product runs on a device, causing the device to execute the method in any possible design of any of the aspects.

[0069] In a sixth aspect, the present application provides a circuit system, including a processing circuit, the processing circuit being configured to execute the method in any possible design of any of the aspects. The processing circuit can be implemented as a corresponding circuit component, such as one or more processors. For example, as a processor and a memory. For example, as a processor and a transceiver. BRIEF DESCRIPTION OF DRAWINGS

[0070] FIG. 1A and FIG. 1B are schematic diagrams of LCPs provided by embodiments of the present application;

[0071] FIG. 2 is a schematic diagram of the architecture of a system provided by an embodiment of the present application;

[0072] FIG. 3 is a schematic diagram of the flow of a data transmission method provided by an embodiment of the present application;

[0073] FIG. 4-FIG. 8 are schematic diagrams of scenarios provided by embodiments of the present application;

[0074] FIG. 9 and FIG. 10 are schematic diagrams of the structure of a communication apparatus provided by embodiments of the present application. DETAILED DESCRIPTION

[0075] The terminology used in the description of the embodiments herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the description of the embodiments and the appended claims herein, the singular forms "a", "an" and "the" are intended to include both singular and plural forms, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and / or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof. As used herein, the term "and / or" includes any and all combinations of one or more of the associated listed items. Expressions such as "at least one of," when preceding the syllables of a list of elements, modify the entire list of elements and do not modify the elements individually.

[0076] Reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the application. Thus, the appearances of the phrases "in one embodiment" or "in some embodiments" in various places throughout this specification are not necessarily all referring to the same embodiment, unless otherwise specified. The terms "including," "containing," "having," and variations thereof are meant to encompass the terms "including," "containing," "having," and variations thereof, unless otherwise specified. The term "connected" is meant to encompass both direct connections and indirect connections, unless otherwise specified.

[0077] The terms "first," "second," and the like, do not denote any quantity or order but are used as labels, names for referring to particular members. Therefore, in the specification, the terms "first" and "second" can be used to describe a variety of elements or indicate the quantity of the elements, unless otherwise specified. Accordingly, the features defined with "first" and "second" can include one or more of the features explicitly or implicitly.

[0078] The words "example" and "exemplary" are used herein to mean serving as an example, instance, or illustration. Any implementation described herein as "example" or "exemplary" is not necessarily to be construed as preferred or advantageous over other implementations. The descriptions of the embodiments herein are not meant to limit the application. Rather, the intent is to embrace all alternatives, modifications, and variations that fall within the scope of the application.

[0079] In addition, the numbering of steps in various embodiments described herein is used to distinguish between different steps, and does not limit the order of the steps. For example, obtaining a resource can occur before, after, or simultaneously with obtaining data for a task.

[0080] "Sending information" can be understood as a device sending information to another device, or can also be understood as a logical module in a device sending information to another logical module. For example, "the access network device sending information" can be understood as the access network device sending information to another device (such as a terminal), or can be understood as a logical module 1 in the access network device sending information to a logical module 2 in the access network device.

[0081] "Receiving information" can be understood as a device receiving information from another device, or can also be understood as a logical module in a device receiving information from another logical module. For example, "the access network device receiving information" can be understood as the access network device receiving information from another device (such as a terminal), or can be understood as a logical module 1 in the access network device receiving information from a logical module 2 in the access network device.

[0082] "Sending information to... (e.g., a terminal)" or related illustrations in the drawings can be understood as the destination of the information being the terminal. This can include directly or indirectly sending information to the terminal. "Receiving information from... (e.g., a terminal)" or "receiving information sent by... (e.g., a terminal)" or "receiving information from... (e.g., a terminal)" or related illustrations in the drawings can be understood as the source of the information being the terminal, which can include directly or indirectly receiving information from the terminal. The information can be processed as necessary between the source and the destination of the information, such as format changes, etc., but the destination can understand the valid information from the source. Similar expressions in this application can be similarly understood, and will not be repeated here.

[0083] The terms "system" and "network" in the embodiments of the present application can be used interchangeably.

[0084] First, some technical terms related to the embodiments of the present application are introduced:

[0085] 1. Task-level scheduling

[0086] Task-level scheduling, also known as task-level transmission, task-level scheduling, etc. In this mechanism, the terminal can transmit one or more tasks.

[0087] One task can include one or more data (or message, or packet). In embodiments of the present application, the task can be replaced by burst, data burst, protocol data unit set (PDU set), data set, task-level data, or other names, without limitation.

[0088] Task-level scheduling can be defined as transmitting a certain amount of data within a certain time.

[0089] For example, in cloud rendering service, a user uses a terminal to take a photo, the terminal sends the photo to the cloud server, and the cloud server returns the rendered photo to the terminal after rendering. The data volume of a photo can be large, for example, 100M, which is carried by dozens of messages. In order to ensure the user experience of cloud rendering service, the dozens of messages need to be transmitted from the terminal to the cloud server within 2S. In this example, task-level scheduling can be understood as 100M data transmitted within 2S.

[0090] 2、Data mapping

[0091] In the current air interface protocol stack architecture, one service (such as cloud rendering service) is mapped to one quality of service flow (QoS flow), and one QoS flow is mapped to one data radio bearer (DRB). One DRB corresponds to one packet data convergence protocol (PDCP) entity, one DRB corresponds to one or more radio link control (RLC) entities, and one RLC entity corresponds to one logical channel (LCH).

[0092] Currently, one DRB corresponds to multiple RLC entities, which can be applied in duplication or split scenarios. Duplication refers to transmitting the same data on multiple LCHs to enhance reliability. Split refers to when the data volume on one LCH exceeds a certain threshold, part of the data volume is carried by another LCH.

[0093] 3、LCP

[0094] As mentioned above, the terminal can map multiple services to multiple LCHs, each of which has data to be transmitted. For the transmission resource configured by the network, the terminal can select one or more LCHs (i.e., LCH selection) and allocate a certain transmission resource for the data on the selected LCH (i.e., resource allocation). The process of LCH selection and resource allocation is called logical channel prioritization (LCP).

[0095] 4、LCH selection

[0096] The network device (such as a base station) can configure some parameter attributes for each LCH. When the network device issues a resource (such as an UL grant) to the terminal, the UL grant can be associated with some applicable conditions, such as a subcarrier spacing index (SCS index) applicable to the UL grant and a physical uplink shared channel transmission duration (PUSCH transmission duration). The terminal selects one or more LCHs that meet the applicable conditions of the UL grant accordingly.

[0097] 5、Resource Allocation

[0098] Currently, the terminal can perform resource allocation by using a token bucket algorithm. The network device can configure three parameters, i.e., a priority, a prioritized bit rate (PBR), and a bucket size duration (BSD), for each LCH.

[0099] The PBR indicates the rate of token accumulation, and the unit is, for example but not limited to, bit / s. As shown in FIG. 1A, Bj is the total amount of tokens that have been accumulated, and the unit is, for example, M. Assuming that the accumulated time is T, then Bj = PBR*T. The maximum value of T can be limited by the BSD to prevent the tokens of an LCH from being accumulated indefinitely.

[0100] As shown in FIG. 1A, the network device allocates an uplink resource 1 to the terminal.

[0101] In the first round of resource allocation, for the selected LCH, the terminal uses the data amount corresponding to Bj of the LCH for packet assembly in the order of priority from high to low if Bj > 0. The data amount used for packet assembly can be understood as the data amount obtained by the uplink resource. The data amount corresponding to Bj of the LCH used for packet assembly can be understood as that the LCH can use the resource amount of Bj.

[0102] And the terminal updates the Bj value of the LCH, the new Bj value is the current Bj value minus the data volume of the packet. As shown in FIG. 1A, the selected LCHs are LCH1-LCH3, in which the priority from high to low is LCH1, LCH2, LCH3. For LCH1, the Bj of LCH1 is greater than 1, assuming the Bj is 50MB, the terminal allocates 50MB in the uplink resource 1 to the data of LCH1. And the terminal updates the Bj value of LCH1 to 50-50. For LCH2, since the Bj of LCH2 is less than 0, the terminal does not allocate resources to LCH2 in the first round of resource allocation. For LCH3, similarly, the terminal allocates the corresponding amount of resources in the uplink resource 1 to LCH3 according to the Bj value of LCH3, and updates the Bj value of LCH3.

[0103] After the first round of resource allocation, if there is still remaining resources, the terminal packetizes the remaining data on the selected LCHs in order of priority from high to low, that is, allocates corresponding uplink resources to these remaining data. As shown in FIG. 1A, after the first round of resource allocation, the remaining data on LCH1 is packetized first in order of priority from high to low, then part of the remaining data on LCH2 is packetized, until the uplink resource 1 is allocated.

[0104] Suppose a task-based service, such as a photo cloud rendering service, is mapped to an LCH. Suppose a task (such as a 100M photo) needs to be sent within 2S, which means 50M data needs to be transmitted per second. According to the above token bucket scheme, the PBR of the LCH should be set to 50M / s. However, tasks are usually bursty. For example, according to user behavior, if the user takes two photos in a row, it means that 200M data needs to be transmitted within 2S, not 100M. If the PBR is set to 50M / s due to the limited resources allocated to the terminal by the network device, it will not be able to complete the transmission of two tasks at the same time within the specified time.

[0105] In view of this, one solution is to set the PBR of the LCH that maps the service to a larger value, such as infinity. As introduced above, in the first round of resource allocation, the terminal allocates resources to each LCH according to the PBR (or the Bj accumulated by the PBR). If the PBR of a certain LCH is large and the priority of the LCH is high, it will cause the LCH to occupy too many resources once there is data to be transmitted on the LCH, so that other LCHs cannot obtain resources or obtain very few resources.

[0106] Still taking the cloud rendering service as an example, in order to guarantee the user experience, the priority of the LCH corresponding to the cloud rendering service is usually set to be high, as shown in FIG. 1B. If the PBR of the LCH corresponding to the cloud rendering service is set to be large, it means that the user can only use the cloud rendering to take a photo, and other services cannot be performed. For example, the user cannot make a phone call while taking a photo, and for another example, the heartbeat packet of the instant messaging application cannot be normally transmitted, so that the instant messaging application is in an offline state during the cloud rendering photo. It can be seen that in the traditional communication method, the data transmission is unbalanced, although some services (such as the cloud rendering service) can be quickly transmitted, but other services are interrupted.

[0107] Therefore, the embodiments of the present application provide a data transmission method, which can be applied to the transmission of tasks. FIG. 2 shows a possible, non-limiting system schematic diagram. As shown in FIG. 2, the communication system 10 includes a radio access network (RAN) 100 and a core network (CN) 200. The RAN 100 includes at least one RAN node (such as 110a and 110b in FIG. 2, collectively referred to as 110) and at least one terminal (such as 120a-120j in FIG. 2, collectively referred to as 120). The RAN 100 can also include other RAN nodes, such as wireless relay devices or wireless backhaul devices (not shown in FIG. 2), etc. The terminal 120 is connected to the RAN node 110 in a wireless manner. The RAN node 110 is connected to the core network 200 in a wireless or wired manner. The core network device in the core network 200 and the RAN node 110 in the RAN 100 can be different physical devices respectively, or can be the same physical device integrated with the core network logic function and the radio access network logic function.

[0108] The communication system 10 can be a 3rd generation partnership project (3GPP) related cellular system, such as a 4G, 5G mobile communication system, or a future-oriented evolution system (such as a 6G, 7G mobile communication system). The communication system 10 can also be an open radio access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. The communication system 10 can also be a communication system in which two or more of the above systems are integrated.

[0109] The RAN node 110, which can also be referred to as an access network device, a RAN entity, or an access node, etc., forms part of the communication system, and is configured to facilitate wireless access to the communication system by terminals. The RAN nodes 110 in the communication system 10 can be of the same type or different types. In some scenarios, the roles of the RAN node 110 and the terminal 120 are relative, e.g., the network element 120i in Figure 2 can be a helicopter or a drone, which can be configured to move as a mobile base station, to the terminal 120j accessing the RAN 100 via the network element 120i, the network element 120i is a base station; but to the base station 110a, the network element 120i is a terminal. The RAN nodes 110 and the terminals 120 are sometimes referred to as communication apparatuses, e.g., the base stations 110a and 110b in Figure 2 can be understood as communication apparatuses with base station functionality, and the network elements 120a-120j can be understood as communication apparatuses with terminal functionality.

[0110] In a possible scenario, the RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next generation NodeB (gNB), a next generation base station in a 6th generation (6G) mobile communication system, a base station in a future mobile communication system, or an access node in a WiFi system, etc. The RAN node can be a macro base station (e.g., 110a in Figure 2), a micro base station or an indoor station (e.g., 110b in Figure 2), a relay node or a donor node, or a wireless controller in a CRAN scenario. Optionally, the RAN node can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the access network device in a vehicle to everything (V2X) technology can be a road side unit (RSU). All or part of the functions of the RAN node in this application can also be implemented by software functions running on hardware, or by virtualized functions instantiated on a platform (e.g., a cloud platform). The RAN node can also be provided with a communication module, circuit or chip for performing corresponding communication functions, and program instructions for performing corresponding communication functions. The RAN node in this application can also be a logical node, a logical module or software that can implement all or part of the functions of the RAN node.

[0111] In another possible scenario, a terminal is assisted by multiple RAN nodes to implement wireless access, and different RAN nodes respectively implement part of functions of a base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be separately arranged, or can also be included in the same network element, for example, in a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, for example, included in a remote radio unit (RRU), an active antenna processing unit (AAU), or a remote radio head (RRH).

[0112] In different systems, the CU (or CU-CP and CU-UP), DU or RU can also have different names, but those skilled in the art can understand their meanings. For example, in an ORAN system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any one of the 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.

[0113] A terminal can be a device or module with corresponding communication functions and can access the above-mentioned communication system. The terminal can also be referred to as a terminal device, user equipment (UE), mobile station, mobile terminal, etc. The terminal can be widely used in various scenarios, such as device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality, augmented reality, industrial control, autonomous driving, remote medical treatment, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver function, wearable device, vehicle, unmanned aerial vehicle, helicopter, airplane, ship, robot, mechanical arm, smart home device, transport vehicle with wireless communication function, communication module, etc. Embodiments of the present application do not limit the device form of the terminal. The terminal usually has a communication module, circuit or chip for performing corresponding communication functions. The terminal also has program instructions for performing corresponding communication functions.

[0114] The data transmission method and device of the embodiments of the present application will be further described below with reference to the accompanying drawings. It can be understood that the access network device (such as a base station) and the terminal are taken as an example of the execution subject of the interaction in the embodiments of the present application, but the embodiments of the present application do not limit the execution subject of the interaction. For example, the method performed by the access network device in the embodiments of the present application can also be implemented by a module (such as a circuit, a chip or a chip system, etc.) in the access network device, or a logic node, logic module or software capable of realizing all or part of the functions of the access network device; the method performed by the terminal can also be implemented by a communication module in the terminal or a circuit or chip (such as a modem chip (also known as a baseband chip), or a SoC chip containing a modem core, or a SIP chip) responsible for communication functions in the terminal.

[0115] FIG. 3 shows an example flow of a data transmission method, which can include:

[0116] S101, the terminal maps M tasks of the first service to N logical channels, M and N are positive integers greater than or equal to 2; each of the M tasks includes one or more packets.

[0117] In the embodiments of the present application, the logical channel can refer to the channel between the RLC layer and the MAC layer. In other systems, such as future evolved systems, the logical channel can also have other names, which are not limited.

[0118] Mapping, which can be alternatively or equivalently expressed as: associating, or delivering, or submitting, or sending, or giving, without limitation.

[0119] For example, as shown in (a) of FIG. 4, the terminal maps the three tasks 1-3 of the service A to the LCHs 1-3 respectively. For example, the tasks 1-3 are data of a photo respectively.

[0120] Optionally, the one or more LCHs to which the tasks of the same service are mapped can be referred to as an LCH group. As shown in FIG. 4, the LCHs 1-3 can be referred to as an LCH group or a logical LCH, and the LCH group is shown in a dashed box in (b) of FIG. 4 and (c) of FIG. 4.

[0121] Optionally, all packets of a task of the M tasks are mapped to one of the N logical channels. As shown in (a) of FIG. 4, all packets of each of the tasks 1-3 are mapped to one LCH respectively. At any moment, each LCH buffers or processes at most one task.

[0122] In an embodiment of the present application, the first service corresponds to multiple protocol entities, and the protocol entities include one or more of the following protocol entities: LCH, QoS flow, packet data unit session (PDU session), DRB, PDCP entity, RLC entity, and protocol entity in 6G. The protocol entity can also be other protocol entity as long as it can achieve mapping of the M tasks to the N LCHs. For example, the multiple tasks of the first service of the terminal are mapped to multiple QoS flows respectively, and each QoS flow is mapped to one DRB, so as to achieve mapping of the M tasks to the N LCHs. For another example, the terminal maps the multiple tasks to multiple PDU sessions respectively, so as to achieve mapping of the M tasks to the N LCHs. For another example, the terminal maps the multiple tasks to multiple DRBs respectively, so as to achieve mapping of the M tasks to the N LCHs. The parameters (such as PBR) of each protocol entity can be set according to the requirements of the task of the protocol entity.

[0123] Optionally, the network device can configure one or more parameters corresponding to the protocol entities associated with the same service. For example, one or more of the following parameters: LCP related parameters, QoS flow priority, data network name (DNN), slice, IP address, etc. Optionally, the LCP related parameters can include: allowed subcarrier spacing (s) information, maximum PUSCH duration, configured grant type, cell information available for transmission, PBR, priority, LCH selection parameters.

[0124] Optionally, one or more parameters of the multiple protocol entities associated with the same service are the same. For example, the priorities of the multiple QoS flows associated with the same service are the same. For another example, the PBRs and priorities of the multiple LCHs associated with the same service are the same.

[0125] Optionally, one or more parameters of the multiple protocol entities associated with the same service can be different. For example, the Bj, PBR, priority, and BSD of the multiple LCHs associated with the same service can be configured independently.

[0126] In some embodiments, the N LCHs independently maintain the first parameter. Optionally, the first parameter is Bj. The terminal accumulates the Bj of the LCH, which can be understood with reference to related technologies, and will not be described here.

[0127] By using the above method, the terminal serves one service through multiple protocol entities, which can isolate the tasks within the service. Thus, in various scheduling, the relevant parameters can be set according to the characteristics of one task, without considering the parameter settings of multiple concurrent tasks.

[0128] S102, the terminal performs LCP, and the logical channels for performing LCP include L logical channels of the N logical channels, L being a positive integer less than or equal to N.

[0129] Performing LCP can be understood as performing LCP, conducting LCP, or participating in LCP, without limitation.

[0130] LCP can also have other names, without limitation.

[0131] The method of the embodiment of the present application, for the N LCHs mapped by the M tasks of the same service, the logical channels performing LCP include L logical channels of the N logical channels, which means that not all LCHs mapped by the service participate in LCP, but part of the LCHs mapped by the service participate in LCP. For example, as shown in (b) of FIG. 4, at T2, the terminal performs LCP, and the LCHs participating in this LCP are LCH1 and LCH4. The service mapped on LCH4 is different from the service mapped on LCH1. For example, LCH1 maps the data of one photo of the photo service, and LCH4 maps the data of the instant messaging service.

[0132] As shown in (b) of FIG. 4, the terminal can allocate corresponding amounts of resources to LCH1 and LCH4 according to the Bj value of LCH1 and the Bj value of LCH4. For example, the Bj value of LCH1 is 80, the Bj value of LCH4 is 60, and the amount of available uplink resources is greater than 140, and the terminal can allocate resources with a size of 80 in the uplink resources to LCH1 and allocate resources with a size of 60 in the uplink resources to LCH4. Compared with the related art of FIG. 1B, the method corresponding to (b) of FIG. 4 can avoid that the service A excessively uses the uplink resources, and can ensure that the data of other services can also obtain necessary uplink resources as much as possible, thereby improving the overall service transmission performance of the terminal. For example, the terminal can perform instant messaging while cloud photographing.

[0133] For another example, as shown in (c) of FIG. 4, at T3, the terminal performs LCP, and the LCHs participating in this LCP are LCH2 and LCH5. The service mapped on LCH5 is different from the service mapped on LCH2. The terminal can allocate corresponding amounts of resources to LCH2 and LCH5 according to the Bj value of LCH2 and the Bj value of LCH5.

[0134] Optionally, the terminal can dynamically create an LCH. For example, when a new task arrives, it is found that there is no empty LCH in the LCH group, and then a new LCH is created.

[0135] Alternatively, the terminal can pre-create multiple LCHs. For example, for the photo cloud rendering service, the user can take a maximum of 5 photos within 2 seconds, and 5 tasks (5 photos to be transmitted) are generated, and the terminal can pre-establish 5 LCHs.

[0136] By using the scheme of the embodiment of the present application, for one LCP, only part of the LCHs mapped by the first service participate in this LCP, which can avoid that the first service excessively uses the uplink resources, and thus can reduce the probability of starvation of other services as much as possible, thereby improving the overall service transmission quality of the terminal.

[0137] The embodiment of the present application further provides a data transmission method. In the method, a terminal can map M tasks of a first service to N LCHs in a certain order. As follows, the method is introduced.

[0138] Optionally, the network device can configure a round-robin order, which can also be referred to as a first order, for the LCH group of the terminal, for example, LCH1→LCH2→LCH3. Alternatively, the terminal can determine the first order by itself, for example, in a protocol pre-configuration manner. The embodiment of the present application does not limit the manner of determining the first order.

[0139] As a possible implementation manner, N tasks in M are mapped to N logical channels sorted in the first order. For example, for the first N tasks arriving in time sequence, the first task is mapped to the first LCH in the first order, the second task is mapped to the second LCH in the first order, the third task is mapped to the third LCH in the first order, and so on.

[0140] For example, the first order can be an order of indexes of N LCHs from low to high. As shown in (a) of FIG. 4, the first task arriving is mapped to the LCH1 with the smallest index, the second task arriving is mapped to the LCH2, and the third task arriving is mapped to the LCH3 with the largest index. The first order is not limited to the index order, and is not limited. For example, the first order can also be determined according to a priority, a fixed order or other orders.

[0141] Optionally, when M is greater than N, that is, the number of tasks is greater than the number of LCHs, the terminal can round-robin map the tasks more than N according to the first order. For example, the N+1th task in M tasks is mapped to the first logical channel sorted in the first order among N logical channels. That is, when the number of tasks is greater, the Nth task is mapped, and the N+1th task is mapped to the first LCH in the first order again.

[0142] For example, as shown in FIG. 5(a), when N=3 and the number of LCHs corresponding to the first service is three, the terminal maps the first task 1-3 of the service A to LCH1-LCH3 in the order of the arrival time of the tasks 1-3 according to the first sequence. Then, as shown in FIG. 5(b), when the fourth task (task 4) of the service A arrives, the terminal maps the task 4 (an example of the N+1th task) to LCH1 which is the first LCH in the order of the index from low to high. Then, as shown in FIG. 5(c), when the fifth task (task 5) of the service A arrives, the terminal maps the task 5 to LCH2 which is the second LCH in the order of the index from low to high. In this way, when the sixth task (task 6) of the service A arrives, the terminal maps the task 6 to LCH3 which is the third LCH in the order of the index from low to high. When the seventh task (task 7) of the service A arrives, the terminal maps the task 7 to LCH3 which is the first LCH in the order of the index from low to high, i.e., the task returns to the first LCH in the first sequence again, and so on.

[0143] That is, when the number of tasks is greater than the number of LCHs, the terminal performs round-robin mapping according to the first sequence. In this way, more tasks can be mapped by a small number of LCHs, which helps to reduce the implementation complexity of the terminal.

[0144] As a possible implementation, when the second task in the M tasks arrives, the terminal maps the second task to the first logical channel in the first sequence which is empty among the N logical channels.

[0145] The empty LCH can be an LCH which has not mapped a task or data. Alternatively, the empty LCH can be an LCH which has mapped a task or data, but the task or data has been transmitted. Alternatively, the empty LCH can be an LCH which has mapped a task or data, but the task or data has been emptied beyond the deadline. The empty LCH can also be understood as an LCH which does not exist task or data buffer.

[0146] Taking the fourth task of the service A as an example, as shown in (a) of FIG. 6, the LCHs associated with the service A are LCH1-LCH5. The first three tasks of the service A are sequentially and respectively mapped to LCH1-LCH3 in the first order (e.g., the indexes are from low to high). As shown in (b) of FIG. 6, assuming that the five LCHs LCH1-LCH5 are sorted in the first order, the resulting LCH order is LCH1->LCH2->LCH3->LCH4->LCH5. When the fourth task arrives, a period of time has passed, the first task has been transmitted, or has been discarded due to timeout, so that the terminal determines that the first LCH (LCH1) in the LCH order is empty. Alternatively, it is understood that when the fourth task arrives, the first task mapped on the LCH1 has been transmitted, and the LCH1 does not have a buffered task. In this case, the terminal maps the fourth task to the LCH1. Similarly, when the fifth task arrives, the terminal sequentially checks each LCH according to the first order 1->2->3->4->5, and finds that the LCH1 is not empty and the LCH2 is empty, so that the terminal can map the fifth task to the empty LCH2. When the sixth task arrives, if the LCH1 and the LCH2 are not empty and the LCH3 is empty, the terminal can map the sixth task to the empty LCH3. When the seventh task arrives, if the LCH1 is empty, the terminal can map the seventh task to the empty LCH1, and so on.

[0147] In this way, each time a new task needs to be mapped, the terminal can sequentially check each LCH from the beginning to the end according to the first order, until the first empty LCH is determined, and then map the task to the found LCH.

[0148] Alternatively, as a possible implementation, when the second task of the M tasks arrives, the terminal maps the second task to the first empty LCH in the N logical channels sorted in the first order, starting from the first logical channel. The first logical channel is the first logical channel in the N logical channels sorted in the first order, which has been mapped to a task.

[0149] The logical channel of the mapped task can also be understood as the logical channel of the latest mapped task. Taking N=5 as an example, according to the first order, the order of the five LCHs is: LCH1->LCH2->LCH3->LCH4->LCH5->LCH1->LCH2->LCH3->LCH4->LCH5… In some examples, tasks 1-3 that arrive in time sequence are mapped to LCH1-LCH3 in turn, respectively, and the LCH of the latest mapped task is LCH3. In other examples, tasks 1-5 that arrive in time sequence are mapped to LCH1-LCH5 in turn, respectively, and then tasks 6-8 are mapped to LCH1-LCH3 in turn, respectively, wherein the latest mapped task is task 8 and the LCH of the latest mapped task is LCH3.

[0150] For example, as shown in (c) of FIG. 6, assuming that the five LCHs LCH1-LCH5 are sorted in the first order, the obtained LCH order is LCH1->LCH2->LCH3->LCH4->LCH5->LCH1->LCH2->LCH3->LCH4->LCH5… When task 4 arrives, the terminal determines that, in the order, the LCH of the latest mapped task is LCH3 (an example of the first logical channel). That is, in the LCH order, the first LCH emptied from LCH3 is LCH4. Since there is no task or data buffered on LCH4, the terminal maps task 4 to LCH4.

[0151] Optionally, the terminal can record the mapping order (or mapping sequence) of the N logical channels, and subsequently, when performing LCP, the terminal can switch the new transmission LCH in the group according to the recorded mapping order. The mapping order of a logical channel mapped earlier in time is prior to the mapping order of a logical channel mapped later in time. For example, taking the method corresponding to (b) of FIG. 6 as an example, the mapping order of each LCH in time sequence is LCH1->LCH2->LCH3->LCH1…, indicating that the terminal maps tasks arriving in time sequence to LCH1, LCH2, LCH3, and LCH1 in turn. For another example, taking the method corresponding to (c) of FIG. 6 as an example, the mapping order of each LCH in time sequence is LCH1->LCH2->LCH3->LCH4…, indicating that the terminal maps tasks arriving in time sequence to LCH1, LCH2, LCH3, and LCH4 in turn.

[0152] By using the above method, multiple mapping methods of tasks are provided, so that multiple tasks are mapped to corresponding LCHs in order, so as to avoid unbalanced data transmission caused by multiple tasks being mapped to a few LCHs.

[0153] The above process of mapping tasks to corresponding LCHs can be referred to as a task queuing process.

[0154] The embodiment of the application further provides a data transmission method, wherein the terminal performs LCP, and at most one of the N logical channels performs new transmission of a task. The terminal performs LCP, which can be referred to as dequeuing of the task. In this way, the first service can be prevented from using too many uplink resources, thereby causing other services to be starved. As follows, the method is introduced:

[0155] As a possible implementation manner, at a first time, a fourth logical channel of the N logical channels performs new transmission of a first task. When a first condition is met, it is determined that the logical channel performing the new transmission of the task is a third logical channel of the N logical channels. That is, the terminal can switch the LCH performing the new transmission.

[0156] The LCH performing the new transmission can be referred to as a new transmission LCH.

[0157] The first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; the new transmission of the first task on the fourth logical channel is completed, and the current LCP is ended.

[0158] The current LCP can also be replaced by the current resource use or allocation being completed, or replaced by: the next LCP being started.

[0159] Taking the first condition as an example that the new transmission of the first task on the fourth logical channel is completed, the network device allocates uplink resources to the terminal. As shown in (a) of FIG. 7, the terminal maps a plurality of tasks to a plurality of LCHs respectively. As shown in (b) of FIG. 7, at T2, the LCH group associated with service A includes LCH1-LCH3. First, LCH1 participates in LCP, and the terminal performs LCP according to the parameters of LCH1 and the parameters of the LCHs other than the LCHs in the group. For example, according to the priority and Bj of LCH1, the priority and Bj of LCH4, and the priority and Bj of LCH5, LCP is performed according to the related art. For example, in the first round of resource allocation, the terminal allocates resources in the uplink resources to LCH1 according to the Bj of LCH1, LCH4 and LCH5, and transmits task 1 on LCH1 using the allocated resources.

[0160] As shown in (c) of FIG. 7, at T4, when all data in task 1 is completed, the terminal switches the LCH performing the new transmission to LCH2 in the group, and LCH2 participates in LCP.

[0161] Afterwards, for the transmission of task 2, the terminal allocates the remaining resources to the data of LCH2, LCH4 and LCH5, and transmits the data of task 2 on LCH2 using the allocated resources. In this way, the terminal switches the LCH for new transmission to the next LCH after each new transmission of a task on the current LCH, so as to realize new transmission of tasks on multiple LCHs in the group, and complete new transmission of multiple tasks in time. This way of triggering the terminal to switch the LCH for new transmission can be referred to as mode 1.

[0162] Taking the first condition that the new transmission of the first task on the fourth logical channel is completed and the current LCP ends as an example, the LCH for new transmission is LCH1. The terminal performs LCP according to the priority and Bj of LCH1, the priority and Bj of LCH4, and the priority and Bj of LCH5, and according to the related art. Afterwards, the transmission of task 1 on LCH1 is completed, but there is still remaining resources, and the LCH group to which LCH1 belongs cannot participate in the allocation of the remaining resources. Until the current LCP ends and the next LCP starts, the terminal is triggered to switch the LCH for new transmission to LCH2. This way of triggering the terminal to switch the LCH for new transmission can be referred to as mode 2.

[0163] In some examples, if the network device allocates more resources, there is still remaining resources after the first round of resource allocation according to Bj, and the transmission of task 1 of LCH1 is completed, according to mode 1, the terminal triggers to switch the LCH for new transmission from LCH1 to LCH2 in the group, and task 2 on LCH2 can use the remaining resources. According to mode 2, the current LCP has not ended, and the terminal will not be triggered to switch the LCH for new transmission.

[0164] For example, if the transmission of task 1 in LCH1 is completed and task 4 is mapped to LCH1, according to mode 2, the terminal will not be triggered to switch the LCH for new transmission back to LCH1 at the time of round-robin switching, and LCH1 cannot temporarily transmit data of task 4.

[0165] The embodiment of the application also provides a data transmission method, in which a terminal determines LCHs participating in LCP in a certain order. As follows, the method is introduced:

[0166] As a possible implementation manner, the first condition is met, and the third logical channel of the N logical channels is determined as the logical channel for new transmission of a task, which can be implemented as follows: if the first condition is met, the third logical channel is determined as the logical channel for new transmission of a task according to the mapping order of the N logical channels; and the mapping order of the third logical channel is after that of the fourth logical channel.

[0167] For example, as shown in (b) of FIG. 6, the mapping order of LCHs is LCH1->LCH2->LCH3->LCH1…, which means that the terminal will map the multiple tasks arriving in time sequence to LCH1, LCH2, LCH3, LCH1… in turn. Correspondingly, the terminal switches the LCH in the LCH group for task retransmission according to the mapping order.

[0168] For example, taking the first condition that the task transmission on the current retransmission LCH is completed as an example, for example, it is determined that the first LCH for task retransmission is LCH1, when task 1 on LCH1 is completed, the LCH for task retransmission is switched to LCH2 to transmit task 2 mapped on LCH2. Then, when task 2 on LCH2 is completed, the LCH for task retransmission is switched to LCH3. When task 3 on LCH3 is completed, the LCH for task retransmission is switched to LCH1. When task 4 on LCH1 is completed, the LCH for task retransmission is switched to the corresponding LCH, and so on. That is, the order of task queuing is: LCH1->LCH2->LCH3->LCH1…, and the order of task dequeuing (switching the retransmission LCH) in the LCP is also: LCH1->LCH2->LCH3->LCH1…

[0169] For example, the order of task queuing is: LCH1->LCH2->LCH3->LCH4->LCH5, and in terms of task dequeuing, the LCP also switches the retransmission LCH in the LCH group in the order of LCH1->LCH2->LCH3->LCH4->LCH5. If an empty LCH is encountered, for example, LCH5 is empty, then the next LCH in the mapping order can be jumped to until the first non-empty LCH is encountered, or the current LCH is returned.

[0170] In this way, the LCH that maps the task first will perform task retransmission first. For example, the first LCH1 that maps the task performs task retransmission first. The second LCH2 that maps the task performs task retransmission second. This can enable the task that is mapped earlier to be transmitted earlier, and implement the "first-in first-out" of the task.

[0171] Alternatively, as another possible implementation, the first condition is satisfied, and the logical channel for task retransmission is determined as the third logical channel of the N logical channels, which can be implemented as: if the first condition is satisfied, the logical channel for task retransmission is determined as the third logical channel according to the first order; wherein according to the first order, the third logical channel is in sequence after the fourth logical channel.

[0172] For example, as shown in FIG. 6, the first order (round-robin order) of the LCHs is LCH1 -> LCH2 -> LCH3 -> LCH1 -> LCH2 -> LCH3…, which means that the terminal will map the multiple tasks arriving in time sequence to LCH1, LCH2, LCH3, LCH1, LCH2, LCH3… in turn. Correspondingly, the terminal switches the LCH for task new transmission according to the round-robin order.

[0173] For example, taking the first condition that the task transmission on the current LCH for new transmission is completed as an example, it is determined that the first LCH for task new transmission is LCH1, when task 1 on LCH1 is transmitted, the LCH for task new transmission is switched to LCH2. Then, when task 2 on LCH2 is transmitted, the LCH for task new transmission is switched to LCH3. When task 3 on LCH3 is transmitted, the LCH for task new transmission is switched to LCH1. When task 4 on LCH1 is transmitted, the LCH for task new transmission is switched to LCH2. When task 5 on LCH2 is transmitted, the LCH for task new transmission is switched to LCH3. And so on.

[0174] FIG. 7 takes the example that the data mapped on LCH4 and LCH5 is non-task-level data. In other examples, the data mapped on LCH4 and LCH5 can be tasks. For example, the second service has one task mapped on LCH4 and LCH5 respectively. During LCP, at most one LCH in the group to which LCH4 and LCH5 belong participates in LCP. For example, during LCP performed by the terminal, LCH1 in the LCH group associated with the first service and LCH4 in the LCH group associated with the second service participate in LCP.

[0175] Compared with the related art in which the PBR value of the LCH of a certain service is large, causing the data of the service to be concentrated and transmitted within a time period, and other services cannot be performed, the scheme of the embodiments of the present application disperses multiple tasks of the first service to be completed within a time period. For example, corresponding to one LCP, the data of photo 1 is transmitted, and corresponding to the next LCP, the data of photo 2 is transmitted. That is, the photos are dispersed and transmitted within different sub-periods within the allowed 2S time delay budget. During LCP, the corresponding task does not occupy too many resources in each sub-period. For example, during one LCP, the terminal allocates resources for photo 1 according to the Bj value of the LCH mapping photo 1. And, allocates resources for other service data (such as instant messaging data) according to the Bj value of the LCH of the data.

[0176] In the above example, only one LCH in the group participates in LCP each time. In another embodiment, multiple LCHs can participate in LCP each time. As long as the M tasks can be dispersed for transmission. For example, the terminal maps task 1-task 3 of the first service to LCH1-LCH3 respectively. At a certain LCP, there is more uplink resource, and the data amount of the second service on LCH4 and LCH5 is small, so LCH1, LCH2, LCH4 and LCH5 all participate in this LCP. For another example, at a certain LCP, there is less uplink resource, and the priority of the data of the second service on LCH4 and LCH5 is high, so LCH1, LCH4 and LCH5 participate in this LCP.

[0177] The embodiment of the present application also provides a data transmission method, and the terminal can retransmit the failed task by using a certain method to meet the data transmission requirement. As follows, the retransmission method is introduced:

[0178] As a possible implementation manner, at a first time, a fourth logical channel in the N logical channels performs new transmission of a first task. The terminal acquires a first resource; at a second time, the terminal determines that the logical channel performing new transmission of the task is a third logical channel in the N logical channels. That is, the terminal switches the LCH performing new transmission of the task from the fourth LCH to the third LCH.

[0179] In some cases, if the first task of the fourth LCH fails to be transmitted, the terminal determines that the retransmission data of the first task of the fourth LCH has priority to use the first resource compared with the new transmission data of the third LCH. It can be understood that the priority of the retransmission data is higher than that of the new transmission data.

[0180] Optionally, the first resource is acquired by the terminal from a network device. The first resource can be used to send the task in uplink.

[0181] In this way, if a certain LCH in the LCH group has a retransmission requirement, the retransmission data has priority to use the uplink resource compared with the new transmission data. For example, as shown in (a) of FIG. 6, task 1 is mapped on LCH1, and the terminal switches the new transmission LCH to LCH2 after transmitting the new transmission data of task 1 of LCH1. Then, the terminal determines that the new transmission of task 1 fails, and the retransmission data of task 1 (an example of the first task) on LCH1 can have priority to use the first resource compared with the new transmission data of task 2 on LCH2. For example, the first resource has 100MB, and the retransmission data of task 1 needs to use 80MB, so the new transmission data of task 2 can use the remaining 20MB of the first resource. For another example, the first resource has 50MB, and the first resource is used for task 1.

[0182] In this way, the terminal can retransmit the data of task 1 through LCH1.

[0183] Considering the urgency and importance of the retransmission data, the retransmission data can be given priority over the new transmission data to use the first resource by using the method, so that the terminal can use the first resource to transmit important retransmission data first, which helps to improve the data transmission quality of the terminal.

[0184] As another possible implementation, if the first task transmission of the fourth logical channel fails, the retransmission data of the first task and the first information are sent through the third logical channel, and the first information indicates that the retransmission data belongs to the fourth logical channel.

[0185] In this way, the terminal uses the LCH of the new transmission for retransmission. For example, the retransmission data of LCH1 and the first information are sent by using LCH2, and the first information indicates that the retransmission data belongs to LCH1. After the receiving end receives the retransmission data and the first information through LCH2, the retransmission data is sent to LCH1 according to the first information.

[0186] The embodiments of the present application also provide a data transmission method, and the terminal can update the value of the corresponding parameter of the LCH to ensure the accuracy of the value of the parameter.

[0187] As a possible implementation, after the new transmission of the first task is performed through the third logical channel of the N logical channels, the terminal can update the value of the first parameter of the third logical channel to the first value. The updated value of the first parameter is the current value of the first parameter minus the second value, and the second value is the amount of resources used for transmitting the first task.

[0188] Optionally, the first parameter includes Bj.

[0189] Optionally, the first parameter of the second logical channel is determined according to the first parameter of each logical channel of the N logical channels; and the first parameter is related to the LCP.

[0190] Optionally, the first parameter of the second logical channel is determined according to the first parameter of each logical channel of the N logical channels, which can be implemented as follows: the value of the first parameter of the second logical channel is the sum of the values of the first parameters of each logical channel of the N logical channels. For example, as shown in (b) of FIG. 7, N=3, and the LCH group associated with service A includes LCH1-LCH3. The Bj value of LCH1 can be the sum of the Bj values of LCH1, LCH2, and LCH3.

[0191] Alternatively, the first parameter of the second logical channel is the first parameter of itself. As still shown in (b) of FIG. 7, the Bj value of LCH1 is the Bj value of LCH1. In one or more embodiments of the present disclosure, in the scheme using Bj of LCH, the Bj value of the LCH (denoted as Bj self) or the sum of Bj values of all LCHs in the group in which the LCH is located (denoted as Bj total) can be used. For example, in the first round of resource allocation of LCP, the terminal can perform LCP according to Bj total of LCHs in the group, Bj of LCH4 outside the group, and Bj of LCH5 outside the group.

[0192] As described above, when data of one LCH participates in group packet, the terminal needs to update the Bj value of the LCH. The new Bj value is the old Bj value minus the amount of data of the LCH participating in the group packet. As a possible implementation, the amount of data of the LCH participating in the group packet is less than or equal to the Bj corresponding to the LCH. This method can be referred to as method 1. Alternatively, the amount of data of the LCH participating in the group packet is less than or equal to the sum of Bj values corresponding to LCHs in the group in which the LCH is located. This method can be referred to as method 2.

[0193] For example, there are two LCHs in the LCH group associated with the first service, where LCH1 (Bj1 = 10) and LCH2 (Bj2 = 5). Assuming that at this time LCH1 performs task new transmission, LCH1 participates in LCP with other LCHs outside the group to compete for resources. According to method 1, in the case of sufficient uplink resources, the terminal allocates a resource amount (such as 10 MB) matching the Bj size for the task on LCH1, so that 10 MB of data in LCH1 participates in group packet. Moreover, the terminal deducts 10 from the Bj value of LCH1 to update the Bj value.

[0194] According to method 2, in the case of sufficient uplink resources, the terminal allocates a resource amount (such as 15 MB) matching the sum of Bj to the task on LCH1, so that 15 MB of data in LCH1 participates in group packet. Through method 2, the task on LCH1 can obtain more resources, so that the data in LCH1 can be transmitted faster.

[0195] In method 2, 15 MB of data in LCH1 participates in group packet, so the terminal can deduct 15 from the Bj value of LCH1 to update the Bj value of LCH1. The new Bj1 value is: 10-15 = -5. In this example, the Bj used by LCH1 to participate in LCP is 15. That is, when LCH1 participates in LCP, it borrows tokens of other LCHs (such as LCH2) in the group.

[0196] Afterwards, when the new transmission LCH switches to LCH2, assuming that Bj2 of LCH2 continues to accumulate to 7 during the period, the Bj used by LCH2 in LCP is: -5+7=2. That is, LCH2 accumulates 7 tokens by itself, and LCH2 lends 5 tokens to LCH1, so the total available tokens in the group are 2. In the case of sufficient uplink resources, the terminal allocates resources corresponding to 2 tokens to the new transmission task on LCH2.

[0197] In some cases, LCH1 needs to retransmit when LCH2 transmits newly. In the above example, the Bj value of LCH1 is negative (-5) when LCH2 transmits newly. If the traditional LCP mechanism is followed, LCH1 cannot obtain resources in the first round of resource allocation and has to wait for the second round of resource allocation. In some cases, the resources may have been allocated in the first round of resource allocation, resulting in LCH1 failing to obtain resources and LCH1 retransmission lagging.

[0198] In view of this, in the embodiments of the present application, the Bj value of the LCH in the group is not considered, but it is specified that the retransmission data in the group is superior to the new transmission data. Still following the above example, assuming that the Bj used by LCH2 in LCP is 2 when switching to LCH2 to participate in LCP. Therefore, in the first round of resource allocation, if the uplink resources are sufficient, LCH2 can obtain the resource amount corresponding to 2 tokens. The resources corresponding to the 2 tokens are preferentially used for LCH1 retransmission. Assuming that LCH1 uses the resources corresponding to 1 token for retransmission, LCH2 can use the resources corresponding to the remaining 1 token.

[0199] Among them, the updating method of Bj is that the Bj of LCH1 is updated to: -5-1=-6; and the Bj of LCH2 is updated to: 7-1=6.

[0200] Next, an application example of the method of the embodiments of the present application is given as follows.

[0201] The map, scene, etc. in the game need real-time cloud rendering. In some cases, the user may want to switch the scene or map. For example, the user starts to select map A, and the application sends the data of map A to the terminal, and then the terminal sends the data of map A to the cloud. In the process, the user wants to switch to map B.

[0202] According to the traditional scheme, the data related to the game service are all mapped to the same LCH. After the data of map B is generated, the data of map A is no longer necessary to be transmitted. In the traditional scheme, the terminal can be instructed to delete the data of map A and transmit the data of map B through a discard instruction. However, the implementation complexity of this scheme is high, because the discard instruction may be carried in the data packet header, and the terminal cannot predict which data packet header carries the discard instruction, so the terminal needs to check each data packet received from the application to determine whether the corresponding packet is instructed to be discarded.

[0203] In view of this, the scheme of the embodiments of the present application can be adopted, and data of different maps are respectively mapped to different LCHs. For example, as shown in FIG. 8, data of map A is mapped to LCH1, and when a user wants to switch to map B, data of map B is mapped to LCH2. When the terminal perceives that there is data on LCH2 and there is also data on LCH1, it is known that map switching has occurred. Then, the data on LCH1 belongs to outdated data, and the terminal can directly empty the data on LCH1. In this method, there is no need for an additional discard indication to instruct the terminal to delete the data of map A on LCH1, and the terminal also does not need to check each data packet to determine when it needs to be discarded.

[0204] In other scenarios, for the purpose of reliability, after the terminal sends a task, it expects the other party to reply with a reception status report. In the related art, the status report is not sent at any time, but is triggered based on certain trigger conditions. For example, the trigger condition is that when the data of the corresponding LCH on the terminal is empty, the terminal triggers a request for a status report to the base station.

[0205] According to the conventional scheme, task 1 and task 2 of service A are mapped to one LCH. Even if task 1 on LCH1 is transmitted, since task 2 is still in the cache, the data of LCH1 is not empty, and the terminal does not trigger a request for a status report to the base station. It can be seen that this scheme can only trigger the acquisition of a status report after all the tasks on the LCH are emptied, and cannot achieve "task-by-task status report".

[0206] Unlike this, according to the scheme of the embodiments of the present application, at any moment, only one task is cached or processed on one LCH. Therefore, when one task on the LCH is transmitted, according to the related art, a status report is naturally triggered. It can achieve "task-by-task status report".

[0207] The features, structures, or characteristics of the embodiments of the present application can be combined in any suitable manner in one or more embodiments. In various embodiments of the present application, the magnitude of the serial number of each process does not mean the order of execution, and the execution order of each process should be determined according to its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0208] For example, the order of some steps in the claims can be adjusted unless specially limited, and the order is not limited.

[0209] In the embodiments of this application, the same or similar parts among various embodiments can be mutually referred to, unless otherwise specified. In various embodiments of this application, the terms and / or descriptions of different embodiments are consistent and can be mutually referred to, unless otherwise specified and logically conflicted. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship. The implementation manners of this application do not constitute a limitation on the protection scope of this application.

[0210] In addition, some steps in the method embodiments can be equivalently replaced by other possible steps. Alternatively, some steps in the method embodiments can be optional and can be deleted in some use scenarios. Alternatively, other possible steps can be added in the method embodiments.

[0211] For example, the method shown in FIG. 3 can be combined with any of the mapping methods (enqueuing methods) for mapping M tasks to N LCHs provided in the embodiments of this application. For another example, any enqueuing method can be used in combination with a corresponding dequeuing method. For another example, any enqueuing method, corresponding dequeuing method, can be used in combination with any retransmission method. Any of the above methods can be used in combination with a method for updating the parameters (such as Bj value) of LCH.

[0212] For example, the terminal in the embodiments of this application can be implemented by the communication device in FIG. 9. FIG. 9 shows a hardware structure schematic diagram of the communication device provided in the embodiments of this application. The communication device 400 includes at least one processor 401, a memory 403 and at least one communication interface 404.

[0213] The processor 401 can be a central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of programs of the solutions of this application.

[0214] Optionally, the communication device can include a communication line, which can include a path for transmitting information between corresponding components of the device.

[0215] The communication interface 404 uses any transceiver-like device for communicating with other devices or communication networks, such as Ethernet, RAN, wireless local area networks (WLAN), etc.

[0216] The memory 403 can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disk storage, a magnetic disk storage or other magnetic storage devices, or any other medium capable of storing desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to this. The memory can exist independently, and be connected to the processor through a communication line. The memory can also be integrated with the processor.

[0217] The memory 403 is configured to store computer-executable instructions for implementing the solutions of the present application, and the processor 401 is configured to execute the computer-executable instructions stored in the memory 403.

[0218] Optionally, the computer-executable instructions in the embodiments of the present application can also be referred to as application program codes, and the embodiments of the present application are not limited in this regard.

[0219] In a specific implementation, as an example, the processor 401 can include one or more CPUs, such as CPU0 and CPU1 in FIG. 9.

[0220] In a specific implementation, as an example, the communication apparatus 400 can include multiple processors, such as the processor 401 and the processor 408 in FIG. 9. Each of these processors can be a single-CPU processor or a multi-CPU processor. The processor herein can refer to one or more devices, circuits, and / or processing cores for processing data (for example, computer program instructions).

[0221] The structure shown in FIG. 9 is only an example, and the communication apparatus can also include more or fewer components, or other component layout manners, which are not limited. For example, the communication apparatus can include a processor implemented in hardware, or the processor implemented in a program calling manner. Or the communication apparatus includes a processor and a memory. Or the communication apparatus includes a processor and a communication interface.

[0222] It can be understood that, in order to implement the above functions, the device in the embodiments of the present application comprises a hardware structure and / or a software module corresponding to the execution of each function. The units and algorithm steps of the examples described in conjunction with the embodiments disclosed in the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is implemented in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the technical solutions of the embodiments of the present application.

[0223] The embodiments of the present application can divide the functional units of the device / apparatus according to the above method examples. For example, each functional unit can be divided according to each function, or two or more functions can be integrated into one processing unit. The integrated unit can be implemented in the form of hardware or software functional unit. It should be noted that the division of units in the embodiments of the present application is illustrative, and is only a logical function division. Actual implementation can have another division method.

[0224] The embodiments of the present application provide a device, which can be the first terminal or other device or corresponding component. The device can include a memory and one or more processors. The memory and the processor are coupled. The memory is configured to store computer program code, which includes computer instructions. When the processor executes the computer instructions, the device can perform each function or step corresponding to the execution of the device in the above method embodiments. The structure of the device can refer to the structure of the device (communication device) shown in FIG. 9.

[0225] The core structure of the device (communication device) can be represented as the structure shown in FIG. 10, which includes a processing module 1301 and a storage module 1303.

[0226] The processing module 1301 (also referred to as a processing unit) can include at least one of a central processing unit (CPU), an application processor (AP), or a communication processor (CP) or an AI processor, such as the processor 401 and / or 408 shown in FIG. 9. The processing module 1301 can perform operations or data processing related to the control and / or communication of at least one of the other elements of the user communication device.

[0227] The storage module 1303 can include a volatile memory and / or a non-volatile memory. The storage module is configured to store instructions or data related to at least one of the other modules of the device. For example, it can be implemented as the memory 403 shown in FIG. 9.

[0228] Optionally, the communication module 1305 (also referred to as a communication unit) is further included to support the device to communicate with other devices (through a communication network). For example, the communication module can be connected to a network via wireless communication or wired communication to communicate with other devices. The wireless communication can employ at least one of cellular communication protocols, such as Long Term Evolution (LTE), Long Term Evolution-Advanced (LTE-A), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), Universal Mobile Telecommunication System (UMTS), Wireless Broadband (WiBro), or Global System for Mobile Communications (GSM). The wireless communication can include, for example, short-range communication. The short-range communication can include at least one of Wireless-Fidelity (Wi-Fi), Bluetooth, Near Field Communication (NFC), Magnetic Stripe Transmission (MST), or GNSS. For example, the communication module can be implemented as the communication interface 404 of FIG. 9.

[0229] The embodiments of the present application further provide a chip system including at least one processor and at least one interface circuit. The processor and the interface circuit can be interconnected by a line. For example, the interface circuit can be used to receive a signal from another device (e.g., a memory of a communication device). For another example, the interface circuit can be used to send a signal to another device (e.g., a processor). Illustratively, the interface circuit can read an instruction stored in a memory and send the instruction to the processor. When the instruction is executed by the processor, the communication device can be caused to perform various steps in the above-described embodiments. Of course, the chip system can further include other discrete devices, which are not specifically limited in the embodiments of the present application.

[0230] The embodiments of the present application further provide a computer storage medium including computer instructions, which, when executed on the above-described communication device, cause the communication device to perform various functions or steps performed by a mobile phone in the above-described method embodiments.

[0231] The embodiments of the present application further provide a computer program product, which, when executed on a computer, causes the computer to perform various functions or steps performed by a mobile phone in the above-described method embodiments.

[0232] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the convenience and brevity of description, only the division of the above functional modules is taken as an example for illustration, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the above-described functions.

[0233] In several embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented in other manners. For example, the division of the apparatus embodiments is merely an example, and the division of the modules or units can be different, for example, multiple modules or units can be combined or integrated into another apparatus, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections can be indirect couplings or communication connections through some interfaces, apparatuses or units, and can be in electrical, mechanical or other forms.

[0234] The units described as separate components may or may not be physically separate, and the components shown as units may be one physical unit or multiple physical units, i.e., may be located in one place, or may be distributed in multiple different places. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiments.

[0235] In addition, each functional unit in the various embodiments of the present application can be integrated into one processing unit, or each unit can be physically present separately, or two or more units can be integrated into one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0236] If the integrated unit is realized in the form of a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present application essentially or the parts that make contributions to the prior art or the whole or part of the technical solutions can be embodied in the form of a software product, which is stored in a storage medium, includes several instructions to make a device (which can be a single chip, a chip, etc.) or a processor execute all or part of the steps of the various embodiments of the method of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0237] The above is merely a specific implementation of the present application, but the protection scope of the present application is not limited thereto, and any changes or replacements within the technical scope disclosed in the present application should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A data transmission method, characterized by, Comprising: mapping M tasks of a first service to N logical channels, M, N are positive integers greater than or equal to 2; each of the M tasks comprises one or more packets; performing logical channel priority (LCP), the logical channels performing LCP include L logical channels of the N logical channels, L is a positive integer less than or equal to N.

2. The method of claim 1, wherein, All packets of a task of the M tasks are mapped to a logical channel of the N logical channels.

3. The method according to claim 1 or 2, characterized in that, N tasks of the M are mapped to the N logical channels sorted in a first order.

4. The method of claim 3, wherein, M is greater than N, the N+1 task of the M tasks is mapped to the first logical channel sorted in the first order among the N logical channels.

5. The method according to claim 3 or 4, characterized in that, Further comprising: when a second task of the M tasks arrives, mapping the second task to the first empty logical channel sorted in the first order among the N logical channels; or, mapping the second task to the first empty logical channel starting from the first logical channel sorted in the first order among the N logical channels; the first logical channel is the latest mapped task logical channel sorted in the first order among the N logical channels; recording the mapping order of the N logical channels; wherein the mapping order of the logical channel with earlier mapping time is prior to the logical channel with later mapping time.

6. The method according to any one of claims 1 to 5, characterized in that, The first parameter of a second logical channel is determined according to the first parameter of each logical channel of the N logical channels; the first parameter is related to LCP; the second logical channel is any logical channel of the N logical channels.

7. The method of claim 6, wherein, The first parameter of the second logical channel is determined according to the first parameter of each logical channel of the N logical channels, including: the value of the first parameter of the second logical channel is the sum of the values of the first parameters of each logical channel of the N logical channels.

8. The method according to any one of claims 1 to 7, characterized in that, When performing LCP, at most one logical channel of the N logical channels performs new transmission of tasks.

9. The method according to any one of claims 1 to 8, characterized in that, Further comprising: when the first condition is met, determining that the logical channel performing new transmission of tasks is a third logical channel of the N logical channels; the first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; the new transmission of the first task on the fourth logical channel is completed, and the current LCP is ended.

10. The method of claim 5, wherein, When the first condition is met, determining that the logical channel performing new transmission of tasks is a third logical channel of the N logical channels, including: if the first condition is met, determining that the logical channel performing new transmission of tasks is the third logical channel according to the mapping order of the N logical channels; the mapping order of the third logical channel is after that of the fourth logical channel; the first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; the new transmission of the first task on the fourth logical channel is completed, and the current LCP is ended.

11. The method of claim 3 or 4, wherein, When the first condition is met, determining that the logical channel performing new transmission of tasks is a third logical channel of the N logical channels, including: If the first condition is met, the logical channel performing the new transmission of the task is determined to be the third logical channel according to the first order; The third logical channel is after the fourth logical channel according to the first order; The first condition includes at least one of the following conditions: the new transmission of the first task on the fourth logical channel is completed; the new transmission of the first task on the fourth logical channel is completed, and the current LCP is ended.

12. The method according to any one of claims 1 to 11, characterized in that, At the first time, the fourth logical channel of the N logical channels performs the new transmission of the first task, further comprising: Obtaining a first resource; Determining the logical channel performing the new transmission of the task to be the third logical channel of the N logical channels; If the first task transmission of the fourth logical channel fails, the retransmission data of the first task is determined to be used preferentially compared with the new transmission data of the third logical channel.

13. The method according to any one of claims 1 to 11, characterized in that, At the first time, the fourth logical channel of the N logical channels performs the new transmission of the first task, further comprising: Obtaining a first resource; Determining the logical channel performing the new transmission of the task to be the third logical channel of the N logical channels; If the first task transmission of the fourth logical channel fails, the retransmission data of the first task and first information are sent through the third logical channel, and the first information indicates that the retransmission data belongs to the fourth logical channel.

14. The method according to any one of claims 1 to 13, characterized in that, After the third logical channel of the N logical channels performs the new transmission of the first task, further comprising: The value of the first parameter of the third logical channel is updated to a first value; the updated value of the first parameter is the current value of the first parameter minus a second value, and the second value is the resource amount used for transmitting the first task.

15. The method according to any one of claims 1 to 14, characterized in that, The first parameter includes Bj.

16. A computer-readable storage medium, characterized in that, The program or instructions, when executed, implement the method of any one of claims 1 to 15.

17. A computer program product, characterised in that, The computer program product, when executed on a communication device, causes the communication device to perform the method of any one of claims 1 to 15.

18. A communications device, characterized by The circuit system includes a processing circuit configured to perform the method of any one of claims 1 to 15.

19. A circuit system, characterized by The circuit system includes a processing circuit configured to perform the method of any one of claims 1 to 15.

20. A communication device / chip, characterized in that, The circuit system includes a processing circuit configured to perform the method of any one of claims 1 to 15.

Images