CN110636555B - Data scheduling method and device - Google Patents

Data scheduling method and device Download PDF

Info

Publication number
CN110636555B
CN110636555B CN201810646900.1A CN201810646900A CN110636555B CN 110636555 B CN110636555 B CN 110636555B CN 201810646900 A CN201810646900 A CN 201810646900A CN 110636555 B CN110636555 B CN 110636555B
Authority
CN
China
Prior art keywords
lch
iab
data
lchs
buffer
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201810646900.1A
Other languages
Chinese (zh)
Other versions
CN110636555A (en
Inventor
李铕
袁世通
朱元萍
戴明增
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201810646900.1A priority Critical patent/CN110636555B/en
Priority to PCT/CN2019/091692 priority patent/WO2019242603A1/en
Publication of CN110636555A publication Critical patent/CN110636555A/en
Application granted granted Critical
Publication of CN110636555B publication Critical patent/CN110636555B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/215—Flow control; Congestion control using token-bucket
    • 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/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • 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/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • 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
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information

Abstract

The embodiment of the invention discloses a data scheduling method, an IAB node and a readable storage medium, wherein the method is applied to the IAB node, an adaptation layer of the IAB node is deployed on an RLC layer, and the method comprises the following steps: receiving data of M LCHs from N UEs, wherein the data is cached in an adaptation layer, and N and M are integers which are larger than or equal to 1; sending all data or partial data of each LCH in M LCHs of N UEs to a buffer of an IAB LCH, wherein the buffer belongs to an RLC layer; and scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH. The embodiment of the invention can realize the scheduling of data of a plurality of UE.

Description

Data scheduling method and device
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a method and a device for data scheduling.
Background
Fifth generation mobile communications (5G) put more stringent requirements on network performance metrics, such as: capacity index is improved by 1000 times, wider coverage requirement is achieved, and the like. In order to meet the requirement of 5G ultrahigh capacity, high-frequency small stations are used for networking in a hot spot area. However, due to the problems of poor propagation characteristics of high-frequency carriers, severe shielding and attenuation, and narrow coverage, a large number of densely deployed small stations are required, so that a large number of optical fibers are required for backhaul, and the difficulty of optical fiber deployment is high. In addition, in order to meet the requirement of 5G wide coverage, network coverage needs to be provided in some remote areas, and the deployment of optical fibers is difficult. Therefore, in order to solve the above problems, an Integrated Access and Backhaul (IAB) technology in which both an Access Link (Access Link) and a Backhaul Link (Backhaul Link) adopt wireless transmission is introduced in the industry. In the IAB technique, a UE accesses an IAB node through a radio access link, and the IAB node is connected to a base station through a radio backhaul link.
In 5G New Radio (New Radio) uplink scheduling, after receiving an uplink grant from a base station, a User Equipment (UE), performs data scheduling based on a priority of a Logical Channel (LCH) of the UE. However, when the uplink scheduling of the 5G NR is applied to the IAB technology, since one IAB node may be connected with a plurality of UEs, and the uplink scheduling in the 5G NR is based on one UE for scheduling, how to implement scheduling of data of a plurality of UEs becomes an urgent technical problem to be solved.
Disclosure of Invention
The embodiment of the invention discloses a method and a device for scheduling data, which are used for realizing the scheduling of data of a plurality of UE.
A first aspect discloses a method for data scheduling, which is applied to an IAB node, an adaptation layer of the IAB node is deployed on a Radio Link Control (RLC) layer, receives data of M LCHs from N UEs, the data is buffered in the adaptation layer, sends all or part of the data of each LCH of the M LCHs of the N UEs to a buffer of the IAB LCH, the buffer belongs to the RLC layer, and schedules the data in the buffer of the IAB LCH according to a priority of the IAB LCH. Wherein N and M are integers greater than or equal to 1. After receiving data of N UEs, all or part of the data is sent to a buffer of the IAB LCH, and then scheduling is performed uniformly based on the priority of the IAB LCH, so that the data of multiple UEs can be scheduled, and the Quality of Service (QoS) requirement of the LCH of each UE can be guaranteed.
In one embodiment, all or a portion of the data for each of the M LCHs for the N UEs may be sent to a buffer of the IAB LCH for each unit time interval. The unit time interval may be an uplink scheduling time interval, or a time interval configured by the base station or the parent node, or a maximum value, a minimum value, or an average value in a cycle (BSD) of M LCH token buckets of N UEs, or a time interval determined according to the uplink scheduling time interval. The size of the partial data or the entire data of each LCH of the M LCHs of the N UEs may be smaller than or equal to the product of the unit time interval and a preset Prioritized Bit Rate (PBR), or smaller than or equal to the product of the unit time interval and the PBR of the LCH. In the technical scheme, the data in the LCH of the UE is sent to the buffer of the IAB LCH in the unit time interval, so that fair scheduling of the data can be realized, and the data of each LCH is guaranteed to be scheduled according to the appointed rate.
In an embodiment, when all data or part of data of each LCH of the M LCHs of the N UEs is sent to the buffer of the IAB LCH, all data or part of data of each LCH of the M LCHs of the N UEs may be sent to the buffer of the IAB LCH according to a configuration order, a priority, or an equivalent priority of each LCH of the M LCHs of the N UEs. In the above technical solution, the data in the LCH of the UE is sent to the buffer of the IAB LCH, so that the convergence of LCH data of a plurality of UEs can be achieved, and the scheduling of the buffer data in the IAB LCH is simplified.
In an embodiment, when all data or part of data of each LCH of the M LCHs of the N UEs is sent to the buffer of the IAB LCH, a mapping relationship between each LCH of the M LCHs of the N UEs and the IAB LCH may be determined according to the configuration information, and then all data or part of data of each LCH of the M LCHs of the N UEs is sent to the corresponding buffer of the IAB LCH according to the mapping relationship. In the above technical solution, the data in the buffer of the IAB LCH is scheduled through the determined mapping relationship, so that the scheduling priority and PBR of the LCH of the UE can be guaranteed, and the QoS scheduling requirement of the LCH of each UE can be satisfied.
In an embodiment, the IAB node may report the size of the buffered data in the buffer in the IAB node, so that the base station allocates the uplink scheduling resource to the IAB node according to the size of the buffered data. The buffer may include a buffer of the RLC layer, and may also include buffers of the RLC layer and the adaptation layer. In the above technical solution, the upper node of the IAB node can perform resource scheduling according to the data in the buffer of the IAB node through reporting, thereby satisfying the QoS quality assurance of the UE.
In an embodiment, the IAB node may obtain a mapping relationship between the LCH of the UE and the IAB LCH and Logical Channel Priority (LCP) parameters of M LCHs of the N UEs, and generate the LCP parameters of the IAB LCH according to the mapping relationship, the LCP parameters of the M LCHs of the N UEs, and a generation criterion, so that when scheduling data in the buffer of the IAB LCH according to the priority of the IAB LCH, scheduling may be performed according to the LCP parameters of the IAB LCH. The generation criteria may include: the PBR of the IAB LCH may be the sum of the PBRs of the LCHs of the UEs corresponding to the IAB LCH, or may be the product of the minimum value in the PBRs of the LCHs of the UEs corresponding to the IAB LCH and the number of the LCHs of the UEs corresponding to the IAB LCH, or may be the product of the maximum value in the PBRs of the LCHs of the UEs corresponding to the IAB LCH and the number of the LCHs of the UEs corresponding to the IAB LCH; the BSD of the IAB LCH may be a minimum value, a maximum value, or an average value of the BSDs of the LCHs of the UEs corresponding to the IAB LCH, or may be a ratio of a sum of products of the PBR and the BSD of the LCH of the UE corresponding to the IAB LCH to the PBR of the IAB LCH. In the above technical solution, the LCP parameters of the IAB LCH are generated by the criterion, which can ensure that the data of each LCH is scheduled, and can ensure the rate requirement, thereby implementing the fair scheduling of the LCHs of each UE.
In one embodiment, generating the criteria may further include: the priority of the IAB LCH may be the minimum value, the maximum value, or the average value of the priorities of the LCHs of the UEs corresponding to the IAB LCH.
A second aspect discloses a method for scheduling data, which is applied to an IAB node, an adaptation layer of the IAB node is deployed on a Medium Access Control (MAC) layer, the IAB node receives data of M LCHs from N UEs, the data is cached in an RLC layer, equivalent priorities of the M LCHs of the N UEs are determined according to priorities of the M LCHs of the N UEs, and the data of the M LCHs of the N UEs are scheduled according to the equivalent priorities. Wherein N and M are integers greater than or equal to 1. After receiving the data of the M LCHs of the N UEs, determining the equivalent priorities of the M LCHs of the N UEs first, and then scheduling the data of the plurality of UEs based on the equivalent priorities of the M LCHs of the N UEs, so as to ensure the QoS requirement of the LCH of each UE.
In one embodiment, the equivalent priorities of the M LCHs of the N UEs may be determined according to a mapping relationship between the priorities of the LCHs of the UEs and the equivalent priorities. In the above technical solution, scheduling based on the equivalent priority can be achieved through a mapping relationship between the LCH of the UE and the equivalent priority.
In one embodiment, the product of the priority of each of the M LCHs for the N UEs and the priority factor may be determined to be the equivalent priority of each of the M LCHs for the N UEs. In the technical scheme, the calculation of the LCH equivalent priority of the UE can be simplified, various network factors can be considered, and the fair transmission of the data of each UE is realized.
In one embodiment, the priority factor may be determined by at least one of a hop count, a time delay, and a size of data stored in each LCH of the M LCHs of the N UEs, where the hop count may be the number of IAB nodes from the IAB node to the base station, the time delay may be a time delay between the UE corresponding to each LCH of the M LCHs of the N UEs or the access IAB node and the base station, an average value of time delays experienced by packets of each LCH of the M LCHs of the N UEs, or an average value of time delay differences experienced by packets of each LCH of the M LCHs of the N UEs, that is, an average value of remaining packet time of each LCH of the M LCHs of the N UEs.
In an embodiment, the product or the sum of the priority of each LCH in the M LCHs of the N UEs and the priority of the IAB LCH corresponding to the LCH may be determined as the equivalent priority of the LCH, or the sum of the priority of each LCH in the M LCHs of the N UEs and the product of the priority of the IAB LCH corresponding to the LCH and the setting value may be determined as the equivalent priority of the LCH.
In an embodiment, the product or the sum of the priority of each LCH in the M LCHs of the N UEs and the priority of the UE corresponding to the LCH may be determined as the equivalent priority of the LCH, or the sum of the priority of each LCH in the M LCHs of the N UEs and the product of the priority of the UE corresponding to the LCH and the setting value may be determined as the equivalent priority of the LCH.
In an embodiment, all data or part of data of each LCH of the M LCHs of the N UEs may be sent to a buffer of the IAB LCH according to a correspondence between the equivalent priority and the IAB LCH, where the buffer belongs to an adaptation layer, and the data in the buffer of the IAB LCH is scheduled according to the priority of the IAB LCH, so that scheduling based on the IAB LCH may be implemented.
In an embodiment, the size of the data buffered in the buffer in the IAB node may be reported through a MAC Control Element (CE). The MAC CE may include a Radio Network Temporary Identifier (RNTI) for indicating the UE ID and information for indicating a Logical Channel Group (LCG), and may also include reserved bits and information for indicating the LCG. This information may include the LCG ID or a bitmap (bitmap). The LCG number of the IAB node can be expanded by modifying the MAC CE format, so that the LCG number can be enough when the size of the cache data in the buffer in the IAB node is reported.
In an embodiment, the IAB LCH ID may be configured, and the data of the M LCHs of the N UEs are mapped to the corresponding IAB LCH according to the IAB LCH ID or the priority of the M LCHs of the N UEs, or the data of the M LCHs of the N UEs are mapped to the corresponding IAB LCH according to the LCG, and then the size of the buffered data in the buffer in the IAB node is reported. The LCG number of the IAB node can be expanded by configuring the IAB LCH ID, namely configuring the virtual IAB LCH, so that the LCG number can be enough when the size of the cache data in the buffer in the IAB node is reported.
In one embodiment, when the scheduling granularity is LCH of the UE, the buffer may comprise a buffer of the RLC layer.
In an embodiment, when the scheduling granularity is IAB LCH, the size of the buffered data in the buffer in the IAB node may be reported, and the buffer may include a buffer of the adaptation layer, or may include buffers of the adaptation layer and the RLC layer.
A third aspect discloses an IAB node comprising means for performing a method of data scheduling as disclosed in the first aspect or any of its possible implementations, or comprising means for performing a method of data scheduling as disclosed in the second aspect or any of its possible implementations.
A fourth aspect discloses an IAB node comprising a processor for storing program code, a memory for executing the program code, and a transceiver for communicating with other communication devices. When the processor executes the program code stored in the memory, the processor is caused to perform the method of data scheduling disclosed in any of the possible implementations of the first aspect or the first aspect, or the processor is caused to perform the method of data scheduling disclosed in any of the possible implementations of the second aspect or the second aspect.
A fifth aspect discloses a readable storage medium having stored thereon a program which, when run, implements a method of data scheduling as disclosed in the first aspect or any one of the possible implementations of the first aspect, or implements a method of data scheduling as disclosed in the second aspect or any one of the possible implementations of the second aspect.
Drawings
FIG. 1 is a schematic diagram of a network architecture according to an embodiment of the present invention;
FIG. 2 is a flow chart illustrating a method for scheduling data according to an embodiment of the present invention;
FIG. 3 is a flow chart illustrating another method for scheduling data according to an embodiment of the present invention;
FIG. 4 is a flowchart illustrating a method for scheduling data according to another embodiment of the present invention;
FIG. 5 is a flowchart illustrating a method for scheduling data according to another embodiment of the present invention;
fig. 6 is a schematic structural diagram of an IAB node according to an embodiment of the present invention;
fig. 7 is a schematic structural diagram of another IAB node disclosed in the embodiments of the present invention;
fig. 8 is a schematic structural diagram of another IAB node disclosed in the embodiment of the present invention;
fig. 9 is a schematic structural diagram of another IAB node disclosed in the embodiment of the present invention;
fig. 10 is a schematic diagram of a BSR MAC CE in a short format according to an embodiment of the present invention;
fig. 11 is a schematic diagram of a BSR MAC CE in a long format according to an embodiment of the present invention;
fig. 12 is a schematic diagram of another BSR MAC CE with a short format according to an embodiment of the present invention;
fig. 13 is a schematic diagram of another BSR MAC CE with a long format according to an embodiment of the present invention.
Detailed Description
The embodiment of the invention discloses a method and a device for scheduling data, which are used for realizing the scheduling of data of a plurality of UE. The following are detailed below.
In order to better understand a method and an apparatus for data scheduling disclosed in the embodiments of the present invention, a network architecture used in the embodiments of the present invention is described below. Referring to fig. 1, fig. 1 is a schematic diagram of a network architecture according to an embodiment of the present invention. As shown in fig. 1, the network architecture may include one or more UEs, one or more IAB nodes, a base station, and a core network. Only one UE and two IAB nodes are illustrated in fig. 1. As shown in fig. 1, the link between the UE and the IAB node 1 is an access link, the link between the IAB node 1 and the IAB node 2 and the link between the IAB node 2 and the base station are backhaul links (i.e., backhaul links refer to links between the IAB nodes and the base station), and both the access link and the backhaul link are wireless links. And the IAB node is used for providing wireless access service for the UE and is connected to the base station through a wireless backhaul link to transmit the service data of the user. And a base station for connecting to the core network through a wired link. The base station may be an integrated entity, or may be a Centralized Unit (CU) and a Distributed Unit (DU) separately. The base station may be a host base station or a donor (donor) node. IAB node 1 is an access IAB node for the UE, IAB node 2 is located between IAB node 1 and the base station, and may be referred to as an intermediate node, and IAB node 2 may also provide service for the UE. Each IAB node treats the IAB node for which backhaul services are provided as a parent node and, accordingly, may be considered a child node of its parent node. For example: IAB node 2 is a parent node of IAB node 1, and IAB node 1 is a child node of IAB node 2. A parent node may also be referred to as an upstream or superior (upstream) node; a child node may also be referred to as a downstream or lower (downstream) node.
In order to better understand the method and the apparatus for data scheduling disclosed in the embodiments of the present invention, an application scenario of the embodiments of the present invention is described below. The protocol stack of the user plane introduces a 1a architecture, i.e. the IAB node is used as the DU of the base station to provide services for the UE. The main idea is as follows:
the return is provided only through an adaptation layer or through a Tunneling Protocol for User Plane (GTP-U) of a General Packet Radio Service (GPRS) in User Plane in combination with F1-U (F1-U Plane, data Plane between CU/DU);
hop-by-hop inter-IAB node data forwarding is provided by an adaptation layer.
Under the architecture of 1a, a Packet Data Convergence Protocol (PDCP) of the UE is deployed in a base station or a CU, and the adaptation layer is deployed in the following two ways:
firstly, an adaptation layer is deployed above an RLC layer:
at this time, the adaptation layer on the base station performs mapping/aggregation from UE bearer/UE service/UE QoS flow (flow) to IAB bearer or IAB RLC bearer; the adaptation layer on the IAB node may directly perform mapping from the IAB RLC bearer to the IAB RLC bearer between the backhaul links, or may perform mapping/aggregation from the UE bearer to the IAB RLC bearer as in the base station; the configuration of the RLC bearer on the backhaul link corresponds to the LCH (or bearer or radio bearer or RLC channel) of each IAB, that is, the RLC entity is configured for each IAB RLC bearer, and the corresponding LCH is configured; the object processed in the MAC layer scheduling is LCH of each IAB.
Secondly, the adaptation layer is arranged above the MAC layer (namely between the MAC layer and the RLC layer)
At this time, the configuration of the RLC bearer on the backhaul link corresponds to the LCH (or bearer or radio bearer or RLC channel) of each UE, that is, one RLC bearer is configured for each UE bearer on the IAB node, and includes an RLC entity and a corresponding LCH; the LCH of each UE can be distinguished during the dispatching of the MAC layer, and the back transmission link is directly mapped according to the RLC LCH of the UE.
The adaptation layer may be an independent protocol layer, or may be a sub-layer or a sub-module of an existing protocol layer, for example: it may be a sub-layer of the RLC layer or a sub-layer of the MAC layer.
The mapping includes, but is not limited to, mapping of UE radio bearers to IAB radio bearers, or mapping of UE traffic (e.g., QoS flows) to IAB radio bearers.
According to the NR protocol definition, an RLC bearer refers to an RLC and MAC LCH configured for one radio bearer (radio bearer) in one cell group (cell group). The RLC bearer on the backhaul link takes the definition of NR. According to the NR protocol definition, the RLC layer provides the PDCP layer with an RLC channel, i.e., the RLC channel is an interface between the PDCP layer and the RLC layer. If the adaptation layer is deployed above the RLC layer, the RLC layer provides the RLC channel to the adaptation layer.
The uplink scheduling of NR may include the steps of:
1) reporting the size of data volume to be sent of the UE by the UE through a Buffer Status Report (BSR) message;
2) the base station executes uplink scheduling and provides uplink authorization comprising uplink transmission resources for the UE;
3) and the UE executes LCP processing after receiving the uplink authorization.
During bearer configuration, a corresponding LCH and a corresponding LCG of the bearer are configured, so that when the UE reports the size of the data volume to be sent of the UE, the UE reports the size of the data volume to be sent based on the LCG, the BSR message may include the buffer size of one or more LCGs, the data volume to be sent includes the data volume to be sent of the RLC layer and the PDCP layer, and the maximum number of LCGs in NR is 8. The Data amount to be transmitted in the RLC layer may include an RLC Service Data Unit (SDU) that is not transmitted or an RLC SDU segment, and an RLC Protocol Data Unit (PDU) that is to be initially transmitted or an RLC PDU that is to be retransmitted. The amount of data to be transmitted of the PDCP layer may include PDCP SDUs that are not encapsulated into PDCP PDUs, and PDCP PDUs and PDCP control (control) PDUs that are not delivered to the lower layer. The object of LCP processing is LCH, and when LCH is configured, PBR, BSD and priority are configured to support LCP operation to satisfy QoS. The LCP protocol may be as follows:
1) update the amount of data allowed to be scheduled (i.e., inject data into the token bucket):
each LCH maintains a Bj, each scheduling time updates Bj (Bj is Bj + PBR) according to PBR T, Bj is min (PBR BSD, Bj) taken as the capacity of the token bucket, namely the data volume allowed to be scheduled, and T is the time interval of uplink scheduling.
2) Performing LCP scheduling operations:
when data is scheduled in the first round, resources are allocated (namely scheduling is carried out) to LCHs with Bj >0 from high to low according to the priorities of the LCHs, the data volume of the MAC SDU selected by each LCH meets the requirement of PBR, and the selected data volume of the LCH is updated to be Bj-Bj. When there are resources left in the second round of scheduling data, the resources are allocated strictly according to the LCH priority from high to low until the LCH has no data or no uplink transmission resource can be allocated, and then Bj is not considered.
However, applying the scheduling procedure of NR to the IAB node may be problematic. The following problems may exist for the case where the adaptation layer is deployed above the RLC layer:
1) how to perform the mapped aggregation operation in order to guarantee the QoS requirements of the LCH of each UE;
a simple implementation of aggregation is to put the LCH data of the UE into the buffer of the IAB LCH according to the mapping rules, and to form a First In First Out (FIFO) queue according to the order of arrival of the data. However, since the LCH of each UE may have different LCP parameters, the simple FIFO queue will not guarantee the QoS requirement of the LCH of each UE when the LCH data of different UEs arrive in different order or the data amount is not small.
2) How to configure the LCP parameters for each IAB LCH to achieve the total demand of multiple UE bearers;
the mapping operation maps the data of the LCHs of a plurality of different UEs to the same IAB LCH, and then scheduling is performed based on the LCHs of the IAB nodes, but the data of the LCHs of the UEs mapped to the same IAB LCH may change frequently, so that the QoS requirements change accordingly.
3) How to solve the influence of the queue management of the adaptation layer on the data volume calculation method of the BSR.
When the adaptation layer introduces aggregation operation in order to meet the QoS requirement of each UE, it is necessary to maintain a queue of UEs in the adaptation layer for aggregation operation, and these data participate in subsequent transmission.
The following problems may exist for the case where the adaptation layer is deployed above the MAC layer:
1) how to solve the problem that the BSR is insufficient in LCG number;
MAC scheduling is performed for LCHs of multiple UEs, and BSR may be performed based on the LCG of each UE. The number of LCGs required at this time is the number of UEs the number of LCGs per UE, but the number of LCGs in NR is only 8, so that the requirement cannot be satisfied.
2) The problem of how the LCP operation of the IAB node handles LCH of different UEs.
The existing LCP processing is for LCH of the same UE, the priority setting is also for LCH of the same UE, while LCP in IAB node needs to process LCH of different UE, but there is no solution for how to process priority among LCH of multiple UE.
Referring to fig. 2 based on the network architecture shown in fig. 1, fig. 2 is a schematic flow chart of a data scheduling method according to an embodiment of the present invention. The data scheduling method is applied to an IAB node, is particularly suitable for an access IAB node of UE, and an adaptation layer of the IAB node is deployed above an RLC layer. As shown in fig. 2, in the data scheduling method, an IAB node receives data of M LCHs from N UEs, the data is buffered in an adaptation layer, N and M are integers greater than or equal to 1, and sends all or part of the data of each LCH in the M LCHs of the N UEs to a buffer of the IAB LCH, and the buffer belongs to an RLC layer; and scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH. Sending all or part of data of each LCH of the M LCHs of the N UEs to the buffer of the IAB LCH includes: and transmitting all data or part of data of each LCH in the M LCHs of the N UEs to a buffer of the IAB LCH in each unit time interval. Comprises the following steps.
201. Data for M LCHs from N UEs is received.
In this embodiment, when performing uplink data transmission, the UE sends data to be transmitted to the IAB node, so that the IAB node may receive data of M LCHs from N UEs, where the M LCHs of the N UEs are LCHs that the IAB node needs to forward the data, N and M are integers greater than or equal to 1, and N is less than or equal to M. The IAB node configures a buffer for each of M LCHs of N UEs in the adaptation layer, and thus, after receiving the data of the M LCHs from the N UEs, buffers the data of the M LCHs of the N UEs in a buffer (buffer) of the adaptation layer. In one possible implementation, after receiving the data of M LCHs from N UEs, the data is buffered in a buffer of the RLC layer directly, and no data buffering is needed in the adaptation layer.
202. And sending all data or part of data of each LCH in the M LCHs of the N UEs to a buffer of the IAB LCH.
In this embodiment, when the scheduling uses the IAB node as the granularity, that is, the IAB is used as one UE to perform scheduling, that is, the scheduling granularity is the IAB LCH, the IAB node configures a buffer of the IAB LCH in the RLC layer. Therefore, for subsequent scheduling, after buffering the data of the M LCHs of the N UEs in the buffer of the adaptation layer, all or part of the data of each LCH of the M LCHs of the N UEs needs to be sent to the buffer of the IAB LCH, that is, an aggregation operation is performed, that is, the data buffered in the buffer of the adaptation layer is moved to the buffer of the RLC layer.
In this embodiment, all data or part of data of each LCH of the M LCHs of the N UEs may be sent to the buffer of the IAB LCH in each unit time interval, and since the data in the LCH of the UE is sent to the buffer of the IAB LCH in the unit time interval, fair scheduling of the data may be achieved, and it is ensured that the data of each LCH is scheduled at an agreed rate. The unit time interval may be an uplink scheduling time interval, for example, a time interval configured by a base station or a parent node, a maximum value, a minimum value, or an average value of BSDs of M LCHs of N UEs, or a time interval determined according to the uplink scheduling time interval, where the specific unit time interval is not limited in this application. For example: assuming that the time interval of the uplink scheduling is T, the unit time interval may be T × n, where n is a preset parameter, or may be a product of an average value of T and n. Optionally, the size of the partial data or the entire data of each LCH of the M LCHs of the N UEs may be smaller than or equal to the product of the unit time interval and a preset PBR, where the preset PBR may be a maximum value, a minimum value, or an average value of the PBR of each LCH of the M LCHs of the N UEs, and may also be other values. Alternatively, the preset PBR may be preconfigured by the base station or the parent node or OAM entity for each IAB LCH. Optionally, the size of the partial data or the entire data of each LCH of the M LCHs of the N UEs may also be smaller than or equal to the product of the unit time interval and the PBR of the LCH, and at this time, the IAB node needs to acquire the LCP parameter of each LCH of the M LCHs of the N UEs. The LCP parameters include at least one of priority, PBR, and BSD.
Alternatively, when the IAB node aggregates the data of the LCH of the new UE, it may use the PBR of the LCH of the existing UE for aggregation. For example, when the LCH of a new UE is mapped to the same IAB LCH as the LCH of an existing UE, the two LCHs may have the same or similar QoS requirements, and thus the LCH of the new UE may use the PBR of the LCH of the existing UE.
In this embodiment, all data or part of data of each LCH of the M LCHs of the N UEs may be sent to the buffer of the IAB LCH according to the configuration order of each LCH of the M LCHs of the N UEs, for example, the data is sent first by configuration. All data or part of data of each LCH in the M LCHs of the N UEs may also be sent to the buffer of the IAB LCH according to the priority of each LCH in the M LCHs of the N UEs, and when the LCHs of different UEs have the same priority, the data may be sent randomly, or according to the configuration order, or according to the size (size) of the buffered data. All data or part of data of each LCH of the M LCHs of the N UEs may also be sent to the buffer of the IAB LCH according to the equivalent priority of each LCH of the M LCHs of the N UEs, and the specific determination manner of the equivalent priority may refer to step 402. All data or part of data of each LCH of the M LCHs of the N UEs may also be sent to the buffer of the IAB LCH at random, further, the data may be sent randomly at the first sending, and the data may be sent in the same order as the first sending at the subsequent sending, or the data buffered by the LCH may be selected for sending sequentially. For example: the first transmission is in the order UE1LCH1, UE2LCH2, UE3LCH1, and the subsequent transmissions are in the same order. The data in the LCH of the UE is sent to the buffer of the IAB LCH, so that the LCH data of a plurality of UEs can be converged, and the scheduling of the buffer data in the IAB LCH is simplified.
In this embodiment, a mapping relationship between each LCH of the M LCHs of the N UEs and the IAB LCH may be determined according to the configuration information, then all or part of the data of each LCH of the M LCHs of the N UEs is sent to the buffer of the corresponding IAB LCH according to the mapping relationship, and the data in the buffer of the IAB LCH is scheduled according to the determined mapping relationship, so as to ensure the scheduling priority and PBR of the LCH of the UE, and meet the QoS scheduling requirements of the LCHs of the UEs.
Step 202 may be performed after receiving the uplink grant, or may be performed before receiving the uplink grant.
Optionally, during the aggregation operation, the aggregated data amount may be determined first, and then all data or part of data of each LCH of the M LCHs of the N UEs is sent to the buffer of the IAB LCH according to the priority or the configuration order. The amount of aggregated data may be determined before or after receiving the uplink grant. The size of the aggregated data amount may be equal to the product of the unit time interval and the preset PBR. The aggregate data volume may be determined by scheduling of the IAB LCH, that is, scheduling of the IAB LCH is performed after receiving the uplink grant, resources are allocated to each IAB LCH, and the result of resource allocation is used as the aggregate data volume of each IAB LCH. Or determining the total aggregate data volume of each LCH of the IAB according to the uplink grant.
203. And scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH.
In this embodiment, after all data or part of data of each LCH of the M LCHs of the N UEs is sent to the buffer of the IAB LCH, the data in the buffer of the IAB LCH may be scheduled according to the priority of the IAB LCH, that is, the uplink resource is allocated to the IAB LCH according to the priority of the IAB LCH. The cached data corresponding to the IAB LCH can be processed by using the existing NR LCP mechanism.
Optionally, data of an LCH of a UE corresponding to the IAB LCH may be scheduled. The LCP operation of NR can be referred to, and only data is fetched from the cache of the IAB LCH in the first round of data scheduling; and when the data is scheduled in the second round, scheduling is executed according to the priority of the IAB LCH, wherein the data which can be scheduled by the IAB LCH comprises the data in the buffer of the IAB LCH and the data in the buffer of the LCH of the corresponding UE. Or, during the first round of data scheduling and the second round of data scheduling, the LCP operation of NR may be adopted, only data in the buffer of the IAB LCH is scheduled, and during the third round of data scheduling, if there is a surplus uplink resource, data in the buffer of the LCH of the UE corresponding to the IAB LCH may be scheduled, and the execution sequence may be that resources are allocated to the LCH of the corresponding UE according to the priority of the IAB LCH from high to low until the LCHs of all UEs corresponding to the IAB LCH have no data or no uplink resource is allocable.
In the data scheduling method described in fig. 2, after receiving data of N UEs, all or part of the data is first sent to a buffer of the IAB LCH, and then scheduling is performed uniformly based on the priority of the IAB LCH, so that scheduling of data of multiple UEs can be realized, so as to ensure the QoS requirement of the LCH of each UE.
Referring to fig. 3, fig. 3 is a schematic flow chart of another data scheduling method according to an embodiment of the present invention based on the network architecture shown in fig. 1. The data scheduling method is applied to an IAB node, and particularly an adaptation layer of the IAB node is deployed above an RLC layer. As shown in fig. 3, in the data scheduling method, an IAB node receives data of M LCHs from N UEs, the data is buffered in an RLC layer, the data is buffered in an adaptation layer, N and M are integers greater than or equal to 1; sending all data or partial data of each LCH in M LCHs of N UEs to a buffer of an IAB LCH, wherein the buffer belongs to an RLC layer; reporting the size of the cached data in a buffer in the IAB node; acquiring a mapping relation between LCH of UE and IAB LCH and LCP parameters of M LCH of N UE, and generating LCP parameters of IAB LCH according to the mapping relation, the LCP parameters of M LCH of N UE and a generation criterion; and scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH. The method comprises the following steps:
301. data for M LCHs from N UEs is received.
Step 301 is the same as step 201, and please refer to step 201 for detailed description, which is not described herein again.
302. And sending all data or part of data of each LCH in the M LCHs of the N UEs to a buffer of the IAB LCH.
Step 302 is the same as step 202, and please refer to step 202 for detailed description, which is not repeated herein.
303. And reporting the size of the cached data in a buffer in the IAB node.
In this embodiment, in order to acquire the uplink scheduling resource, the IAB node needs to report the size of the data cached in the buffer in the IAB node to the base station, and through the reporting, the upper node of the IAB node can perform resource scheduling according to the data in the buffer of the IAB node, thereby satisfying the QoS quality guarantee of the UE. The reported buffer may include a buffer of the RLC layer, for example: when all data of the adaptation layer are aggregated to the RLC layer, the reported buffer may include a buffer of the RLC layer; the reported buffers may include buffers of the RLC layer and the adaptation layer, for example: when only part of the data of the adaptation layer is aggregated to the RLC layer, the reported buffer may include the RLC layer and the buffer of the adaptation layer. When the aggregation operation of step 302 is not performed, the aggregation function involved in step 302 is not configured, or step 202 is performed after receiving the uplink grant, the reported buffer includes a buffer of the adaptation layer. The data buffered in the adaptation layer buffer may include SDUs that are not encapsulated into PDUs, PDUs that are not delivered to the lower layer, and may also include control PDUs and/or status PDUs. The size of the data buffered in the buffer in the IAB node may be reported by the BSR, or may be reported by other messages, for example: the message passing through the adaptation layer is not limited in this application.
Step 303 may be executed after step 301, or may be executed after step 302.
304. And acquiring a mapping relation between the LCH of the UE and the IAB LCH and LCP parameters of M LCHs of N UEs, and generating the LCP parameters of the IAB LCH according to the mapping relation, the LCP parameters of M LCHs of N UEs and a generation criterion.
Step 304 may be executed before step 301, after step 302, or after step 303.
In this embodiment, the mapping relationship between the LCH of the UE and the IAB LCH and the LCP parameters of the M LCHs of the N UEs may be obtained first, then the LCP parameters of the IAB LCH are generated according to the mapping relationship, the LCP parameters of the M LCHs of the N UEs and the generation criterion, and the LCP parameters of the IAB LCH are generated according to the criterion, so that the data of each LCH can be scheduled, the rate requirement can be guaranteed, and the LCH of each UE can be scheduled fairly. The mapping relationship between the LCH of the UE and the IAB LCH may be preconfigured, for example: pre-appointing that LCH1 service data of UE are all placed on IAB LCH2 for transmission; the IAB node may also generate according to predefined rules or pre-configured criteria, such as: the pre-configured criteria may be a mapping criteria between a UE's LCH quality of service Class Identifier (QCI) and the IAB LCH QCI. The generation criterion may include at least one of: the PBR of the IAB LCH may be the sum of the PBRs of the LCHs of the UEs corresponding to the IAB LCH, or may be the product of the minimum value in the PBRs of the LCHs of the UEs corresponding to the IAB LCH and the number of the LCHs of the UEs corresponding to the IAB LCH, or may be the product of the maximum value in the PBRs of the LCHs of the UEs corresponding to the IAB LCH and the number of the LCHs of the UEs corresponding to the IAB LCH; the BSD of the IAB LCH may be a minimum value, a maximum value, or an average value of the BSDs of the LCHs of the UEs corresponding to the IAB LCH, or may be a ratio of a sum of products of the PBR and the BSD of the LCH of the UE corresponding to the IAB LCH to the PBR of the IAB LCH.
In this embodiment, the priority of the IAB LCH may be preconfigured or generated by the IAB node. When the priority of the IAB LCH is generated by the IAB node, the generation criteria may further include: the priority of the IAB LCH may be the minimum value, the maximum value, or the average value of the priorities of the LCHs of the UEs corresponding to the IAB LCH.
Optionally, an upper IAB node of the IAB node needs to acquire an LCP parameter of the IAB LCH of the IAB node, so that the upper IAB node or the base station allocates an uplink scheduling resource to the IAB node, and the upper IAB node of the IAB node may acquire the LCP parameter of the IAB LCH of the IAB node in the following manner: 1) the upper IAB node acquires the LCP parameter of the IAB LCH of the lower IAB node, which may be that the upper IAB node transmits a query request to the lower IAB node after acquiring the bearer configuration/context of the UE, and then the lower IAB node feeds back the query request to the upper IAB node; or when the superior IAB node is triggered to configure the bearer of the UE, sending a query request to the subordinate IAB node, and then feeding back the subordinate IAB node to the superior IAB node; or after the LCP parameter of the IAB LCH is generated by the lower IAB node, the LCP parameter is actively reported to the upper IAB node. The query request and the feedback may be RRC messages, or may be other messages, such as MAC CE, or messages of an adaptation layer, which is not limited in the present application. 2) And the superior IAB node acquires the mapping relation between the IAB LCH of the inferior IAB node and the LCH of the UE and generates LCP parameters of the IAB LCH of the inferior IAB node. The acquiring method may be through an RRC message, or may be other messages, such as a MAC CE, or a message of an adaptation layer, which is not limited in the present application.
Alternatively, the LCP parameters of the IAB LCH of the IAB node may be configured in the base station set, and the LCP parameters of the IAB LCH of the base station configured IAB node may be generated according to step 304. At this time, the base station may need to acquire the bearer configuration of the UE, the mapping relationship between the LCH of the UE and the IAB LCH, and even further need to acquire the routing information of the UE data, so as to select the IAB node through which the data is transmitted to acquire the data. If the base station cannot determine the bearer mapping on each IAB node, the IAB node is required to report the mapping relation to the base station after executing the bearer mapping, or the base station inquires the mapping relation to the IAB node. When the bearer configuration of the UE is generated by the IAB node, the IAB node needs to report the bearer configuration of the UE to the base station. When the bearing of the UE is established, the base station sends the LCP parameter of the IAB LCH of the IAB node to the IAB node.
305. And scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH.
Step 305 is the same as step 203, and please refer to step 303 for detailed description, which is not repeated herein.
In this embodiment, after the data in the buffer of the IAB LCH is scheduled according to the priority of the IAB LCH, the scheduled data is sent to the upper IAB node or the base station.
In the data scheduling method described in fig. 3, after receiving data of N UEs, all or part of the data is first sent to a buffer of the IAB LCH, and then scheduling is performed uniformly based on the priority of the IAB LCH, because the LCP parameter of the IAB LCH determines the LCP parameter referring to the LCH of the UE, scheduling of data of multiple UEs can be implemented, so as to ensure the QoS requirement of the LCH of each UE.
Referring to fig. 4, fig. 4 is a schematic flow chart of another data scheduling method according to an embodiment of the present invention based on the network architecture shown in fig. 1. The method is applied to the IAB node, and is particularly suitable for the adaptation layer of the IAB node to be deployed above the MAC layer. As shown in fig. 4, in the data scheduling method, an IAB node receives data of M LCHs from N UEs, where the data is buffered in an RLC layer, and N and M are integers greater than or equal to 1; determining the equivalent priorities of M LCHs of N UEs according to the priorities of the M LCHs of the N UEs; and scheduling the data of M LCHs of the N UEs according to the equivalent priority. The method comprises the following steps:
401. data for M LCHs from N UEs is received.
In this embodiment, when performing uplink data transmission, the UE sends data to be transmitted to the IAB node, and forwards the data to the base station through the IAB node, so that the IAB node may receive data from M LCHs of N UEs, where the M LCHs of the N UEs are LCHs that need the IAB node to forward the data, N and M are integers greater than or equal to 1, and N is less than or equal to M. The IAB node may configure one buffer or RLC entity for each of the M LCHs of the N UEs in the RLC layer, and thus, after receiving the data of the M LCHs from the N UEs, buffer the data of the M LCHs of the N UEs in the buffer of the RLC layer.
402. And determining the equivalent priorities of the M LCHs of the N UEs according to the priorities of the M LCHs of the N UEs.
In this embodiment, the equivalent priorities of the M LCHs of the N UEs are determined according to the priorities of the M LCHs of the N UEs, the equivalent priorities of the M LCHs of the N UEs can be determined according to a mapping relationship between the priorities of the LCHs of the UEs and the equivalent priorities, and scheduling based on the equivalent priorities can be achieved through the mapping relationship between the LCHs of the UEs and the equivalent priorities. The mapping relationship between the LCH priority of the UE and the equivalent priority may be preconfigured, may also be acquired by the IAB node, or may also be generated by the IAB node, and similarly, the equivalent priority may be preconfigured, for example: configured by a parent node, a base station, or an OAM entity of the IAB node, or acquired by the IAB node, or generated by the IAB node.
In a possible implementation, the equivalent priority is the priority of the IAB LCH, and at this time, the mapping relationship between the priority of the LCH of the UE and the equivalent priority is the mapping relationship from the LCH of the UE to the IAB LCH; after the LCH of the UE is mapped to the IAB LCH, the priority of the IAB LCH can be used as the equivalent priority of the LCH of the UE. The M LCHs of the N UEs may be mapped to J IAB LCHs, J being an integer greater than or equal to 1, or the LCH of each UE of the LCHs of the N UEs may be configured with one IAB LCH mapped one by one, with different priority levels of the IAB LCHs. When the scheduling is executed, the IAB LCH is selected according to the priority of the IAB LCH, and then the LCH of the UE corresponding to the IAB LCH is selected according to the priority of the LCH of the UE.
In one possible implementation, the equivalent priority is a priority of the IAB LCH, and at this time, the mapping relationship between the priority of the LCH of the UE and the equivalent priority is a mapping relationship from the priority of the LCH of the UE to the priority of the IAB LCH, for example, the priority of the selected IAB LCH is higher than or equal to the priority of the LCH of the UE, after the mapping is performed, the LCH of the UE is mapped to the IAB LCH, and the priority of the IAB LCH is used as the equivalent priority of the LCH of the UE.
In a possible implementation, the mapping relationship between the IAB LCH priority and the equivalent priority may be configured, and after the equivalent priorities of the M LCHs of the N UEs are determined, the LCH of the UE may be mapped to the IAB LCH according to the mapping relationship between the equivalent priority and the priority of the IAB LCH. After the equivalent priorities of the M LCHs of the N UEs are determined, the equivalent priority of the LCH of the UE may be used as the priority of the IAB LCH according to the mapping relationship from the LCH of the UE to the IAB LCH, and the priority scheduling is performed using the equivalent priority in the scheduling.
In this embodiment, the product of the priority of each LCH in the M LCHs of the N UEs and the priority factor may also be determined to be the equivalent priority of each LCH in the M LCHs of the N UEs, which may simplify the calculation of the equivalent priority of the LCHs of the UEs, and may consider various network factors to achieve fair transmission of data of each UE. The priority factor may be determined by at least one of a hop count, a delay, and a size of data stored by each of the M LCHs for the N UEs. The hop count may be the number of IAB nodes from the IAB node to the base station, that is, the number of IAB nodes between the access IAB node of the UE and the base station, and at this time, the access IAB node of the UE may be included, or the access IAB node of the UE may not be included. The hop count may also be the number of IAB nodes between the UE and the base station. When the hop count is the number of IAB nodes between the UE and the base station, or the number of IAB nodes to the base station and includes the access IAB node of the UE, as shown in fig. 1, the hop count from IAB node 1 to the base station is 2, and the hop count from IAB node 2 to the base station is 1. The hop count may also be the number of links between the UE and the base station, including the access link and the backhaul link, as shown in fig. 1, the hop count from the UE to the base station is 3. The hop count may also be the number of links between the IAB node and the base station, as shown in fig. 1, the hop count from IAB node 1 to the base station is 2. The time delay may be a time delay between the UE corresponding to each LCH of the M LCHs of the N UEs or the access IAB node and the base station, an average value of the time delay experienced by the data packet of each LCH of the M LCHs of the N UEs, an average value of the time-to-live of the data packet of each LCH of the M LCHs of the N UEs and the time delay difference experienced, or a time delay between the IAB node (middle IAB node) performing data forwarding/scheduling and the base station. Assuming that the smaller the value is, the higher the priority is, at this time, the priority factor may be the number of hops, the time delay, or the reciprocal of the data size stored in each of M LCHs of N UEs; the priority factor may store the data size for each of the M LCHs for N UEs, or the hop count, the delay, or the number of N LCHs, assuming a higher value for the priority.
Optionally, the equivalent priorities of the M LCHs of the N UEs may also be configured by an upper IAB node or a base station of the IAB node, and the upper IAB node or the base station of the IAB node may configure the priorities of the M LCHs of the N UEs as the equivalent priorities, where the priority of each LCH in the M LCHs of the N UEs is different.
In this embodiment, the product or the sum of the priority of each LCH in the M LCHs of the N UEs and the priority of the IAB LCH corresponding to the LCH may be determined as the equivalent priority of the LCH, or the sum of the priority of each LCH in the M LCHs of the N UEs and the first product may be determined as the equivalent priority of the LCH, where the first product is the product of the priority of the IAB LCH corresponding to the LCH and the setting value. The set value can be a preset value or a value agreed by a protocol. The IAB LCH may be configured with only the IAB LCH ID and no buffer for the IAB LCH, i.e. a virtual IAB LCH.
In this embodiment, the product or the sum of the priority of each LCH in the M LCHs of the N UEs and the priority of the UE corresponding to the LCH may be determined as the equivalent priority of the LCH, or the sum of the priority of each LCH in the M LCHs of the N UEs and the second product may be determined as the equivalent priority of each LCH in the M LCHs of the N UEs, where the second product is the product of the priority of the UE corresponding to the LCH and the setting value.
403. And scheduling the data of M LCHs of the N UEs according to the equivalent priority.
In this embodiment, after the equivalent priorities of the M LCHs of the N UEs are determined according to the priorities of the M LCHs of the N UEs, the data of the M LCHs of the N UEs are scheduled according to the equivalent priorities, that is, uplink scheduling resources are allocated to the data of the M LCHs of the N UEs according to the equivalent priorities. The scheduling granularity may be LCH of the UE, and at this time, the data of M LCHs of the N UEs are directly scheduled according to the equivalent priority.
In a possible implementation, the scheduling granularity may also be IAB LCH, and at this time, all data or part of data of each LCH of the M LCHs of the N UEs may be sent to a buffer of the IAB LCH according to a correspondence between the equivalent priority and the IAB LCH, where the buffer belongs to the adaptation layer, and then the data in the buffer of the IAB LCH is scheduled according to the priority of the IAB LCH. That is, the adaptive layer configures a buffer queue of the IAB LCH, and moves all or part of the data of the M LCHs of the N UEs in the RLC layer to the buffer of the IAB LCH configured in the adaptive layer for buffering. The step of sending all or part of the data of each LCH of the M LCHs of the N UEs to the buffer of the IAB LCH is similar to the implementation manner of step 202, and please refer to step 202 for detailed description, which is not repeated herein.
Optionally, when the scheduling granularity is IAB LCH, step 402 may not be performed, all data or part of data of each LCH of the M LCHs of the N UEs is directly sent to a buffer of the IAB LCH according to the priority of the M LCHs of the N UEs or according to a mapping relationship between the LCHs of the UEs and the IAB LCH, where the buffer belongs to the adaptation layer, and then the data in the buffer of the IAB LCH is scheduled according to the priority of the IAB LCH.
The step of sending all or part of the data of each LCH of the M LCHs of the N UEs to the buffer of the IAB LCH is similar to the implementation manner of step 202, and please refer to step 202 for detailed description, which is not repeated herein.
In the data scheduling method described in fig. 4, after receiving the data of the M LCHs of the N UEs, the equivalent priorities of the M LCHs of the N UEs are determined first, and then based on the equivalent optimal scheduling data of the M LCHs of the N UEs, the data of the multiple UEs can be scheduled, so as to ensure the QoS requirement of the LCH of each UE.
Referring to fig. 5, based on the network architecture shown in fig. 1, fig. 5 is a flowchart illustrating another data scheduling method according to an embodiment of the present invention. The method is applied to the IAB node, and particularly an adaptation layer of the IAB node is deployed above a MAC layer. As shown in fig. 5, in the data scheduling method, an IAB node receives data of M LCHs from N UEs, where the data is buffered in an RLC layer, and N and M are integers greater than or equal to 1; determining the equivalent priorities of M LCHs of N UEs according to the priorities of the M LCHs of the N UEs; reporting the size of the cached data in a buffer in the IAB node; and scheduling the data of M LCHs of the N UEs according to the equivalent priority. The method comprises the following steps:
501. data for M LCHs from N UEs is received.
Step 501 is the same as step 401, and please refer to step 401 for detailed description, which is not repeated herein.
502. And determining the equivalent priorities of the M LCHs of the N UEs according to the priorities of the M LCHs of the N UEs.
Step 502 is the same as step 402, and please refer to step 402 for detailed description, which is not repeated herein.
503. And reporting the size of the cached data in a buffer in the IAB node.
In this embodiment, the IAB node also needs to report the size of the data buffered by the buffer in the IAB node, so that the base station allocates the uplink scheduling resource to the IAB node. When the scheduling granularity is the LCH of the UE, the number of LCGs is not sufficient when reporting according to the LCH of the UE as the granularity, so the UE ID can be increased on the basis of the existing LCG ID. When the size of the data cached in the buffer in the IAB node is reported by the BSR, the BSR can simultaneously distinguish the UE and the LCG corresponding to the UE, and therefore, the BSR MAC CE can be enhanced, including: a field for indicating a UE ID, which may be used for transmitting an RNTI, and a field for indicating information of an LCG. When the BSR MAC CE is in short format (short format), the information indicating the LCG is an LCG ID; when the BSR MAC CE is in long format (long format), the information indicating the LCG is a bitmap. By modifying the format of the MAC CE, the sufficient LCG number can be obtained when the size of the data cached in the buffer in the IAB node is reported. Referring to fig. 10, fig. 10 is a schematic diagram illustrating a BSR MAC CE in a short format according to an embodiment of the present invention. As shown in fig. 10, the BSR MAC CE includes a 16-bit RNTI, a 3-bit LCG ID, and a 5-bit buffer size. Referring to fig. 11, fig. 11 is a schematic diagram illustrating a BSRMAC CE in long format according to an embodiment of the present invention. As shown in fig. 11, the BSR MAC CE includes a 16-bit RNTI, an 8 × m-bit buffer size, and 8-bit bitmaps LCG0-LCG 7, where m is the number of reported LCGs and is an integer equal to or greater than 1.
In this embodiment, the number of LCGs may also be increased, and when 64 LCGs are supported, the BSR MAC CE is enhanced, including: a reserved field R and a field for indicating information of the LCG. When the BSR MAC CE is in a short format, the information indicating the LCG is the LCG ID, but the original 3bit is extended to 6bit (i.e. 8 LCGs are changed to 64 LCGs); when the BSR MAC CE is in the long format, the information indicating the LCG is a bitmap, but the original 8 bits are extended to 64 bits. The format of the MAC CE can be modified and the LCG number of the IAB node can be expanded, so that the LCG number can be enough when the size of the cache data in the buffer in the IAB node is reported. Referring to fig. 12, fig. 12 is a schematic diagram illustrating another BSR MAC CE in short format according to an embodiment of the present invention. As shown in fig. 12, the BSR MAC CE includes 5-bit R, 6-bit LCG ID, and 5-bit buffer size. Referring to fig. 13, fig. 13 is a schematic diagram illustrating another BSR MAC CE with a long format according to an embodiment of the present invention. As shown in fig. 13, the BSR MAC CE includes an 8 × mbit buffer size and 64-bit bitmap LCGs 0-LCGs 63, where m is the number of reported LCGs and is an integer equal to or greater than 1.
In this embodiment, the IAB LCH ID may also be configured on the RLC layer, that is, the virtual IAB LCH may be configured on the RLC layer, then the data of the M LCHs of the N UEs may be mapped onto the corresponding IAB LCH according to the IAB LCH ID, or the data of the M LCHs of the N UEs may be mapped onto the corresponding IAB LCH according to the priorities of the M LCHs of the N UEs, or the data of the M LCHs of the N UEs may be mapped onto the corresponding IAB LCH according to the LCG, or the data of the M LCHs of the N UEs may be mapped onto the corresponding IAB LCG according to the LCG, and then the size of the data cached in the buffer of the IAB node is reported based on the LCG of the IAB, and the data may be configured with the IAB LCH ID, namely, the virtual IAB LCH is configured, the LCG number of the IAB node is expanded, and the LCG number can be enough when the size of the cache data in the buffer in the IAB node is reported. The mapping rule of the LCG of the UE and the LCG of the IAB may be protocol agreed, or may be configured by an OAM entity, a base station, or an IAB node. The ID of the LCH of the UE and the ID of the IAB LCH to which the LCH is forwarded may be the same, for example: LCH1 of UE1 maps to IAB LCH 1. When mapping the data of M LCHs of N UEs to corresponding IAB LCHs according to the IAB LCH IDs, the IAB node needs to acquire the LCH IDs carried by the UEs, the LCH IDs of the IABs, and the LCGs corresponding to the IAB LCHs. When mapping the data of M LCHs of N UEs to corresponding IAB LCGs according to the LCGs, the IAB node needs to acquire the LCH ID carried by the UE, the LCG corresponding to the LCH of the UE, and the LCG of the IAB. When mapping the data of the M LCHs of the N UEs to the corresponding IAB LCH according to the priorities of the M LCHs of the N UEs, the IAB node needs to acquire the LCH ID carried by the UE, the LCG corresponding to the LCH of the UE, the LCH of the IAB, the priority of the IAB LCH, and the LCG corresponding to the IAB LCH.
In this embodiment, the reported buffer may include a buffer of the RLC layer, for example, when the LCH of the UE is used as the scheduling granularity, the adaptation layer does not need to maintain the IAB queue, and the reported buffer may include a buffer of the RLC layer. The reported buffer may include a buffer of the adaptation layer, for example, when IAB LCH is used as scheduling granularity, if the RLC layer data is moved to the adaptation layer in its entirety, the reported buffer may include a buffer of the adaptation layer. The reported buffers may include those of the adaptation layer and the RLC layer, for example, when the scheduling granularity is IAB LCH, if only the data part of the RLC layer is moved to the adaptation layer, the reported buffers may include those of the adaptation layer and the RLC layer. The buffer data size in the buffer in the IAB node can be reported through the BSR.
Step 503 may be executed after step 501, or may be executed after step 502.
504. And scheduling the data of M LCHs of the N UEs according to the equivalent priority.
Step 504 is the same as step 403, and please refer to step 403 for detailed description, which is not described herein again.
In this embodiment, after scheduling the data of M LCHs of N UEs according to the equivalent priority, the scheduled data is sent to the upper IAB node or the base station.
In the method for scheduling data described in fig. 5, after receiving the data of the M LCHs of the N UEs, the equivalent priorities of the M LCHs of the N UEs are determined first, and then based on the equivalent optimal scheduling data of the M LCHs of the N UEs, scheduling of the data of the multiple UEs can be implemented, so as to guarantee the QoS requirement of the LCH of each UE.
Referring to fig. 6, based on the same concept of the network architecture shown in fig. 1 and the method for scheduling data in the foregoing embodiment, fig. 6 is a schematic structural diagram of an IAB node disclosed in the embodiment of the present invention. The IAB node can be applied to the data scheduling method shown in fig. 2 to 3. As shown in fig. 6, the IAB node may include:
a receiving unit 601, configured to receive data of M LCHs from N UEs, where the data is cached in an adaptation layer, and N and M are integers greater than or equal to 1;
a sending unit 602, configured to send all data or part of data of each LCH of the M LCHs of the N UEs received by the receiving unit 601 to a buffer of the IAB LCH, where the buffer belongs to the RLC layer;
a scheduling unit 603, configured to schedule, according to the priority of the IAB LCH, the data sent by the sending unit 602 to the buffer of the IAB LCH.
As a possible implementation, the sending unit 602 is specifically configured to send all data or part of data of each LCH of the M LCHs of the N UEs to a buffer of the IAB LCH in each unit time interval.
As a possible implementation, the IAB node may further include:
a reporting unit 604, configured to report the size of the buffered data in the buffer in the IAB node;
the buffer includes a buffer of the RLC layer, or a buffer of the RLC layer and the adaptation layer.
Specifically, the reporting unit 604 is configured to report the size of the data received by the receiving unit 601 buffered in the buffer in the IAB node
As a possible implementation, the sending unit 602 may include:
a determining subunit 6021, configured to determine, according to the configuration information, a mapping relationship between each LCH of the M LCHs of the N UEs and the IAB LCH;
a sending subunit 6022, configured to send all data or part of data of each LCH of the M LCHs of the N UEs received by the receiving unit 601 to the buffer of the corresponding IAB LCH according to the mapping relationship determined by the determining subunit 6021.
As a possible implementation, the IAB node may further include:
an obtaining unit 605, configured to obtain a mapping relationship between an LCH of a UE and an IAB LCH and LCP parameters of M LCHs of N UEs;
a generating unit 606, configured to generate the LCP parameters of the IAB LCH according to the mapping relationship, the LCP parameters of the M LCHs of the N UEs, and the generation criterion obtained by the obtaining unit 605;
the generating criteria may include:
the priority bit rate PBR of the IAB LCH is the sum of PBRs of LCHs of the UE corresponding to the IAB LCH, or the product of the minimum value in the PBRs of the LCHs of the UE corresponding to the IAB LCH and the number of the LCHs of the UE corresponding to the IAB LCH, or the product of the maximum value in the PBRs of the LCHs of the UE corresponding to the IAB LCH and the number of the LCHs of the UE corresponding to the IAB LCH;
the BSD of the IAB LCH is the minimum value, the maximum value or the average value in the BSDs of the LCHs of the UE corresponding to the IAB LCH, or the ratio of the sum of the products of the PBRs and the BSDs of the LCHs of the UE corresponding to the IAB LCH and the PBR of the IAB LCH.
Specifically, the scheduling unit 603 is configured to schedule data in the buffer of the IAB LCH according to the priority of the IAB LCH and the LCP parameter generated by the generating unit 606.
More detailed descriptions about the receiving unit 601, the sending unit 602, the scheduling unit 603, the reporting unit 604, the obtaining unit 605 and the generating unit 606 may be directly obtained by referring to the description about the IAB node in the method embodiments shown in fig. 2 to fig. 3, which is not described herein again.
Referring to fig. 7, based on the same concept of the network architecture shown in fig. 1 and the method for scheduling data in the foregoing embodiment, fig. 7 is a schematic structural diagram of another IAB node disclosed in the embodiment of the present invention. The IAB node can be applied to the data scheduling method shown in fig. 4 to 5. As shown in fig. 7, the IAB node may include:
a receiving unit 701, configured to receive data of M LCHs from N UEs, where the data is buffered in an RLC layer, and N and M are integers greater than or equal to 1;
a determining unit 702, configured to determine, according to priorities of M LCHs of N UEs, equivalent priorities of the M LCHs of the N UEs;
a scheduling unit 703, configured to schedule, according to the equivalent priority determined by the determining unit 702, the data of the M LCHs of the N UEs received by the receiving unit 701.
As a possible implementation manner, the determining unit 702 is specifically configured to determine the equivalent priorities of the M LCHs of the N UEs according to a mapping relationship between the priorities of the LCHs of the UEs and the equivalent priorities.
As a possible implementation, the determining unit 702 is specifically configured to determine that a product of the priority of each LCH of the M LCHs of the N UEs and the priority factor is an equivalent priority of each LCH of the M LCHs of the N UEs.
As a possible implementation manner, the priority factor may be determined by at least one of a hop count, a time delay, and a data size stored in each LCH of the M LCHs of the N UEs, where the hop count is the number of IAB nodes from the IAB node to the base station, and the time delay is a time delay between the UE corresponding to each LCH of the M LCHs of the N UEs or the access IAB node and the base station.
As a possible implementation, the scheduling unit 703 may include:
a sending subunit 7031, configured to send, according to the correspondence between the equivalent priority determined by the determining unit 702 and the IAB LCH, all data or part of data of each LCH of the M LCHs of the N UEs received by the receiving unit 701 to a buffer of the IAB LCH, where the buffer belongs to an adaptation layer;
a scheduling subunit 7032, configured to schedule the data in the buffer of the IAB LCH according to the priority of the IAB LCH.
As a possible implementation manner, the IAB node may further include a reporting unit 704.
In an embodiment, the reporting unit 704 is configured to report, by using the MAC CE, a size of data buffered in a buffer in the IAB node;
the MAC CE may include:
an RNTI indicating a UE ID, and information indicating an LCG; or
Reserved bits, and information indicating an LCG;
the information includes an LCG ID or bitmap;
the buffer includes a buffer of the RLC layer.
In another embodiment, the reporting unit 704 is configured to report a size of data buffered in a buffer in the IAB node;
the buffer may comprise a buffer of the adaptation layer or a buffer of the adaptation layer and the RLC layer.
Specifically, the reporting unit 704 reports the size of the data received by the receiving unit 701 buffered in a buffer in the IAB node.
More detailed descriptions about the receiving unit 701, the determining unit 702, the scheduling unit 703 and the reporting unit 704 may be directly obtained by referring to the related descriptions of the IAB node in the method embodiments shown in fig. 4 to fig. 5, which are not described herein again.
Referring to fig. 8, based on the same concept of the network architecture shown in fig. 1 and the method for scheduling data in the foregoing embodiment, fig. 8 is a schematic structural diagram of another IAB node disclosed in the embodiment of the present invention. The IAB node can be applied to the data scheduling method shown in fig. 4 to 5. As shown in fig. 8, the IAB node may include:
a receiving unit 801, configured to receive data of M LCHs from N UEs, where the data is buffered in an RLC layer, N and M are integers greater than or equal to 1;
a determining unit 802, configured to determine, according to priorities of M LCHs of N UEs, equivalent priorities of the M LCHs of the N UEs;
a scheduling unit 803, configured to schedule the data of the M LCHs of the N UEs received by the receiving unit 801 according to the equivalent priority determined by the determining unit 802.
As a possible implementation, the IAB node may further include:
a configuring unit 804, configured to configure an IAB LCH ID;
a mapping unit 805, configured to map, according to the IAB LCH ID configured by the configuration unit 804 or the priorities of the M LCHs of the N UEs, the data of the M LCHs of the N UEs received by the receiving unit 801 onto the corresponding IAB LCH, or map, according to the LCG, the data of the M LCHs of the N UEs onto the corresponding IAB LCG;
a reporting unit 806, configured to report the size of the data buffered by the buffer of the IAB node.
Specifically, the reporting unit 806 reports the size of the data buffered in the buffer of the IAB node and received by the receiving unit 801.
As a possible implementation, the buffer comprises a buffer of the RLC layer.
More detailed descriptions about the receiving unit 801, the determining unit 802, the scheduling unit 803, the configuring unit 804, the mapping unit 805, and the reporting unit 806 may be directly obtained by referring to the description about the IAB node in the method embodiments shown in fig. 4 to fig. 5, which is not described herein again.
Referring to fig. 9, fig. 9 is a schematic structural diagram of another IAB node according to an embodiment of the present invention. As shown in fig. 9, the IAB node may include a processor 901, a memory 902, a transceiver 903, and a bus 904. The processor 901 may be a general purpose Central Processing Unit (CPU), multiple CPUs, a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of programs in accordance with the present invention. The Memory 902 may be, but is not limited to, a Read-Only Memory (ROM) or other type of static storage device that can store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that can store information and instructions, an Electrically Erasable Programmable Read-Only Memory (EEPROM), a Compact Disc Read-Only Memory (CD-ROM) or other optical Disc storage, optical Disc storage (including Compact Disc, laser Disc, optical Disc, digital versatile Disc, blu-ray Disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 902 may be self-contained, and the bus 904 may be coupled to the processor 901. The memory 902 may also be integrated with the processor 901. Bus 904 may include a path that conveys information between the aforementioned components. The transceiver 903 may be a transceiver antenna, or may be another transceiver device. Wherein:
in one embodiment, the IAB node may be applied in the method for data scheduling shown in fig. 2 to fig. 3, where:
a transceiver 903, configured to receive data of M LCHs from N UEs, where the data is buffered in an adaptation layer, N and M are integers greater than or equal to 1;
the memory 902 has a set of program codes stored therein, and the processor 901 is configured to call the program codes stored in the memory 902 to perform the following operations:
sending all data or partial data of each LCH in M LCHs of N UEs to a buffer of an IAB LCH, wherein the buffer belongs to an RLC layer;
and scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH.
As a possible implementation, the sending, by the processor 901, all or part of the data of each LCH of the M LCHs of the N UEs to the buffer of the IAB LCH includes:
and transmitting all data or part of data of each LCH in the M LCHs of the N UEs to a buffer of the IAB LCH in each unit time interval.
As a possible implementation manner, the transceiver 903 is further configured to report the size of the buffered data in the buffer in the IAB node;
the buffer includes a buffer of the RLC layer, or a buffer of the RLC layer and the adaptation layer.
As a possible implementation, the sending, by the processor 901, all or part of the data of each LCH of the M LCHs of the N UEs to the buffer of the IAB LCH includes:
determining the mapping relation between each LCH and IAB LCH in M LCHs of N UEs according to the configuration information;
and sending all data or part of data of each LCH in the M LCHs of the N UEs to a buffer of the corresponding IAB LCH according to the mapping relation.
As a possible implementation, the processor 901 is further configured to call the program code stored in the memory 902 to perform the following operations:
acquiring a mapping relation between an LCH (link control channel) of the UE and an IAB LCH (initial access control channel) and LCP (link control protocol) parameters of M LCHs of N UEs;
generating LCP parameters of the IAB LCH according to the mapping relation, the LCP parameters of the M LCHs of the N UEs and the generation criterion;
the generating criteria may include:
the PBR of the IAB LCH is the sum of the PBRs of the LCHs of the UE corresponding to the IAB LCH, or the product of the minimum value in the PBRs of the LCHs of the UE corresponding to the IAB LCH and the number of the LCHs of the UE corresponding to the IAB LCH, or the product of the maximum value in the PBRs of the LCHs of the UE corresponding to the IAB LCH and the number of the LCHs of the UE corresponding to the IAB LCH;
the BSD of the IAB LCH is the minimum value, the maximum value or the average value in the BSDs of the LCHs of the UE corresponding to the IAB LCH, or the ratio of the sum of the products of the PBRs and the BSDs of the LCHs of the UE corresponding to the IAB LCH and the PBR of the IAB LCH.
Wherein, the steps 202, 203, 302, 304, and 305 can be executed by a processor 901 and a memory 902 in the IAB node, and the steps 201, 301, and 303 can be executed by a transceiver 903 in the IAB node.
The sending unit 602, the scheduling unit 603, the obtaining unit 605, and the generating unit 606 may be implemented by a processor 901 and a memory 902 in the IAB node, and the receiving unit 601 and the reporting unit 604 may be implemented by a transceiver 903 in the IAB node.
In another embodiment, the IAB node may be applied in the method for data scheduling shown in fig. 4 to 5, where:
a transceiver 903, configured to receive data of M LCHs from N UEs, where the data is buffered in an RLC layer, N and M are integers greater than or equal to 1;
the memory 902 has a set of program codes stored therein, and the processor 901 is configured to call the program codes stored in the memory 902 to perform the following operations:
determining the equivalent priorities of M LCHs of N UEs according to the priorities of the M LCHs of the N UEs;
and scheduling the data of M LCHs of the N UEs according to the equivalent priority.
As a possible implementation, the determining, by the processor 901, the equivalent priorities of the M LCHs of the N UEs according to the priorities of the M LCHs of the N UEs includes:
and determining the equivalent priorities of M LCHs of the N UEs according to the mapping relation between the priorities of the LCHs of the UEs and the equivalent priorities.
As a possible implementation, the determining, by the processor 901, the equivalent priorities of the M LCHs of the N UEs according to the priorities of the M LCHs of the N UEs includes:
determining the product of the priority of each of the M LCHs of the N UEs and the priority factor as the equivalent priority of each of the M LCHs of the N UEs.
As a possible implementation manner, the priority factor is determined by at least one of a hop count, a time delay, and a data size stored in each LCH of the M LCHs of the N UEs, where the hop count is the number of IAB nodes from the IAB node to the base station, and the time delay is a time delay between the UE corresponding to each LCH of the M LCHs of the N UEs or the access IAB node and the base station.
As a possible implementation, the scheduling, by the processor 901, data of M LCHs of N UEs according to the equivalent priority includes:
according to the corresponding relation between the equivalent priority and the IAB LCH, sending all data or part of data of each LCH in M LCHs of N UEs to a buffer of the IAB LCH, wherein the buffer belongs to the adaptation layer;
and scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH.
As a possible implementation manner, the transceiver 903 is further configured to report the size of the cached data in the buffer in the IAB node through the MAC CE;
the MAC CE may include:
an RNTI indicating a UE ID, and information indicating an LCG; or
Reserved bits, and information indicating an LCG;
the information includes an LCG ID or bitmap.
As a possible implementation, the processor 901 is further configured to call the program code stored in the memory 902 to perform the following operations:
configuring IAB LCH ID;
mapping the data of M LCHs of N UEs to corresponding IAB LCHs according to the IAB LCH IDs or the priorities of the M LCHs of the N UEs, or mapping the data of the M LCHs of the N UEs to corresponding IAB LCGs according to the LCGs;
the transceiver 903 is further configured to report the size of the buffered data in the buffer in the IAB node.
As a possible implementation, the buffer may comprise a buffer of the RLC layer.
As a possible implementation manner, the transceiver 903 is further configured to report the size of the buffered data in the buffer in the IAB node;
the buffer includes a buffer of the adaptation layer, or a buffer of the adaptation layer and the RLC layer.
Wherein, step 402, step 403, step 502 and step 504 can be executed by a processor 901 and a memory 902 in the IAB node, and step 401, step 501 and step 503 can be executed by a transceiver 903 in the IAB node.
The determining unit 702/802, the scheduling unit 703/803, the configuring unit 804 and the mapping unit 805 may be implemented by the processor 901 and the memory 902 in the IAB node, and the receiving unit 701/801 and the reporting units 704 and 806 may be implemented by the transceiver 903 in the IAB node.
The embodiment of the invention also discloses a readable storage medium, wherein a program is stored on the readable storage medium, and when the program runs, the method for scheduling the data as shown in fig. 2-5 is realized.
Those skilled in the art will recognize that, in one or more of the examples described above, the functions described in this invention may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
In another embodiment of the present application, there is also provided a computer program product comprising computer instructions stored in the computer-readable storage medium described above.
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made on the basis of the technical solutions of the present invention should be included in the scope of the present invention.

Claims (28)

1. A method for data scheduling, the method being applied to an access backhaul integrated IAB node, an adaptation layer of the IAB node being deployed above a Radio Link Control (RLC) layer, the method comprising:
receiving data of M Logical Channels (LCH) from N User Equipments (UE), wherein the data is cached in the adaptation layer, and N and M are integers greater than or equal to 1;
sending all data or partial data of each LCH in M LCHs of the N UEs to a buffer of an IAB LCH, wherein the buffer belongs to an RLC layer;
acquiring a mapping relation between an LCH (logical channel link) of UE (user equipment) and an IAB LCH (initial access control) and logic channel priority LCP (logical channel link protocol) parameters of M LCHs of the N UEs;
generating LCP parameters of the IAB LCH according to the mapping relation, the LCP parameters of the M LCHs of the N UEs and a generation criterion;
and scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH.
2. The method of claim 1, wherein sending all or a portion of data for each of the M LCHs for the N UEs into a buffer of an IAB LCH comprises:
and transmitting all data or part of data of each LCH in the M LCHs of the N UEs to a buffer of the IAB LCH in each unit time interval.
3. The method of claim 1, wherein sending all or a portion of data for each of the M LCHs for the N UEs into a buffer of an IAB LCH comprises:
determining a mapping relation between each LCH in M LCHs of the N UEs and the IAB LCH according to configuration information;
and sending all data or part of data of each LCH in the M LCHs of the N UEs to a buffer of the corresponding IAB LCH according to the mapping relation.
4. The method according to any one of claims 1-3, further comprising:
reporting the size of the cached data in a buffer in the IAB node;
the buffer comprises a buffer of the RLC layer, or comprises buffers of the RLC layer and the adaptation layer.
5. The method according to any of claims 1-3, wherein the generation criteria comprises:
the priority bit rate PBR of the IAB LCH is the sum of PBRs of LCHs of the UE corresponding to the IAB LCH, or the product of the minimum value in the PBRs of the LCHs of the UE corresponding to the IAB LCH and the number of the LCHs of the UE corresponding to the IAB LCH, or the product of the maximum value in the PBRs of the LCHs of the UE corresponding to the IAB LCH and the number of the LCHs of the UE corresponding to the IAB LCH;
the cycle BSD of the token bucket of the IAB LCH is the minimum value, the maximum value or the average value in the BSDs of the LCHs of the UE corresponding to the IAB LCH, or the ratio of the PBR of the IAB LCH to the sum of the products of the PBR and the BSD of the LCH of the UE corresponding to the IAB LCH.
6. A method for data scheduling, the method being applied to an IAB node, an adaptation layer of the IAB node being deployed above a Media Access Control (MAC) layer, the method comprising:
receiving M LCH data from N UEs, wherein the data are cached in an RLC layer, and N and M are integers greater than or equal to 1;
determining a product of a priority of each LCH of the M LCHs of the N UEs and a priority factor as an equivalent priority of the each LCH, wherein the priority factor is determined by at least one of hop count, time delay and size of data stored in the each LCH;
and scheduling the data of M LCHs of the N UEs according to the equivalent priority.
7. The method of claim 6, wherein the hop count is the number of IAB nodes from the IAB node to a base station, and the delay is a delay between the UE or access IAB node corresponding to each LCH and the base station.
8. The method of claim 6 or 7, wherein the scheduling data of the M LCHs of the N UEs according to the equivalent priority comprises:
sending all data or part of data of each LCH in M LCHs of the N UEs to a buffer of the IAB LCH according to the corresponding relation between the equivalent priority and the IAB LCH, wherein the buffer belongs to the adaptation layer;
and scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH.
9. The method according to claim 6 or 7, characterized in that the method further comprises:
reporting the size of the cached data in a buffer in the IAB node through an MAC control element CE;
the MAC CE includes:
a Radio Network Temporary Identity (RNTI) for indicating a UE ID and information for indicating a Logical Channel Group (LCG); or
Reserved bits, and information indicating an LCG;
the information includes an LCG ID or a bitmap.
10. The method according to claim 6 or 7, characterized in that the method further comprises:
configuring IAB LCH ID;
mapping the data of the M LCHs of the N UEs to corresponding IAB LCHs according to the IAB LCH IDs or the priorities of the M LCHs of the N UEs, or mapping the data of the M LCHs of the N UEs to corresponding IAB LCGs according to LCGs;
and reporting the size of the cached data in the buffer in the IAB node.
11. The method of claim 9, wherein the buffer comprises a buffer of the RLC layer.
12. The method of claim 10, wherein the buffer comprises a buffer of the RLC layer.
13. The method of claim 8, further comprising:
reporting the size of the cached data in a buffer in the IAB node;
the buffer comprises a buffer of the adaptation layer, or comprises buffers of the adaptation layer and the RLC layer.
14. An IAB node, wherein an adaptation layer of the IAB node is deployed above an RLC layer, comprising:
a receiving unit, configured to receive data of M LCHs from N UEs, where the data is cached in the adaptation layer, and N and M are integers greater than or equal to 1;
a sending unit, configured to send all or part of the data of each LCH of the M LCHs of the N UEs received by the receiving unit to a buffer of an IAB LCH, where the buffer belongs to an RLC layer;
an obtaining unit, configured to obtain a mapping relationship between an LCH of a UE and an IAB LCH, and LCP parameters of M LCHs of the N UEs;
a generating unit, configured to generate LCP parameters of the IAB LCH according to the mapping relationship, the LCP parameters of the M LCHs of the N UEs, and a generation criterion that are obtained by the obtaining unit;
and the scheduling unit is used for scheduling the data in the buffer of the IAB LCH according to the priority of the IAB LCH.
15. The IAB node of claim 14, wherein the sending unit is specifically configured to send all or part of data of each LCH of the M LCHs of the N UEs to a buffer of an IAB LCH in each unit time interval.
16. The IAB node of claim 14, wherein the sending unit comprises:
a determining subunit, configured to determine, according to the configuration information, a mapping relationship between each LCH of the M LCHs of the N UEs and the IAB LCH;
and a sending subunit, configured to send, according to the mapping relationship determined by the determining subunit, all data or part of data of each LCH of the M LCHs of the N UEs received by the receiving unit to a buffer of the corresponding IAB LCH.
17. The IAB node of any of claims 14-16, wherein the IAB node further comprises:
a reporting unit, configured to report the size of the cached data in the buffer in the IAB node;
the buffer comprises a buffer of the RLC layer, or comprises buffers of the RLC layer and the adaptation layer.
18. The IAB node of any of claims 14-16, wherein the generation criteria comprises:
the PBR of the IAB LCH is the sum of PBRs of LCHs of the UE corresponding to the IAB LCH, or the product of the minimum value in the PBRs of the LCHs of the UE corresponding to the IAB LCH and the number of the LCHs of the UE corresponding to the IAB LCH, or the product of the maximum value in the PBRs of the LCHs of the UE corresponding to the IAB LCH and the number of the LCHs of the UE corresponding to the IAB LCH;
the BSD of the IAB LCH is the minimum value, the maximum value or the average value in the BSDs of the LCHs of the UE corresponding to the IAB LCH, or the ratio of the PBR of the IAB LCH to the sum of the products of the PBR and the BSD of the LCH of the UE corresponding to the IAB LCH.
19. An IAB node, wherein an adaptation layer of the IAB node is deployed above a MAC layer, comprising:
a receiving unit, configured to receive data of M LCHs from N UEs, where the data is buffered in an RLC layer, and N and M are integers greater than or equal to 1;
a determining unit, configured to determine that a product of a priority of each LCH of the M LCHs of the N UEs and a priority factor is an equivalent priority of the each LCH, where the priority factor is determined by at least one of a hop count, a delay, and a size of data stored in the each LCH;
and the scheduling unit is used for scheduling the data of the M LCHs of the N UEs received by the receiving unit according to the equivalent priority determined by the determining unit.
20. The IAB node of claim 19, wherein the hop count is the number of IAB nodes from the IAB node to a base station, and the delay is a delay between the UE or access IAB node corresponding to each LCH and the base station.
21. The IAB node of claim 19 or 20, wherein the scheduling unit comprises:
a sending subunit, configured to send, according to the correspondence between the equivalent priority determined by the determining unit and the IAB LCH, all or part of the data of each LCH of the M LCHs of the N UEs received by the receiving unit to a buffer of the IAB LCH, where the buffer belongs to the adaptation layer;
and the scheduling subunit is used for scheduling the data sent by the sending subunit to the buffer of the IAB LCH according to the priority of the IAB LCH.
22. The IAB node of claim 19 or 20, wherein the IAB node further comprises:
a reporting unit, configured to report, by using an MAC CE, a size of data cached in a buffer in the IAB node;
the MAC CE includes:
an RNTI indicating a UE ID, and information indicating an LCG; or
Reserved bits, and information indicating an LCG;
the information includes an LCG ID or a bitmap.
23. The IAB node of claim 19 or 20, wherein the IAB node further comprises:
a configuration unit, configured to configure an IAB LCH ID;
a mapping unit, configured to map, according to the IAB LCH ID configured by the configuration unit or the priorities of the M LCHs of the N UEs, data of the M LCHs of the N UEs to corresponding IAB LCHs, or map, according to the LCGs, data of the M LCHs of the N UEs to corresponding IAB LCGs;
and the reporting unit is used for reporting the size of the cache data in the buffer in the IAB node.
24. The IAB node of claim 22, wherein the buffer comprises a buffer of the RLC layer.
25. The IAB node of claim 23, wherein the buffer comprises a buffer of the RLC layer.
26. The IAB node of claim 21, wherein the IAB node further comprises:
a reporting unit, configured to report the size of the cached data in the buffer in the IAB node;
the buffer comprises a buffer of the adaptation layer, or comprises buffers of the adaptation layer and the RLC layer.
27. An IAB node, comprising:
hardware associated with program instructions for performing the method steps of any one of claims 1-13.
28. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored thereon a program which, when executed, implements a method of data scheduling according to any one of claims 1-13.
CN201810646900.1A 2018-06-21 2018-06-21 Data scheduling method and device Active CN110636555B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201810646900.1A CN110636555B (en) 2018-06-21 2018-06-21 Data scheduling method and device
PCT/CN2019/091692 WO2019242603A1 (en) 2018-06-21 2019-06-18 Data scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810646900.1A CN110636555B (en) 2018-06-21 2018-06-21 Data scheduling method and device

Publications (2)

Publication Number Publication Date
CN110636555A CN110636555A (en) 2019-12-31
CN110636555B true CN110636555B (en) 2022-04-12

Family

ID=68966993

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810646900.1A Active CN110636555B (en) 2018-06-21 2018-06-21 Data scheduling method and device

Country Status (2)

Country Link
CN (1) CN110636555B (en)
WO (1) WO2019242603A1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110830182B (en) * 2018-08-09 2023-08-01 北京三星通信技术研究有限公司 Method and device for retransmitting data
CN111050353B (en) 2018-10-11 2021-12-03 华为技术有限公司 Data transmission method and device for wireless backhaul network
WO2020166859A1 (en) * 2019-02-11 2020-08-20 Lg Electronics Inc. Method and apparatus for transmitting buffer status report by iab node in wireless communication system
EP4193658A4 (en) * 2020-09-11 2024-01-10 Samsung Electronics Co Ltd Method and network entity for logical channel management in a wireless communication network
JP2023542318A (en) * 2020-09-25 2023-10-06 富士通株式会社 Resource allocation methods, devices and systems
CN114390551A (en) * 2020-10-19 2022-04-22 维沃移动通信有限公司 Configuration method and device of preemptive BSR (buffer status report) and electronic equipment
CN116458252A (en) * 2020-12-22 2023-07-18 华为技术有限公司 Node scheduling method and device

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104521305A (en) * 2012-08-02 2015-04-15 三菱电机株式会社 Communication system
CN106488577A (en) * 2016-09-26 2017-03-08 华为技术有限公司 The method of transmission information and user equipment
WO2017196249A1 (en) * 2016-05-13 2017-11-16 Telefonaktiebolaget Lm Ericsson (Publ) Network architecture, methods, and devices for a wireless communications network
CN107371223A (en) * 2010-02-12 2017-11-21 三菱电机株式会社 Gsm
CN107736004A (en) * 2015-06-30 2018-02-23 高通股份有限公司 Traffic stream migration in backhaul network
WO2018049283A1 (en) * 2016-09-09 2018-03-15 Qualcomm Incorporated Methods and apparatus for formatting a protocol data unit for wireless communication
CN107852363A (en) * 2015-06-30 2018-03-27 高通股份有限公司 Management to the network routed domain in communication network
WO2018063892A1 (en) * 2016-09-29 2018-04-05 At&T Intellectual Property I, L.P. Initial access and radio resource management for integrated access and backhaul (iab) wireless networks
CN108063659A (en) * 2011-04-28 2018-05-22 三菱电机株式会社 Communication system

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2010148086A2 (en) * 2009-06-16 2010-12-23 Interdigital Patent Holdings, Inc. Method and apparatus for synchronous harq operation and interference avoidance
CN101932007B (en) * 2009-06-22 2014-02-26 中兴通讯股份有限公司 Method and wireless relay system for realizing service flow transmission of mobile terminal
US20130016630A1 (en) * 2011-07-12 2013-01-17 Qualcomm Incorporated Beacons for user equipment relays
US20140126454A1 (en) * 2012-11-05 2014-05-08 Qualcomm Incorporated Embms support in heterogeneous network
CN107645747B (en) * 2016-07-22 2020-02-21 电信科学技术研究院 Method and equipment for sending and receiving data

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107371223A (en) * 2010-02-12 2017-11-21 三菱电机株式会社 Gsm
CN108063659A (en) * 2011-04-28 2018-05-22 三菱电机株式会社 Communication system
CN104521305A (en) * 2012-08-02 2015-04-15 三菱电机株式会社 Communication system
CN107736004A (en) * 2015-06-30 2018-02-23 高通股份有限公司 Traffic stream migration in backhaul network
CN107852363A (en) * 2015-06-30 2018-03-27 高通股份有限公司 Management to the network routed domain in communication network
WO2017196249A1 (en) * 2016-05-13 2017-11-16 Telefonaktiebolaget Lm Ericsson (Publ) Network architecture, methods, and devices for a wireless communications network
WO2018049283A1 (en) * 2016-09-09 2018-03-15 Qualcomm Incorporated Methods and apparatus for formatting a protocol data unit for wireless communication
CN106488577A (en) * 2016-09-26 2017-03-08 华为技术有限公司 The method of transmission information and user equipment
WO2018063892A1 (en) * 2016-09-29 2018-04-05 At&T Intellectual Property I, L.P. Initial access and radio resource management for integrated access and backhaul (iab) wireless networks

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"UP protocol design for architecture 1a";Huawei;《3GPP TSG-RAN WG3 #100 R3-183182》;20180525;参见第1-3页，第1节至第2.2.1节，图1-3 *
"Way Forward – IAB Architecture for L2/3 relaying";Qualcomm Inc, KDDI, AT&T, Nokia, Nokia Shanghai Bell, Huawei, E;《3GPP TSG-RAN WG3 Meeting #99 R3-181502》;20180302;全文 *
Huawei, Hisilicon."Adaptation layer based L2 relaying and light L2 relaying".《3GPP TSG-RAN WG2 #101bis R2-1806126》.2018, *

Also Published As

Publication number Publication date
WO2019242603A1 (en) 2019-12-26
CN110636555A (en) 2019-12-31

Similar Documents

Publication Publication Date Title
CN110636555B (en) Data scheduling method and device
US11800429B2 (en) Methods and systems for routing data through IAB nodes in 5G communication networks
RU2678691C2 (en) Efficient mechanisms of planning upperlink for double connection
CN103746936B (en) For the method and WTRU from WTRU scheduled uplink datas
KR101182175B1 (en) Mapping services to radio bearers and allocating bandwidth to the radio bearers according to weight values
CN102577499B (en) For the method and apparatus of resource management
CN111278049B (en) Method and communication device for supporting time-sensitive communication service quality
CN111107634B (en) Data transmission method and device for wireless backhaul network
US20070047553A1 (en) Uplink scheduling in wireless networks
CN111586749B (en) Downlink cache state feedback method and device
US8130709B2 (en) Apparatus and method for transmitting and receiving control information for uplink data in a mobile communication system and system thereof
EP3251451B1 (en) Method and device for selecting uplink data
US20100260153A1 (en) Method for data transmission in a mesh mode of a wireless communication network
JP5179589B2 (en) Method and apparatus for adjusting reverse data rate in mobile communication system
JP2013515420A (en) Control of service quality in relays
WO2020083365A1 (en) Transmission control method and device
CN110809293B (en) Resource scheduling method and equipment for wireless backhaul path
KR20220044328A (en) Routing method, BSR creation method, device and storage medium
WO2020199829A1 (en) Buffer state report transmission method and apparatus
WO2018000220A1 (en) Data transmission method, apparatus and system
JP2013502814A (en) Method and apparatus for measuring usage of radio resources by traffic class in radio communication system
CN107426823B (en) Method and system for multiplexing media access control layer
CN107113821A (en) The method and apparatus of transmitting uplink data
US10645686B2 (en) Resource reservation protocol for wireless backhaul
KR20210065098A (en) Communication device, infrastructure equipment and methods

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant