WO2021109143A1 - 上行数据传输的控制方法和装置 - Google Patents

上行数据传输的控制方法和装置 Download PDF

Info

Publication number
WO2021109143A1
WO2021109143A1 PCT/CN2019/123761 CN2019123761W WO2021109143A1 WO 2021109143 A1 WO2021109143 A1 WO 2021109143A1 CN 2019123761 W CN2019123761 W CN 2019123761W WO 2021109143 A1 WO2021109143 A1 WO 2021109143A1
Authority
WO
WIPO (PCT)
Prior art keywords
logical channel
bit rate
uplink
terminal device
sdu
Prior art date
Application number
PCT/CN2019/123761
Other languages
English (en)
French (fr)
Inventor
孙飞
罗海燕
戴明增
王君
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN201980101987.7A priority Critical patent/CN114642051A/zh
Priority to EP19954790.2A priority patent/EP4057735A4/en
Priority to PCT/CN2019/123761 priority patent/WO2021109143A1/zh
Publication of WO2021109143A1 publication Critical patent/WO2021109143A1/zh
Priority to US17/832,294 priority patent/US20220295334A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0252—Traffic management, e.g. flow control or congestion control per individual bearer or channel
    • H04W28/0257—Traffic management, e.g. flow control or congestion control per individual bearer or channel the individual bearer or channel having a maximum bit rate or a bit rate guarantee
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543—Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0268—Traffic management, e.g. flow control or congestion control using specific QoS parameters for wireless networks, e.g. QoS class identifier [QCI] or guaranteed bit rate [GBR]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1268—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient

Definitions

  • This application relates to the field of communications, and more specifically, to a method and device for controlling uplink data transmission.
  • the present application provides a method and device for controlling uplink data transmission, in order to reduce the risk of network congestion.
  • a method for controlling uplink data transmission including: a terminal device receives first information from a network device, where the first information is used to indicate the maximum uplink bit rate of each logical channel in at least one logical channel; The terminal device allocates uplink resources to all or part of the at least one logical channel based on the maximum uplink bit rate.
  • the maximum uplink bit rate of a logical channel represents the upper limit of the bit rate of uplink transmission of the logical channel.
  • the foregoing first information may be sent by a network device through radio resource control (radio resource control, RRC) signaling, for example, a LogicalChannelConfig information element.
  • RRC radio resource control
  • the above-mentioned first information may carry the maximum uplink bit rate, and may also carry the maximum amount of data that can be transmitted uplink within a specific period of time, and the maximum amount of data that can be transmitted uplink within the specific period of time and the maximum uplink bit rate are mutually convertible.
  • the network device indicates the maximum uplink bit rate of at least one logical channel to the terminal device, so that the terminal device allocates uplink resources for the logical channel based on the maximum uplink bit rate limit, so that the terminal can be When the device performs uplink transmission, it realizes the rate control of the logical channel. It should be understood that for a logical channel, if the terminal device allocates more uplink resources for the logical channel, the uplink bit rate of the logical channel is higher. If the terminal device allocates less uplink resources for the logical channel, the logical channel The uplink bit rate of the channel is low.
  • the terminal device can allocate uplink resources for the logical channel based on the maximum uplink bit rate of the logical channel, thereby controlling the uplink bit rate of the logical channel not to exceed the maximum uplink bit rate of the logical channel , Thereby helping to reduce the risk of network congestion.
  • the method in the embodiment of the present application is mainly applicable to a logical channel corresponding to a data radio bearer (DRB), that is, the above-mentioned at least one logical channel is a logical channel corresponding to the DRB.
  • DRB data radio bearer
  • the aforementioned at least one logical channel corresponds to one network slice.
  • the sum of the maximum uplink bit rate of all logical channels corresponding to a network slice may be less than or equal to the maximum uplink bit rate of the network slice.
  • the network device configures the maximum uplink bit rate of the logical channel for the terminal device to ensure that the sum of the maximum uplink bit rate of all logical channels corresponding to a network slice is less than or equal to that in the network slice
  • the maximum uplink bit rate in the network slice can be used to control the uplink transmission rate of the terminal device in the network slice, which is beneficial to avoid the problem of overloading the uplink transmission rate in the network slice when the terminal device performs uplink data transmission, and further reduces the risk of network congestion.
  • the aforementioned at least one logical channel may correspond to one network slice.
  • the network device may indicate the maximum uplink bit rate of the at least one logical channel to the terminal device through the foregoing first information. It should be understood that the maximum uplink bit rate of a logical channel is for a single logical channel, and the maximum uplink bit rate of a logical channel represents the upper limit of the bit rate of uplink transmission of the logical channel.
  • the maximum uplink bit rate of a network slice is for a single network slice, and the maximum uplink bit rate of a network slice represents the upper limit of the uplink transmission bit rate of all logical channels corresponding to the network slice.
  • the aforementioned at least one logical channel corresponds to one protocol data unit PDU session.
  • the sum of the maximum uplink bit rate of all logical channels corresponding to a PDU session may be less than or equal to the maximum uplink bit rate of the PDU session. It should be understood that the maximum uplink bit rate of a PDU session is for a single PDU session, and the maximum uplink bit rate of a PDU session represents the upper limit of the bit rate of uplink transmission of all logical channels corresponding to the PDU session.
  • the network device configures the maximum uplink bit rate of the logical channel for the terminal device to ensure that the sum of the maximum uplink bit rate of all logical channels corresponding to a PDU session is less than or equal to that of the PDU session.
  • the maximum uplink bit rate realizes the control of the uplink transmission rate of the terminal device in the PDU session, which is beneficial to avoid the problem of overloading the uplink transmission rate in the PDU session when the terminal device performs uplink data transmission, and reduces the risk of network congestion.
  • the terminal device allocates uplink resources for all or part of the at least one logical channel based on the maximum uplink bit rate, including: the terminal device based on the at least one logical channel The priority bit rate and the maximum uplink bit rate allocate uplink resources to all or part of the logical channels in the at least one logical channel.
  • the maximum uplink bit rate of the logical channel is the upper limit of the bit rate of the uplink transmission of the logical channel
  • the maximum uplink bit rate of a logical channel may be greater than or equal to the priority bit rate of the logical channel.
  • the terminal device allocates uplink resources to all or part of the at least one logical channel based on the priority bit rate and the maximum uplink bit rate of the logical channel, including: : The terminal device allocates uplink resources to the at least one logical channel based on the priority bit rate of the logical channel; if there are remaining uplink resources and the first logical channel of the at least one logical channel still has data to be transmitted, the terminal device Based on the maximum uplink bit rate of the first logical channel, the remaining uplink resources are allocated until any one of the following conditions is met: the first logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the first logical channel is exhausted. The uplink bit rate of the logical channel reaches the maximum uplink bit rate of the first logical channel.
  • the terminal device can refer to the token bucket algorithm to allocate uplink resources for the logical channel. That is, the terminal device can first perform the first round of allocation, and allocate uplink resources for the logical channel based on the priority bit rate of the logical channel until any one of the following conditions is met: the uplink bit rate of the logical channel reaches the logical channel's Priority bit rate restriction, or exhaustion of uplink resources. After the first round of allocation, from a time average point of view, the uplink bit rate of the logical channel is less than or equal to the priority bit rate of the logical channel.
  • the terminal device can refer to the priority bit rates of the multiple logical channels and allocate uplink resources for the multiple logical channels in the order of decreasing priority until any of the following conditions To meet the requirements: the uplink bit rates of the multiple logical channels have reached the limit of their respective priority bit rates, or the uplink resources are exhausted, so that from the perspective of time average, the uplink bit rates of the multiple logical channels are less than or equal to their respective priority bit rates.
  • the priority bit rate is the priority bit rates of the multiple logical channels and allocate uplink resources for the multiple logical channels in the order of decreasing priority until any of the following conditions.
  • the terminal device may perform the second round of allocation.
  • the first logical channel is a logical channel whose uplink bit rate is less than the maximum uplink bit rate of the logical channel among the logical channels that still have data to be transmitted. For all logical channels that have reached the maximum uplink bit rate in the first round of allocation, no matter whether there is still data to be sent, the second round of allocation is not performed.
  • the terminal device can allocate the remaining uplink resources based on the maximum uplink bit rate of the first logical channel, that is, the UMBR of the first logical channel, until any one of the following conditions is met: the first logical channel has no data to be transmitted Or the remaining uplink resources are exhausted, so that the uplink bit rate of the first logical channel is less than or equal to the UMBR of the first logical channel from a time average perspective.
  • the foregoing first logical channel may be one logical channel, or may include multiple logical channels.
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the first logical channel, including: if the first logical channel is not multiplexed into the protocol The sum of the uplink bit rate of the first service data unit SDU of the data unit PDU and the uplink bit rate of the second SDU in the first logical channel that has been multiplexed into the PDU is less than or equal to the maximum uplink bit rate of the first logical channel , The terminal device multiplexes the first SDU to the PDU.
  • the terminal device when the terminal device allocates uplink resources, it can try not to segment the SDU, which can limit the uplink transmission rate of the logical channel to not exceed the upper limit of the logical channel transmission rate, reduce the risk of network congestion, and simplify some unnecessary Process, improve the efficiency of resource allocation of terminal equipment.
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the first logical channel, including: if the first logical channel is not multiplexed into PDU The sum of the uplink bit rate of the first SDU in the first logical channel and the uplink bit rate of the second SDU that has been multiplexed into the PDU in the first logical channel is greater than the maximum uplink bit rate of the first logical channel. Perform segmentation processing to obtain the first sub-SDU, and multiplex the first sub-SDU into the PDU.
  • the terminal device can segment the SDU to obtain sub-SDUs, so that the maximum uplink bit rate of the first logical channel can be met. Next, multiplex the segmented sub-SDU into the PDU. In other words, for a larger SDU, the terminal device can perform multiplexing through segmentation operations, thereby increasing the amount of uplink transmission data of the first logical channel.
  • the terminal device can multiplex a larger SDU segment into the PDU as much as possible, that is, after multiplexing the segmented sub-SDU into the PDU as much as possible, the cumulative uplink bit rate of the third network slice is equal to The maximum uplink bit rate of the third network slice, thereby maximizing the data transmission of the logical channel.
  • the first logical channel includes at least two logical channels
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the first logical channel, including: Based on the maximum uplink bit rates of the at least two logical channels, the terminal device allocates the remaining uplink resources in the descending order of the priorities of the at least two logical channels until any one of the following conditions is met: The logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the uplink bit rate of the at least two logical channels reaches the limit of the maximum uplink bit rate of the at least two logical channels.
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the at least two logical channels and according to the descending order of the priority of the at least two logical channels , Including: if the sum of the uplink bit rate of the third SDU that is not multiplexed into the PDU in the second logical channel and the uplink bit rate of the fourth SDU that has been multiplexed into the PDU in the second logical channel is less than or equal to For the maximum uplink bit rate of the second logical channel, the terminal device multiplexes the third SDU to the PDU, and the second logical channel is the logical channel with the highest priority among the at least two logical channels.
  • the terminal device when the terminal device allocates uplink resources, it can try not to segment the SDU, which can limit the uplink transmission rate of the logical channel to not exceed the upper limit of the logical channel transmission rate, reduce the risk of network congestion, and simplify some unnecessary Process, improve the efficiency of resource allocation of terminal equipment.
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the at least two logical channels and according to the descending order of the priority of the at least two logical channels , Including: if the sum of the uplink bit rate of the third SDU that is not multiplexed into the PDU in the second logical channel and the uplink bit rate of the fourth SDU that has been multiplexed into the PDU in the second logical channel is greater than the first For the maximum uplink bit rate of the second logical channel, the terminal device will segment the third SDU to obtain the third sub SDU, and multiplex the third sub SDU into the PDU.
  • the second logical channel is the at least two The logical channel with the highest priority among the logical channels.
  • the terminal device can segment the SDU to obtain sub-SDUs, so that the maximum uplink bit rate of the second logical channel can be met. Next, multiplex the segmented sub-SDU into the PDU. In other words, for a larger SDU, the terminal device can perform multiplexing through segmentation operations, thereby increasing the amount of uplink transmission data of the second logical channel.
  • the terminal device can multiplex a larger SDU segment into the PDU as much as possible, that is, after multiplexing the segmented sub-SDU into the PDU as much as possible, the cumulative uplink bit rate of the third network slice is equal to The maximum uplink bit rate of the third network slice, thereby maximizing the data transmission of the logical channel.
  • the terminal device After the terminal device allocates uplink resources for the second logical channel according to the above method, if there are still remaining uplink resources, the terminal device can continue to allocate uplink resources for the logical channel of the next priority.
  • the logical channel of the next priority refers to the Among the above-mentioned at least two logical channels, the second logical channel is the logical channel with the next priority.
  • another method for controlling uplink data transmission including: a network device determines first information, where the first information is used to indicate the maximum uplink bit rate of each logical channel in at least one logical channel; the network device Send the first information to the terminal device.
  • the method further includes: the network device receives a protocol data unit PDU from the terminal device, the The PDU includes data from all or part of the logical channels in at least one logical channel, and the data of all or part of the logical channels is multiplexed into the PDU based on the maximum uplink bit rate.
  • the PDU may be parsed to obtain the data of the logical channel.
  • the at least one logical channel corresponds to one network slice.
  • the at least one logical channel corresponds to one PDU session.
  • another method for controlling uplink data transmission including: the terminal device determines the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice, and the logical channel corresponds to the network slice; the terminal device is based on the logical channel The priority bit rate and the maximum uplink bit rate of the network slice are used to allocate uplink resources for the logical channel.
  • the terminal device allocates uplink resources based on the maximum uplink bit rate of the network slice to the logical channel to ensure that the sum of the uplink bit rates of all logical channels corresponding to a network slice is less than or equal to that of the network.
  • the maximum uplink bit rate in the slice realizes the control of the uplink transmission rate of the terminal device in the network slice, which helps avoid the problem of the uplink transmission rate overload in the network slice when the terminal device performs uplink data transmission, and reduces the risk of network congestion.
  • the foregoing logical channels may include one or more logical channels, and the one or more logical channels correspond to one or more network slices.
  • the three logical channels can correspond to two network slices, that is, logical channel 1 and logical channel 2 correspond to network slice 1.
  • Logical channel 3 corresponds to network slice 2.
  • the maximum uplink bit rate of a network slice is for a single network slice, and the maximum uplink bit rate of a network slice represents the upper limit of the bit rate of uplink transmission of all logical channels corresponding to the network slice.
  • the terminal device allocates uplink resources to the logical channel based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice, including: the terminal device allocates uplink resources to the logical channel based on the The priority bit rate of the logical channel and the maximum uplink bit rate of the network slice. Uplink resources are allocated for the logical channel until any one of the following conditions is met: the uplink bit rate of the logical channel reaches the priority bit rate of the logical channel Or the uplink bit rate of the network slice exceeds the maximum uplink bit rate of the network slice, or the uplink resources are exhausted.
  • the above-mentioned logical channel includes at least two logical channels
  • the terminal device is based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice as the logical channel
  • Allocating uplink resources includes: the terminal device allocates the at least two logical channels based on the priority bit rate of the at least two logical channels and the maximum uplink bit rate of the network slice according to the descending order of the priority of the at least two logical channels Uplink resources until any one of the following conditions is met: the uplink bit rates of the at least two logical channels both reach the limit of the priority bit rate of the at least two logical channels, or the network slices corresponding to the at least two logical channels The uplink bit rate reaches the limit of the uplink bit rate of the network slices corresponding to the at least two logical channels, or the uplink resources are exhausted.
  • the above allocation process is the first round of allocation, that is, the terminal device can refer to the new token bucket algorithm proposed in this application to allocate uplink resources for the logical channel, which can make the time average view of the multiple logical channels
  • the uplink bit rate is less than or equal to the respective priority bit rate, and from a time average perspective, the uplink bit rate of each network slice is less than or equal to the respective maximum uplink bit rate.
  • the terminal device is decremented according to the priority of the at least two logical channels based on the priority bit rate of the at least two logical channels and the maximum uplink bit rate of the network slice Sequence, allocating uplink resources for the at least two logical channels, including: in the case that the number of tokens corresponding to the first logical channel of the at least two logical channels is greater than 0, the terminal device determines that the at least two logical channels are After the first service data unit SDU of the first logical channel is multiplexed into the protocol data unit PDU, the cumulative uplink bit rate of the first network slice in the network slice corresponding to the first logical channel, and the first logical channel is The logical channel with the highest priority among the at least two logical channels; if the cumulative uplink bit rate of the first network slice is less than or equal to the maximum uplink bit rate of the first network slice, the terminal device multiplexes the first SDU to the PDU.
  • the terminal device is decremented according to the priority of the at least two logical channels based on the priority bit rate of the at least two logical channels and the maximum uplink bit rate of the network slice Sequence, allocating uplink resources for the at least two logical channels, including: in the case that the number of tokens corresponding to the first logical channel of the at least two logical channels is greater than 0, the terminal device determines that the at least two logical channels are After the first SDU of the first logical channel is multiplexed into the PDU, the cumulative uplink bit rate of the first network slice in the network slice corresponding to the first logical channel, and the first logical channel is the at least two logical channels The logical channel with the highest priority in the medium; if the cumulative uplink bit rate of the first network slice is greater than the maximum uplink bit rate of the first network slice, and the number of tokens corresponding to the second logical channel of the at least two logical channels is greater than 0.
  • the terminal device After the terminal device determines that the second SDU of the second logical channel is multiplexed into the PDU, the cumulative uplink bit rate of the second network slice in the network slice corresponding to the second logical channel, the second logical channel Is the logical channel with the next priority of the first logical channel among the at least two logical channels; if the cumulative uplink bit rate of the second network slice is less than or equal to the maximum uplink bit rate of the second network slice, the terminal device will The second SDU is multiplexed to the PDU.
  • the terminal device first allocates uplink resources to the first logical channel with the highest priority according to the descending order of the priority of the at least two logical channels. If the first logical channel corresponds to the first logical channel, the first logical channel is allocated uplink resources. The cumulative uplink bit rate of a network slice exceeds the limit of the maximum uplink bit rate of the first network slice, and the terminal device allocates uplink resources to the logical channel of the next priority (that is, the second logical channel).
  • first network slice corresponding to the first logical channel and the second network slice corresponding to the second logical channel may be the same or different. That is, the first logical channel and the second logical channel may correspond to the same network slice, and It can correspond to different network slices, which is not limited in the embodiment of the present application.
  • the cumulative uplink bit rate of the first network slice is based on the length of the sliding time window of the first network slice and the sliding time window of the first network slice.
  • the cumulative data volume in the sliding time window of the first network slice is determined by the cumulative data volume of the first network slice in the first time period from the current moment onwards, the data volume transmitted by all logical channels of the first network slice Sum, the length of the first time period is the length of the sliding time window.
  • the rate limit is the concept of average time, if it is for a single TTI, it is more restrictive and less flexible. Therefore, by setting a sliding time window, you can get the latest network within a period of time (which can include multiple TTIs)
  • the cumulative data volume of the slice is more conducive to realizing the limitation of the uplink bit rate of the network slice, and improving the calculation flexibility of the uplink bit rate of the network slice.
  • the length of the sliding time window of the network slice may be obtained in advance by the terminal device.
  • the length of the sliding time window of the network slice may be configured by the network device for the terminal device, or defined by the protocol, which is not limited in the embodiment of the present application.
  • the method further includes: the terminal device receives second information sent by the network device, where the second information is used to indicate the length of the sliding time window of the first network slice .
  • the lengths of the sliding time windows corresponding to multiple network slices may be the same or different. If the sliding time windows corresponding to multiple network slices have the same length, the network device can indicate the length through a second message. If the lengths of the sliding time windows corresponding to multiple network slices are not the same, the network device can indicate the identifier of the network slice and the length of the sliding time window of the network slice through the second information, so that the length of the sliding time window of the network slice is the same as that of the network slice. Corresponding to the logo. For example, the foregoing second information may indicate length 1, length 2, and length 3, and indicate that length 1 corresponds to network slice 1, length 2 corresponds to network slice 2, and length 3 corresponds to network slice 3.
  • the method further includes : If there are remaining uplink resources and the third logical channel in the logical channel still has data to be transmitted, the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the network slice corresponding to the third logical channel until Until any one of the following conditions is met: the third logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the cumulative uplink bit rate of the network slice corresponding to the third logical channel reaches the third logical channel The maximum upper limit bit rate limit of the corresponding network slice.
  • the terminal device may perform the second round of allocation.
  • the third logical channel is a logical channel for which the cumulative uplink bit rate of the corresponding network slice is less than the maximum uplink bit rate of the network slice among the logical channels that still have data to be transmitted. For all logical channels corresponding to the network slice that has reached the maximum uplink bit rate in the first round of allocation, no matter whether there is still data to be sent, the second round of allocation is not performed.
  • the terminal device may allocate the remaining uplink resources based on the maximum uplink bit rate of the network slice corresponding to the third logical channel until any one of the following conditions is met: the third logical channel has no data to be transmitted, or the remaining uplink resources The uplink resources are exhausted, or the cumulative uplink bit rate of the network slice corresponding to the third logical channel reaches the limit of the maximum uplink bit rate of the network slice corresponding to the third logical channel.
  • the foregoing third logical channel may be one logical channel or may include multiple logical channels, and the network slice corresponding to the third logical channel may be one network slice or multiple network slices.
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the network slice corresponding to the third logical channel, including: After the third SDU that is not multiplexed into the PDU is multiplexed into the PDU, the cumulative uplink bit rate of the third network slice in the network slice corresponding to the third logical channel is less than or equal to the maximum of the third network slice For the uplink bit rate, the terminal device multiplexes the third SDU into the PDU; or, if the third SDU is multiplexed into the PDU, the cumulative uplink bit rate of the third network slice is greater than the maximum of the third network slice For the uplink bit rate, the terminal device performs segmentation processing on the third SDU, obtains the third sub SDU, and multiplexes the third sub SDU into the PDU.
  • the terminal device can try not to segment the SDU, and when segmenting the SDU, try to multiplex the larger SDU segment into the PDU, so as to maximize the data transmission of the logical channel.
  • the third logical channel includes at least two logical channels, and the terminal device allocates the remaining uplink based on the maximum uplink bit rate of the network slice corresponding to the third logical channel
  • the resource includes: the terminal device allocates the remaining uplink resources in descending order of the priority of the third logical channel based on the maximum uplink bit rate of the network slice corresponding to the third logical channel until any one of the following conditions is met So far: the third logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the cumulative uplink bit rate of the network slice corresponding to the third logical channel reaches the maximum upper limit bit of the network slice corresponding to the third logical channel Rate limit.
  • the terminal device allocates the remaining third logical channel based on the maximum uplink bit rate of the network slice corresponding to the third logical channel according to the descending order of the priority of the third logical channel.
  • the uplink resource includes: if the fourth SDU in the fourth logical channel that is not multiplexed into the PDU is multiplexed into the PDU, the cumulative uplink bit rate of the fourth network slice corresponding to the fourth logical channel is less than or equal to the first For the maximum uplink bit rate of four network slices, the terminal device multiplexes the fourth SDU to the PDU, and the fourth logical channel is the logical channel with the highest priority among the third logical channels.
  • the terminal device allocates the remaining third logical channel based on the maximum uplink bit rate of the network slice corresponding to the third logical channel according to the descending order of the priority of the third logical channel.
  • the uplink resource includes: if the fourth SDU in the fourth logical channel that is not multiplexed into the PDU is multiplexed into the PDU, the cumulative uplink bit rate of the fourth network slice corresponding to the fourth logical channel is greater than that of the fourth network The maximum uplink bit rate of the slice, the terminal device performs segmentation processing on the fourth SDU to obtain the fourth sub SDU, and multiplexes the fourth sub SDU into the PDU, and the fourth logical channel is the third logical channel The logical channel with the highest priority.
  • the terminal device can try not to segment the SDU, and when segmenting the SDU, try to multiplex the larger SDU segment into the PDU, so as to maximize the data transmission of the logical channel.
  • the terminal device After the terminal device allocates uplink resources for the fourth logical channel according to the above method, if there are still remaining uplink resources, the terminal device can continue to allocate uplink resources for the logical channel of the next priority.
  • the logical channel of the next priority refers to the logical channel of the next priority.
  • the fourth logical channel is the logical channel with the next priority.
  • a network device receives a protocol data unit PDU from a terminal device, the PDU includes data from a logical channel, the logical channel corresponds to a network slice, and the logical channel The data is multiplexed to the PDU based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice; the network device parses the PDU to obtain the data of the logical channel.
  • the method before the network device receives the protocol data unit PDU from the terminal device, the method further includes: the network device determines the length of the sliding time window of the network slice; the network device Send second information to the terminal device, where the second information is used to indicate the length of the sliding time window of the network slice.
  • the second information includes the identifier of the network slice and the length of the sliding time window of the network slice, and the length of the sliding time window of the network slice is the same as the length of the sliding time window of the network slice. Corresponding to the logo.
  • the network device determining the length of the sliding time window of the network slice includes: the network device determines the sliding time window of the network slice based on the type of the network slice length.
  • the network device may determine the length of the sliding time window of the network slice based on the type of the network slice. For example, for network slices of delay-sensitive services, the length of the sliding time window is shorter; for network slices of delay-insensitive services, the length of the sliding time window is longer.
  • the network device can set different sliding time window lengths for different types of network slices to adapt to different service characteristics, thereby flexibly adapting to multiple service scenarios.
  • an apparatus for controlling uplink data transmission which is used to execute the method in any one of the possible implementation manners of the foregoing aspects.
  • the device includes a unit for executing the method in any one of the possible implementation manners of the foregoing aspects.
  • another device for controlling uplink data transmission including a processor, which is coupled to a memory and can be used to execute instructions in the memory to implement the first aspect or any one of the possibilities in the first aspect.
  • the device further includes a memory.
  • the device further includes a communication interface, and the processor is coupled with the communication interface.
  • the device is a terminal device.
  • the communication interface can be a transceiver, or an input/output interface.
  • the device is a chip configured in a terminal device.
  • the communication interface may be an input/output interface.
  • another device for controlling uplink data transmission including a processor, which is coupled to a memory and can be used to execute instructions in the memory to implement any one of the second aspect or the second aspect described above.
  • the device further includes a memory.
  • the device further includes a communication interface, and the processor is coupled with the communication interface.
  • the device is a network device.
  • the communication interface can be a transceiver, or an input/output interface.
  • the device is a chip configured in a network device.
  • the communication interface may be an input/output interface.
  • a processor including: an input circuit, an output circuit, and a processing circuit.
  • the processing circuit is used to receive a signal through the input circuit and transmit a signal through the output circuit, so that the processor executes the method in any one of the possible implementation manners of the foregoing aspects.
  • the above-mentioned processor may be a chip, the input circuit may be an input pin, the output circuit may be an output pin, and the processing circuit may be a transistor, a gate circuit, a flip-flop, and various logic circuits.
  • the input signal received by the input circuit may be received and input by, for example, but not limited to, a receiver, and the signal output by the output circuit may be, for example, but not limited to, output to the transmitter and transmitted by the transmitter, and the input circuit and output
  • the circuit can be the same circuit, which is used as an input circuit and an output circuit at different times. This application does not limit the specific implementation of the processor and various circuits.
  • a processing device including a processor and a memory.
  • the processor is used to read instructions stored in the memory, and can receive signals through a receiver, and transmit signals through a transmitter, so as to execute the method in any one of the possible implementation manners of the foregoing aspects.
  • processors there are one or more processors and one or more memories.
  • the memory may be integrated with the processor, or the memory and the processor may be provided separately.
  • the memory can be a non-transitory (non-transitory) memory, such as a read only memory (ROM), which can be integrated with the processor on the same chip, or can be set in different On the chip, this application does not limit the type of memory and the way of setting the memory and the processor.
  • ROM read only memory
  • sending instruction information may be a process of outputting instruction information from the processor
  • receiving capability information may be a process of receiving input capability information by the processor.
  • the processed output data may be output to the transmitter, and the input data received by the processor may come from the receiver.
  • the transmitter and receiver can be collectively referred to as transceivers.
  • the above-mentioned processing device may be a chip, and the processor may be implemented by hardware or software.
  • the processor When implemented by hardware, the processor may be a logic circuit, an integrated circuit, etc.; when implemented by software, the processing
  • the processor may be a general-purpose processor, which is implemented by reading software codes stored in the memory.
  • the memory may be integrated in the processor, may be located outside the processor, and exist independently.
  • a computer program product includes: a computer program (also called code, or instruction), which when the computer program is executed, enables the computer to execute any of the above aspects.
  • the method in the implementation mode includes: a computer program (also called code, or instruction), which when the computer program is executed, enables the computer to execute any of the above aspects. The method in the implementation mode.
  • a computer-readable storage medium stores a computer program (also called code, or instruction) when it runs on a computer, so that the computer executes the above aspects. Any one of the possible implementation methods.
  • Fig. 1 shows a schematic diagram of a communication system according to an embodiment of the present application
  • Figure 2 shows a schematic diagram of the correspondence between network slices and PDU sessions
  • Figure 3 shows a schematic flow chart of the token bucket algorithm
  • Figure 4 shows a schematic diagram of the allocation result of uplink resources based on the token bucket algorithm
  • FIG. 5 shows a schematic flowchart of a method for controlling uplink data transmission according to an embodiment of the present application
  • FIG. 6 shows a schematic diagram of an uplink resource allocation result according to an embodiment of the present application
  • FIG. 7 shows a schematic flowchart of another method for controlling uplink data transmission according to an embodiment of the present application.
  • FIG. 8 shows a schematic flowchart of a token bucket algorithm according to an embodiment of the present application.
  • FIG. 9 shows a schematic diagram of a sliding time window of an embodiment of the present application.
  • FIG. 10 shows a schematic diagram of another uplink resource allocation result according to an embodiment of the present application.
  • FIG. 11 shows a schematic diagram of another uplink resource allocation result according to an embodiment of the present application.
  • FIG. 12 shows a schematic block diagram of a device for controlling uplink data transmission according to an embodiment of the present application
  • FIG. 13 shows a schematic block diagram of another apparatus for controlling uplink data transmission according to an embodiment of the present application.
  • FIG. 14 shows a schematic structural diagram of a terminal device according to an embodiment of the present application.
  • LTE long term evolution
  • FDD frequency division duplex
  • TDD time division duplex
  • 5G fifth generation
  • NR new radio
  • FIG. 1 shows a schematic diagram of a communication system 100 applicable to the uplink data transmission control method and device according to the embodiments of the present application.
  • the communication system 100 may include at least one network device, such as the network device 110 shown in FIG. 1; the communication system 100 may also include at least one terminal device, such as the terminal device 120 shown in FIG. 1.
  • the network device 110 and the terminal device 120 may communicate through a wireless link.
  • Each communication device such as the network device 110 or the terminal device 120, may be configured with multiple antennas, and the multiple antennas may include at least one transmitting antenna for transmitting signals and at least one receiving antenna for receiving signals.
  • each communication device additionally includes a transmitter chain and a receiver chain.
  • Those of ordinary skill in the art can understand that they may include multiple components related to signal transmission and signal reception (such as processors, modulators, multiplexers, etc.). Converter, demodulator, demultiplexer or antenna, etc.). Therefore, the network device 110 and the terminal device 120 can communicate through multi-antenna technology.
  • the terminal equipment in the embodiments of this application may also be referred to as: user equipment (UE), mobile station (MS), mobile terminal (MT), access terminal, user unit, user station, Mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device, etc.
  • UE user equipment
  • MS mobile station
  • MT mobile terminal
  • access terminal user unit, user station, Mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device, etc.
  • the terminal device may be a device that provides voice/data connectivity to the user, for example, a handheld device with a wireless connection function, a vehicle-mounted device, and so on.
  • some examples of terminal devices include: mobile phones (mobile phones), tablet computers, notebook computers, handheld computers, mobile internet devices (MID), wearable devices, virtual reality (VR) devices, augmented Augmented reality (AR) equipment, wireless terminals in industrial control, wireless terminals in self-driving (self-driving), wireless terminals in remote medical surgery, and smart grid (smart grid) Wireless terminals in transportation safety (transportation safety), wireless terminals in smart city (smart city), wireless terminals in smart home (smart home), cellular phones, cordless phones, session initiation protocols (session initiation) protocol, SIP) phones, wireless local loop (WLL) stations, personal digital assistants (personal digital assistants, PDAs), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, In-vehicle devices, wearable devices, terminal devices in a 5
  • the terminal device may be a terminal device in an Internet of Things (IoT) system.
  • IoT Internet of Things
  • the Internet of Things is an important part of the development of information technology in the future. Its main technical feature is to connect objects to the network through communication technology, so as to realize the intelligent network of human-machine interconnection and interconnection of things.
  • the terminal device in the embodiment of the present application may be a wearable device. Wearable devices can also be called wearable smart devices. It is a general term for using wearable technology to intelligently design everyday wear and develop wearable devices, such as glasses, gloves, watches, clothing and shoes.
  • a wearable device is a portable device that can be worn directly on the body or integrated into the user's clothes or accessories.
  • Wearable devices are not only a hardware device, but also powerful functions can be achieved through software support, data interaction, and cloud interaction.
  • wearable smart devices include full-featured, large-sized, complete or partial functions that can be achieved without relying on smart phones, such as smart watches or smart glasses, and only focus on a certain type of application function, and need to cooperate with other devices such as smart phones.
  • the terminal device may also be a terminal device in machine type communication (MTC).
  • MTC machine type communication
  • the terminal device may also be an in-vehicle module, an in-vehicle module, an in-vehicle component, an in-vehicle chip, or an in-vehicle unit built into the vehicle as one or more components or units.
  • On-board components, on-board chips, or on-board units, etc. can implement the methods provided in this application.
  • the embodiments of the present application can also be applied to the Internet of Vehicles, such as vehicle to everything (V2X), long term evolution-vehicle (LTE-V) technology, and vehicle-to-vehicle (vehicle-to-vehicle) technology.
  • V2X vehicle to everything
  • LTE-V long term evolution-vehicle
  • vehicle-to-vehicle vehicle-to-vehicle technology
  • vehicle, V2V vehicle, V2V technology, etc.
  • the network device involved in this application can be a device that communicates with a terminal device.
  • the network device can also be called an access network device or a wireless access network device. It can be a transmission reception point (TRP) or
  • the evolved base station (evolved NodeB, eNB or eNodeB) in the LTE system can also be a home base station (for example, home evolved NodeB, or home Node B, HNB), baseband unit (BBU), or cloud
  • the wireless controller in the wireless access network (cloud radio access network, CRAN) scenario, or the network device can be a relay station, an access point, an in-vehicle device, a wearable device, a network device in a 5G network, or a PLMN network that will evolve in the future
  • the network equipment in the WLAN can also be the access point (AP) in the WLAN, or the gNB in the NR system.
  • the aforementioned network equipment can also be a city base station, a micro base station, a pic
  • a network device may include a centralized unit (CU) node, or a distributed unit (DU) node, or a radio access network (radio access network, including CU nodes and DU nodes, RAN) equipment, or RAN equipment including control plane CU nodes (CU-CP nodes), user plane CU nodes (CU-UP nodes) and DU nodes.
  • CU centralized unit
  • DU distributed unit
  • radio access network radio access network
  • CU-CP nodes control plane CU nodes
  • CU-UP nodes user plane CU nodes
  • the network equipment provides services for the cell, and the terminal equipment communicates with the cell through the transmission resources (for example, frequency domain resources, or spectrum resources) allocated by the network equipment, and the cell may belong to a macro base station (for example, a macro eNB or a macro gNB, etc.) , It may also belong to the base station corresponding to the small cell, where the small cell may include: metro cell, micro cell, pico cell, femto cell, etc. These small cells have the characteristics of small coverage area and low transmit power, and are suitable for providing high-speed data transmission services.
  • a macro base station for example, a macro eNB or a macro gNB, etc.
  • the small cell may include: metro cell, micro cell, pico cell, femto cell, etc.
  • FIG. 1 is only a schematic diagram, and the communication system 100 may also include other devices not shown.
  • the embodiment of the present application does not limit the number of terminal devices and network devices included in the communication system 100.
  • the terminal device or the network device includes a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer.
  • the hardware layer includes hardware such as a central processing unit (CPU), a memory management unit (MMU), and memory (also referred to as main memory).
  • the operating system can be any one or more computer operating systems that implement business processing through processes, for example, Linux operating systems, Unix operating systems, Android operating systems, iOS operating systems, or windows operating systems.
  • the application layer includes applications such as browsers, address books, word processing software, and instant messaging software.
  • this application does not specifically limit the specific structure of the execution subject of the method provided in this application, as long as it can communicate with the method provided in the embodiment of this application by running a program that records the code of the method provided in this application.
  • the execution subject of the method provided in the embodiments of the present application may be a terminal device or a network device, or a functional module in the terminal device or the network device that can call and execute the program.
  • computer-readable storage media may include, but are not limited to: magnetic storage devices (for example, hard disks, floppy disks, or tapes, etc.), optical disks (for example, compact discs (CDs), digital versatile discs, DVDs ), etc.), smart cards and flash memory devices (for example, erasable programmable read-only memory (EPROM), cards, sticks or key drives, etc.).
  • various storage media described herein may represent one or more devices and/or other machine-readable media for storing information.
  • the term "machine-readable medium” may include, but is not limited to, wireless channels and various other media capable of storing, containing, and/or carrying instructions and/or data.
  • Network slicing (network slicing, NS)
  • Network slicing is an end-to-end logical private network that provides specific network capabilities. Through flexible allocation of network resources and on-demand networking, multiple logical subnets with different characteristics and isolated from each other can be virtualized on the same physical facility to provide targeted services to users. This logical subnet is called a network slice. Network slicing can be used by operators, based on the service level agreement (SLA) signed by customers, to provide isolated and customizable network services for different vertical industries, different customers, and different businesses. Different network slices can be identified and distinguished by single network slice selection assistance information (S-NSSAI).
  • S-NSSAI single network slice selection assistance information
  • Network slicing may include wireless network slicing, transmission network slicing, and core subnet slicing.
  • Terminal devices can establish contact with network slices through PDU sessions.
  • the traffic of different network slices is managed by different PDU sessions.
  • a PDU session belongs to one network slice.
  • PDU sessions in different network slices are isolated from each other.
  • different and isolated radio bearers (RBs) can be configured for different network slices.
  • One RB can correspond to one logical channel (logical channel, LCH), or it can correspond to multiple LCHs, similar to PDU sessions.
  • the slicing also supports the diversity of quality of service (QoS).
  • QoS quality of service
  • one network slice may include one or more PDU sessions, and one PDU session may include one or more RBs and one or more QoS flows.
  • Figure 2 shows a schematic diagram of the correspondence between network slices and PDU sessions.
  • the UE and the NB belong to the next generation-radio access network (NG-RAN), and the NB may include an eNB and a gNB, and may also include other NBs, which are not limited here.
  • the user plane function (UPF) network element on the right side of the NB belongs to the 5G core network (5G core, 5GC).
  • 5G core 5G core
  • There is one PDU session in network slice 1 (NS#1) the PDU session includes 2 RBs and 1 NG-U tunnel, and the NG-U tunnel includes 3 QoS flows.
  • the PDU session includes one RB and one NG-U tunnel, and the NG-U tunnel includes one QoS flow.
  • the NG-U tunnel refers to the user plane tunnel between the gNB and the UPF (N3 interface), which may contain one or more QoS flows, and one PDU session corresponds to one NG-U tunnel.
  • Service data unit SDU Service data unit SDU, protocol data unit PDU and media access control (medium access control, MAC) layer multiplexing (multiplexing)
  • Service data unit also called service data unit
  • SDU Service data unit
  • PDU protocol data unit
  • SDU Service data unit
  • An SDU is an information unit from a higher protocol layer and transferred to a lower protocol layer.
  • the SDU of the Nth layer corresponds to the PDU of the upper layer of the Nth layer.
  • SDU refers to the amount of information received from the N+1th layer entity that has not been processed by the Nth layer entity and retains its identity.
  • PDU refers to a specific data unit at the N protocol layer, including the protocol control information of the N protocol layer and possible user data of the N protocol layer.
  • the sender can multiplex the data of multiple logical channels into a transport channel (transport channel, TCH) through the multiplexing function of the MAC layer, that is, multiplex multiple MAC SDUs into one MAC PDU and send it out through the physical layer.
  • transport channel transport channel
  • MAC layer multiplexing multiplexing multiple MAC SDUs into one MAC PDU by the sender through the MAC layer
  • MAC layer multiplexing multiplexing SDUs to PDU
  • the terminal device can only send one MAC PDU in a transmission time interval (TTI) (without considering the space division multiplexing and carrier aggregation), therefore, it is necessary to multiplex the MAC SDUs of multiple logical channels. To the same MAC PDU, this is the origin of MAC layer multiplexing.
  • TTI transmission time interval
  • the network device can determine the priority of the logical channel according to the type of the logical channel and the QoS parameters carried by the logical channel.
  • a logical channel with a higher priority has a higher probability of being multiplexed by the MAC layer and can obtain more transmission opportunities, which means a higher transmission rate or a lower transmission delay.
  • the network device can allocate uplink resources according to the request of the terminal device and the amount of data to be sent, but the uplink resource allocated by the network device is for the terminal device, not for the logical channel.
  • the following is a detailed description mainly for the uplink situation. Since the SDU comes from a logical channel, for uplink transmission, "MAC layer multiplexing" can be understood as "the terminal device allocates uplink resources for the logical channel”.
  • the terminal device can inform the network device through a buffer status report (BSR) how much data in its upstream buffer (buffer) needs to be sent, so that the network device can send it to the terminal device Configure uplink resources.
  • BSR buffer status report
  • the protocol stipulates that each logical channel group (LCG) corresponds to a BSR value, and each logical channel group includes one or more logical channels.
  • LCG logical channel group
  • the division of LCG will vary according to the implementation of different vendors.
  • the services carried on the logical channels in the same LCG will have similar QoS requirements, which makes a single LCG may include logical channels of different network slices , Which in turn causes the network equipment to be unable to obtain the data volume information of each network slice according to the BSR.
  • the network device can allocate uplink resources to the terminal device according to the BSR, but does not specify which logical channels the allocated uplink resources are used for.
  • the terminal device can multiplex the MAC SDU from each logical channel into the MAC PDU according to the priority of the logical channel, and then send it out through the physical layer.
  • the network device sets a priority bit rate (PBR) for each logical channel of the terminal device, the unit is kB/s, to ensure that the terminal device limits each
  • PBR priority bit rate
  • the transmission rate of the high-priority logical channel in the logical channel enables the low-priority logical channel with data transmission in each logical channel to be served. That is to say, if the data transmission rate of a high-priority logical channel is greater than or equal to the PBR of the logical channel, even if the high-priority logical channel still has data to be sent, the terminal device will switch to a low-priority one.
  • the terminal device can implement the allocation of uplink resources through a token bucket algorithm.
  • the token bucket algorithm is a commonly used rate limiting method, which can be visually compared to the operation process of a bucket containing "tokens".
  • the basic idea of this algorithm is to determine whether to send data of a certain logical channel based on whether there are tokens in the token bucket and how many tokens there are, and to control the data volume of the logical channel multiplexed in the MAC PDU.
  • the network device can configure the following parameters for each logical channel by sending configuration information (such as LogicalChannelConfig cell) to the terminal device:
  • configuration information such as LogicalChannelConfig cell
  • PBR Priority bit rate
  • Bucket size duration (bucketSizeDuartion, BSD);
  • the above-mentioned priority can also be called logical channel priority.
  • the logical channel priority determines the sequence of uplink resource allocation (ie the sequence of multiplexing) when multiple logical channels are multiplexed; PBR represents the bucket per second The number of bytes injected inside; BSD represents the depth of the bucket, in milliseconds. Therefore, the maximum capacity of the token bucket is PBR ⁇ BSD, which limits the total amount of data that each logical channel can buffer, but this does not represent the maximum uplink bit rate of the logical channel.
  • the above configuration information is for logical channels, that is, one logical channel corresponds to one configuration information, each logical channel has its own priority, PBR, and BSD, and each logical channel has its own token bucket.
  • the terminal device receives the above configuration information sent by the network device, determines the priority, PBR and BSD of each logical channel, and allocates uplink resources based on the token bucket algorithm in the order of priority from high to low. After the terminal device allocates uplink resources according to the token bucket algorithm, if there are remaining uplink resources and there are logical channels for data to be transmitted, the terminal device will also redistribute uplink resources. Therefore, in this application, the token The bucket algorithm is also called the first-round allocation algorithm, and the redistribution after the token bucket algorithm is called the second-round allocation algorithm.
  • the terminal device can allocate uplink resources to each logical channel in descending order of priority based on the priority bit rate of each logical channel, until any one of the following conditions is met: each logical channel is allocated to Uplink resources, or exhaustion of uplink resources.
  • Fig. 3 shows a schematic flowchart of the token bucket algorithm (that is, the first round of allocation algorithm).
  • the token bucket algorithm will be introduced in detail below in conjunction with Figure 3.
  • M is an integer greater than or equal to 1
  • each logical channel in the M logical channels corresponds to a token bucket, that is, each logical channel has its own priority, PBR, and BSD.
  • PBR priority
  • BSD the logical channel j
  • the terminal device can maintain a variable B j for the logical channel j, which indicates the token bucket j
  • the number of tokens currently available, and each token corresponds to 1Byte of data.
  • the terminal device can execute the token bucket algorithm to allocate uplink resources, that is, multiplex the SDU into the PDU.
  • the terminal device may perform the following steps for each logical channel in the order of decreasing priority, and the logical channel j is taken as an example for description below.
  • Step 1 Obtain SDU 1 in logical channel j, and judge whether B j is greater than zero.
  • Step 2 If B j is less than 0, it means that there are no tokens available in the token bucket, and the SDU 1 cannot be multiplexed into the PDU.
  • the terminal device processes the logical channel j and then processes the next priority. Logical channel.
  • Step 4 the terminal device determines whether the uplink bit rate of logical channel j is greater than or equal to PBR j .
  • Step 5 If the uplink bit rate of the logical channel j is less than PBR j , the terminal device continues to obtain the SDU in the logical channel j.
  • Step 6 If the uplink bit rate of logical channel j is greater than or equal to PBR j , the processing procedure of the terminal device on logical channel j ends, and then the next logical channel is processed.
  • the smallest multiplexing unit is SDU.
  • the terminal device After a terminal device multiplexes a certain SDU into a PDU, if the uplink bit rate of the current logical channel is greater than or equal to the PBR of the logical channel, the terminal The device processes the logical channel of the next priority; if the uplink bit rate of the current logical channel is less than the PBR of the logical channel, the terminal device can continue to process the next SDU of the logical channel. Therefore, for a single TTI, the uplink bit rate of a logical channel may be greater than the PBR of the logical channel, equal to the PBR of the logical channel, or less than the PBR of the logical channel. This is allowed in the first round of allocation algorithm .
  • the token bucket algorithm allows B j ⁇ 0. That is, before the SDU of logical channel j is multiplexed into the PDU, when B j > 0 and B j- T SDU ⁇ 0, the SDU will not be placed in the queue, but a sufficient order will be obtained by "borrowing". (At this time, after subtracting T SDU from B j , its value is less than 0), the SDU is multiplexed into the PDU. Only after the borrowed token is returned ( Bj increases by PBR j ⁇ TTI every TTI until B j > 0), the logical channel j can perform subsequent data transmission.
  • logical channel j for the low-priority logical channel, take logical channel j as an example. If the uplink resources are limited, then in the previous TTIs, the logical channel j may not be served, but the number of tokens in its token bucket It keeps increasing with TTI (not exceeding PBR j ⁇ BSD j ). For example, if the amount of data to be transmitted in a low-priority logical channel j is 300 Bytes, its PBR j is 100 kBps and BSD j is 3 ms. In the first two TTIs, the logical channel j is not served due to limited uplink resources. In the third TTI, the uplink resources are sufficient.
  • the second round of allocation algorithm If there are remaining uplink resources after the first round of allocation is performed, and there are logical channels with data to be transmitted, the terminal device can directly allocate the remaining ones according to the descending order of the priority of the logical channels with data to be transmitted Uplink resources until any one of the following conditions is met: all logical channels have no data to be transmitted, or the remaining uplink resources are exhausted.
  • N is a positive integer less than or equal to M, and the terminal device can follow the N logical channels.
  • the remaining uplink resources are allocated in descending order of priority of the logical channels. Only when the data of the high-priority logical channel are allocated uplink resources and the uplink resources are not exhausted, the low-priority logical channel can be served, that is, in the second round of allocation, the terminal device maximizes the high priority Level of data transmission through logical channels.
  • terminal device may follow the following principles in the above-mentioned second round of allocation process:
  • the terminal device If the terminal device segments the SDU in the logical channel, it should fill in the largest segment as much as possible according to the size of the remaining resources and the PBR of the logical channel, that is, the terminal device should maximize the data transmission;
  • the terminal equipment will allocate uplink resources in a strict descending order of priority. That is, at this time, the terminal device will maximize the transmission of higher priority data.
  • the terminal will consider other logical channels with a lower priority than the logical channel.
  • Fig. 4 shows a schematic diagram of uplink resource allocation results based on the foregoing first-round allocation algorithm and the second-round allocation algorithm.
  • M 3, that is, there are 3 logical channels, namely LCH1, LCH2, and LCH3.
  • the priority of LCH 1 is 1, the priority of LCH 2 is 2, and the priority of LCH 3 is 3. Assuming that a smaller value indicates a higher priority, LCH 1 has the highest priority, LCH 2 is the next, and LCH 3 has the lowest priority.
  • the data to be transmitted for LCH 1 is DATA 1
  • the priority bit rate for LCH 1 is PBR 1
  • the data to be transmitted for LCH 2 is DATA 2
  • the priority bit rate for LCH 2 is PBR 2
  • the data to be transmitted for LCH 3 is DATA 3.
  • the priority bit rate of LCH3 is PBR3.
  • the terminal device can perform the first round of allocation first, that is, the terminal device preferentially allocates uplink resources for the LCH 1, and multiplexes the SDU 1 into the PDU. Since the LCH 1 has reached the limit of the PBR 1, the terminal device can then process the LCH 2 and multiplex the SDU 2 into the PDU. Since the LCH 2 has reached the limit of the PBR 2, the terminal device can then process the LCH 3 and multiplex the SDU 3 into the PDU. As shown in Figure 4, although LCH3 does not exceed the limit of PBR3, there is no data to be transmitted on LCH3. At this time, since the uplink resources are not exhausted, and the LCH 1 and LCH 2 still have data to be transmitted, the terminal device can continue to perform the second round of allocation. The terminal equipment multiplexes the SDU 4 of the LCH 1 to the PDU. At this time, although the LCH 1 still has data to be transmitted, the uplink resources have been exhausted and can no longer be allocated.
  • the above algorithm achieves the fairness of uplink resource allocation to a certain extent, and at the same time ensures the minimum uplink transmission rate of each logical channel.
  • the above algorithm only guarantees the minimum uplink transmission rate of each logical channel, and does not limit the uplink transmission rate of each logical channel, which may lead to a higher uplink transmission rate of the logical channel, which may lead to network congestion.
  • each logical channel of the terminal device may be The uplink transmission rate of the channel exceeds the carrying capacity of its corresponding network slice (that is, the upper limit of the total uplink transmission rate of all logical channels in a single network slice), causing network congestion.
  • the present application provides a method and device for controlling uplink data transmission, which can realize rate control of logical channels when a terminal device performs uplink transmission, which is beneficial to reduce the risk of network congestion.
  • instructions can include direct instructions and indirect instructions, as well as explicit instructions and implicit instructions.
  • the information indicated by a certain piece of information (the maximum uplink bit rate as described below) is called information to be indicated.
  • information to be indicated there can be many ways to indicate the information to be indicated. For example, but not limited to, you can directly Indicate the information to be instructed, such as indicating the information to be instructed itself or the index of the information to be instructed, etc.
  • the information to be indicated can also be indicated indirectly by indicating other information, where there is an association relationship between the other information and the information to be indicated. It is also possible to indicate only a part of the information to be indicated, while other parts of the information to be indicated are known or agreed in advance. For example, it is also possible to realize the indication of specific information by means of a pre-arranged order (for example, stipulated in an agreement) of various information, so as to reduce the indication overhead to a certain extent.
  • MAC media access control
  • UMBR logical channel maximum bit rate
  • PBR priority bit Prioritized bit rate
  • the first, second, and various numerical numbers are only for easy distinction for description, and are not used to limit the scope of the embodiments of the present application. For example, distinguish different information, distinguish different logical channels, and so on.
  • pre-acquisition may include being indicated by network device signaling or pre-defined, for example, protocol definition.
  • pre-defined can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate related information in the equipment (for example, including terminal equipment and network equipment). This application does not make any specific implementation methods. limited.
  • the “protocols” involved in the embodiments of the present application may refer to standard protocols in the communication field, for example, may include LTE protocol, NR protocol, and related protocols applied to future communication systems, which are not limited in this application.
  • the embodiments of this application all use "logical channels" as an example for description, but it should be understood that if there is a one-to-one correspondence between radio bearers and logical channels, the logical channels in the embodiments of this application can also be replaced with radio bearers. Or other terms corresponding to logical channels, which are not limited in the embodiment of the present application.
  • the embodiment of this application uses "uplink bit rate" to describe the transmission rate of the uplink data of the terminal device. This is only an exemplary illustration. The uplink bit rate in the embodiment of this application can also be replaced with an uplink transmission rate, an uplink transmission rate, or For other terms, the embodiment of the present application does not limit this either.
  • terminal equipment can be replaced with a device or chip that can achieve similar functions to the terminal equipment
  • the network equipment can also be replaced with a device that can achieve similar functions to the network equipment.
  • chips the name of which is not limited in the embodiments of this application.
  • FIG. 5 is a schematic flowchart of a method 500 for controlling uplink data transmission according to an embodiment of the application.
  • the method 500 may be applied to the communication system 100 shown in FIG. 1, which is not limited in the embodiment of the present application.
  • the method 500 may include:
  • the network device sends first information to the terminal device, and correspondingly, the terminal device receives the first information from the network device, where the first information is used to indicate the maximum uplink bit rate of each logical channel in at least one logical channel.
  • the method 500 further includes:
  • the network device determines the foregoing first information.
  • the maximum uplink bit rate of each logical channel in at least one logical channel means that the network device can configure its respective maximum uplink bit rate for each logical channel in at least one logical channel, for example, at least one logical channel
  • the channel is 5 logical channels, and the network device can configure 5 maximum uplink bit rates for the 5 logical channels.
  • the 5 maximum uplink bit rates can be the same in whole or in part, or all, which is not limited in the embodiment of the application. .
  • the 5 fields in the above-mentioned first information respectively indicate the 5 maximum uplink bit rates, and the 5 fields respectively correspond to 5 logical channels; or, when all or part of the 5 maximum uplink bit rates are the same , Multiple logical channels with the same maximum uplink bit rate occupy the same field in the above-mentioned first information, and this field can correspond to multiple logical channels. In this way, when the number of at least one logical channel is large, signaling overhead can be saved.
  • S520 The terminal device allocates uplink resources to all or part of the at least one logical channel based on the maximum uplink bit rate.
  • the "all or part" logical channel here means that when the uplink resources are sufficient, the terminal device can allocate uplink resources for each logical channel based on the maximum uplink bit rate of each logical channel; in the case of insufficient uplink resources
  • the terminal device can allocate uplink resources to some logical channels in the above at least one logical channel.
  • the terminal device allocates uplink resources for the partial logical channel based on the maximum uplink bit rate of the partial logical channel.
  • not all logical channels in the above at least one logical channel can be allocated to uplink resources, and there may be some logical channels that cannot be allocated to uplink resources, which is not limited in the embodiment of the present application.
  • the network device indicates the maximum uplink bit rate of at least one logical channel to the terminal device, so that the terminal device limits the uplink resources allocated to the logical channel based on the maximum uplink bit rate, so that the terminal device can perform uplink transmission when the terminal device performs uplink transmission. , Realize the rate control of the logical channel, help reduce the risk of network congestion.
  • the maximum uplink bit rate of a logical channel represents the upper limit of the bit rate of uplink transmission of the logical channel. For a logical channel, if the terminal device allocates more uplink resources for the logical channel, the uplink bit rate of the logical channel is higher; if the terminal device allocates less uplink resources for the logical channel, the uplink resource of the logical channel The bit rate is low. Therefore, the terminal device can allocate uplink resources for the logical channel based on the maximum uplink bit rate of the logical channel, thereby controlling the uplink bit rate of the logical channel not to exceed the maximum uplink bit rate of the logical channel.
  • Radio bearers include two types: data radio bearer (DRB) and signaling radio bearer (SRB).
  • DRB data radio bearer
  • SRB signaling radio bearer
  • the terminal device can preferentially transmit the data of the SRB when it is allocated, that is, the uplink of the logical channel corresponding to the SRB is given priority. Resource requirements. Therefore, in a possible implementation manner, the method of the embodiment of the present application is mainly applicable to a logical channel corresponding to a data radio bearer (DRB), that is, the above-mentioned at least one logical channel is a logical channel corresponding to the DRB.
  • DRB data radio bearer
  • the foregoing first information may be sent by a network device through radio resource control (radio resource control, RRC) signaling, for example, a LogicalChannelConfig information element.
  • RRC radio resource control
  • the foregoing at least one logical channel may correspond to one network slice.
  • the maximum uplink bit rate of a network slice is for a single network slice, and the maximum uplink bit rate of a network slice represents the upper limit of the uplink transmission bit rate of all logical channels corresponding to the network slice.
  • the maximum uplink bit rate of a logical channel is abbreviated as UMBR
  • the maximum uplink bit rate of a network slice is abbreviated as UMBR
  • the foregoing at least one logical channel may correspond to one PDU session.
  • the maximum uplink bit rate of a PDU session is for a single PDU session, and the maximum uplink bit rate of a PDU session represents the upper limit of the bit rate of uplink transmission of all logical channels corresponding to the PDU session.
  • One network slice may include one PDU session or multiple PDU sessions, which is not limited in the embodiment of the present application.
  • the uplink rate control in the network slicing can be realized, and the risk of network congestion at the granularity of the network slicing can be reduced.
  • the uplink rate control in the PDU session can be realized, and the risk of network congestion at the granularity of the PDU session can be reduced.
  • only network slicing is used as an example in the following to describe the uplink data transmission control method in the embodiment of the present application.
  • the sum of the UMBRs of all logical channels corresponding to a network slice is less than or equal to the maximum uplink bit rate of the network slice.
  • the method 500 may further include:
  • the terminal device sends a protocol data unit PDU to the network device, and correspondingly, the network device receives the PDU from the terminal device.
  • the PDU includes data from one or more logical channels, and the data of the one or more logical channels is based on The maximum uplink bit rate of the one or more logical channels is multiplexed into the PDU, and the one or more logical channels may correspond to one or more network slices.
  • S540 The network device parses the PDU to obtain data of the logical channel.
  • the terminal device may allocate uplink resources for each logical channel according to the foregoing S510 and S520, that is, multiplex the SDU of each logical channel into the PDU, and then the terminal device may send the PDU to the network device.
  • the PDU sent by the terminal device may include data from one or more logical channels (ie, SDU), and the one or more logical channels may correspond to one or more network slices.
  • the PDU received by the network device may include data of logical channel 1, logical channel 2, and logical channel 3, where logical channel 1 and logical channel 2 correspond to network slice 1, and logical channel 3 corresponds to network slice 2.
  • the terminal device allocates uplink resources to all or part of the logical channels in the at least one logical channel based on the maximum uplink bit rate, including: the terminal device based on the priority bit rate and maximum uplink bit rate of the at least one logical channel Rate, to allocate uplink resources to all or part of the at least one logical channel.
  • the UMBR of a logical channel is greater than or equal to the priority bit rate PBR of the logical channel. That is, for the logical channel j in any network slice i, there are:
  • i and j are both positive integers.
  • the above-mentioned first information may carry the maximum uplink bit rate, and may also carry the maximum amount of data that can be transmitted uplink within a specific period of time, and the maximum amount of data that can be transmitted uplink within the specific period of time and the maximum uplink bit rate are mutually convertible.
  • the PBR of the foregoing logical channel may be obtained in advance by the terminal device.
  • the PBR of the logical channel may be configured by the network device through configuration information (for example, LogicalChannelConfig cell) for the terminal device.
  • the configuration information and the above-mentioned first information may be different or the same information, that is, the network device can configure the UMBR of the logical channel and the PBR of the logical channel for the terminal device through two different fields of the same information.
  • This application The embodiment does not limit this.
  • the network device configures the maximum uplink bit rate of the logical channel for the terminal device to ensure that the sum of the maximum uplink bit rate of all logical channels corresponding to a network slice is less than or equal to that in the network slice
  • the maximum uplink bit rate in the network slice can be used to control the uplink transmission rate of the terminal device in the network slice, which is beneficial to avoid the problem of overloading the uplink transmission rate in the network slice when the terminal device performs uplink data transmission, and reduces the risk of network congestion.
  • the terminal device can execute the first round allocation algorithm based on the PBR of the logical channel, so that the uplink bit rate of the logical channel reaches the limit of the PBR of the logical channel; if there are remaining uplink resources , And there are logical channels with data to be transmitted, the terminal device executes the second round of allocation algorithm, that is, UMBR based on logical channels, to allocate uplink resources for the logical channels that still have data to be transmitted, so that all logical channels have no data to be transmitted. Or the uplink resources are exhausted, or the logical channel reaches the UMBR limit of the logical channel.
  • the second round of allocation algorithm that is, UMBR based on logical channels
  • the terminal device may allocate resources for the logical channel based only on UMBR.
  • the terminal device may not execute the above-mentioned first-round allocation algorithm, and directly execute the second-round allocation algorithm for the logical channel with data to be transmitted, that is, the logical channel-based UMBR, to allocate uplink resources for the logical channel, so that all logical channels There is no data to be transmitted, or the uplink resources are exhausted, or the logical channel reaches the limit of the UMBR of the logical channel.
  • the terminal device can allocate resources for the logical channel based on other principles and UMBR.
  • the terminal device may allocate uplink resources to the logical channel according to other principles (for example, allocating uplink resources for the data volume of each logical channel with a predefined value), and then execute the second round of allocation algorithm, that is, UMBR based on the logical channel.
  • Uplink resources are allocated to logical channels that still have data to be transmitted, so that all logical channels have no data to be transmitted, or the uplink resources are exhausted, or the logical channel reaches the UMBR limit of the logical channel.
  • the network device can only configure logic for the terminal device UMBR of the channel, no PBR. Further, the network device may not be configured with priority and BSD.
  • the terminal device may sort the multiple logical channels according to the amount of data to be transmitted in each logical channel (for example, in ascending or descending order) Or, the terminal device can randomly sort the logical channels with data to be transmitted, thereby determining the processing priority of each logical channel, so as to allocate uplink resources for each logical channel in the descending order of the priority.
  • the terminal device can directly multiplex the data of the logical channel to the PDU, and then continue to process the logical channel of the next priority.
  • the terminal device can perform segmentation processing on the data of the logical channel, and segment the data to the PDU according to the uplink resource multiplexing.
  • the terminal device can segment the data of the logical channel, multiplex the maximum segment to the PDU according to the UMBR, and then continue to process the next sequence Logical channel.
  • the terminal device can segment the data of the logical channel according to the smaller value of the UMBR and the amount of data that can be transmitted by the remaining uplink resources Reuse the largest segment to the PDU, and then continue to process the next sequential logical channel.
  • the foregoing multiplexing maximum segmentation refers to multiplexing the sub-SDUs obtained after segmenting the SDU into the PDU, and the uplink bit rate of the logical channel is equal to the maximum uplink bit rate of the logical channel.
  • the terminal device allocates uplink resources for all or part of the logical channels in at least one logical channel based on the maximum uplink bit rate, including: the terminal device allocates uplink resources for the at least one logical channel based on the priority bit rate and the maximum uplink bit rate of the at least one logical channel All or part of the logical channels in the uplink resources are allocated.
  • the foregoing terminal device allocating uplink resources for the logical channel based on the maximum uplink bit rate of the logical channel includes: the terminal device allocating uplink resources for the logical channel based on the priority bit rate of the logical channel; If there are remaining uplink resources and the first logical channel in the logical channel still has data to be transmitted, the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the first logical channel until one of the following conditions Until any one is satisfied: the first logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the uplink bit rate of the first logical channel reaches the maximum uplink bit rate of the first logical channel.
  • the terminal device can refer to the token bucket algorithm to allocate uplink resources for the logical channel. That is, the terminal device can first perform the first round of allocation, and allocate uplink resources for the logical channel based on the priority bit rate of the logical channel until any one of the following conditions is met: the uplink bit rate of the logical channel reaches the logical channel's Priority bit rate restriction, or exhaustion of uplink resources. After the first round of allocation, from a time average point of view, the uplink bit rate of the logical channel is less than or equal to the priority bit rate of the logical channel.
  • the terminal device can refer to the priority bit rates of the multiple logical channels and allocate uplink resources for the multiple logical channels in the order of decreasing priority until any of the following conditions To meet the requirements: the uplink bit rates of the multiple logical channels have reached the limit of their respective priority bit rates, or the uplink resources are exhausted, so that from the perspective of time average, the uplink bit rates of the multiple logical channels are less than or equal to their respective priority bit rates.
  • the priority bit rate For the specific allocation method, please refer to the description of the first round of allocation in the above token bucket algorithm, which will not be repeated here.
  • the uplink bit rate of a logical channel is an average value over a period of time. For example, for a logical channel, in a single TTI, this application allows the uplink bit rate of the logical channel to exceed the maximum uplink bit rate of the logical channel. However, After the uplink bit rate of the logical channel exceeds the maximum uplink bit rate of the logical channel, the logical channel is suspended, that is, in the next TTI, the terminal device no longer allocates uplink resources for the logical channel until the logical channel The upstream bit rate of is less than or equal to the maximum upstream bit rate of the logical channel.
  • the terminal device may perform the second round of allocation.
  • the first logical channel is a logical channel whose uplink bit rate is less than the maximum uplink bit rate of the logical channel among the logical channels that still have data to be transmitted. For all logical channels that have reached the maximum uplink bit rate in the first round of allocation, no matter whether there is still data to be sent, the second round of allocation is not performed.
  • the terminal device can allocate the remaining uplink resources based on the maximum uplink bit rate of the first logical channel, that is, the UMBR of the first logical channel, until any one of the following conditions is met: the first logical channel has no data to be transmitted Or the remaining uplink resources are exhausted, so that the uplink bit rate of the first logical channel is less than or equal to the UMBR of the first logical channel from a time average perspective.
  • the foregoing first logical channel may be one logical channel, or may include multiple logical channels. In the following, the process of the second round of allocation will be described in detail in two cases.
  • the first logical channel is a logical channel
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the first logical channel, including: if the first logical channel The sum of the uplink bit rate of the first service data unit SDU in the channel that is not multiplexed into the protocol data unit PDU and the uplink bit rate of the second SDU in the first logical channel that has been multiplexed into the PDU is less than or equal to this The maximum uplink bit rate of the first logical channel, the terminal device multiplexes the first SDU into the PDU; or, if the sum of the uplink bit rate of the first SDU and the uplink bit rate of the second SDU is greater than the first For the maximum uplink bit rate of the logical channel, the terminal device performs segmentation processing on the first SDU, obtains the first sub SDU, and multiplexes the first sub SDU into the PDU.
  • the terminal device can duplicate the first SDU. Use PDU; otherwise, the terminal device can segment the first SDU and multiplex the obtained first sub SDU into the PDU, so that the sum of the uplink bit rate of the first sub SDU and the uplink bit rate of the second SDU Equal to the UMBR of the first logical channel. That is, when the terminal device allocates uplink resources, it may try not to segment the SDU, and when segmenting the SDU, try to multiplex a larger SDU segment into the PDU, so as to maximize the data transmission of the logical channel.
  • the first logical channel includes at least two logical channels
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the first logical channel, including: the terminal device Based on the maximum uplink bit rate of the at least two logical channels, the remaining uplink resources are allocated in descending order of priority of the at least two logical channels until any one of the following conditions is met: the at least two logical channels There is no data to be transmitted, or the remaining uplink resources are exhausted, or the uplink bit rate of the at least two logical channels reaches the limit of the maximum uplink bit rate of the at least two logical channels.
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rates of the at least two logical channels in the descending order of the priorities of the at least two logical channels, including: the terminal device allocates the remaining uplink resources from the at least two logical channels.
  • the second logical channel is selected from the logical channels, and the second logical channel is the logical channel with the highest priority among the at least two logical channels; if the second logical channel is not multiplexed into the PDU, the uplink bit rate of the third SDU The sum of the uplink bit rate of the fourth SDU in the second logical channel that has been multiplexed into the PDU is less than or equal to the maximum uplink bit rate of the second logical channel, and the terminal device multiplexes the third SDU to the PDU; if the sum of the uplink bit rate of the third SDU that is not multiplexed into the PDU in the second logical channel and the uplink bit rate of the fourth SDU that has been multiplexed into the PDU in the second logical channel is greater than the first For the maximum uplink bit rate of the second logical channel, the terminal device will perform segmentation processing on the third SDU to obtain the third sub-SDU; the terminal device multiplexes the third sub-SDU into the PDU.
  • the first logical channel includes at least two logical channels, and the second logical channel has the highest priority. Therefore, the terminal device preferentially allocates uplink resources to the second logical channel. If the third SDU of the second logical channel and the fourth SDU of the second logical channel that have been multiplexed into the PDU can meet the restriction of the UMBR of the second logical channel, the terminal device may multiplex the third SDU into the PDU; Otherwise, the terminal device may perform segmentation processing on the third SDU, and multiplex the obtained third sub SDU into the PDU, so that the sum of the uplink bit rate of the third sub SDU and the uplink bit rate of the fourth SDU is equal to the second UMBR of the logical channel. That is, when the terminal device allocates uplink resources, it may try not to segment the SDU, and when segmenting the SDU, try to multiplex a larger SDU segment into the PDU, so as to maximize the data transmission of the logical channel.
  • the terminal device After the terminal device allocates uplink resources for the second logical channel according to the above method, if there are still remaining uplink resources, the terminal device can continue to allocate uplink resources for the logical channel of the next priority.
  • the logical channel of the next priority refers to the Among the above-mentioned at least two logical channels, the second logical channel is the logical channel with the next priority.
  • the specific allocation method is similar and will not be repeated here.
  • the terminal device may follow the following principles:
  • the terminal device needs to segment the SDU in the logical channel due to the limitation of UMBR, it should fill in the largest segment as much as possible according to the size of the remaining resources and the UMBR of the logical channel, that is, the terminal device should maximize the data transmission;
  • Fig. 6 shows a schematic diagram of an uplink resource allocation result according to an embodiment of the present application.
  • LCH 1 and LCH 2 there are two logical channels, LCH 1 and LCH 2, respectively, and LCH 1 and LCH 2 correspond to a network slice i.
  • the priority of LCH 1 is 1, and the priority of LCH 2 is 2. Assuming that a smaller value indicates a higher priority, LCH 1 has the highest priority, and LCH 2 has the second highest priority.
  • the data to be transmitted of LCH 1 is DATA 1
  • the priority bit rate of LCH 1 is PBR 1
  • the maximum uplink bit rate of LCH 1 is UMBR 1
  • the data to be transmitted of LCH 2 is DATA 2
  • the priority bit rate of LCH 2 is The maximum uplink bit rate of PBR 2
  • LCH 2 is UMBR 2.
  • the maximum upstream bit rate of network slice i The sum of UMBR 1 and UMBR 2 is less than
  • the first round of allocation is performed first, that is, the terminal device preferentially allocates uplink resources for LCH 1, and multiplexes SDU 1 to PDU, so that the uplink bit rate of LCH 1 reaches the limit of PBR 1, and the terminal device connects
  • LCH 2 can be processed, and SDU 2 can be multiplexed into PDU, so that the uplink bit rate of LCH 2 reaches the limit of PBR 2. Since both LCH 1 and LCH 2 have been allocated to uplink resources, and there are still remaining uplink resources, the terminal device can perform the second round of allocation next.
  • the terminal equipment multiplexes the SDU 3 of LCH 1 to the PDU, so that the uplink bit rate of LCH 1 reaches the limit of UMBR 1. At this time, although LCH 1 still has data to be transmitted, the uplink bit rate of LCH 1 has reached UMBR 1 It is no longer possible to continue to allocate uplink resources for LCH1. Since there are still remaining uplink resources, the terminal equipment multiplexes the SDU 4 of the LCH 2 to the PDU. Although the uplink bit rate of LCH 2 has not reached the limit of UMBR 2, there is no data to be transmitted on LCH 2 at this time. According to the method of the embodiment of the present application, the actual row bit rate of the network slice i is less than the maximum uplink bit rate of the network slice i.
  • Figure 6 above only shows an ideal situation, that is, after SDU 1 (which may include one or more SDUs) is multiplexed into PDU, the uplink bit rate of LCH 1 is exactly equal to PBR 1, and SDU 2 (which may include After one or more SDUs are multiplexed into the PDU, the uplink bit rate of LCH 2 is exactly equal to PBR 2.
  • SDU 3 can include one SDU, multiple SDUs, or sub-SDUs after segmentation. Since the terminal device can segment the SDU in the second round of allocation algorithm, the uplink bit rate of LCH 1 can be equal to UMBR 1. .
  • the network device configures the maximum uplink bit rate of the logical channel for the terminal device, ensuring that the sum of the maximum uplink bit rate of all logical channels corresponding to a network slice is less than or equal to the maximum uplink bit rate in the network slice, and the terminal device
  • the second round of resource allocation for the logical channel needs to be performed based on the maximum uplink bit rate of the logical channel. In this way, the control of the uplink transmission rate in the network slice by the terminal device is realized, which is beneficial to avoid the problem of overload of the uplink transmission rate in the network slice when the terminal device performs uplink data transmission, and reduces the risk of network congestion.
  • the embodiment of the present application also provides another method for controlling uplink data transmission, which can also realize the control of the uplink transmission rate in the network slice by the terminal device.
  • FIG. 7 is a schematic flowchart of another method 700 for controlling uplink data transmission according to an embodiment of the present application.
  • the method 700 can be applied to the communication system 100 shown in FIG. 1, which is not limited in the embodiment of the present application.
  • the method 700 may include:
  • the terminal device determines the priority bit rate PBR of the logical channel and the maximum uplink bit rate of the network slice, and the logical channel corresponds to the network slice.
  • the terminal device allocates uplink resources for the logical channel based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice.
  • the foregoing logical channels may include one or more logical channels, and the one or more logical channels correspond to one or more network slices.
  • the three logical channels can correspond to two network slices, that is, logical channel 1 and logical channel 2 correspond to network slice 1.
  • Logical channel 3 corresponds to network slice 2.
  • the maximum uplink bit rate of a network slice is for a single network slice, and the maximum uplink bit rate of a network slice represents the upper limit of the bit rate of uplink transmission of all logical channels corresponding to the network slice.
  • the maximum uplink bit rate of network slicing is abbreviated as
  • the PBR of the above logical channel and the network slice may be obtained in advance by the terminal device.
  • the PBR of the logical channel may be configured by the network device through configuration information (for example, LogicalChannelConfig information element) for the terminal device.
  • configuration information for example, LogicalChannelConfig information element
  • Network slicing The network device may be configured for the terminal device, or may be defined by the protocol, which is not limited in the embodiment of the present application.
  • the terminal device allocates uplink resources based on the maximum uplink bit rate of the network slice to the logical channel to ensure that the sum of the uplink bit rates of all logical channels corresponding to a network slice is less than or equal to that of the network.
  • the maximum uplink bit rate in the slice realizes the control of the uplink transmission rate of the terminal device in the network slice, which helps avoid the problem of the uplink transmission rate overload in the network slice when the terminal device performs uplink data transmission, and reduces the risk of network congestion.
  • the method 700 may further include:
  • the terminal device sends a protocol data unit PDU to the network device, and correspondingly, the network device receives the PDU from the terminal device.
  • the PDU includes data from a logical channel, the logical channel corresponds to a network slice, and the data of the logical channel is based on the The priority bit rate of the logical channel and the maximum uplink bit rate of the network slice are multiplexed into the PDU.
  • the network device parses the PDU to obtain data of the logical channel.
  • the terminal device may allocate uplink resources for each logical channel according to the foregoing S710 and S720, that is, multiplex the SDU of each logical channel into the PDU, and then the terminal device may send the PDU to the network device.
  • the PDU sent by the terminal device may include data from one or more logical channels (ie, SDU), and the one or more logical channels may correspond to one or more network slices.
  • the logical channel is a logical channel
  • the terminal device allocates uplink resources for the logical channel based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice, including: the terminal device is based on The priority bit rate of the logical channel and the maximum uplink bit rate of the network slice.
  • Uplink resources are allocated for the logical channel until any one of the following conditions is met: the uplink bit rate of the logical channel reaches the priority bit of the logical channel Rate limitation, or the uplink bit rate of the network slice exceeds the maximum uplink bit rate of the network slice, or the uplink resources are exhausted.
  • the logical channel includes at least two logical channels
  • the terminal device allocates uplink resources for the logical channel based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice, including: Based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice, the terminal device allocates uplink resources for the at least two logical channels in descending order of the priority of the at least two logical channels until any of the following conditions Until one is satisfied: the uplink bit rates of the at least two logical channels both reach the priority bit rate limit of the at least two logical channels, or the uplink bit rates of the network slices corresponding to the at least two logical channels reach the at least two The uplink bit rate of the network slice corresponding to the logical channel is limited, or the uplink resources are exhausted.
  • the above allocation process is the first round of allocation, that is, the terminal device can refer to the new token bucket algorithm proposed in the embodiment of this application to allocate uplink resources to the logical channel, which can make the multiple logical channels be viewed from the perspective of time average.
  • the uplink bit rate of the channel is less than or equal to the respective priority bit rate, and from a time average perspective, the uplink bit rate of each network slice is less than or equal to the respective maximum uplink bit rate.
  • the following describes in detail the first-round allocation algorithm (that is, the new token bucket algorithm) of the embodiment of the present application.
  • the terminal device is based on the priority bit rate of the at least two logical channels and the maximum uplink bit rate of the network slice according to the descending order of the priority of the at least two logical channels.
  • the logical channel allocation of uplink resources includes: when the number of tokens corresponding to the first logical channel of the at least two logical channels is greater than 0, the terminal device determines the value of the first logical channel of the at least two logical channels.
  • the terminal device After the first service data unit SDU is multiplexed into the protocol data unit PDU, the cumulative uplink bit rate of the first network slice in the network slice corresponding to the first logical channel, and the first logical channel is the at least two logical channels If the cumulative uplink bit rate of the first network slice is less than or equal to the maximum uplink bit rate of the first network slice, the terminal device multiplexes the first SDU into the PDU; if the first network slice has the highest priority logical channel; The cumulative uplink bit rate of a network slice is greater than the maximum uplink bit rate of the first network slice, and the number of tokens corresponding to the second logical channel of the at least two logical channels is greater than 0, the terminal device determines the second logical channel After the second SDU of the channel is multiplexed into the PDU, the cumulative uplink bit rate of the second network slice in the network slice corresponding to the second logical channel is the second logical channel of the at least two logical channels. A logical channel with the next priority of a logical channel
  • the terminal device first allocates uplink resources to the first logical channel with the highest priority according to the descending order of the priority of the at least two logical channels. If the first logical channel corresponds to the first logical channel, the first logical channel is allocated uplink resources. The cumulative uplink bit rate of a network slice exceeds the limit of the maximum uplink bit rate of the first network slice, and the terminal device allocates uplink resources to the logical channel of the next priority (that is, the second logical channel).
  • first network slice corresponding to the first logical channel and the second network slice corresponding to the second logical channel may be the same or different. That is, the first logical channel and the second logical channel may correspond to the same network slice, and It can correspond to different network slices, which is not limited in the embodiment of the present application.
  • the terminal device can perform the following steps for each logical channel in the order of decreasing priority.
  • the following takes logical channel j as an example for description.
  • Step 1 and step 2 are the same as step 1 and step 2 corresponding to FIG. 3, and will not be repeated here.
  • Step 3 If B j is greater than 0, the terminal device determines whether among them, For the cumulative uplink bit rate of the network slice i corresponding to logical channel j after multiplexing SDU 1 into the PDU, Is the cumulative upstream bit rate of network slice i.
  • Step 4 If The processing flow of the terminal device on the logical channel j ends, and then the next logical channel is processed.
  • Steps 6-8 are the same as steps 4-6 corresponding to FIG. 3, and will not be repeated here.
  • the smallest multiplexing unit is the SDU.
  • the terminal device After the terminal device multiplexes a certain SDU into the PDU, if the uplink bit rate of the current logical channel is greater than or equal to the PBR of the logical channel, then The terminal device processes the logical channel of the next priority, and the current logical channel is suspended; if the uplink bit rate of the current logical channel is less than the PBR of the logical channel, the terminal device can continue to process the next SDU of the logical channel.
  • the uplink bit rate of a logical channel may be greater than the PBR of the logical channel, equal to the PBR of the logical channel, or less than the PBR of the logical channel. This is allowed in the first round of allocation algorithm .
  • the amount of uplink data transmitted by all logical channels corresponding to a network slice within a period of time can be referred to as the cumulative data amount of the network slice.
  • the cumulative data amount of the network slice corresponds to the time period.
  • the ratio of can be called the cumulative upstream bit rate of the network slice.
  • the foregoing period of time may be a time period agreed by a protocol or configured by a network device. For example, it may be one or more TTIs, or from the time the network slice is created to the current TTI, which is not limited in the embodiment of the present application. Therefore, the cumulative data volume of the aforementioned network slice may be, for example, the sum of the uplink data volume transmitted by all logical channels in the network slice in the current TTI, or the sum of all historical data since the creation of the network slice.
  • the cumulative uplink bit rate of the first network slice is determined based on the length of the sliding time window of the first network slice and the cumulative data volume of the first network slice in the sliding time window,
  • the cumulative data volume of the first network slice in the sliding time window is the sum of the data volume transmitted by all logical channels of the first network slice in the first time period from the current moment onwards, and the first time period
  • the length of is the length of the sliding time window.
  • the aforementioned period of time is the length of the sliding time window.
  • the sliding time window refers to a period of time going back from the current moment (for example, the current TTI).
  • FIG. 9 shows a schematic diagram of a sliding time window of an embodiment of the present application.
  • the length of the sliding time window of the first network slice may be 1000 TTIs, and the accumulated data of the first network slice The amount is the sum of the amount of data transmitted by all logical channels of the first network slice in a time period of 999 TTI backwards from the current TTI.
  • the rate limit is the concept of average time, if it is for a single TTI, it is more restrictive and less flexible. Therefore, by setting a sliding time window, you can get the latest network within a period of time (which can include multiple TTIs)
  • the cumulative data volume of the slice is more conducive to realizing the limitation of the uplink bit rate of the network slice, and improving the calculation flexibility of the uplink bit rate of the network slice.
  • the length of the sliding time window of the network slice may be obtained in advance by the terminal device.
  • the length of the sliding time window of the network slice may be configured by the network device for the terminal device, or defined by the protocol, which is not limited in the embodiment of the present application.
  • the “sliding time window” is only an exemplary example given for the convenience of description, and the term can also be replaced with a statistical time window, a sliding statistical time window or other terms, which are not limited in the embodiment of the present application.
  • the method further includes: the network device determines the length of the sliding time window of the network slice; the network device sends the second information to the terminal device, and correspondingly, the terminal device receives the second information sent by the network device , The second information is used to indicate the length of the sliding time window of the network slice.
  • the lengths of the sliding time windows corresponding to multiple network slices may be the same or different. If the sliding time windows corresponding to multiple network slices have the same length, the network device can indicate the length through a second message. If the lengths of the sliding time windows corresponding to multiple network slices are not the same, the network device can indicate the identifier of the network slice and the length of the sliding time window of the network slice through the second information, so that the length of the sliding time window of the network slice is the same as that of the network slice. Corresponding to the logo. For example, the foregoing second information may indicate length 1, length 2, and length 3, and indicate that length 1 corresponds to network slice 1, length 2 corresponds to network slice 2, and length 3 corresponds to network slice 3.
  • the network device may determine the length of the sliding time window of the network slice based on the type of the network slice. For example, for network slices of delay-sensitive services, the length of the sliding time window is shorter; for network slices of delay-insensitive services, the length of the sliding time window is longer.
  • the network device can set different sliding time window lengths for different types of network slices to adapt to different service characteristics, thereby flexibly adapting to multiple service scenarios.
  • the method further includes: if there are remaining uplink resources And the third logical channel in the logical channel still has data to be transmitted, and the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the network slice corresponding to the third logical channel until any of the following conditions Until it is satisfied: the third logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the cumulative uplink bit rate of the network slice corresponding to the third logical channel reaches the maximum of the network slice corresponding to the third logical channel The upper limit bit rate limit.
  • the terminal device may perform the second round of allocation.
  • the third logical channel is a logical channel for which the cumulative uplink bit rate of the corresponding network slice is less than the maximum uplink bit rate of the network slice among the logical channels that still have data to be transmitted. For all logical channels corresponding to the network slice that has reached the maximum uplink bit rate in the first round of allocation, no matter whether there is still data to be sent, the second round of allocation is not performed.
  • the terminal device may allocate the remaining uplink resources based on the maximum uplink bit rate of the network slice corresponding to the third logical channel until any one of the following conditions is met: the third logical channel has no data to be transmitted, or the remaining uplink resources The uplink resources are exhausted, or the cumulative uplink bit rate of the network slice corresponding to the third logical channel reaches the limit of the maximum uplink bit rate of the network slice corresponding to the third logical channel.
  • the foregoing third logical channel may be one logical channel or may include multiple logical channels, and the network slice corresponding to the third logical channel may be one network slice or multiple network slices. In the following, the process of the second round of allocation will be described in detail in two cases.
  • the third logical channel is a logical channel
  • the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the network slice corresponding to the third logical channel, including: After the third SDU in the third logical channel that is not multiplexed into the PDU is multiplexed into the PDU, the cumulative uplink bit rate of the third network slice in the network slice corresponding to the third logical channel is less than or equal to the For the maximum uplink bit rate of the third network slice, the terminal device multiplexes the third SDU into the PDU; or, if the third SDU is multiplexed into the PDU, the cumulative uplink bit rate of the third network slice is greater than For the maximum uplink bit rate of the third network slice, the terminal device performs segmentation processing on the third SDU to obtain a third sub SDU, and multiplex the third sub SDU into the PDU.
  • the terminal device can multiplex the third SDU into the PDU; otherwise, the terminal device can segment the third SDU and multiplex the obtained third sub-SDU into the PDU, so that the accumulated uplink bits of the third network slice The rate is equal to the maximum uplink bit rate of the third network slice. That is, when the terminal device allocates uplink resources, it may try not to segment the SDU, and when segmenting the SDU, try to multiplex a larger SDU segment into the PDU, so as to maximize the data transmission of the logical channel.
  • the third logical channel includes at least two logical channels, and the terminal device allocates the remaining uplink resources based on the maximum uplink bit rate of the network slice corresponding to the third logical channel, including : Based on the maximum uplink bit rate of the network slice corresponding to the third logical channel, the terminal device allocates the remaining uplink resources in the descending order of the priority of the third logical channel until any one of the following conditions is met: The third logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the cumulative uplink bit rate of the network slice corresponding to the third logical channel reaches the maximum upper limit bit rate of the network slice corresponding to the third logical channel limit.
  • the terminal device allocates the remaining uplink resources in the descending order of the priority of the third logical channel, including: The fourth logical channel is selected from the three logical channels, and the fourth logical channel is the logical channel with the highest priority among the third logical channels; if the fourth SDU that is not multiplexed into the PDU in the fourth logical channel is multiplexed to After the PDU, if the cumulative uplink bit rate of the fourth network slice corresponding to the fourth logical channel is less than or equal to the maximum uplink bit rate of the fourth network slice, the terminal device multiplexes the fourth SDU into the PDU; After the fourth SDU in the fourth logical channel that is not multiplexed into the PDU is multiplexed into the PDU, the cumulative uplink bit rate of the fourth network slice corresponding to the fourth logical channel is greater than the maximum uplink bit rate of the fourth network slice , The terminal device performs segmentation processing on the fourth
  • the third logical channel includes at least two logical channels, and the fourth logical channel has the highest priority. Therefore, the terminal device preferentially allocates uplink resources to the fourth logical channel. If after the fourth SDU of the fourth logical channel is multiplexed into the PDU, the cumulative uplink bit rate of the fourth network slice corresponding to the fourth logical channel can meet the limitation of the maximum uplink bit rate of the fourth network slice, the terminal device can The fourth SDU is multiplexed into the PDU; otherwise, the terminal device can perform segment processing on the fourth SDU, and multiplex the obtained fourth sub-SDU into the PDU, so that the cumulative uplink bit rate of the fourth network slice is equal to the first The maximum upstream bit rate of four network slices. That is, when the terminal device allocates uplink resources, it may try not to segment the SDU, and when segmenting the SDU, try to multiplex a larger SDU segment into the PDU, so as to maximize the data transmission of the logical channel.
  • the terminal device After the terminal device allocates uplink resources for the fourth logical channel according to the above method, if there are still remaining uplink resources, the terminal device can continue to allocate uplink resources for the logical channel of the next priority.
  • the logical channel of the next priority refers to the logical channel of the next priority.
  • the fourth logical channel is the logical channel with the next priority. The specific allocation method is similar and will not be repeated here.
  • the terminal device may follow the following principles:
  • the terminal device needs to segment the SDU in the logical channel due to the limitation of the maximum uplink bit rate of the network slice, it should fill in as much as possible according to the size of the remaining resources and the maximum uplink bit rate of the network slice corresponding to the logical channel. Enter the maximum segment, that is, the terminal equipment should maximize the data transmission;
  • FIG. 10 shows a schematic diagram of another uplink resource allocation result according to an embodiment of the present application.
  • LCH 1 and LCH 2 correspond to a network slice i.
  • the maximum upstream bit rate of network slice i The priority of LCH 1 is 1, and the priority of LCH 2 is 2. Assuming that a smaller value indicates a higher priority, LCH 1 has the highest priority, and LCH 2 has the second highest priority.
  • the data to be transmitted of LCH 1 is DATA 1
  • the priority bit rate of LCH 1 is PBR 1
  • the data to be transmitted of LCH 2 is DATA 2
  • the priority bit rate of LCH 2 is PBR 2.
  • the first round of allocation is performed first, that is, the terminal device preferentially allocates uplink resources for LCH 1, and multiplexes SDU 1 to PDU, so that the uplink bit rate of LCH 1 reaches the limit of PBR 1, due to network slicing i's cumulative upstream bit rate does not exceed
  • the terminal device can then process LCH 2.
  • the terminal device can multiplex SDU 2 to the PDU, so that the cumulative uplink bit rate of network slice i is equal to At this point, although both LCH 1 and LCH 2 still have data to be sent, and there are remaining uplink resources, the cumulative uplink bit rate of this network slice i has reached The terminal device no longer performs the second round of allocation.
  • Figure 10 above only shows an ideal situation, that is, after SDU 1 (which may include one or more SDUs) is multiplexed into the PDU, the uplink bit rate of LCH 1 is exactly equal to PBR 1, and SDU 2 (which may include After one or more SDUs are multiplexed into the PDU, the sum of the uplink bit rate of LCH 1 and the uplink bit rate of LCH 2 is exactly equal to
  • FIG. 11 shows a schematic diagram of another uplink resource allocation result according to an embodiment of the present application.
  • LCH 1 and LCH 2 correspond to a network slice i.
  • the maximum upstream bit rate of network slice i The priority of LCH 1 is 1, and the priority of LCH 2 is 2. Assuming that a smaller value indicates a higher priority, LCH 1 has the highest priority, and LCH 2 has the second highest priority.
  • the data to be transmitted of LCH 1 is DATA 1
  • the priority bit rate of LCH 1 is PBR 1
  • the data to be transmitted of LCH 2 is DATA 2
  • the priority bit rate of LCH 2 is PBR 2.
  • the first round of allocation is performed first, that is, the terminal device preferentially allocates uplink resources for LCH 1, and multiplexes SDU 1 to PDU, so that the uplink bit rate of LCH 1 reaches the limit of PBR 1, due to network slicing i's cumulative upstream bit rate does not exceed
  • the terminal device can then process LCH 2.
  • the terminal equipment multiplexes the SDU 2 to the PDU, so that the uplink bit rate of LCH 2 reaches the limit of PBR 2. At this time, both LCH 1 and LCH 2 still have data to be sent, and there are remaining uplink resources.
  • the cumulative uplink bit rate of this network slice i is less than The terminal device can continue to perform the second round of allocation.
  • the terminal device can segment SDU 3 to obtain SDU 3', and multiplex SDU 3'into PDU, so that the cumulative uplink bit rate of network slice i is equal to The second round of distribution is over.
  • Figure 11 above only shows an ideal situation, that is, after SDU 1 (which may include one or more SDUs) is multiplexed into PDU, the uplink bit rate of LCH 1 is exactly equal to PBR 1, and SDU 2 (which may include After one or more SDUs are multiplexed into the PDU, the sum of the uplink bit rate of LCH 1 and the uplink bit rate of LCH 2 is exactly equal to PBR 2.
  • the above method 700 ensures that the cumulative uplink bit rate corresponding to a network slice is less than or equal to the maximum uplink bit rate of the network slice through the terminal device based on the maximum uplink bit rate of the network slice corresponding to the logical channel, that is, the terminal device needs to be based on the network slice.
  • Maximum uplink bit rate, the first round of resource allocation and the second round of resource allocation for logical channels are beneficial to avoid the problem of overload of the uplink transmission rate in the network slice when the terminal device performs uplink data transmission, and reduces the risk of network congestion.
  • the foregoing method 500 and method 700 of the embodiment of the present application may be applied to a control scheme for the uplink bit rate of a PDU session.
  • a control scheme for the uplink bit rate of a PDU session Exemplarily, it is only necessary to replace the maximum uplink bit rate of the network slice in the above method with the maximum uplink bit rate of the PDU session, which will not be repeated here.
  • FIG. 12 is a schematic block diagram of a device for controlling uplink data transmission according to an embodiment of the present application.
  • the apparatus 1200 may include a transceiver unit 1210 and a processing unit 1220.
  • the apparatus 1200 may correspond to the terminal device in the above method embodiment, for example, it may be a terminal device or a chip configured in the terminal device.
  • the apparatus 1000 is configured to execute each step or process corresponding to the terminal device in the foregoing method embodiment 500.
  • the transceiving unit 1210 is configured to: receive first information from a network device, where the first information is used to indicate the maximum uplink bit rate of each logical channel in at least one logical channel; the processing unit 1220 is configured to: The uplink bit rate allocates uplink resources to all or part of the logical channels in the at least one logical channel.
  • the processing unit 1220 is specifically configured to allocate uplink resources for all or part of the logical channels in the at least one logical channel based on the priority bit rate and the maximum uplink bit rate of the at least one logical channel.
  • the processing unit 1220 is specifically configured to: allocate uplink resources for the at least one logical channel based on the priority bit rate of the logical channel; if there are remaining uplink resources and the first logical channel of the at least one logical channel There is still data to be transmitted. Based on the maximum uplink bit rate of the first logical channel, the remaining uplink resources are allocated until any one of the following conditions is met: the first logical channel has no data to be transmitted, or the remaining uplink resources The uplink resources are exhausted, or the uplink bit rate of the first logical channel reaches the maximum uplink bit rate of the first logical channel.
  • the processing unit 1220 is specifically configured to: if the uplink bit rate of the first service data unit SDU that is not multiplexed into the protocol data unit PDU in the first logical channel is multiplexed with the first logical channel The sum of the uplink bit rate of the second SDU to the PDU is less than or equal to the maximum uplink bit rate of the first logical channel, and the first SDU is multiplexed into the PDU.
  • the processing unit 1220 is specifically configured to: if the uplink bit rate of the first SDU in the first logical channel that has not been multiplexed into the PDU and the first logical channel that has been multiplexed into the PDU in the first logical channel The sum of the uplink bit rates of the two SDUs is greater than the maximum uplink bit rate of the first logical channel, performing segmentation processing on the first SDU to obtain the first sub-SDU, and multiplexing the first sub-SDU into the PDU.
  • the first logical channel includes at least two logical channels
  • the processing unit 1220 is specifically configured to: based on the maximum uplink bit rate of the at least two logical channels, according to the descending order of priority of the at least two logical channels, The remaining uplink resources are allocated until any one of the following conditions is met: the at least two logical channels have no data to be transmitted, or the remaining uplink resources are exhausted, or the uplink bit rate of the at least two logical channels reaches The maximum uplink bit rate of the at least two logical channels is limited.
  • the processing unit 1220 is specifically configured to: if the uplink bit rate of the third SDU in the second logical channel that has not been multiplexed into the PDU and the fourth SDU in the second logical channel that has been multiplexed into the PDU The sum of the uplink bit rate of is less than or equal to the maximum uplink bit rate of the second logical channel, the third SDU is multiplexed into the PDU, and the second logical channel is the logical channel with the highest priority among the at least two logical channels .
  • the processing unit 1220 is specifically configured to: if the uplink bit rate of the third SDU in the second logical channel that is not multiplexed into the PDU and the fourth SDU in the second logical channel that has been multiplexed into the PDU If the sum of the uplink bit rate is greater than the maximum uplink bit rate of the second logical channel, the third SDU will be segmented to obtain the third sub SDU, and the third sub SDU will be multiplexed into the PDU.
  • the second logical channel is the logical channel with the highest priority among the at least two logical channels.
  • the apparatus 1200 may correspond to the network device in the above method embodiment, for example, it may be a network device or a chip configured in the network device.
  • the apparatus 1000 is configured to execute each step or process corresponding to the network device in the foregoing method embodiment 500.
  • the processing unit 1220 is configured to determine first information, which is used to indicate the maximum uplink bit rate of each logical channel in at least one logical channel; the transceiver unit 1210 is configured to send the first information to a terminal device.
  • the transceiver unit 1210 is further configured to: receive a protocol data unit PDU from the terminal device, the PDU includes data from all or part of the logical channels in the at least one logical channel, and the data of all or part of the logical channels is Based on the maximum uplink bit rate to be multiplexed into the PDU.
  • the processing unit 1220 is configured to: parse the PDU to obtain all or part of the logical channel data.
  • the at least one logical channel corresponds to one network slice.
  • the at least one logical channel corresponds to one PDU session.
  • the apparatus 1200 may correspond to the terminal device in the above method embodiment, for example, it may be a terminal device or a chip configured in the terminal device.
  • the apparatus 1000 is configured to execute each step or process corresponding to the terminal device in the foregoing method embodiment 700.
  • the processing unit 1220 is used to determine the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice, and the logical channel corresponds to the network slice; the processing unit 1220 is also used to: based on the priority bit rate of the logical channel And the maximum uplink bit rate of the network slice to allocate uplink resources for the logical channel.
  • the processing unit 1220 is specifically configured to: the terminal device allocates uplink resources for the logical channel based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice until any one of the following conditions is met : The uplink bit rate of the logical channel reaches the limit of the priority bit rate of the logical channel, or the uplink bit rate of the network slice exceeds the maximum uplink bit rate of the network slice, or the uplink resources are exhausted.
  • the logical channel includes at least two logical channels
  • the processing unit 1220 is specifically configured to: based on the priority bit rate of the at least two logical channels and the maximum uplink bit rate of the network slice, according to the at least two logical channels In the descending order of priority, the uplink resources are allocated to the at least two logical channels until any one of the following conditions is met: the uplink bit rate of the at least two logical channels reaches the priority bit rate of the at least two logical channels Or the uplink bit rate of the network slice corresponding to the at least two logical channels reaches the limit of the uplink bit rate of the network slice corresponding to the at least two logical channels, or the uplink resources are exhausted.
  • the processing unit 1220 is specifically configured to: if the number of tokens corresponding to the first logical channel of the at least two logical channels is greater than 0, if the first logical channel of the at least two logical channels is After the first service data unit SDU is multiplexed into the protocol data unit PDU, the cumulative uplink bit rate of the first network slice in the network slice corresponding to the first logical channel is less than or equal to the maximum uplink bit rate of the first network slice
  • the first SDU is multiplexed to the PDU, and the first logical channel is the logical channel with the highest priority among the at least two logical channels.
  • the processing unit 1220 is specifically configured to: if the number of tokens corresponding to the first logical channel of the at least two logical channels is greater than 0, if the first logical channel of the at least two logical channels is After the first SDU is multiplexed into the PDU, the cumulative uplink bit rate of the first network slice in the network slice corresponding to the first logical channel is greater than the maximum uplink bit rate of the first network slice, and the at least two logical channels The number of tokens corresponding to the second logical channel in the channel is greater than 0, and after the second SDU of the second logical channel of the at least two logical channels is multiplexed into the PDU, the network slice corresponding to the second logical channel The cumulative uplink bit rate of the second network slice in the second network slice is less than or equal to the maximum uplink bit rate of the second network slice, the second SDU is multiplexed into the PDU, and the first logical channel is the priority of the at least two logical channels The logical channel with the highest level, and the second
  • the cumulative uplink bit rate of the first network slice is determined based on the length of the sliding time window of the first network slice and the cumulative data volume of the first network slice in the sliding time window.
  • the cumulative data volume of the slice in the sliding time window is the sum of the data volume transmitted by all logical channels of the first network slice in the first time period from the current moment onwards, and the length of the first time period is the The length of the sliding time window.
  • the device further includes: a transceiving unit 1210, configured to receive second information sent by a network device, where the second information is used to indicate the length of the sliding time window of the first network slice.
  • a transceiving unit 1210 configured to receive second information sent by a network device, where the second information is used to indicate the length of the sliding time window of the first network slice.
  • the processing unit 1220 is specifically configured to: after allocating uplink resources for the logical channel based on the priority bit rate of the logical channel and the maximum uplink bit rate of the network slice, if there are remaining uplink resources and the logical channel The third logical channel in the channel still has data to be transmitted. Based on the maximum uplink bit rate of the network slice corresponding to the third logical channel, the remaining uplink resources are allocated until any one of the following conditions is met: the third The logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the cumulative uplink bit rate of the network slice corresponding to the third logical channel reaches the limit of the maximum upper limit bit rate of the network slice corresponding to the third logical channel.
  • the processing unit 1220 is specifically configured to: if a third SDU in the third logical channel that is not multiplexed into the PDU is multiplexed into the PDU, the network slice corresponding to the third logical channel is If the cumulative uplink bit rate of the third network slice is less than or equal to the maximum uplink bit rate of the third network slice, the third SDU is multiplexed into the PDU; or, if the third SDU is multiplexed into the PDU, the The cumulative uplink bit rate of the third network slice is greater than the maximum uplink bit rate of the third network slice, the third SDU is segmented to obtain a third sub SDU, and the third sub SDU is multiplexed into the PDU.
  • the third logical channel includes at least two logical channels
  • the processing unit 1220 is specifically configured to: reduce the priority of the third logical channel based on the maximum uplink bit rate of the network slice corresponding to the third logical channel
  • the remaining uplink resources are allocated until any one of the following conditions is met: the third logical channel has no data to be transmitted, or the remaining uplink resources are exhausted, or the network slice corresponding to the third logical channel is The accumulated uplink bit rate reaches the limit of the maximum upper limit bit rate of the network slice corresponding to the third logical channel.
  • the processing unit 1220 is specifically configured to: if the fourth SDU in the fourth logical channel that is not multiplexed into the PDU is multiplexed into the PDU, the cumulative uplink of the fourth network slice corresponding to the fourth logical channel is The bit rate is less than or equal to the maximum uplink bit rate of the fourth network slice, the fourth SDU is multiplexed into the PDU, and the fourth logical channel is the logical channel with the highest priority among the third logical channels.
  • the processing unit 1220 is specifically configured to: if the fourth SDU in the fourth logical channel that is not multiplexed into the PDU is multiplexed into the PDU, the cumulative uplink of the fourth network slice corresponding to the fourth logical channel is If the bit rate is greater than the maximum uplink bit rate of the fourth network slice, the fourth SDU is segmented to obtain the fourth sub SDU, and the fourth sub SDU is multiplexed into the PDU.
  • the fourth logical channel is the The logical channel with the highest priority among the third logical channels.
  • the apparatus 1200 may correspond to the network device in the above method embodiment, for example, it may be a network device or a chip configured in the network device.
  • the apparatus 1200 is configured to execute various steps or processes corresponding to the network equipment in the foregoing method embodiment 700.
  • the transceiver unit 1210 is used to receive a protocol data unit PDU from a terminal device, the PDU includes data from a logical channel, the logical channel corresponds to a network slice, and the data of the logical channel is based on the priority bit rate of the logical channel and the network
  • the maximum uplink bit rate of the slice is multiplexed into the PDU; the processing unit 1220 is used to: parse the PDU to obtain the data of the logical channel.
  • the processing unit 1220 is further configured to: before the network device receives the protocol data unit PDU from the terminal device, determine the length of the sliding time window of the network slice; the transceiving unit 1210 is further configured to: Sending second information, which is used to indicate the length of the sliding time window of the network slice.
  • the second information includes the identifier of the network slice and the length of the sliding time window of the network slice, and the length of the sliding time window of the network slice corresponds to the identifier of the network slice.
  • the processing unit 1220 is specifically configured to determine the length of the sliding time window of the network slice based on the type of the network slice.
  • the device 1200 here is embodied in the form of a functional unit.
  • the term "unit” here can refer to application specific integrated circuits (ASICs), electronic circuits, processors used to execute one or more software or firmware programs (such as shared processors, proprietary processors, or groups). Processor, etc.) and memory, merged logic circuits, and/or other suitable components that support the described functions.
  • ASICs application specific integrated circuits
  • processors used to execute one or more software or firmware programs (such as shared processors, proprietary processors, or groups).
  • the apparatus 1200 may be specifically the terminal device in the above-mentioned embodiment, and may be used to execute each process and/or step corresponding to the terminal device in the above-mentioned method embodiment, or, The apparatus 1200 may be specifically a network device in the foregoing embodiment, and may be used to execute various processes and/or steps corresponding to the network device in the foregoing method embodiment. To avoid repetition, details are not described herein again.
  • the apparatus 1200 of each of the foregoing solutions has the function of implementing the corresponding steps performed by the terminal device in the foregoing method, or the apparatus 1200 of the foregoing various solutions has the function of implementing the corresponding steps performed by the network device of the foregoing method.
  • the function can be realized by hardware, or by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions; for example, the communication unit can be replaced by a transceiver (for example, the sending unit in the communication unit can be replaced by a transmitter, and the receiving unit in the communication unit can be replaced by a receiver. Machine replacement), other units, such as processing units, etc., can be replaced by processors to perform the transceiver operations and related processing operations in each method embodiment respectively.
  • the aforementioned communication unit may also be a transceiver circuit (for example, it may include a receiving circuit and a transmitting circuit), and the processing unit may be a processing circuit.
  • the device in FIG. 12 may be the terminal device or the network device in the foregoing embodiment, or may be a chip or a chip system, such as a system on chip (SoC).
  • the communication unit may be an input/output circuit or a communication interface; the processing unit is a processor, microprocessor, or integrated circuit integrated on the chip. There is no limitation here.
  • FIG. 13 shows an apparatus 1300 for controlling uplink data transmission provided by an embodiment of the present application.
  • the device 1300 includes a processor 1310 and a transceiver 1320.
  • the processor 1310 and the transceiver 1320 communicate with each other through an internal connection path, and the processor 1310 is used to execute instructions to control the transceiver 1320 to send signals and/or receive signals.
  • the device 1300 may further include a memory 1330, and the memory 1330 communicates with the processor 1310 and the transceiver 1320 through an internal connection path.
  • the memory 1330 is used to store instructions, and the processor 1310 can execute the instructions stored in the memory 1330.
  • the apparatus 1300 is configured to implement various processes and steps corresponding to the sending end in the foregoing method embodiment.
  • the apparatus 1300 is used to implement various processes and steps corresponding to the receiving end in the foregoing method embodiments.
  • the apparatus 1300 may be specifically a terminal device or a network device in the foregoing embodiment, or may be a chip or a chip system.
  • the transceiver 1320 may be the transceiver circuit of the chip, which is not limited here.
  • the apparatus 1300 may be used to execute various steps and/or processes corresponding to terminal equipment or network equipment in the foregoing method embodiments.
  • the memory 1330 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A part of the memory may also include a non-volatile random access memory.
  • the memory can also store device type information.
  • the processor 1310 may be used to execute instructions stored in the memory, and when the processor 1310 executes the instructions stored in the memory, the processor 1310 is used to execute each step of the above-mentioned method embodiment corresponding to the terminal device or the network device And/or process.
  • FIG. 14 is a schematic structural diagram of a terminal device 1400 according to an embodiment of the present application.
  • the terminal device 1400 can be applied to the system shown in FIG. 1 to perform the functions of the terminal device in the foregoing method embodiment.
  • the terminal device 1400 includes a processor 1410 and a transceiver 1420.
  • the terminal device 1400 further includes a memory 1430.
  • the processor 1410, the transceiver 1420, and the memory 1430 can communicate with each other through internal connection paths to transfer control and/or data signals.
  • the memory 1430 is used to store computer programs, and the processor 1410 is used to download from the memory 1430. Call and run the computer program to control the transceiver 1420 to send and receive signals.
  • the terminal device 1400 may further include an antenna 1440 for transmitting uplink data or uplink control signaling output by the transceiver 1420 through a wireless signal.
  • the foregoing processor 1410 and the memory 1430 may be combined into a processing device, and the processor 1410 is configured to execute the program code stored in the memory 1430 to implement the foregoing functions.
  • the memory 1430 may also be integrated in the processor 1410 or independent of the processor 1410.
  • the processor 1410 may correspond to the processing unit in FIG. 11.
  • the foregoing transceiver 1420 may correspond to the transceiver unit in FIG. 12, and may also be referred to as a transceiver unit.
  • the transceiver 1420 may include a receiver (or called a receiver, a receiving circuit) and a transmitter (or called a transmitter, a transmitting circuit). Among them, the receiver is used to receive signals, and the transmitter is used to transmit signals.
  • terminal device 1400 shown in FIG. 14 can implement various processes involving the terminal device in the foregoing method embodiments.
  • the operations and/or functions of each module in the terminal device 1400 are respectively for implementing the corresponding processes in the foregoing method embodiments.
  • the above-mentioned processor 1410 can be used to execute the actions described in the previous method embodiments implemented by the terminal device, and the transceiver 1420 can be used to execute the terminal device described in the previous method embodiments to send to or receive from the network device. action.
  • the transceiver 1420 can be used to execute the terminal device described in the previous method embodiments to send to or receive from the network device. action.
  • the aforementioned terminal device 1400 may further include a power supply 1450 for providing power to various devices or circuits in the terminal device.
  • the terminal device 1400 may also include one or more of the input unit 1460, the display unit 1470, the audio circuit 1480, the camera 1490, and the sensor 1411.
  • the audio circuit It may also include a speaker 1482, a microphone 1484, and so on.
  • An embodiment of the present application also provides a processing device, including a processor and an interface; the processor is configured to execute the method in any of the foregoing method embodiments.
  • the aforementioned processing device may be a chip.
  • the processing device may be a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on chip (SoC), or It is a central processor unit (CPU), it can also be a network processor (NP), it can also be a digital signal processing circuit (digital signal processor, DSP), or it can be a microcontroller (microcontroller unit). , MCU), it can also be a programmable logic device (PLD) or other integrated chips.
  • FPGA field programmable gate array
  • ASIC application specific integrated circuit
  • SoC system on chip
  • CPU central processor unit
  • NP network processor
  • DSP digital signal processing circuit
  • microcontroller unit microcontroller unit
  • MCU programmable logic device
  • PLD programmable logic device
  • each step of the above method can be completed by an integrated logic circuit of hardware in the processor or instructions in the form of software.
  • the steps of the method disclosed in combination with the embodiments of the present application may be directly embodied as being executed and completed by a hardware processor, or executed and completed by a combination of hardware and software modules in the processor.
  • the software module can be located in a mature storage medium in the field, such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers.
  • the storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware. To avoid repetition, it will not be described in detail here.
  • the processor in the embodiment of the present application may be an integrated circuit chip with signal processing capability.
  • the steps of the foregoing method embodiments can be completed by hardware integrated logic circuits in the processor or instructions in the form of software.
  • the above-mentioned processor may be a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components .
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • the methods, steps, and logical block diagrams disclosed in the embodiments of the present application can be implemented or executed.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.
  • the steps of the method disclosed in the embodiments of the present application may be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor.
  • the software module can be located in a mature storage medium in the field, such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers.
  • the storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
  • the memory in the embodiments of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory can be read-only memory (ROM), programmable read-only memory (programmable ROM, PROM), erasable programmable read-only memory (erasable PROM, EPROM), and electrically available Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory.
  • the volatile memory may be random access memory (RAM), which is used as an external cache.
  • RAM random access memory
  • static random access memory static random access memory
  • dynamic RAM dynamic RAM
  • DRAM dynamic random access memory
  • synchronous dynamic random access memory synchronous DRAM, SDRAM
  • double data rate synchronous dynamic random access memory double data rate SDRAM, DDR SDRAM
  • enhanced synchronous dynamic random access memory enhanced SDRAM, ESDRAM
  • synchronous connection dynamic random access memory serial DRAM, SLDRAM
  • direct rambus RAM direct rambus RAM
  • the present application also provides a computer program product.
  • the computer program product includes: computer program code.
  • the computer program code runs on a computer, the computer executes the steps shown in FIGS. 5 to 11. Each step or process executed by the terminal device or the network device in the illustrated embodiment.
  • the present application also provides a computer-readable storage medium that stores program code, and when the program code runs on a computer, the computer executes FIGS. 5 to 5 Each step or process executed by the terminal device or the network device in the embodiment shown in 11.
  • the present application also provides a communication system, which includes the aforementioned one or more terminal devices and one or more network devices.
  • the network equipment in each of the above-mentioned device embodiments corresponds completely to the network equipment or terminal equipment in the terminal equipment and method embodiments, and the corresponding modules or units execute the corresponding steps.
  • the communication unit executes the receiving or the terminal equipment in the method embodiments.
  • other steps except sending and receiving can be executed by the processing unit (processor).
  • the function of the specific unit can be based on the corresponding method embodiment. Among them, there may be one or more processors.
  • component used in this specification are used to denote computer-related entities, hardware, firmware, a combination of hardware and software, software, or software in execution.
  • the component may be, but is not limited to, a process, a processor, an object, an executable file, an execution thread, a program, and/or a computer running on a processor.
  • the application running on the computing device and the computing device can be components.
  • One or more components may reside in processes and/or threads of execution, and components may be located on one computer and/or distributed between two or more computers.
  • these components can be executed from various computer-readable storage media having various data structures stored thereon.
  • the component can be based on, for example, a signal having one or more data packets (e.g. data from two components interacting with another component in a local system, a distributed system, and/or a network, such as the Internet that interacts with other systems through a signal) Communicate through local and/or remote processes.
  • a signal having one or more data packets (e.g. data from two components interacting with another component in a local system, a distributed system, and/or a network, such as the Internet that interacts with other systems through a signal) Communicate through local and/or remote processes.
  • At least one in this document refers to one or more, and “plurality” refers to two or more than two.
  • “And/or” describes the association relationship of the associated objects, indicating that there can be three relationships, for example, A and/or B, which can mean: A alone exists, A and B exist at the same time, and B exists alone, where A, B can be singular or plural.
  • the character “/” generally indicates that the associated objects before and after are in an “or” relationship.
  • the following at least one item (a) or similar expressions refers to any combination of these items, including any combination of a single item (a) or a plurality of items (a).
  • At least one of a, b, and c can mean: a, or b, or c, or a and b, or a and c, or b and c, or a, b and c, where a, b, c can be single or multiple.
  • the disclosed system, device, and method can be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division, and there may be other divisions in actual implementation, for example, multiple units or components may be combined or It can be integrated into another system, or some features can be ignored or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may be in electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
  • the functional units in the various embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit.
  • each functional unit may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • software When implemented by software, it can be implemented in the form of a computer program product in whole or in part.
  • the computer program product includes one or more computer instructions (programs).
  • programs When the computer program instructions (programs) are loaded and executed on the computer, the processes or functions described in the embodiments of the present application are generated in whole or in part.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.
  • the computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • the computer instructions may be transmitted from a website, computer, server, or data center. Transmission to another website, computer, server or data center via wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.).
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or a data center integrated with one or more available media.
  • the usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, and a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)).
  • the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium.
  • the technical solution of the present application essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including Several instructions are used to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk and other media that can store program code .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请提供了一种数据传输的控制方法和装置，能够在终端设备进行上行传输时，实现对逻辑信道的速率控制，有利于降低网络拥塞的风险。该方法包括：终端设备接收来自网络设备的第一信息，该第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；终端设备基于该最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。

Description

上行数据传输的控制方法和装置 技术领域
本申请涉及通信领域，并且更具体地，涉及一种上行数据传输的控制方法和装置。
背景技术
随着移动通信技术的发展，各类新业务以及应用场景不断涌现，这些业务对网络功能、连接性能及安全性等方面的需求存在很大的差别。
如何对终端设备进行控制，避免网络拥塞，是一个值得考虑的问题。
发明内容
本申请提供一种上行数据传输的控制方法和装置，以期降低网络拥塞的风险。
第一方面，提供了一种上行数据传输的控制方法，包括：终端设备接收来自网络设备的第一信息，该第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；终端设备基于该最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
应理解，一个逻辑信道的最大上行比特率表示该逻辑信道的上行传输的比特率的上限。可选地，上述第一信息可以是网络设备通过无线资源控制(radio resource control，RRC)信令发送的，例如LogicalChannelConfig信元。
应理解，上述第一信息可以携带最大上行比特率，也可以携带特定时间内能够上行传输的最大数据量，该特定时间内能够上行传输的最大数据量和最大上行比特率是可以相互转换的。
本申请实施例的上行数据传输的控制方法，通过网络设备向终端设备指示至少一个逻辑信道的最大上行比特率，使得终端设备基于该最大上行比特率限制为逻辑信道分配上行资源，从而能够在终端设备进行上行传输时，实现对逻辑信道的速率控制。应理解，对于一个逻辑信道而言，若终端设备为该逻辑信道分配的上行资源较多，该逻辑信道的上行比特率较高，若终端设备为该逻辑信道分配的上行资源较少，该逻辑信道的上行比特率较低，因此，终端设备可以基于该逻辑信道的最大上行比特率，为该逻辑信道分配上行资源，从而控制该逻辑信道的上行比特率不超过该逻辑信道的最大上行比特率，从而有利于降低网络拥塞的风险。
在一种可能的实现方式中，本申请实施例的方法主要适用于数据无线承载(data radio bearer，DRB)对应的逻辑信道，即上述至少一个逻辑信道为DRB对应的逻辑信道。
结合第一方面，在第一方面的某些实现方式中，上述至少一个逻辑信道对应一个网络切片。
在网络设备为终端设备配置逻辑信道的最大上行比特率时，可以使一个网络切片对应的所有逻辑信道的最大上行比特率之和小于或等于该网络切片的最大上行比特率。
本申请实施例的上行数据传输的控制方法，通过网络设备为终端设备配置逻辑信道的最大上行比特率，保障一个网络切片对应的所有逻辑信道的最大上行比特率之和小于或等于该网络切片内的最大上行比特率，进而实现对网络切片内终端设备的上行传输速率的控制，有利于避免终端设备进行上行数据传输时，网络切片内上行传输速率过载的问题，进一步降低网络拥塞的风险。
上述至少一个逻辑信道可以对应一个网络切片。网络设备可以通过上述第一信息向终端设备指示该至少一个逻辑信道的最大上行比特率。应理解，逻辑信道的最大上行比特率是针对单个逻辑信道而言的，一个逻辑信道的最大上行比特率表示该逻辑信道的上行传输的比特率的上限。网络切片的最大上行比特率是针对单个网络切片而言的，一个网络切片的最大上行比特率表示该网络切片对应的所有逻辑信道的上行传输的比特率的上限。
结合第一方面，在第一方面的某些实现方式中，上述至少一个逻辑信道对应一个协议数据单元PDU会话。
在网络设备为终端设备配置逻辑信道的最大上行比特率时，可以使一个PDU会话对应的所有逻辑信道的最大上行比特率之和小于或等于该PDU会话的最大上行比特率。应理解，PDU会话的最大上行比特率是针对单个PDU会话而言的，一个PDU会话的最大上行比特率表示该PDU会话对应的所有逻辑信道的上行传输的比特率的上限。
本申请实施例的上行数据传输的控制方法，通过网络设备为终端设备配置逻辑信道的最大上行比特率，保障一个PDU会话对应的所有逻辑信道的最大上行比特率之和小于或等于该PDU会话的最大上行比特率，进而实现对PDU会话内终端设备的上行传输速率的控制，有利于避免终端设备进行上行数据传输时，PDU会话内上行传输速率过载的问题，降低网络拥塞的风险。
结合第一方面，在第一方面的某些实现方式中，终端设备基于最大上行比特率，为至少一个逻辑信道中的全部或部分逻辑信道分配上行资源，包括：终端设备基于至少一个逻辑信道的优先比特率和最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
这样，通过参考逻辑信道的优先比特率和最大上行比特率，不仅避免了低优先级逻辑信道总不能得到服务的问题，而且能够限制逻辑信道的上行传输速率不超过该逻辑信道的传输速率上限，降低网络拥塞的风险。
在一种可能的实现方式中，由于逻辑信道的最大上行比特率为逻辑信道的上行传输的比特率的上限，一个逻辑信道的最大上行比特率可以大于或等于该逻辑信道的优先比特率。
结合第一方面，在第一方面的某些实现方式中，终端设备基于该逻辑信道的优先比特率和最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源，包括：终端设备基于该逻辑信道的优先比特率，为该至少一个逻辑信道分配上行资源；若存在剩余的上行资源、且该至少一个逻辑信道中的第一逻辑信道仍有数据待传输，该终端设备基于该第一逻辑信道的最大上行比特率，分配该剩余的上行资源，直到下列条件中的任一种满足为止：第一逻辑信道没有数据待传输、或者剩余的上行资源耗尽、或者第一逻辑信道的上行比特率达到该第一逻辑信道的最大上行比特率。
在一个例子中，终端设备可以参照令牌桶算法为逻辑信道分配上行资源。即终端设备 可以先执行第一轮分配，基于逻辑信道的优先比特率，为该逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该逻辑信道的上行比特率达到该逻辑信道的优先比特率的限制、或者上行资源耗尽。在第一轮分配之后，从时间平均的角度来看，逻辑信道的上行比特率小于或等于该逻辑信道的优先比特率。在上述逻辑信道包括多个逻辑信道的情况下，终端设备可以参照该多个逻辑信道的优先比特率，按照优先级递减的顺序为该多个逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该多个逻辑信道的上行比特率均达到各自的优先比特率的限制、或者上行资源耗尽，使得从时间平均的角度来看该多个逻辑信道的上行比特率小于或等于各自的优先比特率。
在执行完第一轮分配之后，若还存在剩余的上行资源、且上述逻辑信道中的第一逻辑信道仍有数据待传输，则终端设备可以执行第二轮分配。应理解，该第一逻辑信道为在仍有数据待传输的逻辑信道中，上行比特率小于该逻辑信道的最大上行比特率的逻辑信道。对于已经在第一轮分配中达到最大上行比特率的所有逻辑信道，无论是否仍有数据待发送，均不再执行第二轮分配。
终端设备可以基于该第一逻辑信道的最大上行比特率，即该第一逻辑信道的UMBR，分配剩余的上行资源，直到下列条件中的任一种满足为止：该第一逻辑信道没有数据待传输、或者该剩余的上行资源耗尽，使得从时间平均的角度来看该第一逻辑信道的上行比特率小于或等于该第一逻辑信道的UMBR。上述第一逻辑信道可以为一个逻辑信道，也可以包括多个逻辑信道。
结合第一方面，在第一方面的某些实现方式中，终端设备基于第一逻辑信道的最大上行比特率，分配该剩余的上行资源，包括：若第一逻辑信道中未被复用到协议数据单元PDU的第一服务数据单元SDU的上行比特率与该第一逻辑信道中已被复用到该PDU的第二SDU的上行比特率之和小于或等于第一逻辑信道的最大上行比特率，终端设备将该第一SDU复用至该PDU。
这样，终端设备在分配上行资源时，可以尽量不对SDU分段，能够限制逻辑信道的上行传输速率不超过该逻辑信道的传输速率上限，降低网络拥塞的风险，同时，还可以简化一些不必要的流程，提高终端设备的资源分配的效率。
结合第一方面，在第一方面的某些实现方式中，终端设备基于第一逻辑信道的最大上行比特率，分配该剩余的上行资源，包括：若第一逻辑信道中未被复用到PDU的第一SDU的上行比特率与该第一逻辑信道中已被复用到该PDU的第二SDU的上行比特率之和大于第一逻辑信道的最大上行比特率，终端设备对该第一SDU进行分段处理，获得第一子SDU，并将该第一子SDU复用到该PDU。
这样，若SDU较大无法满足第一逻辑信道的最大上行比特率的限制，该终端设备可以对SDU进行分段处理，获得子SDU，从而能够在满足第一逻辑信道的最大上行比特率的前提下，将分段后的子SDU复用至PDU。换句话说，对于较大的SDU，终端设备可以通过分段操作进行复用，从而提高第一逻辑信道的上行传输的数据量。
进一步地，在对SDU分段时，终端设备可以尽量将更大的SDU分段复用至PDU，即尽量使得分段的子SDU复用至PDU之后，第三网络切片的累积上行比特率等于该第三网络切片的最大上行比特率，从而最大化逻辑信道的数据传输。
结合第一方面，在第一方面的某些实现方式中，第一逻辑信道包括至少两个逻辑信道， 终端设备基于该第一逻辑信道的最大上行比特率，分配该剩余的上行资源，包括：终端设备基于该至少两个逻辑信道的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该至少两个逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该至少两个逻辑信道的上行比特率达到该至少两个逻辑信道的最大上行比特率的限制。
结合第一方面，在第一方面的某些实现方式中，终端设备基于该至少两个逻辑信道的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，分配该剩余的上行资源，包括：若第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与该第二逻辑信道中已被复用到该PDU的第四SDU的上行比特率之和小于或等于该第二逻辑信道的最大上行比特率，终端设备将该第三SDU复用至该PDU，该第二逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道。
这样，终端设备在分配上行资源时，可以尽量不对SDU分段，能够限制逻辑信道的上行传输速率不超过该逻辑信道的传输速率上限，降低网络拥塞的风险，同时，还可以简化一些不必要的流程，提高终端设备的资源分配的效率。
结合第一方面，在第一方面的某些实现方式中，终端设备基于该至少两个逻辑信道的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，分配该剩余的上行资源，包括：若第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与该第二逻辑信道中已被复用到该PDU的第四SDU的上行比特率之和大于该第二逻辑信道的最大上行比特率，终端设备将对该第三SDU进行分段处理，获得第三子SDU，并将该第三子SDU复用到该PDU，该第二逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道。
这样，若SDU较大无法满足第二逻辑信道的最大上行比特率的限制，该终端设备可以对SDU进行分段处理，获得子SDU，从而能够在满足第二逻辑信道的最大上行比特率的前提下，将分段后的子SDU复用至PDU。换句话说，对于较大的SDU，终端设备可以通过分段操作进行复用，从而提高第二逻辑信道的上行传输的数据量。
进一步地，在对SDU分段时，终端设备可以尽量将更大的SDU分段复用至PDU，即尽量使得分段的子SDU复用至PDU之后，第三网络切片的累积上行比特率等于该第三网络切片的最大上行比特率，从而最大化逻辑信道的数据传输。
在终端设备按照上述方法为第二逻辑信道分配上行资源后，若仍存在剩余上行资源，终端设备可以继续为下一优先级的逻辑信道分配上行资源，该下一优先级的逻辑信道是指在上述至少两个逻辑信道中，第二逻辑信道的下一优先级的逻辑信道。
第二方面，提供了另一种上行数据传输的控制方法，包括：网络设备确定第一信息，该第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；该网络设备向终端设备发送该第一信息。
结合第二方面，在第二方面的某些实现方式中，在该网络设备向终端设备发送该第一信息之后，该方法还包括：该网络设备接收来自该终端设备的协议数据单元PDU，该PDU包括来自至少一个逻辑信道中全部或部分逻辑信道的数据，该全部或部分逻辑信道的数据是基于最大上行比特率被复用到所述PDU的。
可选地，在网络设备接收到终端设备的PDU之后，可以解析该PDU，获得该逻辑信道的数据。
结合第二方面，在第二方面的某些实现方式中，所述至少一个逻辑信道对应一个网络切片。
结合第二方面，在第二方面的某些实现方式中，所述至少一个逻辑信道对应一个PDU会话。
第三方面，提供了另一种上行数据传输的控制方法，包括：终端设备确定逻辑信道的优先比特率和网络切片的最大上行比特率，该逻辑信道对应该网络切片；终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源。
本申请实施例的上行数据传输的控制方法，通过终端设备基于网络切片的最大上行比特率为逻辑信道分配上行资源，保障一个网络切片对应的所有逻辑信道的上行比特率之和小于或等于该网络切片内的最大上行比特率，进而实现对网络切片内终端设备的上行传输速率的控制，有利于避免终端设备进行上行数据传输时，网络切片内上行传输速率过载的问题，降低网络拥塞的风险。
上述逻辑信道可以包括一个或多个逻辑信道，该一个或多个逻辑信道对应一个或多个网络切片。示例性地，假设存在三个逻辑信道，分别为：逻辑信道1、逻辑信道2和逻辑信道3，该三个逻辑信道可以对应两个网络切片，即逻辑信道1和逻辑信道2对应网络切片1，逻辑信道3对应网络切片2。应理解，网络切片的最大上行比特率是针对单个网络切片而言的，一个网络切片的最大上行比特率表示该网络切片对应的所有逻辑信道的上行传输的比特率的上限。
结合第三方面，在第三方面的某些实现方式中，终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源，包括：终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该逻辑信道的上行比特率达到该逻辑信道的优先比特率的限制、或者该网络切片的上行比特率超过该网络切片的最大上行比特率、或者上行资源耗尽。
结合第三方面，在第三方面的某些实现方式中，上述逻辑信道包括至少两个逻辑信道，终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源，包括：终端设备基于该至少两个逻辑信道的优先比特率和该网络切片的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，为该至少两个逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该至少两个逻辑信道的上行比特率均达到该至少两个逻辑信道的优先比特率的限制、或者该至少两个逻辑信道对应的网络切片的上行比特率达到该至少两个逻辑信道对应的网络切片的上行比特率的限制、或者上行资源耗尽。
具体而言，上述分配过程为第一轮分配，即终端设备可以参照本申请提出的新的令牌桶算法为逻辑信道分配上行资源，能够使得从时间平均的角度来看该多个逻辑信道的上行比特率小于或等于各自的优先比特率，且在从时间平均的角度来看各个网络切片的上行比特率小于或等于各自的最大上行比特率。
结合第三方面，在第三方面的某些实现方式中，终端设备基于该至少两个逻辑信道的优先比特率和该网络切片的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，为该至少两个逻辑信道分配上行资源，包括：在该至少两个逻辑信道中的第一逻辑信 道对应的令牌数大于0的情况下，终端设备确定将该至少两个逻辑信道中的第一逻辑信道的第一服务数据单元SDU复用至协议数据单元PDU之后，该第一逻辑信道对应的、该网络切片中的第一网络切片的累积上行比特率，该第一逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道；若该第一网络切片的累积上行比特率小于或等于该第一网络切片的最大上行比特率，终端设备将该第一SDU复用至该PDU。
结合第三方面，在第三方面的某些实现方式中，终端设备基于该至少两个逻辑信道的优先比特率和该网络切片的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，为该至少两个逻辑信道分配上行资源，包括：在该至少两个逻辑信道中的第一逻辑信道对应的令牌数大于0的情况下，终端设备确定将该至少两个逻辑信道中的第一逻辑信道的第一SDU复用至PDU之后，该第一逻辑信道对应的、该网络切片中的第一网络切片的累积上行比特率，该第一逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道；若该第一网络切片的累积上行比特率大于该第一网络切片的最大上行比特率，且该至少两个逻辑信道中的第二逻辑信道对应的令牌数大于0，终端设备确定将该第二逻辑信道的第二SDU复用至该PDU之后，该第二逻辑信道对应的、该网络切片中的第二网络切片的累积上行比特率，该第二逻辑信道为该至少两个逻辑信道中该第一逻辑信道的下一优先级的逻辑信道；若该第二网络切片的累积上行比特率小于或等于该第二网络切片的最大上行比特率，终端设备将该第二SDU复用至该PDU。
具体而言，在第一轮分配的过程中，终端设备按照上述至少两个逻辑信道的优先级递减顺序，先为优先级最高的第一逻辑信道分配上行资源，若第一逻辑信道对应的第一网络切片的累计上行比特率超出该第一网络切片的最大上行比特率的限制，该终端设备再为下一优先级的逻辑信道(即第二逻辑信道)分配上行资源。
应理解，上述第一逻辑信道对应的第一网络切片和第二逻辑信道对应的第二网络切片可以相同，也可以不同，即第一逻辑信道和第二逻辑信道可以对应相同的网络切片，也可以对应不同的网络切片，本申请实施例对此不做限定。
结合第三方面，在第三方面的某些实现方式中，该第一网络切片的累积上行比特率是基于该第一网络切片的滑动时间窗口的长度和该第一网络切片在该滑动时间窗口中的累积数据量确定的，该第一网络切片在该滑动时间窗口中的累积数据量为从当前时刻起向前的第一时间段内，该第一网络切片的所有逻辑信道传输的数据量之和，该第一时间段的长度为该滑动时间窗口的长度。
由于对速率的限制是平均时间上的概念，若是针对单个TTI，限制性较强，灵活性较低，因此，通过设置滑动时间窗口，能够获取最新的一段时间(可以包括多个TTI)内网络切片的累积数据量，更有利于实现对网络切片的上行比特率的限制，且提高网络切片的上行比特率的计算灵活性。
应理解，网络切片的滑动时间窗口的长度可以是终端设备预先获取的。具体地，网络切片的滑动时间窗口的长度可以是网络设备为终端设备配置的，或者，是协议定义的，本申请实施例对此不做限定。
结合第三方面，在第三方面的某些实现方式中，该方法还包括：终端设备接收网络设备发送的第二信息，该第二信息用于指示该第一网络切片的滑动时间窗口的长度。
应理解，多个网络切片对应的滑动时间窗口的长度可以是相同的，也可以是不同的。 若多个网络切片对应的滑动时间窗口的长度相同，网络设备可以通过一个第二信息指示该长度即可。若多个网络切片对应的滑动时间窗口的长度不相同，网络设备可以通过该第二信息指示网络切片的标识和网络切片的滑动时间窗口的长度，使得网络切片的滑动时间窗口的长度与网络切片的标识对应。例如，上述第二信息可以指示长度1、长度2和长度3，且指示长度1对应网络切片1，长度2对应网络切片2，长度3对应网络切片3。
结合第三方面，在第三方面的某些实现方式中，在终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源之后，该方法还包括：若存在剩余的上行资源、且该逻辑信道中的第三逻辑信道仍有数据待传输，终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该第三逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该第三逻辑信道对应的网络切片的累积上行比特率达到该第三逻辑信道对应的网络切片的最大上限比特率的限制。
在执行完第一轮分配之后，若还存在剩余的上行资源、且上述逻辑信道中的第三逻辑信道仍有数据待传输，则终端设备可以执行第二轮分配。应理解，该第三逻辑信道为在仍有数据待传输的逻辑信道中，对应网络切片的累积上行比特率小于该网络切片的最大上行比特率的逻辑信道。对于已经在第一轮分配中达到最大上行比特率的网络切片对应的所有逻辑信道，无论是否仍有数据待发送，均不再执行第二轮分配。
终端设备可以基于该第三逻辑信道对应的网络切片的最大上行比特率，分配剩余的上行资源，直到下列条件中的任一种满足为止：该第三逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者第三逻辑信道对应的网络切片的累积上行比特率达到该第三逻辑信道对应的网络切片的最大上行比特率的限制。上述第三逻辑信道可以为一个逻辑信道，也可以包括多个逻辑信道，第三逻辑信道对应的网络切片可以是一个网络切片，也可以是多个网络切片。
结合第三方面，在第三方面的某些实现方式中，终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，分配该剩余的上行资源，包括：若将该第三逻辑信道中未被复用到PDU的第三SDU复用至该PDU之后，该第三逻辑信道对应的、该网络切片中的第三网络切片的累积上行比特率小于或等于该第三网络切片的最大上行比特率，终端设备将该第三SDU复用至该PDU；或，若将该第三SDU复用至该PDU之后，该第三网络切片的累积上行比特率大于该第三网络切片的最大上行比特率，终端设备对该第三SDU进行分段处理，获得第三子SDU，并将该第三子SDU复用到该PDU。
这样，终端设备在分配上行资源时，可以尽量不对SDU分段，在对SDU分段时，尽量将更大的SDU分段复用至PDU，从而最大化逻辑信道的数据传输。
结合第三方面，在第三方面的某些实现方式中，第三逻辑信道包括至少两个逻辑信道，终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，分配该剩余的上行资源，包括：终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，按照该第三逻辑信道的优先级递减顺序，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该第三逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该第三逻辑信道对应的网络切片的累积上行比特率达到该第三逻辑信道对应的网络切片的最大上限比特率的限制。
结合第三方面，在第三方面的某些实现方式中，终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，按照该第三逻辑信道的优先级递减顺序，分配该剩余的上行资源，包括：若将第四逻辑信道中未被复用到PDU的第四SDU复用至该PDU之后，该第四逻辑信道对应的第四网络切片的累积上行比特率小于或等于该第四网络切片的最大上行比特率，终端设备将该第四SDU复用至该PDU，该第四逻辑信道为该第三逻辑信道中优先级最高的逻辑信道。
结合第三方面，在第三方面的某些实现方式中，终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，按照该第三逻辑信道的优先级递减顺序，分配该剩余的上行资源，包括：若将第四逻辑信道中未被复用到PDU的第四SDU复用至该PDU之后，该第四逻辑信道对应的第四网络切片的累积上行比特率大于该第四网络切片的最大上行比特率，终端设备对该第四SDU进行分段处理，获得第四子SDU，并将该第四子SDU复用到该PDU，该第四逻辑信道为该第三逻辑信道中优先级最高的逻辑信道。
这样，终端设备在分配上行资源时，可以尽量不对SDU分段，在对SDU分段时，尽量将更大的SDU分段复用至PDU，从而最大化逻辑信道的数据传输。
在终端设备按照上述方法为第四逻辑信道分配上行资源后，若仍存在剩余上行资源，终端设备可以继续为下一优先级的逻辑信道分配上行资源，该下一优先级的逻辑信道是指在上述至少两个逻辑信道中，第四逻辑信道的下一优先级的逻辑信道。
第四方面，提供了另一种上行数据传输的控制方法，包括：网络设备接收来自终端设备的协议数据单元PDU，该PDU包括来自逻辑信道的数据，该逻辑信道对应网络切片，该逻辑信道的数据是基于该逻辑信道的优先比特率和该网络切片的最大上行比特率被复用到该PDU的；网络设备解析该PDU，获得该逻辑信道的数据。
结合第四方面，在第四方面的某些实现方式中，在网络设备接收来自终端设备的协议数据单元PDU之前，该方法还包括：网络设备确定该网络切片的滑动时间窗口的长度；网络设备向该终端设备发送第二信息，该第二信息用于指示该网络切片的滑动时间窗口的长度。
结合第四方面，在第四方面的某些实现方式中，该第二信息包括该网络切片的标识和该网络切片的滑动时间窗口的长度，该网络切片的滑动时间窗口的长度与该网络切片的标识对应。
结合第四方面，在第四方面的某些实现方式中，该网络设备确定该网络切片的滑动时间窗口的长度，包括：该网络设备基于该网络切片的类型，确定该网络切片的滑动时间窗口的长度。
可选地，网络设备可以基于网络切片的类型，确定网络切片的滑动时间窗口的长度。例如，对于时延敏感业务的网络切片，滑动时间窗口的长度较短；对于时延不敏感业务的网络切片，滑动时间窗口的长度较长。
这样，网络设备可以针对不同类型的网络切片，可以设定不同的滑动时间窗口的长度，来适应不同的业务特性，从而灵活适配多种业务场景。
第五方面，提供了一种上行数据传输的控制装置，用于执行上述各方面中任一种可能的实现方式中的方法。具体地，该装置包括用于执行上述各方面中任一种可能的实现方式中的方法的单元。
第六方面，提供了另一种上行数据传输的控制装置，包括处理器，该处理器与存储器耦合，可用于执行存储器中的指令，以实现上述第一方面或第一方面中任一种可能的实现方式中的方法，或者第三方面或第三方面中任一种可能的实现方式中的方法。在一种可能的实现方式中，该装置还包括存储器。在一种可能的实现方式中，该装置还包括通信接口，处理器与通信接口耦合。
在一种实现方式中，该装置为终端设备。当该装置为终端设备时，该通信接口可以是收发器，或，输入/输出接口。
在另一种实现方式中，该装置为配置于终端设备中的芯片。当该装置为配置于终端设备中的芯片时，该通信接口可以是输入/输出接口。
第七方面，提供了另一种上行数据传输的控制装置，包括处理器，该处理器与存储器耦合，可用于执行存储器中的指令，以实现上述第二方面或第二方面中任一种可能的实现方式中的方法，或者第四方面或第四方面中任一种可能的实现方式中的方法。在一种可能的实现方式中，该装置还包括存储器。在一种可能的实现方式中，该装置还包括通信接口，处理器与通信接口耦合。
在一种实现方式中，该装置为网络设备。当该装置为网络设备时，该通信接口可以是收发器，或，输入/输出接口。
在另一种实现方式中，该装置为配置于网络设备中的芯片。当该装置为配置于网络设备中的芯片时，该通信接口可以是输入/输出接口。
第八方面，提供了一种处理器，包括：输入电路、输出电路和处理电路。该处理电路用于通过该输入电路接收信号，并通过该输出电路发射信号，使得该处理器执行上述各方面中任一种可能的实现方式中的方法。
在具体实现过程中，上述处理器可以为芯片，输入电路可以为输入管脚，输出电路可以为输出管脚，处理电路可以为晶体管、门电路、触发器和各种逻辑电路等。输入电路所接收的输入的信号可以是由例如但不限于接收器接收并输入的，输出电路所输出的信号可以是例如但不限于输出给发射器并由发射器发射的，且输入电路和输出电路可以是同一电路，该电路在不同的时刻分别用作输入电路和输出电路。本申请对处理器及各种电路的具体实现方式不做限定。
第九方面，提供了一种处理装置，包括处理器和存储器。该处理器用于读取存储器中存储的指令，并可通过接收器接收信号，通过发射器发射信号，以执行上述各方面中任一种可能的实现方式中的方法。
在一种可能的实现方式中，处理器为一个或多个，存储器为一个或多个。
在一种可能的实现方式中，存储器可以与处理器集成在一起，或者存储器与处理器分离设置。
在具体实现过程中，存储器可以为非瞬时性(non-transitory)存储器，例如只读存储器(read only memory，ROM)，其可以与处理器集成在同一块芯片上，也可以分别设置在不同的芯片上，本申请对存储器的类型以及存储器与处理器的设置方式不做限定。
应理解，相关的数据交互过程例如发送指示信息可以为从处理器输出指示信息的过程，接收能力信息可以为处理器接收输入能力信息的过程。具体地，处理输出的数据可以输出给发射器，处理器接收的输入数据可以来自接收器。其中，发射器和接收器可以统称 为收发器。
上述处理装置可以是一个芯片，该处理器可以通过硬件来实现也可以通过软件来实现，当通过硬件实现时，该处理器可以是逻辑电路、集成电路等；当通过软件来实现时，该处理器可以是一个通用处理器，通过读取存储器中存储的软件代码来实现，该存储器可以集成在处理器中，可以位于该处理器之外，独立存在。
第十方面，提供了一种计算机程序产品，该计算机程序产品包括：计算机程序(也可以称为代码，或指令)，当该计算机程序被运行时，使得计算机执行上述各方面中任一种可能实现方式中的方法。
第十一方面，提供了一种计算机可读存储介质，该计算机可读存储介质存储有计算机程序(也可以称为代码，或指令)当其在计算机上运行时，使得计算机执行上述各方面中任一种可能的实现方式中的方法。
附图说明
图1示出了本申请实施例的通信系统的示意图；
图2示出了网络切片与PDU会话之间的对应关系的示意图；
图3示出了令牌桶算法的示意性流程图；
图4示出了基于令牌桶算法的上行资源的分配结果的示意图；
图5示出了本申请实施例的一种上行数据传输的控制方法的示意性流程图；
图6示出了本申请实施例的一种上行资源的分配结果的示意图；
图7示出了本申请实施例的另一种上行数据传输的控制方法的示意性流程图；
图8示出了本申请实施例的令牌桶算法的示意性流程图；
图9示出了本申请实施例的滑动时间窗口的示意图；
图10示出了本申请实施例的另一种上行资源的分配结果的示意图；
图11示出了本申请实施例的另一种上行资源的分配结果的示意图；
图12示出了本申请实施例的一种上行数据传输的控制装置的示意性框图；
图13示出了本申请实施例的另一种上行数据传输的控制装置的示意性框图；
图14示出了本申请实施例的终端设备的示意性结构图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
本申请提供的技术方案可以应用于各种通信系统，例如：长期演进(long term evolution，LTE)系统、LTE频分双工(frequency division duplex，FDD)系统、LTE时分双工(time division duplex，TDD)系统、第五代(5th generation，5G)移动通信系统、新无线(new radio，NR)系统或者其他演进的通信系统，以及5G通信系统的下一代移动通信系统等。
为便于理解本申请提供的技术方案，首先结合图1详细说明适用于本申请实施例的通信系统。图1示出了适用于本申请实施例的上行数据传输的控制方法和装置的通信系统100的示意图。如图1所示，该通信系统100可以包括至少一个网络设备，例如图1所示的网络设备110；该通信系统100还可以包括至少一个终端设备，例如图1所示的终端设 备120。网络设备110与终端设备120可以通过无线链路通信。各通信设备，如网络设备110或终端设备120，可以配置多个天线，该多个天线可以包括至少一个用于发送信号的发射天线和至少一个用于接收信号的接收天线。另外，各通信设备还附加地包括发射机链和接收机链，本领域普通技术人员可以理解，它们均可以包括与信号发送和信号接收相关的多个部件(例如处理器、调制器、复用器、解调器、解复用器或天线等)。因此，网络设备110与终端设备120可以通过多天线技术通信。
本申请实施例中的终端设备也可以称为：用户设备(user equipment，UE)、移动台(mobile station，MS)、移动终端(mobile terminal，MT)、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置等。
终端设备可以是一种向用户提供语音/数据连通性的设备，例如，具有无线连接功能的手持式设备、车载设备等。目前，一些终端设备的举例包括：手机(mobile phone)、平板电脑、笔记本电脑、掌上电脑、移动互联网设备(mobile internet device，MID)、可穿戴设备，虚拟现实(virtual reality，VR)设备、增强现实(augmented reality，AR)设备、工业控制(industrial control)中的无线终端、无人驾驶(self driving)中的无线终端、远程手术(remote medical surgery)中的无线终端、智能电网(smart grid)中的无线终端、运输安全(transportation safety)中的无线终端、智慧城市(smart city)中的无线终端、智慧家庭(smart home)中的无线终端、蜂窝电话、无绳电话、会话启动协议(session initiation protocol，SIP)电话、无线本地环路(wireless local loop，WLL)站、个人数字助理(personal digital assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，5G网络中的终端设备或者未来演进的公用陆地移动通信网络(public land mobile network，PLMN)中的终端设备等，本申请对此并不限定。
作为示例而非限定，在本申请中，终端设备可以是物联网(internet of things，IoT)系统中的终端设备。物联网是未来信息技术发展的重要组成部分，其主要技术特点是将物品通过通信技术与网络连接，从而实现人机互连，物物互连的智能化网络。示例性地，本申请实施例中的终端设备可以是可穿戴设备。可穿戴设备也可以称为穿戴式智能设备，是应用穿戴式技术对日常穿戴进行智能化设计、开发出可以穿戴的设备的总称，如眼镜、手套、手表、服饰及鞋等。可穿戴设备是可以直接穿在身上，或是整合到用户的衣服或配件的一种便携式设备。可穿戴设备不仅仅是一种硬件设备，更可以通过软件支持以及数据交互、云端交互来实现强大的功能。广义穿戴式智能设备包括功能全、尺寸大、可不依赖智能手机实现完整或者部分的功能，例如：智能手表或智能眼镜等，以及只专注于某一类应用功能，需要和其它设备如智能手机配合使用，如各类进行体征监测的智能手环、智能首饰等。
作为示例而非限定，在本申请实施例中，终端设备还可以是机器类型通信(machine type communication，MTC)中的终端设备。此外，终端设备还可以是作为一个或多个部件或者单元而内置于车辆的车载模块、车载模组、车载部件、车载芯片或者车载单元等，车辆通过内置的所述车载模块、车载模组、车载部件、车载芯片或者车载单元等可以实施本申请提供的方法。因此，本申请实施例也可以应用于车联网，例如车辆外联(vehicle to  everything，V2X)、车间通信长期演进技术(long term evolution-vehicle，LTE-V)、车到车(vehicle-to-vehicle，V2V)技术等。
本申请涉及的网络设备可以是与终端设备通信的设备，该网络设备也可以称为接入网设备或无线接入网设备，它可以是传输接收点(transmission reception point，TRP)，还可以是LTE系统中的演进型基站(evolved NodeB，eNB或eNodeB)，还可以是家庭基站(例如，home evolved NodeB，或home Node B，HNB)、基带单元(base band unit，BBU)，还可以是云无线接入网络(cloud radio access network，CRAN)场景下的无线控制器，或者该网络设备可以为中继站、接入点、车载设备、可穿戴设备以及5G网络中的网络设备或者未来演进的PLMN网络中的网络设备等，还可以是WLAN中的接入点(access point，AP)，还可以是NR系统中的gNB，上述网络设备还可以是城市基站、微基站、微微基站、毫微微基站等等，本申请对此不做限定。
在一种网络结构中，网络设备可以包括集中单元(centralized unit，CU)节点、或分布单元(distributed unit，DU)节点、或是包括CU节点和DU节点的无线接入网络(radio access network，RAN)设备、或者是包括控制面CU节点(CU-CP节点)和用户面CU节点(CU-UP节点)以及DU节点的RAN设备。
网络设备为小区提供服务，终端设备通过网络设备分配的传输资源(例如，频域资源，或者说，频谱资源)与小区进行通信，该小区可以属于宏基站(例如，宏eNB或宏gNB等)，也可以属于小小区(small cell)对应的基站，这里的小小区可以包括：城市小区(metro cell)、微小区(micro cell)、微微小区(pico cell)、毫微微小区(femto cell)等，这些小小区具有覆盖范围小、发射功率低的特点，适用于提供高速率的数据传输服务。
应理解，上述图1仅为示意图，通信系统100中还可以包括其它未示出的设备。此外，本申请实施例对通信系统100中包括的终端设备、网络设备的数量不做限定。
在本申请实施例中，终端设备或网络设备包括硬件层、运行在硬件层之上的操作系统层，以及运行在操作系统层上的应用层。该硬件层包括中央处理器(central processing unit，CPU)、内存管理单元(memory management unit，MMU)和内存(也称为主存)等硬件。该操作系统可以是任意一种或多种通过进程(process)实现业务处理的计算机操作系统，例如，Linux操作系统、Unix操作系统、Android操作系统、iOS操作系统或windows操作系统等。该应用层包含浏览器、通讯录、文字处理软件、即时通信软件等应用。并且，本申请并未对本申请提供的方法的执行主体的具体结构特别限定，只要能够通过运行记录有本申请提供的方法的代码的程序，以根据本申请实施例提供的方法进行通信即可，例如，本申请实施例提供的方法的执行主体可以是终端设备或网络设备，或者，是终端设备或网络设备中能够调用程序并执行程序的功能模块。
另外，本申请的各个方面或特征可以实现成方法、装置或使用标准编程和/或工程技术的制品。本申请中使用的术语“制品”涵盖可从任何计算机可读器件、载体或介质访问的计算机程序。例如，计算机可读存储介质可以包括，但不限于：磁存储器件(例如，硬盘、软盘或磁带等)，光盘(例如，压缩盘(compact disc，CD)、数字通用盘(digital versatile disc，DVD)等)，智能卡和闪存器件(例如，可擦写可编程只读存储器(erasable programmable read-only memory，EPROM)、卡、棒或钥匙驱动器等)。另外，本文描述的各种存储介质可代表用于存储信息的一个或多个设备和/或其它机器可读介质。术语“机器可读介质” 可包括但不限于，无线信道和能够存储、包含和/或承载指令和/或数据的各种其它介质。
为便于理解本申请实施例，首先对本申请中涉及到的术语进行简单说明。
1.网络切片(network slicing，NS)
网络切片是提供特定网络能力的、端到端的逻辑专用网络。通过对网络资源的灵活分配、按需组网，可以在同一套物理设施上虚拟出多个具有不同特点且相互隔离的逻辑子网，来针对性地为用户提供服务。该逻辑子网即称为网络切片。网络切片可以由运营商使用，基于客户签订的服务等级协议(service level agreement，SLA)，为不同垂直行业、不同客户、不同业务，提供相互隔离、功能可定制的网络服务。不同的网络切片可以通过单网络切片选择支撑信息(single network slice selection assistance information，S-NSSAI)来标识和区分。
网络切片可以包括无线网切片、传输网切片和核心子网切片。终端设备可以通过PDU会话(PDU session)与网络切片建立联系，不同网络切片的流量(traffic)由不同的PDU会话管理，一个PDU会话属于一个网络切片，单个网络切片中可以存在多个PDU会话，不同网络切片内的PDU会话相互隔离。此外，可以为不同网络切片配置不同、且相互隔离的无线承载(radio bearer，RB)，一个RB可以对应一个逻辑信道(logical channel，LCH)，也可以对应多个LCH，与PDU会话类似，网络切片内部也支持服务质量(quality of service，QoS)的多样性。综上，一个网络切片中可以包括一个或多个PDU会话，一个PDU会话中可以包括一个或多个RB、以及一个或多个QoS流。图2示出了网络切片与PDU会话之间的对应关系的示意图。在图2中，UE和NB属于下一代无线接入网(next generation-radio access network，NG-RAN)，NB可以包括eNB和gNB，还可以包括其他NB，此处不做限定。NB右侧的用户面功能(user plane function，UPF)网元属于5G核心网(5G core，5GC)。网络切片1(NS#1)中存在一个PDU会话，该PDU会话包括2个RB和1个NG-U隧道，该NG-U隧道包括3个QoS流。网络切片2(NS#2)中存在一个PDU会话，该PDU会话包括1个RB和1个NG-U隧道，该NG-U隧道包括1个QoS流。其中，NG-U隧道是指gNB与UPF之间(N3接口)的用户面隧道，其中可以包含一个或多个QoS流，一个PDU会话对应一个NG-U隧道。
2.服务数据单元SDU、协议数据单元PDU和媒体访问控制(medium access control，MAC)层复用(multiplexing)
服务数据单元(service data unit，SDU)又叫业务数据单元，是指定层的用户服务的数据集，发给下一层之后，下一层将其封装在协议数据单元(protocol data unit，PDU)中发送出去。对于每一层来说，来自更高一层的信息单元被称为该层的SDU，而经过该层处理后送往下一层的信息单元，被称为该层的PDU。SDU是从高协议层来的、传送到低协议层的信息单元，例如第N层的SDU和该第N层的上一层的PDU是一一对应的。
具体而言，SDU是指从第N+1层实体接收到的、没有被第N层实体处理且保留其标识的信息量。
PDU是指在N协议层的特定数据单元，包括N协议层的协议控制信息和N协议层的可能的用户数据。
发送端可以通过MAC层的复用功能可以将多个逻辑信道的数据复用到一个传输信道(transport channel，TCH)，即将多个MAC SDU复用到一个MAC PDU内，通过物理层 发送出去。
Multiplexing/demultiplexing of MAC SDUs belonging to one or different logical channels into/from transport blocks(TB)delivered to/from the physical layer on transport channels.
为便于描述，后面将发送端通过MAC层将多个MAC SDU复用到一个MAC PDU简称为“MAC层复用”或者“将SDU复用到PDU”。应理解，终端设备在一个传输时间间隔(transmission time interval，TTI)只能发送一个MAC PDU(不考虑空分复用和载波聚合的情况)，因此，需要将多个逻辑信道的MAC SDU复用至同一个MAC PDU上，这就是MAC层复用的由来。
当多个逻辑信道都有数据发送，且该多个逻辑信道的数据总量超过当前TTI的传输能力时，就出现了应该让哪个逻辑信道优先发送的问题，需要确定逻辑信道的优先级。下行传输时，网络设备可以根据逻辑信道的类型和逻辑信道对应承载的QoS参数来决定逻辑信道的优先级。优先级高的逻辑信道有更高的概率被MAC层复用，可获得更多的传输机会，这意味着更高的传输速率或更低的传输时延。上行传输时，网络设备可以根据终端设备的请求和待发送数据量来分配上行资源，但是，网络设备分配的上行资源是针对终端设备的，并不是针对逻辑信道的。下面主要针对上行的情况进行详细说明。由于SDU是来自逻辑信道的，因此，对于上行传输而言，“MAC层复用”即可以理解为“终端设备为逻辑信道分配上行资源”。
当终端设备有上行数据需要发送时，该终端设备可以通过缓冲区状态报告(buffer status report，BSR)告知网络设备，其上行缓存(buffer)中有多少数据需要发送，以便网络设备给该终端设备配置上行资源。为了减少在空口中传输的信息比特数，协议规定每个逻辑信道组(logical channel group，LCG)对应一个BSR值，每个逻辑信道组中包括一个或多个逻辑信道。LCG的划分会根据不同厂商的实现而有所不同，一般而言，相同LCG内的逻辑信道上承载的业务会具有近似的QoS需求，这就使得单个LCG内可能会包括不同网络切片的逻辑信道，进而导致网络设备无法根据BSR获得各个网络切片的数据量信息。终端设备上报BSR之后，网络设备可以根据BSR给该终端设备分配上行资源，但并不指定所分配的上行资源给哪些逻辑信道使用。得到上行资源后，终端设备可以根据逻辑信道的优先级，将来自各个逻辑信道的MAC SDU复用至MAC PDU，再通过物理层发送出去。
为避免出现低优先级逻辑信道总不能得到服务的问题，网络设备为终端设备的各个逻辑信道都设置了一个优先比特速率(prioritized bit rate，PBR)，单位为kB/s，保证终端设备限制各个逻辑信道中高优先级的逻辑信道的传输速率，使得各个逻辑信道中有数据传输的低优先级的逻辑信道得到服务。也就是说，如果某个高优先级的逻辑信道的数据传输速率大于或等于该逻辑信道的PBR，即使该高优先级的逻辑信道仍有数据待发送，终端设备也转而为低优先级的、未达到PBR的逻辑信道分配上行资源。在一种可能的实现方式中，终端设备可以通过令牌桶(token bucket)算法实现上行资源的分配。
3.令牌桶(token bucket)算法
令牌桶算法是一种常用的速率限制方法，可以形象地将该算法比拟成一个装“令牌”的桶(bucket)的运作过程。该算法的基本思想是基于令牌桶内是否有令牌以及令牌的多少来确定是否发送某逻辑信道的数据，并控制复用在MAC PDU中的该逻辑信道的数据 量。
网络设备可以通过向终端设备发送配置信息(例如LogicalChannelConfig信元)，为各个逻辑信道配置下列参数：
优先级(priority)；
优先比特率(PBR)；
桶大小持续时间(bucketSizeDuartion，BSD)；
其中，上述优先级也可以称为逻辑信道优先级，逻辑信道优先级决定了多个逻辑信道被复用时，上行资源分配的先后顺序(即复用的先后顺序)；PBR表示每秒向桶内注入的字节个数；BSD表示桶的深度，以毫秒ms为单位。因此，令牌桶的最大容量为PBR×BSD，其限制了每个逻辑信道可以缓存的数据总量，但这并不代表该逻辑信道的最大上行比特率。应理解，上述配置信息是针对逻辑信道的，即一个逻辑信道对应一个配置信息，每个逻辑信道具有自己的优先级、PBR和BSD，每个逻辑信道具有自己的令牌桶。
终端设备接收网络设备发送的上述配置信息，确定各个逻辑信道的优先级、PBR和BSD，按照优先级从高到低的顺序，基于令牌桶算法分配上行资源。由于终端设备在按照令牌桶算法分配上行资源之后，若存在剩余的上行资源且存在逻辑信道有数据待传输，终端设备还会进行上行资源的再分配，因此，在本申请中，将令牌桶算法又称为第一轮分配算法，将令牌桶算法之后的再分配称为第二轮分配算法。
第一轮分配算法：终端设备可以基于各个逻辑信道的优先比特率，按照优先级递减的顺序为各个逻辑信道分配上行资源，直到下列条件中的任一种满足为止：各个逻辑信道均被分配到上行资源、或者上行资源耗尽。
图3示出了令牌桶算法(即第一轮分配算法)的示意性流程图。下面结合图3对令牌桶算法进行详细介绍。
假设共存在M个逻辑信道，M为大于或等于1的整数，该M个逻辑信道中的每个逻辑信道对应一个令牌桶，即每个逻辑信道有自己的优先级、PBR和BSD。以逻辑信道j为例，j∈{1,2,…,M}，逻辑信道j对应令牌桶j，终端设备可以为逻辑信道j维护一个变量B j，该变量指示了令牌桶j里当前可用的令牌数，且每个令牌对应1Byte数据。B j在逻辑信道j建立时初始化为0，每个TTI增加PBR j×TTI(即假设PBR j为8kBps，每TTI往令牌桶内注入8kBps×1ms＝8Bytes的令牌)。B j的值不能超过令牌桶的最大容量PBR j×BSD j(假设PBR j为8kBps，BSD j＝500ms，最大容量为8kBps×500ms＝4k Bytes)。当有上行数据需要传输时，终端设备可以执行令牌桶算法进行上行资源的分配，即将SDU复用到PDU中。
具体地，终端设备可以按照优先级递减的顺序对每个逻辑信道执行下列步骤，下面以逻辑信道j为例进行说明。
步骤1、获取逻辑信道j中的SDU 1，判断B j是否大于0。
步骤2、若B j小于0，则说明该令牌桶内没有可用的令牌，该SDU 1无法被复用到PDU中，终端设备对逻辑信道j的处理流程结束，接着处理下一优先级的逻辑信道。
步骤3、若B j大于0，则终端设备将SDU 1复用到PDU，并执行B j－＝T SDU 1，T SDU 1表示SDU 1的数据量大小，B j－＝T SDU 1表示将B j的值更新为B j－T SDU 1的值。
步骤4、继步骤3之后，终端设备判断逻辑信道j的上行比特率是否大于或等于PBR j。
步骤5、若逻辑信道j的上行比特率小于PBR j，终端设备继续获取该逻辑信道j中的SDU。
步骤6、若逻辑信道j的上行比特率大于或等于PBR j，终端设备对逻辑信道j的处理流程结束，接着处理下一逻辑信道。
应理解，在第一轮分配算法中，最小的复用单位是SDU，终端设备将某个SDU复用到PDU之后，如果当前逻辑信道的上行比特率大于或等于该逻辑信道的PBR，则终端设备处理下一优先级的逻辑信道；如果当前逻辑信道的上行比特率小于该逻辑信道的PBR，则终端设备可以继续处理该逻辑信道的下一SDU。因此，针对单个TTI，可能出现一个逻辑信道的上行比特率大于该逻辑信道的PBR、等于该逻辑信道的PBR或者小于该逻辑信道的PBR的情况，这在第一轮分配算法中都是允许的。
需要注意的是，令牌桶算法允许出现B j<0的情况。即在将逻辑信道j的SDU复用至PDU之前B j>0，而B j－T SDU<0时，该SDU不会放到队列中，而是采取“借贷”的方式获取到足够的令牌(此时B j减去T SDU后，其值小于0)，把该SDU复用到PDU中。只有将借到的令牌还完后(B j每TTI增加PBR j×TTI，直到B j>0)，该逻辑信道j才能进行后续的数据传输。在“还贷”的这段时间(即自B j<0至B j>0对应的时间段)内，该逻辑信道的上行比特率不超过该逻辑信道的PBR。例如，如果逻辑信道j的待传输数据的数据量大小为T SDU＝500Bytes，网络设备为其配置的PBR j为100kBps。在当前TTI中，其令牌桶中的令牌数为B j＝100，若上行资源足够，令牌桶算法允许终端设备将该SDU复用至PDU。复用之后，该逻辑信道j的令牌数变为B j＝100－500＝－400，那么在接下来的4个TTI(100kBps×4ms＝400Bytes，还贷过程)中，该逻辑信道j被挂起，即终端设备不能传输该逻辑信道j的数据。最终，在时长5个TTI的过程中，该逻辑信道j共发送数据500Bytes，平均上行比特率为500Bytes/5ms＝100kBps，与网络设备配置的PBR j一致。
另外，对于低优先级的逻辑信道，以逻辑信道j为例，若上行资源有限，那么在前面的若干TTI中，该逻辑信道j可能不会得到服务，但是其令牌桶中的令牌数在随TTI不断增加(不超过PBR j×BSD j)。例如，如果某个低优先级的逻辑信道j的待传输数据的数据量为300Bytes，其PBR j为100kBps、BSD j为3ms。在前两个TTI中，由于上行资源有限，该逻辑信道j未得到服务，在第三个TTI，上行资源充足，此时，该逻辑信道j的令牌桶中的令牌数增加至B j＝100kBps×3ms＝300，可以将该逻辑信道j的所有待传输数据发送出去，那么，在时长3个TTI的过程中，该逻辑信道j共传输数据300Bytes，平均上行比特率为300Bytes/3ms＝100kBps，与网络设备配置的PBR j一致。
第二轮分配算法：如果第一轮分配执行完还存在剩余的上行资源、且存在逻辑信道有数据待传输，则终端设备可以直接按照有数据待传输的逻辑信道的优先级递减顺序分配剩余的上行资源，直到下列条件中的任一种满足为止：所有逻辑信道没有数据待传输、或者剩余的上行资源耗尽。
例如，在第一轮分配之后，存在剩余的上行资源，且上述M个逻辑信道中还存在N个逻辑信道有数据待传输，N为小于或等于M的正整数，终端设备可以按照该N个逻辑信道的优先级递减的顺序分配剩余的上行资源。只有当高优先级的逻辑信道的数据都分配了上行资源且上行资源还未耗尽的情况下，低优先级的逻辑信道才能得到服务，即在第二轮分配中，终端设备最大化高优先级的逻辑信道的数据传输。
应理解，在上述第二轮分配过程中终端设备可以遵循以下原则：
(1)如果整个SDU能够填入剩余的PDU中，则不应对该SDU进行分段；
(2)如果终端设备对逻辑信道中的SDU进行分段，则应该根据剩余资源的大小和该逻辑信道的PBR，尽量填入最大分段，即终端设备应最大化数据的传输；
(3)如果某个无线承载或逻辑信道被挂起(令牌数小于0)，则不应传输该无线承载对应逻辑信道的数据。
(4)如果所有的逻辑信道的PBR都设置成0kBps，则终端设备会按照严格的优先级递减顺序来分配上行资源。即此时终端设备会最大限度地满足更高优先级的数据的传输。
(5)如果某个逻辑信道的PBR被配置成无穷大(infinity)时，例如信令无线承载(signaling radio bearer，SRB)对应的逻辑信道的PBR，只有当该逻辑信道没有数据待传输后，终端设备才会考虑比该逻辑信道优先级低的其他逻辑信道。
图4示出了基于上述第一轮分配算法和第二轮分配算法的上行资源的分配结果的示意图。在图4中，M＝3，即存在3个逻辑信道，分别为LCH 1、LCH 2和LCH 3。LCH 1的优先级为1，LCH 2的优先级为2，LCH 3的优先级为3。假设数值越小表示优先级越高，则LCH 1的优先级最高，LCH 2次之，LCH 3的优先级最低。其中，LCH 1的待传输数据为DATA 1，LCH 1的优先比特率为PBR 1，LCH 2的待传输数据为DATA 2，LCH 2的优先比特率为PBR 2，LCH 3的待传输数据为DATA 3，LCH 3的优先比特率为PBR 3。
终端设备可以先执行第一轮分配，即终端设备优先为LCH 1分配上行资源，将SDU 1复用至PDU。由于LCH 1已经达到PBR 1的限制，终端设备接下来可以处理LCH 2，将SDU 2复用至PDU。由于LCH 2已经达到PBR 2的限制，终端设备接下来可以处理LCH 3，将SDU 3复用至PDU。如图4所示，LCH 3虽然未超出PBR 3的限制，但是LCH 3已经没有数据待传输。此时，由于上行资源未耗尽、且LCH 1和LCH 2仍有数据待传输，因此，终端设备可以继续执行第二轮分配。终端设备将LCH 1的SDU 4复用至PDU，此时，虽然LCH 1仍有数据待传输，但是上行资源已经耗尽，无法再继续分配。
综上，上述算法在一定程度上实现了上行资源分配的公平性，同时保证了各个逻辑信道的最低上行传输速率。但是，上述算法仅仅保证了每个逻辑信道的最低上行传输速率，并未对各个逻辑信道的上行传输速率进行限制，这可能会导致逻辑信道的上行传输速率较高，从而导致网络拥塞。示例性地，在网络切片场景中，由于一个逻辑信道可以对应一个网络切片，一个网络切片可以对应一个或多个逻辑信道，若不限制各个逻辑信道的上行传输速率，可能导致终端设备的各个逻辑信道的上行传输速率超过其对应的网络切片的承载能力(即单个网络切片内的所有逻辑信道的总的上行传输速率的上限)，造成网络拥塞。
有鉴于此，本申请提供了一种上行数据传输的控制方法和装置，能够在终端设备进行上行传输时，实现对逻辑信道的速率控制，有利于降低网络拥塞的风险。
在介绍本申请提供的方法之前，先做出以下几点说明。
第一，在本申请中，“指示”可以包括直接指示和间接指示，也可以包括显式指示和隐式指示。将某一信息(如下文所述的最大上行比特率)所指示的信息称为待指示信息，则具体实现过程中，对待指示信息进行指示的方式可以有很多种，例如但不限于，可以直接指示待指示信息，如指示待指示信息本身或者该待指示信息的索引等。也可以通过指示其他信息来间接指示待指示信息，其中该其他信息与待指示信息之间存在关联关系。还可 以仅仅指示待指示信息的一部分，而待指示信息的其他部分则是已知的或者提前约定的。例如，还可以借助预先约定(例如协议规定)的各个信息的排列顺序来实现对特定信息的指示，从而在一定程度上降低指示开销。
第二，在下文示出的实施例中，各术语及英文缩略语，如媒体接入控制(media access control，MAC)、逻辑信道的最大上行比特率(uplink maximum bit rate，UMBR)、优先比特率(prioritized bit rate，PBR)等，均为方便描述而给出的示例性举例，不应对本申请构成任何限定。本申请并不排除在已有或未来的协议中定义其它能够实现相同或相似功能的术语的可能。
第三，在下文示出的实施例中第一、第二以及各种数字编号仅为描述方便进行的区分，并不用来限制本申请实施例的范围。例如，区分不同的信息、区分不同的逻辑信道等。
第四，在下文示出的实施例中，“预先获取”可包括由网络设备信令指示或者预先定义，例如，协议定义。其中，“预先定义”可以通过在设备(例如，包括终端设备和网络设备)中预先保存相应的代码、表格或其他可用于指示相关信息的方式来实现，本申请对于其具体的实现方式不做限定。
第五，本申请实施例中涉及的“协议”可以是指通信领域的标准协议，例如可以包括LTE协议、NR协议以及应用于未来的通信系统中的相关协议，本申请对此不做限定。
第六，本申请实施例均以“逻辑信道”为例进行说明，但应理解，如果无线承载与逻辑信道是一一对应的关系，本申请实施例中的逻辑信道也可以替换为无线承载，或者其他与逻辑信道对应的术语，本申请实施例对此不做限定。此外，本申请实施例采用“上行比特率”描述终端设备的上行数据的传输速率，这仅仅是示例性说明，本申请实施例中的上行比特率也可以替换为上行传输速率、上行发送速率或者其他术语，本申请实施例对此也不做限定。
下面结合图5至图10详细说明本申请提供的各个实施例。
本申请实施例以终端设备和网络设备为例进行描述，应理解，终端设备可以替换为能够实现与终端设备类似功能的装置或芯片，网络设备也可以替换为能够实现与网络设备类似功能的装置或芯片，本申请实施例对其名称不作限定。
图5为本申请实施例提供的上行数据传输的控制方法500的示意性流程图。该方法500可以应用于图1所示的通信系统100，本申请实施例对此不作限定。该方法500可以包括：
S510，网络设备向终端设备发送第一信息，则对应地，终端设备接收来自网络设备的第一信息，该第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率。
可选地，在S510之前，该方法500还包括：
S511，网络设备确定上述第一信息。
此处“至少一个逻辑信道中每个逻辑信道的最大上行比特率”是指，网络设备可以为至少一个逻辑信道中的每个逻辑信道都配置其各自的最大上行比特率，例如，至少一个逻辑信道为5个逻辑信道，网络设备可以为该5个逻辑信道配置5个最大上行比特率，该5个最大上行比特率可以全部或部分相同，或者全部相同，本申请实施例对此不做限定。示例性地，上述第一信息中的5个字段分别指示该5个最大上行比特率，该5个字段分别对应5个逻辑信道；或者，在5个最大上行比特率全部或部分相同的情况下，具有相同最大 上行比特率的多个逻辑信道占用上述第一信息中相同的字段，该字段可以对应该多个逻辑信道。这样，在至少一个逻辑信道的数量较多的情况下，能够节省信令开销。
S520，终端设备基于最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
这里的“全部或部分”逻辑信道是指，在上行资源充足的情况下，终端设备可以基于每个逻辑信道的最大上行比特率，为每个逻辑信道分配上行资源；在上行资源不够的情况下，终端设备可以给上述至少一个逻辑信道中的部分逻辑信道分配上行资源，对应地，此时，终端设备是基于该部分逻辑信道的最大上行比特率为该部分逻辑信道分配上行资源的，换句话说，上述至少一个逻辑信道中并不是所有的逻辑信道都可以被分配到上行资源，可能存在部分逻辑信道分配不到上行资源，本申请实施例对此不做限定。
在上述方法500中，通过网络设备向终端设备指示至少一个逻辑信道的最大上行比特率，使得终端设备基于该最大上行比特率限制为逻辑信道分配的上行资源，从而能够在终端设备进行上行传输时，实现对逻辑信道的速率控制，有利于降低网络拥塞的风险。
应理解，一个逻辑信道的最大上行比特率表示该逻辑信道的上行传输的比特率的上限。对于一个逻辑信道而言，若终端设备为该逻辑信道分配的上行资源较多，该逻辑信道的上行比特率较高，若终端设备为该逻辑信道分配的上行资源较少，该逻辑信道的上行比特率较低，因此，终端设备可以基于该逻辑信道的最大上行比特率，为该逻辑信道分配上行资源，从而控制该逻辑信道的上行比特率不超过该逻辑信道的最大上行比特率。
无线承载包括数据无线承载(data radio bearer，DRB)和信令无线承载(signaling radio bearer，SRB)两类，终端设备在分配时可以优先传输SRB的数据，即优先满足SRB对应的逻辑信道的上行资源需求。因此，在一种可能的实现方式中，本申请实施例的方法主要适用于数据无线承载(data radio bearer，DRB)对应的逻辑信道，即上述至少一个逻辑信道为DRB对应的逻辑信道。
可选地，上述第一信息可以是网络设备通过无线资源控制(radio resource control，RRC)信令发送的，例如LogicalChannelConfig信元。
可选地，上述至少一个逻辑信道可以对应一个网络切片。网络切片的最大上行比特率是针对单个网络切片而言的，一个网络切片的最大上行比特率表示该网络切片对应的所有逻辑信道的上行传输的比特率的上限。为便于区分和描述，本申请实施例将逻辑信道的最大上行比特率简记为UMBR，将网络切片的最大上行比特率简记为
Figure PCTCN2019123761-appb-000001
可选地，上述至少一个逻辑信道可以对应一个PDU会话。与网络切片类似，PDU会话的最大上行比特率是针对单个PDU会话而言的，一个PDU会话的最大上行比特率表示该PDU会话对应的所有逻辑信道的上行传输的比特率的上限。
一个网络切片中可以包括一个PDU会话或者多个PDU会话，本申请实施例对此不做限定。通过对网络切片中的逻辑信道的上行传输速率进行限制，可以实现网络切片内的上行速率控制，降低网络切片粒度的网络拥塞的风险。同理，通过对PDU会话中的逻辑信道的上行传输速率进行限制，可以实现PDU会话内的上行速率控制，降低PDU会话粒度的网络拥塞的风险。为便于描述，后续仅以网络切片为例，对本申请实施例的上行数据传输的控制方法进行描述。
在本申请实施例中，为了避免网络切片内上行传输速率过载，一个网络切片对应的所 有逻辑信道的UMBR之和小于或等于该网络切片的最大上行比特率。
可选地，在S520之后，方法500还可以包括：
S530，终端设备向网络设备发送协议数据单元PDU，则对应地，网络设备接收来自终端设备的PDU，该PDU包括来自一个或多个逻辑信道的数据，该一个或多个逻辑信道的数据是基于该一个或多个逻辑信道的最大上行比特率被复用到该PDU的，该一个或多个逻辑信道可以对应一个或多个网络切片。
S540，该网络设备解析该PDU，获得该逻辑信道的数据。
具体地，终端设备可以按照上述S510和S520为各个逻辑信道分配上行资源，即将各个逻辑信道的SDU复用至PDU，然后，该终端设备可以向网络设备发送该PDU。终端设备发送的PDU可以包括来自一个或多个逻辑信道的数据(即SDU)，该一个或多个逻辑信道可以对应一个或多个网络切片。示例性地，网络设备接收到的PDU可以包括逻辑信道1、逻辑信道2和逻辑信道3的数据，其中，逻辑信道1和逻辑信道2对应网络切片1，逻辑信道3对应网络切片2。
作为一个可选的实施例，该终端设备基于最大上行比特率，为至少一个逻辑信道中的全部或部分逻辑信道分配上行资源，包括：终端设备基于至少一个逻辑信道的优先比特率和最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
这样，通过参考逻辑信道的优先比特率和最大上行比特率，不仅避免了低优先级逻辑信道总不能得到服务的问题，而且能够限制逻辑信道的上行传输速率不超过该逻辑信道的传输速率上限，降低网络拥塞的风险。
在一种可能的实现方式中，由于UMBR为逻辑信道的上行传输的比特率的上限，一个逻辑信道的UMBR大于或等于该逻辑信道的优先比特率PBR。即对于任一网络切片i中的逻辑信道j，都有：
Figure PCTCN2019123761-appb-000002
0≤PBR j≤UMBR j。
其中，i和j均为正整数。
应理解，上述第一信息可以携带最大上行比特率，也可以携带特定时间内能够上行传输的最大数据量，该特定时间内能够上行传输的最大数据量和最大上行比特率是可以相互转换的。此外，上述逻辑信道的PBR可以是终端设备预先获取的，示例性地，逻辑信道的PBR可以是网络设备通过配置信息(例如LogicalChannelConfig信元)为终端设备配置的。该配置信息与上述第一信息可以是不同的信息，也可以是相同的信息，即网络设备可以通过同一信息的两个不同字段分别为终端设备配置逻辑信道的UMBR和逻辑信道的PBR，本申请实施例对此不做限定。
本申请实施例的上行数据传输的控制方法，通过网络设备为终端设备配置逻辑信道的最大上行比特率，保障一个网络切片对应的所有逻辑信道的最大上行比特率之和小于或等于该网络切片内的最大上行比特率，进而实现对网络切片内终端设备的上行传输速率的控制，有利于避免终端设备进行上行数据传输时，网络切片内上行传输速率过载的问题，降低网络拥塞的风险。
在第一种可能的实现方式中，终端设备可以基于上述逻辑信道的PBR，执行上述第一 轮分配算法，使得逻辑信道的上行比特率达到该逻辑信道的PBR的限制；若存在剩余的上行资源、且存在有数据待传输的逻辑信道，终端设备执行第二轮分配算法，即基于逻辑信道的UMBR，为仍有数据待传输的逻辑信道分配上行资源，使得所有逻辑信道均没有数据待传输、或者上行资源耗尽、或者逻辑信道达到该逻辑信道的UMBR的限制。
在第二种可能的实现方式中，终端设备可以仅基于UMBR为逻辑信道分配资源。示例性地，终端设备可以不执行上述第一轮分配算法，直接对有数据待传输的逻辑信道执行第二轮分配算法，即基于逻辑信道的UMBR，为逻辑信道分配上行资源，使得所有逻辑信道均没有数据待传输、或者上行资源耗尽、或者逻辑信道达到该逻辑信道的UMBR的限制。
在第三种可能的实现方式中，终端设备可以基于其他原则和UMBR为逻辑信道分配资源。示例性地，终端设备可以按照其他原则(例如，为各个逻辑信道的预定义数值的数据量分配上行资源)为逻辑信道分配上行资源，再执行第二轮分配算法，即基于逻辑信道的UMBR，为仍有数据待传输的逻辑信道分配上行资源，使得所有逻辑信道均没有数据待传输、或者上行资源耗尽、或者逻辑信道达到该逻辑信道的UMBR的限制。
在上述第二种可能的实现方式和第三种可能的实现方式中，由于终端设备并未基于PBR(即未采用令牌桶算法进行第一轮分配)，网络设备可以仅为终端设备配置逻辑信道的UMBR，无PBR。进一步地，网络设备也可以不配置优先级和BSD。在这种情况下，可选地，在上述逻辑信道包括多个逻辑信道的情况下，终端设备可以根据各个逻辑信道的待传输数据量对多个逻辑信道进行排序(例如，按照升序或降序)，或者，终端设备可以随机对有数据待传输的逻辑信道进行排序，从而确定各个逻辑信道的处理优先级，以便按照该优先级的递减顺序，为各个逻辑信道分配上行资源。
在上述三种可能的实现方式中，终端设备的第二轮分配可能出现下列情况：
(1)若逻辑信道中的待传输数据不超过其UMBR，且上行资源足够，终端设备可以直接将该逻辑信道的数据复用至PDU，然后继续处理下一优先级的逻辑信道。
(2)若逻辑信道中的待传输数据不超过其UMBR，且上行资源不足，终端设备可以将该逻辑信道的数据进行分段处理，根据上行资源复用最大分段至PDU。
(3)若逻辑信道中的待传输数据超过其UMBR，且上行资源足够，终端设备可以将该逻辑信道的数据进行分段处理，根据UMBR复用最大分段至PDU，然后继续处理下一顺序逻辑信道。
(4)若逻辑信道中的待传输数据超过其UMBR，且上行资源不足，终端设备可以将该逻辑信道的数据进行分段处理，根据UMBR和剩余上行资源能够传输的数据量中的较小值复用最大分段至PDU，然后继续处理下一顺序逻辑信道。
上述复用最大分段，即指将对SDU进行分段处理后获得的子SDU复用到PDU中，该逻辑信道的上行比特率等于该逻辑信道的最大上行比特率。
下面针对第一种可能的实现方式进行详细描述。即终端设备基于最大上行比特率，为至少一个逻辑信道中的全部或部分逻辑信道分配上行资源，包括：终端设备基于至少一个逻辑信道的优先比特率和最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
这样，通过参考逻辑信道的优先比特率和最大上行比特率，不仅避免了低优先级逻辑 信道总不能得到服务的问题，而且能够限制逻辑信道的上行传输速率不超过该逻辑信道的传输速率上限，降低网络拥塞的风险。
作为一个可选的实施例，上述终端设备基于逻辑信道的最大上行比特率，为该逻辑信道分配上行资源，包括：该终端设备基于该逻辑信道的优先比特率，为该逻辑信道分配上行资源；若存在剩余的上行资源、且该逻辑信道中的第一逻辑信道仍有数据待传输，该终端设备基于该第一逻辑信道的最大上行比特率，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该第一逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者第一逻辑信道的上行比特率达到该第一逻辑信道的最大上行比特率。
具体而言，终端设备可以参照令牌桶算法为逻辑信道分配上行资源。即终端设备可以先执行第一轮分配，基于逻辑信道的优先比特率，为该逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该逻辑信道的上行比特率达到该逻辑信道的优先比特率的限制、或者上行资源耗尽。在第一轮分配之后，从时间平均的角度来看，逻辑信道的上行比特率小于或等于该逻辑信道的优先比特率。在上述逻辑信道包括多个逻辑信道的情况下，终端设备可以参照该多个逻辑信道的优先比特率，按照优先级递减的顺序为该多个逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该多个逻辑信道的上行比特率均达到各自的优先比特率的限制、或者上行资源耗尽，使得从时间平均的角度来看该多个逻辑信道的上行比特率小于或等于各自的优先比特率。具体分配方法可参见上述令牌桶算法中对于第一轮分配的描述，此处不再赘述。
应理解，逻辑信道的上行比特率是一段时间内的平均值，例如，针对一个逻辑信道，在单个TTI中，本申请允许逻辑信道的上行比特率超过该逻辑信道的最大上行比特率，但是，在逻辑信道的上行比特率超过该逻辑信道的最大上行比特率之后，该逻辑信道即被挂起，即在接下来的TTI中，终端设备不再为该逻辑信道分配上行资源，直到该逻辑信道的上行比特率小于或等于该逻辑信道的最大上行比特率。
在执行完第一轮分配之后，若还存在剩余的上行资源、且上述逻辑信道中的第一逻辑信道仍有数据待传输，则终端设备可以执行第二轮分配。应理解，该第一逻辑信道为在仍有数据待传输的逻辑信道中，上行比特率小于该逻辑信道的最大上行比特率的逻辑信道。对于已经在第一轮分配中达到最大上行比特率的所有逻辑信道，无论是否仍有数据待发送，均不再执行第二轮分配。
终端设备可以基于该第一逻辑信道的最大上行比特率，即该第一逻辑信道的UMBR，分配剩余的上行资源，直到下列条件中的任一种满足为止：该第一逻辑信道没有数据待传输、或者该剩余的上行资源耗尽，使得从时间平均的角度来看该第一逻辑信道的上行比特率小于或等于该第一逻辑信道的UMBR。上述第一逻辑信道可以为一个逻辑信道，也可以包括多个逻辑信道。下面，分两种情况对第二轮分配的过程进行详细描述。
情况1，作为一个可选的实施例，该第一逻辑信道为一个逻辑信道，该终端设备基于该第一逻辑信道的最大上行比特率，分配该剩余的上行资源，包括：若该第一逻辑信道中未被复用到协议数据单元PDU的第一服务数据单元SDU的上行比特率与该第一逻辑信道中已被复用到该PDU的第二SDU的上行比特率之和小于或等于该第一逻辑信道的最大上行比特率，该终端设备将该第一SDU复用至该PDU；或，若该第一SDU的上行比特率与该第二SDU的上行比特率之和大于该第一逻辑信道的最大上行比特率，该终端设备对 该第一SDU进行分段处理，获得第一子SDU，并将该第一子SDU复用到该PDU。
换句话说，若第一逻辑信道的第一SDU与该第一逻辑信道已经被复用到PDU的第二SDU能够满足该第一逻辑信道的UMBR的限制，终端设备可以将该第一SDU复用至PDU；否则，终端设备可以对该第一SDU进行分段处理，将获得的第一子SDU复用到PDU，使得第一子SDU的上行比特率与第二SDU的上行比特率之和等于该第一逻辑信道的UMBR。即终端设备在分配上行资源时，可以尽量不对SDU分段，在对SDU分段时，尽量将更大的SDU分段复用至PDU，从而最大化逻辑信道的数据传输。
情况2，作为一个可选的实施例，该第一逻辑信道包括至少两个逻辑信道，该终端设备基于该第一逻辑信道的最大上行比特率，分配该剩余的上行资源，包括：该终端设备基于该至少两个逻辑信道的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该至少两个逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该至少两个逻辑信道的上行比特率达到该至少两个逻辑信道的最大上行比特率的限制。
示例性地，该终端设备基于该至少两个逻辑信道的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，分配该剩余的上行资源，包括：该终端设备从该至少两个逻辑信道中选择第二逻辑信道，该第二逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道；若该第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与该第二逻辑信道中已被复用到该PDU的第四SDU的上行比特率之和小于或等于该第二逻辑信道的最大上行比特率，该终端设备将该第三SDU复用至该PDU；若该第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与该第二逻辑信道中已被复用到该PDU的第四SDU的上行比特率之和大于该第二逻辑信道的最大上行比特率，该终端设备将对该第三SDU进行分段处理，获得第三子SDU；该终端设备将该第三子SDU复用到该PDU。
换句话说，第一逻辑信道包括至少两个逻辑信道，其中，第二逻辑信道是优先级最高的，因此，终端设备优先为第二逻辑信道分配上行资源。若第二逻辑信道的第三SDU与该第二逻辑信道已经被复用到PDU的第四SDU能够满足该第二逻辑信道的UMBR的限制，终端设备可以将该第三SDU复用至PDU；否则，终端设备可以对该第三SDU进行分段处理，将获得的第三子SDU复用到PDU，使得第三子SDU的上行比特率与第四SDU的上行比特率之和等于该第二逻辑信道的UMBR。即终端设备在分配上行资源时，可以尽量不对SDU分段，在对SDU分段时，尽量将更大的SDU分段复用至PDU，从而最大化逻辑信道的数据传输。
在终端设备按照上述方法为第二逻辑信道分配上行资源后，若仍存在剩余上行资源，终端设备可以继续为下一优先级的逻辑信道分配上行资源，该下一优先级的逻辑信道是指在上述至少两个逻辑信道中，第二逻辑信道的下一优先级的逻辑信道。具体分配方法类似，此处不再赘述。
应理解，在本申请实施例的第二轮分配的过程中，终端设备可以遵循以下原则：
(1)如果逻辑信道的整个SDU能够填入剩余的PDU中，且未达到该逻辑信道的UMBR的限制，则不应对该SDU进行分段；
(2)如果终端设备由于UMBR的限制需要对逻辑信道中的SDU进行分段，则应该根据剩余资源的大小和该逻辑信道的UMBR，尽量填入最大分段，即终端设备应最大化数 据的传输；
(3)如果某个无线承载或逻辑信道被挂起(令牌数小于0)，则不应传输该无线承载对应逻辑信道的数据。
图6示出了本申请实施例的一种上行资源的分配结果的示意图。在图6中，存在2个逻辑信道，分别为LCH 1和LCH 2，LCH 1和LCH 2对应一个网络切片i。LCH 1的优先级为1，LCH 2的优先级为2。假设数值越小表示优先级越高，则LCH 1的优先级最高，LCH 2次之。其中，LCH 1的待传输数据为DATA 1，LCH 1的优先比特率为PBR 1，LCH 1的最大上行比特率为UMBR 1，LCH 2的待传输数据为DATA 2，LCH 2的优先比特率为PBR 2，LCH 2的最大上行比特率为UMBR 2。网络切片i的最大上行比特率为
Figure PCTCN2019123761-appb-000003
UMBR 1和UMBR 2之和小于
Figure PCTCN2019123761-appb-000004
按照本申请实施例的方法，先执行第一轮分配，即终端设备优先为LCH 1分配上行资源，将SDU 1复用至PDU，使得LCH 1的上行比特率达到PBR 1的限制，终端设备接下来可以处理LCH 2，将SDU 2复用至PDU，使得LCH 2的上行比特率达到PBR 2的限制。由于LCH 1和LCH 2均已被分配到上行资源，且仍存在剩余的上行资源，终端设备接下来可以执行第二轮分配。终端设备将LCH 1的SDU 3复用至PDU，使得LCH 1的上行比特率达到UMBR 1的限制，此时，虽然LCH 1仍有数据待传输，但是由于LCH 1的上行比特率已经达到UMBR 1的限制，无法再继续为LCH 1分配上行资源。由于仍存剩余的上行资源，终端设备将LCH 2的SDU 4复用至PDU。虽然LCH 2的上行比特率未达到UMBR 2的限制，但是此时LCH 2没有数据待传输。按照本申请实施例的方法，网络切片i的实际上行比特率小于该网络切片i的最大上行比特率。
应理解，上述图6仅仅示出了一种理想的情况，即SDU 1(可以包括一个或多个SDU)复用到PDU之后，LCH 1的上行比特率正好等于PBR 1，SDU 2(可以包括一个或多个SDU)复用到PDU之后，LCH 2的上行比特率正好等于PBR 2。此外，SDU 3可以包括一个SDU、多个SDU、或者进行分段处理后的子SDU，由于第二轮分配算法中终端设备可以对SDU进行分段，能够使得LCH 1的上行比特率等于UMBR 1。
上述方法500通过网络设备为终端设备配置逻辑信道的最大上行比特率，保障了一个网络切片对应的所有逻辑信道的最大上行比特率之和小于或等于该网络切片内的最大上行比特率，终端设备需要基于逻辑信道的最大上行比特率，进行逻辑信道的第二轮资源分配。这样，实现了终端设备对网络切片内的上行传输速率的控制，有利于避免终端设备进行上行数据传输时，网络切片内上行传输速率过载的问题，降低网络拥塞的风险。
本申请实施例还提供了另一种上行数据传输的控制方法，同样能够实现终端设备对网络切片内的上行传输速率的控制。
图7是本申请实施例的另一种上行数据传输的控制方法700的示意性流程图。该方法700可以应用于图1所示的通信系统100，本申请实施例对此不作限定。该方法700可以包括：
S710，终端设备确定逻辑信道的优先比特率PBR和网络切片的最大上行比特率，该逻辑信道对应该网络切片。
S720，该终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源。
上述逻辑信道可以包括一个或多个逻辑信道，该一个或多个逻辑信道对应一个或多个网络切片。示例性地，假设存在三个逻辑信道，分别为：逻辑信道1、逻辑信道2和逻辑信道3，该三个逻辑信道可以对应两个网络切片，即逻辑信道1和逻辑信道2对应网络切片1，逻辑信道3对应网络切片2。应理解，网络切片的最大上行比特率是针对单个网络切片而言的，一个网络切片的最大上行比特率表示该网络切片对应的所有逻辑信道的上行传输的比特率的上限。为便于描述，本申请实施例将网络切片的最大上行比特率简记为
Figure PCTCN2019123761-appb-000005
应理解，上述逻辑信道的PBR和网络切片的
Figure PCTCN2019123761-appb-000006
可以是终端设备预先获取的，示例性地，逻辑信道的PBR可以是网络设备通过配置信息(例如LogicalChannelConfig信元)为终端设备配置的。网络切片的
Figure PCTCN2019123761-appb-000007
可以是网络设备为终端设备配置的，也可以是协议定义的，本申请实施例对此不做限定。
本申请实施例的上行数据传输的控制方法，通过终端设备基于网络切片的最大上行比特率为逻辑信道分配上行资源，保障一个网络切片对应的所有逻辑信道的上行比特率之和小于或等于该网络切片内的最大上行比特率，进而实现对网络切片内终端设备的上行传输速率的控制，有利于避免终端设备进行上行数据传输时，网络切片内上行传输速率过载的问题，降低网络拥塞的风险。
可选地，在S720之后，方法700还可以包括：
S730，终端设备向网络设备发送协议数据单元PDU，则对应地，网络设备接收来自终端设备的PDU，该PDU包括来自逻辑信道的数据，该逻辑信道对应网络切片，该逻辑信道的数据是基于该逻辑信道的优先比特率和该网络切片的最大上行比特率被复用到该PDU的。
S740，该网络设备解析该PDU，获得该逻辑信道的数据。
具体地，终端设备可以按照上述S710和S720为各个逻辑信道分配上行资源，即将各个逻辑信道的SDU复用至PDU，然后，该终端设备可以向网络设备发送该PDU。终端设备发送的PDU可以包括来自一个或多个逻辑信道的数据(即SDU)，该一个或多个逻辑信道可以对应一个或多个网络切片。
作为一个可选的实施例，该逻辑信道为一个逻辑信道，该终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源，包括：终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该逻辑信道的上行比特率达到该逻辑信道的优先比特率的限制、或者该网络切片的上行比特率超过该网络切片的最大上行比特率、或者上行资源耗尽。
作为一个可选的实施例，该逻辑信道包括至少两个逻辑信道，该终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源，包括：该终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，为该至少两个逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该至少两个逻辑信道的上行比特率均达到该至少两个逻辑信道的优先比特率的限制、或者该至少两个逻辑信道对应的网络切片的上行比特率达到该至少两个逻辑信道对应的网络切片的上行比特率的限制、或者上行资源耗尽。
具体而言，上述分配过程为第一轮分配，即终端设备可以参照本申请实施例提出的新的令牌桶算法为逻辑信道分配上行资源，能够使得从时间平均的角度来看该多个逻辑信道的上行比特率小于或等于各自的优先比特率，且在从时间平均的角度来看各个网络切片的上行比特率小于或等于各自的最大上行比特率。下面详细介绍本申请实施例的第一轮分配算法(即新的令牌桶算法)。
作为一个可选的实施例，该终端设备基于该至少两个逻辑信道的优先比特率和该网络切片的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，为该至少两个逻辑信道分配上行资源，包括：在该至少两个逻辑信道中的第一逻辑信道对应的令牌数大于0的情况下，该终端设备确定将该至少两个逻辑信道中的第一逻辑信道的第一服务数据单元SDU复用至协议数据单元PDU之后，该第一逻辑信道对应的、该网络切片中的第一网络切片的累积上行比特率，该第一逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道；若该第一网络切片的累积上行比特率小于或等于该第一网络切片的最大上行比特率，该终端设备将该第一SDU复用至该PDU；若该第一网络切片的累积上行比特率大于该第一网络切片的最大上行比特率，且该至少两个逻辑信道中的第二逻辑信道对应的令牌数大于0，该终端设备确定将该第二逻辑信道的第二SDU复用至该PDU之后，该第二逻辑信道对应的、该网络切片中的第二网络切片的累积上行比特率，该第二逻辑信道为该至少两个逻辑信道中该第一逻辑信道的下一优先级的逻辑信道；若该第二网络切片的累积上行比特率小于或等于该第二网络切片的最大上行比特率，该终端设备将该第二SDU复用至该PDU。
具体而言，在第一轮分配的过程中，终端设备按照上述至少两个逻辑信道的优先级递减顺序，先为优先级最高的第一逻辑信道分配上行资源，若第一逻辑信道对应的第一网络切片的累计上行比特率超出该第一网络切片的最大上行比特率的限制，该终端设备再为下一优先级的逻辑信道(即第二逻辑信道)分配上行资源。
应理解，上述第一逻辑信道对应的第一网络切片和第二逻辑信道对应的第二网络切片可以相同，也可以不同，即第一逻辑信道和第二逻辑信道可以对应相同的网络切片，也可以对应不同的网络切片，本申请实施例对此不做限定。
下面结合图8对本申请实施例的第一轮分配算法进行详细描述。与图3类似，终端设备可以按照优先级递减的顺序对每个逻辑信道执行下列步骤，下面以逻辑信道j为例进行说明。
步骤1和步骤2与图3对应的步骤1和步骤2相同，此处不再赘述。
步骤3、若B j大于0，则终端设备判断是否
Figure PCTCN2019123761-appb-000008
其中，
Figure PCTCN2019123761-appb-000009
为将SDU 1复用到PDU之后逻辑信道j对应的网络切片i的累积上行比特率，
Figure PCTCN2019123761-appb-000010
为网络切片i的累积上行比特率。
步骤4、若
Figure PCTCN2019123761-appb-000011
终端设备对逻辑信道j的处理流程结束，接着处理下一逻辑信道。
步骤5、若
Figure PCTCN2019123761-appb-000012
终端设备将SDU 1复用到PDU，更新网络切片i的累积数据量，并执行B j－＝T SDU 1，T SDU 1表示SDU 1的数据量大小，B j－＝T SDU 1表示将B j的值更新为B j－T SDU 1的值。
步骤6-8与图3对应的步骤4-6相同，此处不再赘述。
应理解，在上述第一轮分配算法中，最小的复用单位是SDU，终端设备将某个SDU复用到PDU之后，如果当前逻辑信道的上行比特率大于或等于该逻辑信道的PBR，则终端设备处理下一优先级的逻辑信道，当前逻辑信道挂起；如果当前逻辑信道的上行比特率小于该逻辑信道的PBR，则终端设备可以继续处理该逻辑信道的下一SDU。因此，针对单个TTI，可能出现一个逻辑信道的上行比特率大于该逻辑信道的PBR、等于该逻辑信道的PBR或者小于该逻辑信道的PBR的情况，这在第一轮分配算法中都是允许的。
在本申请实施例中，一段时间内一个网络切片对应的所有逻辑信道所传输的上行数据量可以被称为该网络切片的累积数据量，则对应地，该网络切片的累积数据量与该时间的比值可以被称为该网络切片的累积上行比特率。上述一段时间可以是协议约定的、或者网络设备配置的时间段，例如，可以是一个或多个TTI，或者自网络切片创建之时至当前TTI，本申请实施例对此不做限定。因此，上述网络切片的累积数据量例如可以是当前TTI内该网络切片内的所有逻辑信道传输的上行数据量之和，或者，自网络切片创建起所有历史数据之和。
应理解，上述“累积数据量”、“累积上行比特率”仅仅是为方便描述而给出的示例性举例，不应对本申请构成任何限定。本申请并不排除在已有或未来的协议中定义其它能够实现相同或相似功能的术语的可能。
作为一个可选的实施例，该第一网络切片的累积上行比特率是基于该第一网络切片的滑动时间窗口的长度和该第一网络切片在该滑动时间窗口中的累积数据量确定的，该第一网络切片在该滑动时间窗口中的累积数据量为从当前时刻起向前的第一时间段内，该第一网络切片的所有逻辑信道传输的数据量之和，该第一时间段的长度为该滑动时间窗口的长度。
上述一段时间的时长即为该滑动时间窗口的长度。滑动时间窗口是指从当前时刻(例如当前TTI)起向前回溯的一段时间。示例性地，图9示出了本申请实施例的滑动时间窗口的示意图，如图9所示，第一网络切片的滑动时间窗口的长度可以为1000个TTI，该第一网络切片的累积数据量为从当前TTI起，向前回溯999个TTI的时间段内，第一网络切片的所有的逻辑信道传输的数据量之和。
由于对速率的限制是平均时间上的概念，若是针对单个TTI，限制性较强，灵活性较低，因此，通过设置滑动时间窗口，能够获取最新的一段时间(可以包括多个TTI)内网络切片的累积数据量，更有利于实现对网络切片的上行比特率的限制，且提高网络切片的上行比特率的计算灵活性。
应理解，网络切片的滑动时间窗口的长度可以是终端设备预先获取的。具体地，网络切片的滑动时间窗口的长度可以是网络设备为终端设备配置的，或者，是协议定义的，本申请实施例对此不做限定。此外，“滑动时间窗口”仅仅是为方便描述而给出的示例性举例，该术语也可以替换为统计时间窗口、滑动统计时间窗口或者其他术语，本申请实施例对此也不做限定。
作为一个可选的实施例，该方法还包括：该网络设备确定网络切片的滑动时间窗口的长度；网络设备向终端设备发送第二信息，则对应地，终端设备接收网络设备发送的第二信息，该第二信息用于指示网络切片的滑动时间窗口的长度。
应理解，多个网络切片对应的滑动时间窗口的长度可以是相同的，也可以是不同的。 若多个网络切片对应的滑动时间窗口的长度相同，网络设备可以通过一个第二信息指示该长度即可。若多个网络切片对应的滑动时间窗口的长度不相同，网络设备可以通过该第二信息指示网络切片的标识和网络切片的滑动时间窗口的长度，使得网络切片的滑动时间窗口的长度与网络切片的标识对应。例如，上述第二信息可以指示长度1、长度2和长度3，且指示长度1对应网络切片1，长度2对应网络切片2，长度3对应网络切片3。
可选地，网络设备可以基于网络切片的类型，确定网络切片的滑动时间窗口的长度。例如，对于时延敏感业务的网络切片，滑动时间窗口的长度较短；对于时延不敏感业务的网络切片，滑动时间窗口的长度较长。
这样，网络设备可以针对不同类型的网络切片，可以设定不同的滑动时间窗口的长度，来适应不同的业务特性，从而灵活适配多种业务场景。
作为一个可选的实施例，在该终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源之后，该方法还包括：若存在剩余的上行资源、且该逻辑信道中的第三逻辑信道仍有数据待传输，该终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该第三逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该第三逻辑信道对应的网络切片的累积上行比特率达到该第三逻辑信道对应的网络切片的最大上限比特率的限制。
在执行完第一轮分配之后，若还存在剩余的上行资源、且上述逻辑信道中的第三逻辑信道仍有数据待传输，则终端设备可以执行第二轮分配。应理解，该第三逻辑信道为在仍有数据待传输的逻辑信道中，对应网络切片的累积上行比特率小于该网络切片的最大上行比特率的逻辑信道。对于已经在第一轮分配中达到最大上行比特率的网络切片对应的所有逻辑信道，无论是否仍有数据待发送，均不再执行第二轮分配。
终端设备可以基于该第三逻辑信道对应的网络切片的最大上行比特率，分配剩余的上行资源，直到下列条件中的任一种满足为止：该第三逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者第三逻辑信道对应的网络切片的累积上行比特率达到该第三逻辑信道对应的网络切片的最大上行比特率的限制。上述第三逻辑信道可以为一个逻辑信道，也可以包括多个逻辑信道，第三逻辑信道对应的网络切片可以是一个网络切片，也可以是多个网络切片。下面，分两种情况对第二轮分配的过程进行详细描述。
情况1，作为一个可选的实施例，该第三逻辑信道为一个逻辑信道，该终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，分配该剩余的上行资源，包括：若将该第三逻辑信道中未被复用到PDU的第三SDU复用至该PDU之后，该第三逻辑信道对应的、该网络切片中的第三网络切片的累积上行比特率小于或等于该第三网络切片的最大上行比特率，该终端设备将该第三SDU复用至该PDU；或，若将该第三SDU复用至该PDU之后，该第三网络切片的累积上行比特率大于该第三网络切片的最大上行比特率，该终端设备对该第三SDU进行分段处理，获得第三子SDU，并将该第三子SDU复用到该PDU。
换句话说，若将第三逻辑信道的第三SDU复用至PDU之后，该第三逻辑信道对应的第三网络切片的累积上行比特率能够满足该第三网络切片的最大上行比特率的限制，终端设备可以将该第三SDU复用至PDU；否则，终端设备可以对该第三SDU进行分段处理， 将获得的第三子SDU复用到PDU，使得第三网络切片的累积上行比特率等于该第三网络切片的最大上行比特率。即终端设备在分配上行资源时，可以尽量不对SDU分段，在对SDU分段时，尽量将更大的SDU分段复用至PDU，从而最大化逻辑信道的数据传输。
情况2，作为一个可选的实施例，该第三逻辑信道包括至少两个逻辑信道，该终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，分配该剩余的上行资源，包括：该终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，按照该第三逻辑信道的优先级递减顺序，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该第三逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该第三逻辑信道对应的网络切片的累积上行比特率达到该第三逻辑信道对应的网络切片的最大上限比特率的限制。
示例性地，该终端设备基于该第三逻辑信道对应的网络切片的最大上行比特率，按照该第三逻辑信道的优先级递减顺序，分配该剩余的上行资源，包括：该终端设备从该第三逻辑信道中选择第四逻辑信道，该第四逻辑信道为该第三逻辑信道中优先级最高的逻辑信道；若将该第四逻辑信道中未被复用到PDU的第四SDU复用至该PDU之后，该第四逻辑信道对应的第四网络切片的累积上行比特率小于或等于该第四网络切片的最大上行比特率，该终端设备将该第四SDU复用至该PDU；若将该第四逻辑信道中未被复用到PDU的第四SDU复用至该PDU之后，该第四逻辑信道对应的第四网络切片的累积上行比特率大于该第四网络切片的最大上行比特率，该终端设备对该第四SDU进行分段处理，获得第四子SDU；该终端设备将该第四子SDU复用到该PDU。
换句话说，第三逻辑信道包括至少两个逻辑信道，其中，第四逻辑信道是优先级最高的，因此，终端设备优先为第四逻辑信道分配上行资源。若将第四逻辑信道的第四SDU复用至PDU之后，该第四逻辑信道对应的第四网络切片的累积上行比特率能够满足该第四网络切片的最大上行比特率的限制，终端设备可以将该第四SDU复用至PDU；否则，终端设备可以对该第四SDU进行分段处理，将获得的第四子SDU复用到PDU，使得第四网络切片的累积上行比特率等于该第四网络切片的最大上行比特率。即终端设备在分配上行资源时，可以尽量不对SDU分段，在对SDU分段时，尽量将更大的SDU分段复用至PDU，从而最大化逻辑信道的数据传输。
在终端设备按照上述方法为第四逻辑信道分配上行资源后，若仍存在剩余上行资源，终端设备可以继续为下一优先级的逻辑信道分配上行资源，该下一优先级的逻辑信道是指在上述至少两个逻辑信道中，第四逻辑信道的下一优先级的逻辑信道。具体分配方法类似，此处不再赘述。
应理解，在本申请实施例的第二轮分配的过程中，终端设备可以遵循以下原则：
(1)如果逻辑信道的整个SDU能够填入剩余的PDU中，且未达到该逻辑信道对应的网络切片的最大上行比特率的限制，则不应对该SDU进行分段；
(2)如果终端设备由于网络切片的最大上行比特率的限制需要对逻辑信道中的SDU进行分段，则应该根据剩余资源的大小和该逻辑信道对应的网络切片的最大上行比特率，尽量填入最大分段，即终端设备应最大化数据的传输；
(3)如果某个无线承载或逻辑信道被挂起(令牌数小于0)，则不应传输该无线承载对应逻辑信道的数据。
图10示出了本申请实施例的另一种上行资源的分配结果的示意图。在图10中，存在 2个逻辑信道，分别为LCH 1和LCH 2，LCH 1和LCH 2对应一个网络切片i。网络切片i的最大上行比特率为
Figure PCTCN2019123761-appb-000013
LCH 1的优先级为1，LCH 2的优先级为2。假设数值越小表示优先级越高，则LCH 1的优先级最高，LCH 2次之。其中，LCH 1的待传输数据为DATA 1，LCH 1的优先比特率为PBR 1，LCH 2的待传输数据为DATA 2，LCH 2的优先比特率为PBR 2。
按照本申请实施例的方法，先执行第一轮分配，即终端设备优先为LCH 1分配上行资源，将SDU 1复用至PDU，使得LCH 1的上行比特率达到PBR 1的限制，由于网络切片i的累积上行比特率未超过
Figure PCTCN2019123761-appb-000014
终端设备接下来可以处理LCH 2。但是，若将SDU 2和SDU 3均复用至PDU之后，网络切片i的累积上行比特率大于
Figure PCTCN2019123761-appb-000015
因此终端设备可以将SDU 2复用至PDU，使得网络切片i的累积上行比特率等于
Figure PCTCN2019123761-appb-000016
此时，虽然LCH 1和LCH 2均仍有数据待发送，且存在剩余的上行资源，但是，该网络切片i的累积上行比特率已达到
Figure PCTCN2019123761-appb-000017
终端设备不再执行第二轮分配。
应理解，上述图10仅仅示出了一种理想的情况，即SDU 1(可以包括一个或多个SDU)复用到PDU之后，LCH 1的上行比特率正好等于PBR 1，SDU 2(可以包括一个或多个SDU)复用到PDU之后，LCH 1的上行比特率和LCH 2的上行比特率之和正好等于
Figure PCTCN2019123761-appb-000018
图11示出了本申请实施例的另一种上行资源的分配结果的示意图。在图11中，存在2个逻辑信道，分别为LCH 1和LCH 2，LCH 1和LCH 2对应一个网络切片i。网络切片i的最大上行比特率为
Figure PCTCN2019123761-appb-000019
LCH 1的优先级为1，LCH 2的优先级为2。假设数值越小表示优先级越高，则LCH 1的优先级最高，LCH 2次之。其中，LCH 1的待传输数据为DATA 1，LCH 1的优先比特率为PBR 1，LCH 2的待传输数据为DATA 2，LCH 2的优先比特率为PBR 2。
按照本申请实施例的方法，先执行第一轮分配，即终端设备优先为LCH 1分配上行资源，将SDU 1复用至PDU，使得LCH 1的上行比特率达到PBR 1的限制，由于网络切片i的累积上行比特率未超过
Figure PCTCN2019123761-appb-000020
终端设备接下来可以处理LCH 2。终端设备将SDU 2复用至PDU，使得LCH 2的上行比特率达到PBR 2的限制。此时，LCH 1和LCH 2均仍有数据待发送，且存在剩余的上行资源，该网络切片i的累积上行比特率小于
Figure PCTCN2019123761-appb-000021
终端设备可以继续执行第二轮分配。考虑到若将SDU 3复用至PDU之后，网络切片i的累积上行比特率大于
Figure PCTCN2019123761-appb-000022
因此终端设备可以对SDU 3进行分段处理，获得SDU 3′，将SDU 3′复用至PDU，使得网络切片i的累积上行比特率等于
Figure PCTCN2019123761-appb-000023
第二轮分配结束。
应理解，上述图11仅仅示出了一种理想的情况，即SDU 1(可以包括一个或多个SDU)复用到PDU之后，LCH 1的上行比特率正好等于PBR 1，SDU 2(可以包括一个或多个SDU)复用到PDU之后，LCH 1的上行比特率和LCH 2的上行比特率之和正好等于PBR 2。
上述方法700通过终端设备基于逻辑信道对应的网络切片的最大上行比特率，保障了一个网络切片对应的累积上行比特率小于或等于该网络切片的最大上行比特率，即终端设备需要基于网络切片的最大上行比特率，进行逻辑信道的第一轮资源分配和第二轮资源分配。这样，实现了终端设备对网络切片内的上行传输速率的控制，有利于避免终端设备进行上行数据传输时，网络切片内上行传输速率过载的问题，降低网络拥塞的风险。
本申请实施例的上述方法500和方法700可以应用于针对PDU会话的上行比特率的控制方案。示例性地，只需要将上述方法中的网络切片的最大上行比特率替换为PDU会 话的最大上行比特率即可，此处不再赘述。
应理解，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
以上，结合图5至图11详细说明了本申请实施例提供的上行数据传输的控制方法。以下，结合图12至图14详细说明本申请实施例提供的上行数据传输的控制装置。
图12是本申请实施例提供的上行数据传输的控制装置的示意性框图。如图12所示，该装置1200可以包括收发单元1210和处理单元1220。
在一种可能的设计中，该装置1200可对应于上文方法实施例中的终端设备，例如，可以为终端设备，或者配置于终端设备中的芯片。该装置1000用于执行上述方法实施例500中终端设备对应的各个步骤或流程。
具体地，该收发单元1210用于：接收来自网络设备的第一信息，该第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；该处理单元1220用于：基于最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
可选地，该处理单元1220具体用于：基于该至少一个逻辑信道的优先比特率和最大上行比特率，为该至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
可选地，该处理单元1220具体用于：基于该逻辑信道的优先比特率，为该至少一个逻辑信道分配上行资源；若存在剩余的上行资源、且该至少一个逻辑信道中的第一逻辑信道仍有数据待传输，基于该第一逻辑信道的最大上行比特率，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该第一逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者第一逻辑信道的上行比特率达到该第一逻辑信道的最大上行比特率。
可选地，该处理单元1220具体用于：若该第一逻辑信道中未被复用到协议数据单元PDU的第一服务数据单元SDU的上行比特率与该第一逻辑信道中已被复用到该PDU的第二SDU的上行比特率之和小于或等于该第一逻辑信道的最大上行比特率，将该第一SDU复用至该PDU。
可选地，该处理单元1220具体用于：若该第一逻辑信道中未被复用到PDU的第一SDU的上行比特率与该第一逻辑信道中已被复用到所述PDU的第二SDU的上行比特率之和大于该第一逻辑信道的最大上行比特率，对该第一SDU进行分段处理，获得第一子SDU，并将该第一子SDU复用到该PDU。
可选地，该第一逻辑信道包括至少两个逻辑信道，该处理单元1220具体用于：基于该至少两个逻辑信道的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该至少两个逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该至少两个逻辑信道的上行比特率达到该至少两个逻辑信道的最大上行比特率的限制。
可选地，该处理单元1220具体用于：若第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与该第二逻辑信道中已被复用到该PDU的第四SDU的上行比特率之和小于或等于该第二逻辑信道的最大上行比特率，将该第三SDU复用至该PDU，该第二逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道。
可选地，该处理单元1220具体用于：若第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与该第二逻辑信道中已被复用到该PDU的第四SDU的上行比特率之和大于 该第二逻辑信道的最大上行比特率，将对该第三SDU进行分段处理，获得第三子SDU，并将该第三子SDU复用到该PDU，该第二逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道。
在一种可能的设计中，该装置1200可对应于上文方法实施例中的网络设备，例如，可以为网络设备，或者配置于网络设备中的芯片。该装置1000用于执行上述方法实施例500中网络设备对应的各个步骤或流程。
该处理单元1220用于：确定第一信息，该第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；该收发单元1210用于：向终端设备发送第一信息。
可选地，该收发单元1210还用于：接收来自该终端设备的协议数据单元PDU，该PDU包括来自该至少一个逻辑信道中全部或部分逻辑信道的数据，该全部或部分逻辑信道的数据是基于该最大上行比特率被复用到该PDU的。
可选地，该处理单元1220用于：解析该PDU，获得全部或部分逻辑信道的数据。
可选地，该至少一个逻辑信道对应一个网络切片。
可选地，该至少一个逻辑信道对应一个PDU会话。
在一种可能的设计中，该装置1200可对应于上文方法实施例中的终端设备，例如，可以为终端设备，或者配置于终端设备中的芯片。该装置1000用于执行上述方法实施例700中终端设备对应的各个步骤或流程。
具体地，该处理单元1220用于：确定逻辑信道的优先比特率和网络切片的最大上行比特率，该逻辑信道对应该网络切片；该处理单元1220还用于：基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源。
可选地，该处理单元1220具体用于：终端设备基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该逻辑信道的上行比特率达到该逻辑信道的优先比特率的限制、或者该网络切片的上行比特率超过该网络切片的最大上行比特率、或者上行资源耗尽。
可选地，该逻辑信道包括至少两个逻辑信道，该处理单元1220具体用于：基于该至少两个逻辑信道的优先比特率和该网络切片的最大上行比特率，按照该至少两个逻辑信道的优先级递减顺序，为该至少两个逻辑信道分配上行资源，直到下列条件中的任一种满足为止：该至少两个逻辑信道的上行比特率均达到该至少两个逻辑信道的优先比特率的限制、或者该至少两个逻辑信道对应的网络切片的上行比特率达到该至少两个逻辑信道对应的网络切片的上行比特率的限制、或者上行资源耗尽。
可选地，该处理单元1220具体用于：在该至少两个逻辑信道中的第一逻辑信道对应的令牌数大于0的情况下，若将该至少两个逻辑信道中的第一逻辑信道的第一服务数据单元SDU复用至协议数据单元PDU之后，该第一逻辑信道对应的、该网络切片中的第一网络切片的累积上行比特率小于或等于该第一网络切片的最大上行比特率，将该第一SDU复用至该PDU，该第一逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道。
可选地，该处理单元1220具体用于：在该至少两个逻辑信道中的第一逻辑信道对应的令牌数大于0的情况下，若将该至少两个逻辑信道中的第一逻辑信道的第一SDU复用至PDU之后，该第一逻辑信道对应的、该网络切片中的第一网络切片的累积上行比特率大于该第一网络切片的最大上行比特率，且该至少两个逻辑信道中的第二逻辑信道对应的 令牌数大于0，将该至少两个逻辑信道中的第二逻辑信道的第二SDU复用至该PDU之后，该第二逻辑信道对应的、该网络切片中的第二网络切片的累积上行比特率小于或等于该第二网络切片的最大上行比特率，将该第二SDU复用至该PDU，该第一逻辑信道为该至少两个逻辑信道中优先级最高的逻辑信道，该第二逻辑信道为该至少两个逻辑信道中该第一逻辑信道的下一优先级的逻辑信道。
可选地，该第一网络切片的累积上行比特率是基于该第一网络切片的滑动时间窗口的长度和该第一网络切片在该滑动时间窗口中的累积数据量确定的，该第一网络切片在该滑动时间窗口中的累积数据量为从当前时刻起向前的第一时间段内，该第一网络切片的所有逻辑信道传输的数据量之和，该第一时间段的长度为该滑动时间窗口的长度。
可选地，该装置还包括：收发单元1210，用于接收网络设备发送的第二信息，该第二信息用于指示该第一网络切片的滑动时间窗口的长度。
可选地，该处理单元1220具体用于：在基于该逻辑信道的优先比特率和该网络切片的最大上行比特率，为该逻辑信道分配上行资源之后，若存在剩余的上行资源、且该逻辑信道中的第三逻辑信道仍有数据待传输，基于该第三逻辑信道对应的网络切片的最大上行比特率，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该第三逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该第三逻辑信道对应的网络切片的累积上行比特率达到该第三逻辑信道对应的网络切片的最大上限比特率的限制。
可选地，该处理单元1220具体用于：若将该第三逻辑信道中未被复用到PDU的第三SDU复用至该PDU之后，该第三逻辑信道对应的、该网络切片中的第三网络切片的累积上行比特率小于或等于该第三网络切片的最大上行比特率，将该第三SDU复用至该PDU；或，若将该第三SDU复用至该PDU之后，该第三网络切片的累积上行比特率大于该第三网络切片的最大上行比特率，对该第三SDU进行分段处理，获得第三子SDU，并将该第三子SDU复用到该PDU。
可选地，该第三逻辑信道包括至少两个逻辑信道，该处理单元1220具体用于：基于该第三逻辑信道对应的网络切片的最大上行比特率，按照该第三逻辑信道的优先级递减顺序，分配该剩余的上行资源，直到下列条件中的任一种满足为止：该第三逻辑信道没有数据待传输、或者该剩余的上行资源耗尽、或者该第三逻辑信道对应的网络切片的累积上行比特率达到该第三逻辑信道对应的网络切片的最大上限比特率的限制。
可选地，该处理单元1220具体用于：若将第四逻辑信道中未被复用到PDU的第四SDU复用至该PDU之后，该第四逻辑信道对应的第四网络切片的累积上行比特率小于或等于该第四网络切片的最大上行比特率，将该第四SDU复用至该PDU，该第四逻辑信道为该第三逻辑信道中优先级最高的逻辑信道。
可选地，该处理单元1220具体用于：若将第四逻辑信道中未被复用到PDU的第四SDU复用至该PDU之后，该第四逻辑信道对应的第四网络切片的累积上行比特率大于该第四网络切片的最大上行比特率，对该第四SDU进行分段处理，获得第四子SDU，并将该第四子SDU复用到该PDU，该第四逻辑信道为该第三逻辑信道中优先级最高的逻辑信道。
在一种可能的设计中，该装置1200可对应于上文方法实施例中的网络设备，例如，可以为网络设备，或者配置于网络设备中的芯片。该装置1200用于执行上述方法实施例 700中网络设备对应的各个步骤或流程。
该收发单元1210用于：接收来自终端设备的协议数据单元PDU，该PDU包括来自逻辑信道的数据，该逻辑信道对应网络切片，该逻辑信道的数据是基于该逻辑信道的优先比特率和该网络切片的最大上行比特率被复用到该PDU的；该处理单元1220用于：解析该PDU，获得该逻辑信道的数据。
可选地，该处理单元1220还用于：在该网络设备接收来自终端设备的协议数据单元PDU之前，确定该网络切片的滑动时间窗口的长度；该收发单元1210还用于：向该终端设备发送第二信息，该第二信息用于指示该网络切片的滑动时间窗口的长度。
可选地，该第二信息包括该网络切片的标识和该网络切片的滑动时间窗口的长度，该网络切片的滑动时间窗口的长度与该网络切片的标识对应。
可选地，该处理单元1220具体用于：基于该网络切片的类型，确定该网络切片的滑动时间窗口的长度。
应理解，这里的装置1200以功能单元的形式体现。这里的术语“单元”可以指应用特有集成电路(application specific integrated circuit，ASIC)、电子电路、用于执行一个或多个软件或固件程序的处理器(例如共享处理器、专有处理器或组处理器等)和存储器、合并逻辑电路和/或其它支持所描述的功能的合适组件。在一个可选例子中，本领域技术人员可以理解，装置1200可以具体为上述实施例中的终端设备，可以用于执行上述方法实施例中与终端设备对应的各个流程和/或步骤，或者，装置1200可以具体为上述实施例中的网络设备，可以用于执行上述方法实施例中与网络设备对应的各个流程和/或步骤，为避免重复，在此不再赘述。
上述各个方案的装置1200具有实现上述方法中终端设备所执行的相应步骤的功能，或者，上述各个方案的装置1200具有实现上述方法中网络设备所执行的相应步骤的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块；例如通信单元可以由收发机替代(例如，通信单元中的发送单元可以由发送机替代，通信单元中的接收单元可以由接收机替代)，其它单元，如处理单元等可以由处理器替代，分别执行各个方法实施例中的收发操作以及相关的处理操作。
此外，上述通信单元还可以是收发电路(例如可以包括接收电路和发送电路)，处理单元可以是处理电路。在本申请的实施例，图12中的装置可以是前述实施例中的终端设备或网络设备，也可以是芯片或者芯片系统，例如：片上系统(system on chip，SoC)。其中，通信单元可以是输入输出电路、通信接口；处理单元为该芯片上集成的处理器或者微处理器或者集成电路。在此不做限定。
图13示出了本申请实施例提供的上行数据传输的控制装置1300。该装置1300包括处理器1310和收发器1320。其中，处理器1310和收发器1320通过内部连接通路互相通信，该处理器1310用于执行指令，以控制该收发器1320发送信号和/或接收信号。
可选地，该装置1300还可以包括存储器1330，该存储器1330与处理器1310、收发器1320通过内部连接通路互相通信。该存储器1330用于存储指令，该处理器1310可以执行该存储器1330中存储的指令。在一种可能的实现方式中，装置1300用于实现上述方法实施例中的发送端对应的各个流程和步骤。在另一种可能的实现方式中，装置1300用 于实现上述方法实施例中的接收端对应的各个流程和步骤。
应理解，装置1300可以具体为上述实施例中的终端设备或网络设备，也可以是芯片或者芯片系统。对应的，该收发器1320可以是该芯片的收发电路，在此不做限定。具体地，该装置1300可以用于执行上述方法实施例中与终端设备或网络设备对应的各个步骤和/或流程。可选地，该存储器1330可以包括只读存储器和随机存取存储器，并向处理器提供指令和数据。存储器的一部分还可以包括非易失性随机存取存储器。例如，存储器还可以存储设备类型的信息。该处理器1310可以用于执行存储器中存储的指令，并且当该处理器1310执行存储器中存储的指令时，该处理器1310用于执行上述与终端设备或网络设备对应的方法实施例的各个步骤和/或流程。
图14是本申请实施例提供的终端设备1400的示意性结构图。该终端设备1400可应用于如图1所示的系统中，执行上述方法实施例中终端设备的功能。如图所示，该终端设备1400包括处理器1410和收发器1420。可选地，该终端设备1400还包括存储器1430。其中，处理器1410、收发器1420和存储器1430之间可以通过内部连接通路互相通信，传递控制和/或数据信号，该存储器1430用于存储计算机程序，该处理器1410用于从该存储器1430中调用并运行该计算机程序，以控制该收发器1420收发信号。可选地，终端设备1400还可以包括天线1440，用于将收发器1420输出的上行数据或上行控制信令通过无线信号发送出去。
上述处理器1410可以和存储器1430可以合成一个处理装置，处理器1410用于执行存储器1430中存储的程序代码来实现上述功能。具体实现时，该存储器1430也可以集成在处理器1410中，或者独立于处理器1410。该处理器1410可以与图11中的处理单元对应。
上述收发器1420可以与图12中的收发单元对应，也可以称为收发单元。收发器1420可以包括接收器(或称接收机、接收电路)和发射器(或称发射机、发射电路)。其中，接收器用于接收信号，发射器用于发射信号。
应理解，图14所示的终端设备1400能够实现上述方法实施例中涉及终端设备的各个过程。终端设备1400中的各个模块的操作和/或功能，分别为了实现上述方法实施例中的相应流程。具体可参见上述方法实施例中的描述，为避免重复，此处适当省略详细描述。
上述处理器1410可以用于执行前面方法实施例中描述的由终端设备内部实现的动作，而收发器1420可以用于执行前面方法实施例中描述的终端设备向网络设备发送或从网络设备接收的动作。具体请见前面方法实施例中的描述，此处不再赘述。
可选地，上述终端设备1400还可以包括电源1450，用于给终端设备中的各种器件或电路提供电源。
除此之外，为了使得终端设备的功能更加完善，该终端设备1400还可以包括输入单元1460、显示单元1470、音频电路1480、摄像头1490和传感器1411等中的一个或多个，所述音频电路还可以包括扬声器1482、麦克风1484等。
本申请实施例还提供了一种处理装置，包括处理器和接口；所述处理器用于执行上述任一方法实施例中的方法。
应理解，上述处理装置可以是一个芯片。例如，该处理装置可以是现场可编程门阵列(field programmable gate array，FPGA)，可以是专用集成芯片(application specific integrated  circuit，ASIC)，还可以是系统芯片(system on chip，SoC)，还可以是中央处理器(central processor unit，CPU)，还可以是网络处理器(network processor，NP)，还可以是数字信号处理电路(digital signal processor，DSP)，还可以是微控制器(micro controller unit，MCU)，还可以是可编程控制器(programmable logic device，PLD)或其他集成芯片。
在实现过程中，上述方法的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。为避免重复，这里不再详细描述。
应注意，本申请实施例中的处理器可以是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现场可编程门阵列(FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
可以理解，本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
根据本申请实施例提供的方法，本申请还提供一种计算机程序产品，该计算机程序产品包括：计算机程序代码，当该计算机程序代码在计算机上运行时，使得该计算机执行图5至图11所示的实施例中终端设备或网络设备所执行的各个步骤或流程。
根据本申请实施例提供的方法，本申请还提供一种计算机可读存储介质，该计算机可读存储介质存储有程序代码，当该程序代码在计算机上运行时，使得该计算机执行图5至图11所示的实施例中终端设备或网络设备所执行的各个步骤或流程。
根据本申请实施例提供的方法，本申请还提供一种通信系统，其包括前述的一个或多个终端设备以及一个或多个网络设备。
上述各个装置实施例中网络设备与终端设备和方法实施例中的网络设备或终端设备完全对应，由相应的模块或单元执行相应的步骤，例如通信单元(收发器)执行方法实施例中接收或发送的步骤，除发送、接收外的其它步骤可以由处理单元(处理器)执行。具体单元的功能可以基于相应的方法实施例。其中，处理器可以为一个或多个。
在本说明书中使用的术语“部件”、“模块”、“系统”等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序和/或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程和/或执行线程中，部件可位于一个计算机上和/或分布在两个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读存储介质执行。部件可例如根据具有一个或多个数据分组(例如来自与本地系统、分布式系统和/或网络间的另一部件交互的二个部件的数据，例如通过信号与其它系统交互的互联网)的信号通过本地和/或远程进程来通信。
应理解，本文中的“至少一个”是指一个或者多个，“多个”是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B的情况，其中A，B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。“以下至少一项(个)”或其类似表达，是指的这些项中的任意组合，包括单项(个)或复数项(个)的任意组合。例如，a、b和c中的至少一项(个)，可以表示：a，或b，或c，或a和b，或a和c，或b和c，或a、b和c，其中a，b，c可以是单个，也可以是多个。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各种说明性逻辑块(illustrative logical block)和步骤(step)，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以基于前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各 个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
在上述实施例中，各功能单元的功能可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令(程序)。在计算机上加载和执行所述计算机程序指令(程序)时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，(例如，软盘、硬盘、磁带)、光介质(例如，DVD)、或者半导体介质(例如固态硬盘(solid state disk，SSD))等。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (31)

  1. 一种上行数据传输的控制方法，其特征在于，包括：
    终端设备接收来自网络设备的第一信息，所述第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；
    所述终端设备基于所述最大上行比特率，为所述至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
  2. 根据权利要求1所述的方法，其特征在于，所述终端设备基于所述最大上行比特率，为所述至少一个逻辑信道中的全部或部分逻辑信道分配上行资源，包括：
    所述终端设备基于所述至少一个逻辑信道的优先比特率和所述最大上行比特率，为所述至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
  3. 根据权利要求2所述的方法，其特征在于，所述终端设备基于所述至少一个逻辑信道的优先比特率和所述最大上行比特率，为所述至少一个逻辑信道中的全部或部分逻辑信道分配上行资源，包括：
    所述终端设备基于所述优先比特率，为所述至少一个逻辑信道分配上行资源；
    若存在剩余的上行资源、且所述至少一个逻辑信道中的第一逻辑信道仍有数据待传输，所述终端设备基于所述第一逻辑信道的最大上行比特率，分配所述剩余的上行资源，直到下列条件中的任一种满足为止：
    所述第一逻辑信道没有数据待传输、或者所述剩余的上行资源耗尽、或者所述第一逻辑信道的上行比特率达到所述第一逻辑信道的最大上行比特率的限制。
  4. 根据权利要求3所述的方法，其特征在于，所述终端设备基于所述第一逻辑信道的最大上行比特率，分配所述剩余的上行资源，包括：
    若所述第一逻辑信道中未被复用到协议数据单元PDU的第一服务数据单元SDU的上行比特率与所述第一逻辑信道中已被复用到所述PDU的第二SDU的上行比特率之和小于或等于所述第一逻辑信道的最大上行比特率，所述终端设备将所述第一SDU复用至所述PDU。
  5. 根据权利要求3所述的方法，其特征在于，所述终端设备基于所述逻辑信道的优先比特率和所述第一逻辑信道的最大上行比特率，分配所述剩余的上行资源，包括：
    若所述第一逻辑信道中未被复用到PDU的第一SDU的上行比特率与所述第一逻辑信道中已被复用到所述PDU的第二SDU的上行比特率之和大于所述第一逻辑信道的最大上行比特率，所述终端设备对所述第一SDU进行分段处理，获得第一子SDU，并将所述第一子SDU复用到所述PDU。
  6. 根据权利要求3所述的方法，其特征在于，所述第一逻辑信道包括至少两个逻辑信道，所述终端设备基于所述第一逻辑信道的最大上行比特率，分配所述剩余的上行资源，包括：
    所述终端设备基于所述至少两个逻辑信道的最大上行比特率，按照所述至少两个逻辑信道的优先级递减顺序，分配所述剩余的上行资源，直到下列条件中的任一种满足为止：
    所述至少两个逻辑信道没有数据待传输、或者所述剩余的上行资源耗尽、或者所述至 少两个逻辑信道的上行比特率均达到所述至少两个逻辑信道的最大上行比特率的限制。
  7. 根据权利要求6所述的方法，其特征在于，所述终端设备基于所述至少两个逻辑信道的最大上行比特率，按照所述至少两个逻辑信道的优先级递减顺序，分配所述剩余的上行资源，包括：
    若第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与所述第二逻辑信道中已被复用到所述PDU的第四SDU的上行比特率之和小于或等于所述第二逻辑信道的最大上行比特率，所述终端设备将所述第三SDU复用至所述PDU，所述第二逻辑信道为所述至少两个逻辑信道中优先级最高的逻辑信道。
  8. 根据权利要求6所述的方法，其特征在于，所述终端设备基于所述至少两个逻辑信道的最大上行比特率，按照所述至少两个逻辑信道的优先级递减顺序，分配所述剩余的上行资源，包括：
    若第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与所述第二逻辑信道中已被复用到所述PDU的第四SDU的上行比特率之和大于所述第二逻辑信道的最大上行比特率，所述终端设备对所述第三SDU进行分段处理，获得第三子SDU，并将所述第三子SDU复用到所述PDU，所述第二逻辑信道为所述至少两个逻辑信道中优先级最高的逻辑信道。
  9. 根据权利要求1至8中任一项所述的方法，其特征在于，所述至少一个逻辑信道对应一个网络切片。
  10. 根据权利要求1至9中任一项所述的方法，其特征在于，所述至少一个逻辑信道对应一个PDU会话。
  11. 一种上行数据传输的控制方法，其特征在于，包括：
    网络设备确定第一信息，所述第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；
    所述网络设备向终端设备发送所述第一信息。
  12. 根据权利要求11所述的方法，其特征在于，在所述网络设备向终端设备发送所述第一信息之后，所述方法还包括：
    所述网络设备接收来自所述终端设备的协议数据单元PDU，所述PDU包括来自所述至少一个逻辑信道中全部或部分逻辑信道的数据，所述全部或部分逻辑信道的数据是基于所述最大上行比特率被复用到所述PDU的。
  13. 根据权利要求11或12所述的方法，其特征在于，所述至少一个逻辑信道对应一个网络切片。
  14. 根据权利要求11或12所述的方法，其特征在于，所述至少一个逻辑信道对应一个PDU会话。
  15. 一种上行数据传输的控制装置，其特征在于，包括：
    收发单元，用于接收来自网络设备的第一信息，所述第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；
    处理单元，用于基于所述最大上行比特率，为所述至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
  16. 根据权利要求15所述的装置，其特征在于，所述处理单元具体用于：
    基于所述至少一个逻辑信道的优先比特率和所述最大上行比特率，为所述至少一个逻辑信道中的全部或部分逻辑信道分配上行资源。
  17. 根据权利要求16所述的装置，其特征在于，所述处理单元具体用于：
    基于所述优先比特率，为所述至少一个逻辑信道分配上行资源；
    若存在剩余的上行资源、且所述至少一个逻辑信道中的第一逻辑信道仍有数据待传输，基于所述第一逻辑信道的最大上行比特率，分配所述剩余的上行资源，直到下列条件中的任一种满足为止：
    所述第一逻辑信道没有数据待传输、或者所述剩余的上行资源耗尽、或者所述第一逻辑信道的上行比特率达到所述第一逻辑信道的最大上行比特率的限制。
  18. 根据权利要求17所述的装置，其特征在于，所述处理单元具体用于：
    若所述第一逻辑信道中未被复用到协议数据单元PDU的第一服务数据单元SDU的上行比特率与所述第一逻辑信道中已被复用到所述PDU的第二SDU的上行比特率之和小于或等于所述第一逻辑信道的最大上行比特率，将所述第一SDU复用至所述PDU。
  19. 根据权利要求17所述的装置，其特征在于，所述处理单元具体用于：
    若所述第一逻辑信道中未被复用到PDU的第一SDU的上行比特率与所述第一逻辑信道中已被复用到所述PDU的第二SDU的上行比特率之和大于所述第一逻辑信道的最大上行比特率，对所述第一SDU进行分段处理，获得第一子SDU，并将所述第一子SDU复用到所述PDU。
  20. 根据权利要求17所述的装置，其特征在于，所述第一逻辑信道包括至少两个逻辑信道，所述处理单元具体用于：
    基于所述至少两个逻辑信道的最大上行比特率，按照所述至少两个逻辑信道的优先级递减顺序，分配所述剩余的上行资源，直到下列条件中的任一种满足为止：
    所述至少两个逻辑信道没有数据待传输、或者所述剩余的上行资源耗尽、或者所述至少两个逻辑信道的上行比特率均达到所述至少两个逻辑信道的最大上行比特率的限制。
  21. 根据权利要求20所述的装置，其特征在于，所述处理单元具体用于：
    若第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与所述第二逻辑信道中已被复用到所述PDU的第四SDU的上行比特率之和小于或等于所述第二逻辑信道的最大上行比特率，将所述第三SDU复用至所述PDU，所述第二逻辑信道为所述至少两个逻辑信道中优先级最高的逻辑信道。
  22. 根据权利要求20所述的装置，其特征在于，所述处理单元具体用于：
    若第二逻辑信道中未被复用到PDU的第三SDU的上行比特率与所述第二逻辑信道中已被复用到所述PDU的第四SDU的上行比特率之和大于所述第二逻辑信道的最大上行比特率，对所述第三SDU进行分段处理，获得第三子SDU，并将所述第三子SDU复用到所述PDU，所述第二逻辑信道为所述至少两个逻辑信道中优先级最高的逻辑信道。
  23. 根据权利要求15至22中任一项所述的装置，其特征在于，所述至少一个逻辑信道对应一个网络切片。
  24. 根据权利要求15至22中任一项所述的装置，其特征在于，所述至少一个逻辑信道对应一个PDU会话。
  25. 一种上行数据传输的控制装置，其特征在于，包括：
    处理单元，用于确定第一信息，所述第一信息用于指示至少一个逻辑信道中每个逻辑信道的最大上行比特率；
    收发单元，用于向终端设备发送所述第一信息。
  26. 根据权利要求25所述的装置，其特征在于，所述收发单元还用于：
    接收来自所述终端设备的协议数据单元PDU，所述PDU包括来自所述至少一个逻辑信道中全部或部分逻辑信道的数据，所述全部或部分逻辑信道的数据是基于所述最大上行比特率被复用到所述PDU的。
  27. 根据权利要求25或26所述的装置，其特征在于，所述至少一个逻辑信道对应一个网络切片。
  28. 根据权利要求25或26所述的装置，其特征在于，所述至少一个逻辑信道对应一个PDU会话。
  29. 一种上行数据传输的控制装置，其特征在于，包括：处理器，所述处理器与存储器耦合，所述存储器用于存储程序或指令，当所述程序或指令被所述处理器执行时，使得所述无线定位装置执行权利要求1-14中任一项所述的方法。
  30. 一种计算机可读存储介质，用于存储计算机程序，其特征在于，所述计算机程序包括用于实现权利要求1-14中任一项所述的方法的指令。
  31. 一种芯片，其特征在于，包括：处理器，用于读取存储器中存储的指令，当所述处理器执行所述指令时，使得所述芯片实现上述权利要求1-14中任一项所述的方法。
PCT/CN2019/123761 2019-12-06 2019-12-06 上行数据传输的控制方法和装置 WO2021109143A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
CN201980101987.7A CN114642051A (zh) 2019-12-06 2019-12-06 上行数据传输的控制方法和装置
EP19954790.2A EP4057735A4 (en) 2019-12-06 2019-12-06 UPLINK COMMUNICATION CONTROL METHOD AND APPARATUS
PCT/CN2019/123761 WO2021109143A1 (zh) 2019-12-06 2019-12-06 上行数据传输的控制方法和装置
US17/832,294 US20220295334A1 (en) 2019-12-06 2022-06-03 Uplink data transmission control method and apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/123761 WO2021109143A1 (zh) 2019-12-06 2019-12-06 上行数据传输的控制方法和装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/832,294 Continuation US20220295334A1 (en) 2019-12-06 2022-06-03 Uplink data transmission control method and apparatus

Publications (1)

Publication Number Publication Date
WO2021109143A1 true WO2021109143A1 (zh) 2021-06-10

Family

ID=76222093

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/123761 WO2021109143A1 (zh) 2019-12-06 2019-12-06 上行数据传输的控制方法和装置

Country Status (4)

Country Link
US (1) US20220295334A1 (zh)
EP (1) EP4057735A4 (zh)
CN (1) CN114642051A (zh)
WO (1) WO2021109143A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
BR112022011462A2 (pt) * 2019-12-13 2022-08-23 Beijing Xiaomi Mobile Software Co Ltd Método para processar dados, equipamento de usuário, e, meio de armazenamento de memória
CN117835438A (zh) * 2022-09-29 2024-04-05 华为技术有限公司 数据传输方法和相关产品
CN117998649A (zh) * 2022-11-04 2024-05-07 华为技术有限公司 一种通信方法及相关设备
WO2024187455A1 (en) * 2023-03-16 2024-09-19 Nokia Shanghai Bell Co., Ltd. Prioritized bit rate based slicing control

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101459964A (zh) * 2007-12-13 2009-06-17 华硕电脑股份有限公司 无线资源分配的方法及其相关通讯装置
CN101902817A (zh) * 2009-05-26 2010-12-01 中兴通讯股份有限公司 无线通信系统中上行无线资源调度方法与装置
CN101933361A (zh) * 2008-02-01 2010-12-29 交互数字专利控股公司 用于初始化、保持以及重配置令牌桶的方法和设备
US20120002541A1 (en) * 2010-07-01 2012-01-05 Verizon Patent And Licensing Inc. Flow-based proactive connection admission control (cac) in wireless networks

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
PL2670204T3 (pl) * 2008-02-01 2017-07-31 Interdigital Patent Holdings, Inc. Sposób i urządzenie do priorytetyzowania kanałów logicznych
CN102036390B (zh) * 2009-09-30 2014-12-10 中兴通讯股份有限公司 一种优先级处理方法
CN107295561B (zh) * 2016-04-01 2022-06-21 中兴通讯股份有限公司 资源的申请方法及装置
US10383165B2 (en) * 2016-06-03 2019-08-13 Ofinno, Llc Uplink resource allocation in a wireless device and wireless network
EP3530053A1 (en) * 2016-10-19 2019-08-28 Convida Wireless, LLC Apparatus

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101459964A (zh) * 2007-12-13 2009-06-17 华硕电脑股份有限公司 无线资源分配的方法及其相关通讯装置
CN101933361A (zh) * 2008-02-01 2010-12-29 交互数字专利控股公司 用于初始化、保持以及重配置令牌桶的方法和设备
CN101902817A (zh) * 2009-05-26 2010-12-01 中兴通讯股份有限公司 无线通信系统中上行无线资源调度方法与装置
US20120002541A1 (en) * 2010-07-01 2012-01-05 Verizon Patent And Licensing Inc. Flow-based proactive connection admission control (cac) in wireless networks

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
QUALCOMM INCORPORATED, ORANGE: "UE Handling of MBR Greater than GBR", 3GPP DRAFT; R2-104573, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG2, no. Madrid, Spain; 20100823, 16 August 2010 (2010-08-16), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, XP050451736 *
See also references of EP4057735A4 *

Also Published As

Publication number Publication date
CN114642051A (zh) 2022-06-17
EP4057735A1 (en) 2022-09-14
US20220295334A1 (en) 2022-09-15
EP4057735A4 (en) 2022-11-16

Similar Documents

Publication Publication Date Title
WO2021109143A1 (zh) 上行数据传输的控制方法和装置
CN111866796B (zh) 用于获取无线承载配置的方法和装置
CN110474854B (zh) 资源分配的方法和装置
CN113329431B (zh) 一种无线承载的配置方法、终端、存储介质及芯片
CN108464048A (zh) 数据传输的方法、终端及基站
CN111417215B (zh) 一种无线承载的配置方法、终端及通信装置
US20200280621A1 (en) Media access control protocol data unit processing method and apparatus
CN112584342B (zh) 通信方法和通信装置
EP3972361B1 (en) Wireless communication method and terminal device
CN113573355A (zh) 通信方法和装置
EP4175356A1 (en) Wireless communication method, terminal device, and network device
WO2019191987A1 (zh) 传输上行数据的方法、终端设备和网络设备
WO2021258766A1 (zh) 一种配置终端设备的方法及设备
CN113455100B (zh) 用于中继通信的方法和装置
CN116762452A (zh) 缓存状态上报的方法、缓存状态上报的配置方法及装置
CN116406020B (zh) 数据传输方法和装置
WO2024051530A1 (zh) 通信方法和通信装置
WO2024140600A1 (zh) 通信方法、通信装置及通信系统
WO2023065155A1 (zh) 无线通信的方法、终端设备、接入网设备和核心网设备
WO2024140241A1 (zh) 数据传输方法和装置
WO2022061829A1 (zh) 无线通信方法和设备
WO2023040881A1 (zh) 一种信息处理方法、装置、终端设备及网络设备
WO2022267632A1 (zh) 会话管理的方法及装置
US20230217426A1 (en) Resource allocation method and apparatus and system
WO2023184553A1 (zh) 无线通信的方法、网络设备和终端设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19954790

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019954790

Country of ref document: EP

Effective date: 20220610

NENP Non-entry into the national phase

Ref country code: DE