Method for providing traffic control information in opposite direction of data traffic in integrated access backhaul network of adaptation layer
By introducing end-to-end and point-to-point traffic control mechanisms in the IAB network, the problem of HFN asynchrony and lossless handover support is solved, scheduling fairness and congestion avoidance in the IAB nodes are achieved, and the sequence number overhead is reduced.
Patent Information
- Application Number
- CN202411185768.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2018-06-21
- Filing Date
- 2019-06-18
- Publication Date
- 2024-11-15
AI Technical Summary
In the IAB network of cellular networks, the lack of effective traffic control mechanisms makes it difficult to support HFN asynchronous and lossless handover, and congestion in IAB nodes and scheduling fairness between UEs are difficult to achieve.
An end-to-end and point-to-point traffic control mechanism is introduced, and by passing PDCP status information in the IAB network, maintaining the PDCP reception window, and configuring a reorder timer to provide traffic control information to promote scheduling fairness among IAB nodes.
Effectively prevent HFN from being synchronized, support lossless handover, avoid congestion of IAB nodes, and realize scheduling fairness among UEs, reducing the overhead and complexity of additional serial numbers.
Smart Images

Figure CN118972325A_ABST
Abstract
Description
Technical Field
[0001] The following disclosure relates to transmission technology in cellular networks. In particular, the following disclosure relates to flow control in an Integrated Access and Backhaul (IAB) network. Background Art
[0002] Wireless communication systems such as the third generation (3G) mobile phone standards and technologies are well known. Such 3G standards and technologies were developed by the Third Generation Partnership Project (3GPP). The third generation of wireless communications is generally developed to support macro-mobile phone communications. Communication systems and networks have been developed towards broadband and mobile systems.
[0003] In a cellular wireless communication system, a user equipment (UE) is connected to a radio access network (RAN) via a radio link. The RAN includes a set of base stations that provide radio links to UEs located in cells covered by the base stations, and is connected to a core network (CN) that provides overall network control. As will be appreciated, the RAN and CN each perform their own functions for the entire network. For convenience, the term cellular network will be used to refer to the combined RAN and CN, and it will be understood that the term is used to refer to the various systems used to perform the disclosed functions.
[0004] The 3rd Generation Partnership Project developed the so-called Long Term Evolution (LTE) system, the evolved UMTS Terrestrial Radio Access Network (E-UTRAN), as a mobile access network in which one or more macro cells are covered by base stations called eNodeB or eNB (evolved NodeB). Recently, LTE is further developing towards the so-called 5G or NR (New Radio) system, in which one or more cells are covered by base stations called gNB. It is recommended that NR use the Orthogonal Frequency Division Multiplexed (OFDM) physical transmission format.
[0005] Regarding IAB networks, typically on the Uu radio interface, the protocol stack of the NR User Plane (UP) does not explicitly provide a flow control mechanism. For Acknowledged Mode (AM), in both the Uplink (UL) and Downlink (DL), the sender's Packet Data Convergence Protocol (PDCP) entity knows that the highest-order PDCP Protocol Data Unit (PDU) has been delivered to the receiver's PDCP entity. In this case, the sender's PDCP entity indirectly obtains this information from the Automatic Repeat-reQuest (ARQ) feedback of the AM mode of the Radio Link Control (RLC) protocol. For Unacknowledged Mode (UM), in both UL and DL, the sender's PDCP entity knows the highest-order PDCP PDU successfully sent to the receiver's PDCP entity (maximum PDCP COUNT successfully sent). In this case, the PDCP entity at the sender obtains this information indirectly from the Hybrid Automatic Repeat reQuest (HARQ) feedback or the Port Physical Layer (PHY) feedback to confirm that the PDCP PDU has been transmitted over the Uu interface. In the DL direction, in the high-level split architecture (Split Architecture) of the gNB (Centralized Unit (CU) / Distributed Unit (DU)), a flow control mechanism is available on F1-U, which helps to pass information from lower layers (such as ARQ or HARQ feedback) or equivalent information (about specific delivered / sent PDUs) to the centralized unit pointing to the PDCP entity. This information is communicated on a per-UE / bearer basis and uses the NR user plane protocol defined in 3GPP TS 38.425. Therefore, implicit flow control mechanisms are only provided on the Uu radio interface, while explicit flow control mechanisms are defined on the F1-U interface.
[0006] Flow control is important because it can be used to resolve the Hyper Frame Number (HFN) desynchronization problem. The PDCP transmitter can avoid the HFN desynchronization problem by avoiding sending more than half of the PDCP Sequence Number (SN) space without acknowledging that it has been delivered to the receiving PDCP entity. This means that at any given point in time, a maximum range of half of the PDCP sequence number space may be pending (i.e., it has been sent by the PDCP transmitter but has not yet been considered to have been received by the PDCP receiver).
[0007] Flow control is also important to enable lossless handover (for AM bearers). To achieve lossless handover, the PDCP entity on the sender side starts retransmitting the PDCP service data units (SDUs) from the new link, starting from the first PDCP SDU that was unsuccessfully transmitted on the old link. In other words, the PDCP entity on the sender side needs to know the delivery status of the PDCP PDUs so that it can discard such PDUs when necessary (because those PDUs will no longer be considered for retransmission).
[0008] In the IAB tree, transmissions between PDCP entities involve multiple hops, i.e., multiple links on the Uu radio interface. At each intermediate node, packets may be dropped in case of downstream congestion (e.g., temporary blockage on one of the links towards the receiver). This problem is exacerbated by the fact that the network scheduler on a parent IAB node only has direct link information on the UE or IAB node to which it is connected. That is, if a parent IAB node serves an IAB bearer that aggregates multiple UEs, and one of the downstream links of one of the UEs (served by another node downstream) becomes congested (e.g., temporarily blocked), the parent IAB node will have no visibility on this blockage and continue to schedule data packets for the UE. These packets may have to be dropped by the node serving the congested link.
[0009] Therefore, there is a need for a communication protocol for efficient operation of integrated access and wireless backhaul for NR.
[0010] The present invention proposes to introduce end-to-end (E2E) flow control and / or hop-to-hop flow control within the IAB tree. End-to-end flow control is required to enable legacy PDCP data transmission operations (including preventing HFN desynchronization and lossless handover support). Point-to-point flow control is required to avoid congestion in IAB nodes and related SDU discards, and to provide scheduling fairness between UEs. Summary of the invention
[0011] This Summary is provided to introduce some concepts in a simplified form that are further described in the Detailed Description below. This Summary is not intended to identify key features or essential features of the claimed claims, nor is it intended to be used as an aid in determining the scope of the claimed claims.
[0012] A method for data flow control in an IAB network of an adaptation layer is provided. For each of a plurality of UEs, the method comprises the following steps: in a downlink (DL) environment, transmitting a polling request configured to facilitate requesting PDCP status information; or in an uplink (UL) environment, transmitting PDCP status information; the PDCP status information comprises sequence data indicating the following: the highest order PDCP SN or PDCP COUNT of the PDCP PDU, the PDCP PDU successfully delivered or sent to the UE, or the first lost PDCP SN or PDCP COUNT of the PDCP PDU, based on the PDCP PDU successfully delivered or sent to the UE.
[0013] Optionally, the method further includes maintaining a PDCP reception window at the IAB access node based on the PDCP PDU successfully delivered to or successfully sent to the UE, and generating PDCP status information based on the PDCP reception window when needed.
[0014] Optionally, the method further includes: determining, at the IAB access node, that the PDCP PDU has been successfully delivered to the UE based on an acknowledgement character (ACK) of the RLC received from the UE.
[0015] Optionally, the method further comprises: determining, at the IAB access node, that the PDCP PDU has been successfully sent to the UE based on received HARQ feedback or PHY feedback of successful transmission.
[0016] Optionally, maintaining the PDCP reception window further includes determining whether there is a gap in a PDCP PDU sequence in the NR, and if it is determined that there is a gap, clearing the gap after a configured reordering timer expires.
[0017] Optionally, a reordering timer is configured on the access IAB node. Further optionally, a value of the reordering timer configured on the access IAB node is the same as or higher than a value configured on the UE.
[0018] Optionally, the polling request includes a polling bit.
[0019] Optionally, PDCP COUNT corresponds to RX_DELIV_IN.
[0020] An IAB network configured to perform a data flow control method is also provided. The network includes: a centralized unit of an IAB-donor, configured to implement a user plane protocol (NUPP) of NR and configured to poll the status information of PDCP; a distributed unit of the IAB-donor, configured to forward the polling request at the adaptation layer; and optionally, one or more intermediate IAB nodes, configured to forward the polling request and / or the status information of PDCP between the distributed unit and a mobile terminal (Mobile-Termination, MT).
[0021] Optionally, the network also includes an access IAB node configured to implement a PDCP receiving window; optionally, the access IAB node is also configured to generate a PDCP state and send the generated PDCP state to a distribution unit of the IAB host; the distribution unit of the IAB host is configured to relay the PDCP state from the adaptation layer to the user plane protocol of the NR.
[0022] Optionally, the access IAB node is further configured to: poll the UE, preferably at the RLC level, whenever a polling request is received, and send the PDCP status information only after receiving the PDCP status information from the UE in response to the polling of the UE.
[0023] A method for data flow control in an IAB network of an adaptation layer is also provided. For each UE of a plurality of UEs, the method comprises the following steps: in an uplink (UL) environment, transmitting a polling request configured to facilitate requesting PDCP status information; and in a downlink (DL) environment, transmitting PDCP status information; the PDCP status information comprises sequence data indicating the following: the highest order PDCP SN or PDCP COUNT of the PDCP PDU, the PDCP PDU successfully delivered or sent to the centralized unit, or the first lost PDCP SN or PDCP COUNT of the PDCP PDU, based on the PDCP PDU successfully delivered or sent to the centralized unit.
[0024] An IAB network configured to perform a data flow control method is also provided. The network includes an access IAB node configured to send a polling request to obtain a PDCP state as needed; a distribution unit of the IAB host configured to generate a PDCP state when polling and send the PDCP state back to the adaptation layer, and one or more optional intermediate IAB nodes configured to forward the polling request and / or PDCP state information between the distribution unit and the mobile terminal.
[0025] Optionally, generating the PDCP state at the distributed unit of the IAB host includes: configuring the distributed unit of the IAB host to implement and / or maintain a PDCP receiving window for generating PDCP state information.
[0026] Optionally, generating a PDCP state at a distribution unit of the IAB host includes:
[0027] The polling field in the user plane protocol relayed from the adaptation layer to the NR on the distribution unit hosting the IAB;
[0028] On the centralized unit hosting the IAB, the poll is forwarded to the PDCP, which is configured to return the PDCP status;
[0029] On a centralized unit hosting the IAB, including the PDCP status in the user plane protocol frames of the NR; or
[0030] Relaying the PDCP status from the user plane protocol of NR to the adaptation layer on the distributed unit hosted by the IAB.
[0031] Optionally, the distribution unit of the IAB host is further configured with a reordering timer for maintaining the receiving window.
[0032] Optionally, the network also includes: an access IAB node configured to limit the ACK_SN process of the RLC to data packets, and delivered data packets that are effectively confirmed by the PDCP status; optionally, wherein the access IAB node is further used to limit MAC scheduling so that, preferably based on the PDCP status information, no more than half of the PDCP sequence numbers are pending.
[0033] Optionally, any of the above methods further includes: providing flow control information for each of the multiple UEs at the adaptation layer, where the flow control information is configured to facilitate point-to-point flow control between IAB nodes.
[0034] Optionally, the flow control information includes one or more relative scheduling weights.
[0035] Optionally, the method further includes: determining, at the access IAB node, a respective relative scheduling weight of each UE among the plurality of UEs; and sending the respective relative scheduling weights to a parent IAB node of the access IAB node; optionally, the parent IAB node includes one of an IAB node and an IAB host.
[0036] Optionally, the method further includes: determining a total scheduling weight based on one or more relative scheduling weights; and / or determining a normalized relative scheduling weight based on one or more relative scheduling weights.
[0037] Optionally, the method further includes: sending one or more relative scheduling weights, a total scheduling weight and / or a normalized relative scheduling weight to an RLC bearer of the IAB.
[0038] Optionally, the traffic control information includes one or more absolute scheduling costs; optionally, the one or more absolute scheduling costs are determined based on radio frequency resources.
[0039] Optionally, the method further includes: determining, at the access IAB node, respective absolute scheduling costs for each of the plurality of UEs; and sending respective absolute scheduling costs to a parent IAB node of the access IAB node; optionally, the parent IAB node includes one of an IAB node and an IAB host.
[0040] Optionally, the method further comprises: determining a total dispatch cost based on one or more absolute dispatch costs; and / or determining a normalized absolute dispatch cost based on one or more absolute dispatch costs.
[0041] Optionally, the method further includes: sending one or more absolute scheduling costs, total scheduling costs and / or normalized absolute scheduling costs to the RLC bearer of the IAB.
[0042] Optionally, the method further comprises determining the downstream scheduling based on a relative scheduling weight or an absolute scheduling cost.
[0043] Optionally, the method further includes: aggregating relative scheduling weights or absolute scheduling costs; and determining downstream scheduling based on the aggregated relative scheduling weights or absolute scheduling costs.
[0044] Optionally, the method further comprises determining one or more relative scheduling weights or one or more absolute scheduling costs based at least in part on a maximum achievable throughput for each UE.
[0045] A non-transitory computer-readable medium is further provided, which contains a computer program configured to implement the data flow control method. The non-transitory computer-readable medium may include at least one of the following group: a hard disk, a CD-ROM, an optical storage device, a magnetic storage device, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an EPROM, an electrically erasable programmable read-only memory, and a flash memory. BRIEF DESCRIPTION OF THE DRAWINGS
[0046] Further details, aspects and embodiments of the present invention will be described with reference to the accompanying drawings by way of example only. The elements in the drawings are drawn for simplicity and clarity and are not necessarily drawn to scale. For ease of understanding, similar reference numerals are included in the corresponding drawings.
[0047] Figure 1is a reference diagram of an IAB architecture provided by an embodiment of the present invention;
[0048] FIG2 is a schematic diagram of a proposed architecture group 1 including architectures 1a and 1b provided by an embodiment of the present invention;
[0049] Figure 3 A schematic diagram of a protocol stack of an L2 relay with an adaptation layer for the architecture 1a shown in FIG2 provided by an embodiment of the present invention;
[0050] Figure 4 is a schematic diagram of an exemplary data flow between a centralized unit, a distributed unit and a UE provided by an embodiment of the present invention;
[0051] Figure 5 It is a schematic diagram of an exemplary data traffic of two bearers serving user equipment A and B backhauled on the same RLC bearer of an IAB provided by an embodiment of the present invention;
[0052] Figure 6 is a schematic diagram of an exemplary baseline architecture provided by an embodiment of the present invention;
[0053] Figure 7 is a schematic diagram of another exemplary baseline architecture provided by an embodiment of the present invention;
[0054] Figure 8 It is a schematic diagram of an example of a PDCP reception window state variable in an IAB node and a UE within a given time provided by an embodiment of the present invention;
[0055] Fig. 9 and Fig.10 is a schematic diagram of a point-to-point flow control provided by an embodiment of the present invention;
[0056] Fig.11 It is a schematic diagram of providing absolute scheduling cost provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0057] Those skilled in the art will recognize and appreciate that the details of the described examples are merely illustrative of some embodiments and that the teachings set forth herein are applicable to a variety of alternative arrangements.
[0058] Figure 1A reference diagram of the IAB architecture is shown. In general, the IAB strives to reuse existing functions and interfaces defined for access. In particular, the Mobile Terminal (MT), gNB-DU, gNB-CU, User Plane Function (UPF), Access and Mobility Management Function (AMF) and Session Management Function (SMF) and the corresponding interfaces NR's Uu interface (between MT and gNB), F1, NG, X2 and N4 are used as the baseline for the IAB architecture. The functions of the mobile terminal have been defined as the components of the mobile device. Herein, the mobile terminal is referred to as a function residing on the IAB node that terminates the radio interface layer of the backhaul Uu interface towards the IAB host or other IAB nodes.
[0059] Figure 1 A reference diagram of the IAB in standalone mode is shown, containing one IAB Host and multiple IAB Nodes. The IAB Host is considered as a single logical node that contains a set of functions such as gNB-DU, gNB-CU-CP, gNB-CU-UP, and possibly other functions. In a deployment, the IAB Host may be split based on these functions, which may or may not all be collocated, as allowed by the 3GPP Radio Access Network (NG-RAN) architecture. When such a split is made, IAB-related aspects may arise, which will be explored later in the study. Similarly, some functions currently associated with the IAB Host may eventually be moved outside the Host if it is clear that they do not perform IAB-specific tasks.
[0060] Figure 2 shows a proposed architecture group 1 including architectures 1a and 1b. The proposed IAB multi-hop design can be represented based on five architecture reference diagrams, two of which are shown in Figure 2. These architectures differ in the required modifications on the interfaces or other functionalities required (e.g., to accomplish multi-hop forwarding) and are divided into two architecture groups.
[0061] The main features of architecture group 1 are shown in Figure 2. Architecture group 1 includes architectures 1a and 1b. Both architectures utilize the CU / DU split architecture. In architecture 1a, the backhaul of F1-U uses the adaptation layer or a combination of GTP-U and the adaptation layer, and the point-to-point forwarding across intermediate nodes uses the adaptation layer. In architecture 1b, the backhaul of F1-U on the access node uses GTP-U / UDP / IP, while the point-to-point forwarding across intermediate nodes uses the adaptation layer.
[0062] Architecture 1a utilizes a CU / DU split architecture. Figure 2(1a) shows a reference diagram of a two-hop link of an IAB node below an IAB host. In this architecture, each IAB node consists of a distribution unit and a mobile terminal. The IAB node is connected to an upstream IAB node or IAB host through the mobile terminal. The IAB node establishes an RLC channel to the mobile terminal of the UE and the downstream IAB node through the distribution unit. For the mobile terminal, this RLC channel may refer to a modified RLC*. Whether an IAB node can be connected to multiple upstream IAB nodes or IAB hosts is for further study (For Further Study, FFS).
[0063] The host also holds a distribution unit to support UEs and mobile terminals at downstream IAB nodes. The IAB host maintains a centralized unit for the distributed units of all IAB nodes and its own distributed units. Whether different centralized units can serve the distributed units of an IAB node is for further study (FFS). Each distributed unit on an IAB node is connected to the centralized unit in the IAB host using a modified form of F1, called F1*. F1*-U runs over an RLC channel on the wireless backhaul between the mobile terminals on the serving IAB node and the distributed unit on the host. The transmission of F1*-U between the mobile terminals on the serving IAB node and the distributed unit, and between the distributed unit on the host and the centralized unit is for further study (FFS). An adaptation layer containing routing information is added to enable point-to-point forwarding. It replaces the IP functionality of the standard F1 stack. F1*-U can carry a GTP-U header for end-to-end association between the centralized unit and the distributed unit. In a further enhancement, the information carried in the GTP-U header can be included in the adaptation layer. In addition, optimizations to RLC can be considered, such as applying ARQ only on end-to-end connections as opposed to point-to-point. Two examples of such F1*-U protocol stacks are shown on the right side of Figure 2(1a). In this figure, the enhancements to RLC are referred to as RLC*. The mobile terminal of each IAB node further maintains a connection between the non-access stratum (NAS) and the core network (NextGeneration Core, NGC), for example, for authentication of the IAB node. It also maintains PDU sessions through the NGC, for example, providing the IAB node with a connection to operation and maintenance (OAM).
[0064] Architecture 1b also utilizes a CU / DU split architecture. Figure 2(1b) shows a reference diagram of a two-hop link of an IAB node below an IAB host. Note that the IAB host contains only one logical centralized unit. Whether an IAB node can be connected to multiple upstream IAB nodes or IAB hosts is for further study (FFS). In this architecture, each IAB node and IAB host has the same functionality as architecture 1a (see Figure 2(1a)). Moreover, as in architecture 1a, an RLC channel is established for each backhaul link, and an adaptation layer is inserted to achieve hop-by-hop forwarding of F1*. In contrast to architecture 1a, the mobile terminal on each IAB node establishes a PDU session with the UPF residing on the host. The PDU session of the mobile terminal carries F1* for the collocated distribution unit. In this way, the PDU session provides a point-to-point link between the centralized unit and the distribution unit. At the intermediate hops, the PDCP-PDU of F1* is forwarded by the adaptation layer in the same manner as described in architecture 1a. An example of an F1*-U protocol stack is shown on the right side of Figure 2(1b).
[0065] Architecture Group 2 (not shown) includes Architectures 2a, 2b, and 2c. In Architecture 2a, the backhaul of F1-U or NG-U on the access node uses GTP-U / UDP / IP, and the hop-by-hop forwarding across the intermediate nodes uses PDU session layer routing. In Architecture 2b, the backhaul of F1-U or NG-U on the access node uses GTP-U / UDP / IP, and the hop-by-hop forwarding across the intermediate nodes uses GTP-U / UDP / IP nested tunnelling. In Architecture 2c, the backhaul of F1-U or NG-U on the access node uses GTP-U / UDP / IP, and the hop-by-hop forwarding across the intermediate nodes uses GTP-U / UDP / IP / PDCP nested tunnelling.
[0066] In the following, we focus on architecture group 1, and in particular architecture 1a. It should be understood that architecture 1a can minimize the overhead on the Uu interface.
[0067] Figure 3 The proposed protocol stack for L2 relay with adaptation layer for architecture 1a is shown. The UE establishes RLC channels to the distribution unit at the UE's access IAB node according to TS38.300. Each of these RLC channels is extended by a potential modified form of F1-U, called F1*-U, between the UE's access distribution unit and the IAB host. The information embedded in F1*-U is transmitted on the RLC channel over the backhaul link. The transmission of F1*-U on the wireless backhaul is implemented by the adaptation layer, which can be located above or below the RLC layer.
[0068] The functions supported by the adaptation layer are as follows. In architecture 1a, the information carried on the adaptation layer supports: identification of the UE bearer of the PDU, routing across wireless backhaul topologies, QoS enforcement by the scheduler on the DL and UL of the wireless backhaul link (QoS-enforcement), and mapping of the UE's user plane PDU to the backhaul RLC channel. In architecture 1b, the information carried on the adaptation layer supports: routing across wireless backhaul topologies, QoS enforcement by the scheduler on the DL and UL of the wireless backhaul link, and mapping of the UE's user plane PDU to the backhaul RLC channel.
[0069] The content carried in the adaptation layer header may include: UE bearer specific ID, UE specific ID, routing ID, IAB node or IAB host address, QoS information and potentially other information. The details of the information carried in the adaptation layer are for further study (FFS).
[0070] The processing of adaptation layer information supports the above functions at the IAB node of each path (point-to-point) and / or at the access IAB node and IAB host of the UE (end-to-end).
[0071] The integration of the adaptation layer into the L2 stack includes an integration with or above the MAC layer ( Figure 3 a and b), and above the RLC layer ( Figure 3 c) is the example layout shown.
[0072] It should be understood that the figures only illustrate example protocol stacks and do not exclude other possibilities.
[0073] The adaptation layer may consist of sub-layers. It is conceivable, for example, that the GTP-U header becomes part of the adaptation layer. Alternatively, the header stack of GTP-U / UDP / IP may be part of the adaptation layer. The design of the adaptation header may be architecture-dependent and is for further study (FFS).
[0074] Figure 4 An exemplary data flow between a centralized unit, a distributed unit, and a UE is shown. Typically, on the Uu radio interface, the NR UP protocol stack does not explicitly provide a flow control mechanism. However, an implicit flow control mechanism is provided through feedback from lower layers.
[0075] For AM, in both uplink (UL) and downlink (DL), the PDCP entity at the sender knows the highest sequence PDCP PDU that has been delivered to the PDCP entity at the receiver. In this case, the PDCP entity at the sender derives this information indirectly from the ARQ feedback of the AM mode of the RLC.
[0076] For UM, in both UL and DL, the PDCP entity at the transmitting side knows the highest sequence PDCP PDU (maximum PDCP COUNT successfully transmitted) that has been successfully transmitted to the PDCP entity at the receiving side. In this case, the PDCP entity at the transmitting side obtains this information indirectly from the HARQ feedback or PHY feedback to confirm that the PDCP PDU has been transmitted over the Uu interface.
[0077] In the DL direction, flow control mechanisms are available on F1-U in the higher layer split architecture (CU / DU) of the gNB, which facilitates the delivery of information from lower layers (e.g. ARQ or HARQ feedback) or equivalent information (about delivered / sent PDUs for a particular case) to a centralized unit pointing to the PDCP entity. This information is communicated on a per UE / bearer basis and uses the NR user plane protocol defined in 3GPP TS 38.425. This protocol allows flow control and efficient lossless handover implementation.
[0078] Flow control is important because it can be used to address the HFN de-sync problem. The PDCP transmitter can avoid the HFN de-sync problem by avoiding sending more than half of the PDCP SN space without acknowledging delivery to the receiving PDCP entity. This means that at any given point in time, a maximum of half of the PDCP SN space may be pending (i.e., it has been sent by the PDCP transmitter but is not yet considered to have been received by the PDCP receiver).
[0079] Flow control is also important to enable lossless handover (for AM bearers). To achieve lossless handover, the PDCP entity on the sending side starts retransmitting the PDCP SDUs on the new link, starting from the first PDCP SDU that was unsuccessfully transmitted on the old link. That is, the PDCP entity on the sending side needs to know the delivery status of the PDCP PDUs so that it can discard such PDUs when needed (because those PDUs will no longer be considered for retransmission).
[0080] In DL, to achieve lossless handover (HO), the source gNB forwards packets to the target gNB starting from the first packet received out of sequence by the UE. Similarly, in UL, the UE retransmits PDCP SDUs starting from the first SDU, whose delivery has not been acknowledged out of sequence. Discarding old (acknowledged) packets is a valid UE implementation, as such old packets are not required according to the specification (even if not explicitly specified).
[0081] The NR user plane protocol provides the following functions:
[0082] Provide NR user plane specific sequence number information for user data delivered from a node carrying NR PDCP to the corresponding node of a specific data radio bearer.
[0083] Information on successful and in-sequence delivery of NR PDCP PDUs from the corresponding node to the UE for user data associated with a specific data radio bearer.
[0084] The information of NR PDCP PDUs is not delivered to the UE or lower layers.
[0085] Information of the NR PDCP PDUs transmitted to the lower layers for user data associated with a specific data radio bearer.
[0086] Information of downlink NR PDCP PDUs will be discarded for user data associated with a specific data radio bearer;
[0087] • Information on the current required buffer size at the corresponding node for sending user data associated with a specific data radio bearer to the UE.
[0088] information on the currently required minimum buffer size on the corresponding node for sending user data to the UE associated with all data radio bearers configured for the UE on the corresponding node;
[0089] Information on successful in-sequence delivery of NR PDCP PDUs from the corresponding node to the UE for retransmission of user data associated with a specific data radio bearer;
[0090] Information of the NR PDCP PDUs transmitted to the lower layers for retransmission of user data associated with a specific data radio bearer; and
[0091] Information about specific events at the corresponding node.
[0092] Thanks to the new NR user plane specific sequence number information for user data transmitted from the node carrying NR PDCP to the corresponding node, information on successful in-sequence delivery of NR PDCP PDUs can be provided. This sequence number enables the corresponding node to identify out-of-sequence / lost PDCP packets.
[0093] Furthermore, only DL direction is supported. Supporting UL direction is not straight forward as it would mean taking into account flow control of user packets transmitted from a “corresponding node” (not carrying NR PDCP) to a node carrying NR PDCP, i.e. the opposite of what the protocol provides. The first problem would then be that since the “corresponding node” (not carrying NR PDCP) did not generate the PDCP PDUs, the PDCP PDUs might have been out of sequence or some sequence numbers might have been missing. Adding new NR user plane specific sequence number information would not identify out of sequence / missing PDCP packets.
[0094] Currently, in the proposed IAB architecture, the NR User Plane Protocol (NUPP) is part of GTP-U, which is part of F1-U. The F1-U backhaul option can extend NUPP to the access IAB node. However, this adds a lot of overhead on the air interface (the entire F1-U stack: IP / UDP / GTP-U with NUPP). Options related to architecture 1a are attractive because they can reduce this overhead. In architecture 1a, an adaptation layer is added that contains routing information to enable point-to-point forwarding. It replaces the IP functionality of the standard F1 stack. The IAB host maintains a centralized unit for all the distributed units of the IAB nodes as well as its own distributed units. Each distributed unit on the IAB node connects to the centralized unit in the IAB host using a modified form of F1, called F1*. F1*-U represents the user plane portion of this interface.
[0095] It can be understood from F1*-U that: between the distributed unit on the serving IAB node and the mobile terminal: further study (FFS); between the mobile terminal on the serving IAB node and the distributed unit on the host: on the RLC channel; between the distributed unit on the host and the centralized unit: it is assumed that F1-U can be reused as a baseline and relayed on the distributed unit of the host.
[0096] Regarding congestion / drop issues in IAB networks, the lack of flow control mechanisms between nodes in an IAB network may be a problem. The following description focuses on architecture 1a (see Figure 2 (1a)), UP option c). However, it should be noted that this is only for simplification of the description and the proposal is not limited to this architecture.
[0097] For simplicity, consider the case where there is no particular QoS distinction, i.e. all UEs have one bearer with similar QoS characteristics. In this simplest alternative, this option can be seen as adding the UE_ID (via the adaptation layer) to the PDCP PDU. The UE_ID enables routing across the IAB tree.
[0098] Figure 5An example is shown where 2 bearers serving UE A and UE B are backhauled on the same IAB's RLC bearer. To facilitate the scalability of the IAB, a preferred embodiment includes aggregating different UE bearers within the same backhaul bearer (IAB bearer). Figure 5 An example is shown, where two bearers serving UE A and UE B are backhauled on the same IAB's RLC bearer and can be distinguished by the UE_ID added by the adaptation layer.
[0099] like Figure 5 As shown, the scheduler on the IAB host side will treat UEs equally even if the link to UE B is bad / congested. This will lead to an overload of the IAB node for UE B, possibly resulting in the discarding of UE B's SDUs. It can also be seen that unfairness occurs in the scheduling of the IAB backhaul link: the scheduling weights of UE A and UE B (which can be derived from proportional fair scheduling, for example) should ideally also be used at the IAB host.
[0100] Regarding the HFN out-of-sync / lossless HO issue within the IAB network, another issue is that in the DL, the indication of successful PDCP delivery / transmission is only for the first IAB node, not for the UE. Similarly, in the UL, the indication of successful PDCP delivery / transmission is only for the access IAB node, not for the gNB. Therefore, the PDCP entity on the sender side cannot easily ensure that PDCP PDUs corresponding to less than half of the PDCP SN space are pending. The HFN out-of-sync issue may occur, for example, once PDCP PDUs corresponding to more than half of the PDCP SN space are discarded in the IAB network.
[0101] This is also problematic for supporting lossless HO. In DL, the source gNB may have buffered old PDCP SDUs, but it does not know which one to start retransmitting. This can lead to inefficient implementation. In UL, since old (acknowledged) packets are no longer required in the specification, discarding such packets (even if not explicitly specified) once the sequence number of the RLC's ACK indicates cumulative acknowledgment of such packets is a very efficient UE implementation. If such packets are not delivered to the IAB host, but are lost or stuck somewhere in the IAB tree, they will not be retransmitted and will definitely be lost.
[0102] The proposed method and system according to the present invention are intended to solve the above-mentioned problems.
[0103] End-to-end flow control is required to enable legacy PDCP data transport operation (including protection against HFN desynchronization and lossless handover support). This is not achievable in architectures without F1-U backhaul or F1*-U including at least NUPP.
[0104] End-to-end flow control is needed to avoid congestion and the associated SDU discard in the IAB nodes and to provide scheduling fairness among UEs.
[0105] A generic approach for enabling PDCP data transfer operations (including protection against HFN desynchronization and lossless handover support) would rely on PDCP status report polling from the PDCP entity (such as the solution implemented for LWA bearers). However, the IAB needs to support legacy NR UEs (Class 15). Therefore, this generic approach is not applicable.
[0106] An alternative approach would consist of relying on flow control provided over F1-U, i.e. in the user plane protocol of NR within GTP-U (utilizing the user plane protocol of NR within GTP-U between the distribution units of the IAB host and the IAB access node). This would work for DL. The access IAB node would be able to send data delivery status information for DL to the host node, bearing PDCP. However, one of the main disadvantages is the added overhead. The new NR-U sequence numbers would need to be applied to all downlink packets. Furthermore, this alternative approach is not simple in UL, as NUPP does not support UL data transmission and is not easily extensible (see above).
[0107] Regarding the congestion problem within the IAB tree, a general approach would include using an architecture such as a PDU session supporting each IAB link with appropriate QoS. However, such an architecture would introduce high overhead.
[0108] The end-to-end flow control proposed according to the present invention relies on the access IAB node to maintain an image of the UE receive PDCP window, even though it does not implement PDCP from a data path perspective (PDCP does not need to be included in the protocol stack). The receive PDCP window within the access IAB node is updated based on the PDCP PDUs successfully delivered / sent to the UE (based on ARQ / HARQ or PHY feedback), rather than based on the received PDCP PDUs as in a conventional PDCP implementation. A reordering timer value also needs to be provided to the access IAB node (ideally, it matches the timer value configured for the UE PDCP).
[0109] One of the main advantages of the proposed flow control includes that the overhead / complexity of additional sequence numbers can be avoided.
[0110] Refer to the following Figure 6 , 7 and 8 describe end-to-end flow control according to the present invention.
[0111] Figure 6An example baseline architecture according to an embodiment of the present invention is shown. As shown, in the DL, the centralized unit of the sender PDCP entity should be aware of the successful delivery / transmission of the PDCP to the UE. If the F1-U terminates in the access IAB node, the centralized unit can obtain this information by polling the access IAB node using NUPP. However, such a solution comes at the expense of very high overhead on the wireless backhaul. We focus on the architecture where the F1-U does not terminate in the access IAB node. UE-based solutions can rely on UE PDCP to send status reports (SRs) based on polling or autonomous triggering. However, this is not applicable to legacy UEs. Therefore, a NW-based solution is preferred.
[0112] As shown, the internal DU / CU split of the IAB host has been detailed and the user plane protocol layer of NR over GTP-U has been added for illustration purposes. NUPP is not actually a separate layer but is embedded in the GTP-U extension header within the NR RAN container, but for ease of understanding it can be treated as a separate layer / header. In this architecture, flow control (knowledge of successful delivery of PDCP PDUs) is only available for delivery to the first IAB node.
[0113] According to an embodiment of the present invention, Figure 7 As shown, one option is to have a user plane protocol termination point for NR at the access IAB node.
[0114] Figure 7 An example baseline architecture according to an embodiment of the present invention is shown. Similar to the above, the user plane protocol of NR does not have to be a separate layer. Figure 7 In the embodiment, the user plane protocol of NR will be embedded in the GTP-U extended header of the user plane protocol of NR between the centralized unit and the distribution unit of the IAB host (in the NR container of GTP-U), relayed at the distribution unit of the IAB host, and embedded in the adaptation layer header between the distribution unit of the IAB host and the access IAB node. Therefore, in this embodiment, the user plane protocol field of NR is included in the adaptation layer. Since the NUPP protocol can be reused, it has the benefit of reducing the impact of the specification. However, since the user plane protocol of NR adds a specific sequence number to each data packet, there is still a lot of overhead for wireless backhaul.
[0115] With NUPP, the “corresponding node” is able to provide the sequence numbers of the NR PDCP PDUs that were successfully delivered to the UE in the highest order, out of those NR PDCP PDUs received from the node hosting the NR PDCP entity due to the RLC ACK feedback from the UE, as well as detect any missing NR PDCP PDUs in the received sequence. This detection is made possible by the additional information in the NUPP, in particular the additional sequence number added to all DL packets. Similar functionality can be achieved by not including the entire NUPP frame in the adaptation layer, but only the additional adaptation layer sequence number in the data traffic direction, and the PDCP status in the opposite direction. However, even if this reduces the overhead slightly compared to transmitting the NUPP frame, the overhead of adding a specific sequence number to each packet still exists.
[0116] Figure 8 An example of a PDCP receive window state variable within an IAB node and a UE at a given time is shown. Another way to derive similar information is to have the access IAB node maintain an image of the PDCP receive window of the UE. In this embodiment, the access IAB node tracks the PDCP PDUs received from the host node and sent to the UE. Based on the PDCP PDUs that are successfully delivered to the UE (in the case of AM) or successfully sent to the UE (in the case of UM), the access IAB node should maintain an image of the PDCP receive window. In other words, the IAB node updates the PDCP receive state variable by considering the "received" PDCP PDU when confirming the delivery / transmission of the PDCP PDU. If a gap occurs in the sequence of received PDCP PDUs (from the parent node), the IAB node will not start the reordering timer. The reordering timer is only started if there is a gap in the sequence of PDCP PDUs that have been confirmed to be delivered / sent (from the lower layer feedback of the UE link).
[0117] In this way, the image window is always behind the PDCP window inside the UE. The IAB node may maintain a RX_DELIV_IN variable which represents the PDCP PDU (first loss count or first lost sequence number) following the PDCP PDU successfully delivered / sent to the UE in the highest sequence. The reordering timer ensures packet loss detection. A packet from a sequence gap is considered lost when the reordering timer associated with a higher COUNT value expires.
[0118] One of the main advantages of the proposed embodiment is that it avoids including a new sequence number as in the user plane protocol of NR. Instead, what is required is mainly the reordering timer information, which can be configured by the access IAB node on a per UE / bearer basis through the CP configuration.
[0119] It is further proposed to enhance the adaptation layer in the baseline architecture (see Figure 6 ) so that it can convey the following information (on a per UE / bearer basis): In DL, one polling bit can request the PDCP status.
[0120] In the UL, the PDCP status information is contained in the lower edge of the "PDCP reception window image of the UE" at the access IAB node. It can be equivalent to:
[0121] ★The highest sequence PDCP SN or PDCP COUNT in the PDCP PDU successfully delivered / sent to the UE;
[0122] ★Based on the PDCP PDU successfully delivered / sent to the UE, the PDCP SN or PDCP COUNT (i.e. the corresponding RX_DELIV_IN) that is lost first.
[0123] In the above, "successfully delivered" means that an RLC ACK is received from the UE (AM case), and "successfully sent" means that the transmission is considered successful from the perspective of the lower layers (UM case, such as just sent through PHY feedback or HARQ feedback indicating successful transmission). In addition, "in sequence" means that there are no gaps in the sequence. If there are gaps in the PDCP PDU sequence (which may occur in case of PDCP SN being skipped or a drop within the IAB tree), the gap is cleared only after the reordering timer expires. As part of the adaptation layer, no additional sequence numbers are required.
[0124] It is further proposed that the user plane protocol of the NR is terminated at the distribution unit of the IAB host, and the distribution unit of the IAB host performs polling relay from the user plane protocol of the NR to the adaptation layer, and relays the PDCP status information from the adaptation layer to the user plane protocol of the NR.
[0125] The overall functional processing includes:
[0126] The centralized unit of the IAB host implements the user plane protocol of NR and polls the PDCP status;
[0127] ★The distribution unit of the IAB host forwards the poll at the adaptation layer;
[0128] ★Based on the PDCP PDUs successfully delivered / sent to the UE, the receiver (access IAB node) implements the receive PDCP window, a delayed image of the UE’s PDCP receive window, so that the PDCP state can be generated when needed;
[0129] ★The receiver (access IAB node) generates and sends PDCP status upstream when polling;
[0130] The distributed unit of the IAB host generates the PDCP status of the user plane protocol of the NR and sends it to the centralized unit;
[0131] ★The intermediate IAB node forwards the polling / PDCP status between the distribution unit and the mobile terminal.
[0132] It is important to note that the PDCP receive window at the access IAB node does not affect the data traffic to the UE in any way. Received PDCP PDUs are relayed to the UE without any delay. The only purpose of maintaining the PDCP receive window is to be able to generate PDCP states when required. PDCP remains terminated at the centralized unit of the UE and IAB host, so no full PDCP entity is required at the access IAB node.
[0133] To minimize the difference between the UE's PDCP receive window and its image within the Access IAB node, the Access IAB node may poll the UE (at RLC level) whenever a poll for the PDCP status is received and send the PDCP status only if the UE has answered the RLC poll.
[0134] The PDCP state can be triggered by polling as described above, or autonomously. Autonomous triggering can be based on a time period or a sequence number increment period, and can be configured.
[0135] To minimize the overhead associated with polling and reporting PDCP status, the donor IAB node may trigger polling only when needed, for example, when it notices that the overall link quality has degraded (by other means) or before a handover.
[0136] As shown in the figure, in the UL, the UE sending the PDCP entity should be aware of the successful delivery / transmission (indication) of the PDCP to the centralized unit hosting the IAB.
[0137] Similar concepts as those proposed for the distribution unit apply. That is, it is recommended to introduce:
[0138] In the UL, a poll bit enables the access IAB node to request the PDCP status;
[0139] In DL, the PDCP status information is equivalent to:
[0140] ★The highest sequence PDCP SN or PDCP COUNT among the PDCP PDUs successfully delivered / sent to the centralized unit;
[0141] ★ The first lost PDCP SN or PDCP COUNT (i.e. the corresponding RX_DELIV) based on the PDCP PDUs successfully delivered / sent to the centralized unit.
[0142] The overall functional processing is as follows:
[0143] The access IAB node restricts the processing of the RLC ACK_SN (in the RLC STATUS PDU) to packets that are effectively confirmed as delivered via the PDCP status (in the AM);
[0144] The access IAB node limits the MAC scheduling so that no more than half of the PDCP SNs are pending (due to valid acknowledgement of sent packet information in the PDCP state);
[0145] ★ The access IAB node periodically sends polls to obtain PDCP status (as needed);
[0146] The receiver (distributed unit of the IAB host) implements the PDCP receive window (image of the receive PDCP window in the centralized unit), so it can generate the PDCP status;
[0147] ★The receiver (distribution unit of the IAB host) generates the PDCP status and sends it back to the adaptation layer.
[0148] ★The intermediate IAB node forwards the polling / PDCP status between the distribution unit and the mobile terminal.
[0149] Optionally, NUPP can be enhanced to support PDCP status polling for UL:
[0150] On the distribution unit hosted by the IAB, the poll is relayed from the adaptation layer to the NUPP (new poll field used in UL);
[0151] ★On the centralized unit hosting the IAB, the poll is forwarded to the PDCP, and the PDCP returns the PDCP status;
[0152] ★PDCP status is contained in NUPP (new message / frame, status message for DL data transmission can be reused);
[0153] The distribution unit of the IAB host relays the PDCP status from the user plane protocol of the NR to the adaptation layer.
[0154] In that case, the distributed unit does not have to implement the PDCP receive window (image of the PDCP receive window in the centralized unit).
[0155] For AM, the main benefit is that the UE will not drop packets unless the IAB host confirms that the packet has been successfully received. This will prevent the UE from dropping packets that may still be needed (for example, a packet that was just successfully sent to the access IAB node, but was dropped in the IAB tree before reaching the centralized unit) and allow lossless handover.
[0156] For UM, delaying HARQ feedback does not seem realistic / ideal. However, the MAC scheduling can be adjusted. The main benefit is that the access IAB node has the necessary information to prevent the UE (through appropriate MAC scheduling) from sending more than half of the PDCP SN space in the IAB tree (i.e., distributed cells that have not yet reached the host).
[0157] The PDCP state can be triggered by polling as described above, or autonomously. Autonomous triggering can be based on a time period or SN increment cycle and can be configured.
[0158] To minimize the overhead associated with polling and reporting PDCP status, the access IAB node may trigger polling only when needed, such as when it notices a degradation in overall link quality (by other means) or before a handover.
[0159] Fig. 9 and 10 Point-to-point flow control according to an embodiment of the present invention is shown. The previous embodiment helps to recover the basic UP principles for DRB data transmission. The PDCP entity of the sender can obtain (to some extent) the knowledge of the successful delivery / transmission of PDCP PDUs to the receiving entity. This helps to prevent HFN desynchronization (for AM and UM) and allows lossless HO.
[0160] However, end-to-end flow control cannot solve the potential congestion problem in the IAB network, which leads to the discarding of SDUs in the IAB network as initially described. It also cannot solve the fairness problem between UEs.
[0161] To this end, more detailed information needs to be provided on a point-to-point basis. It is recommended to introduce flow control information (FCI). Flow control information should be based on each UE / bearer. Therefore, it can be added to the adaptation layer as control information (in the opposite direction of traffic). In contrast to the end-to-end control information discussed in the previous embodiments, the point-to-point flow control information will be related to each link between IAB nodes, that is, a child IAB node will provide this information to its parent IAB node through the adaptation layer.
[0162] There are several choices for the possible contents of the flow control information: relative scheduling weight and absolute scheduling cost, as well as maximum achievable throughput, receive window / buffer status, number of UEs / bearers served on the IAB link.
[0163] About relative scheduling weights and reference Fig. 9 and 10In the above example, the access IAB node scheduling weights for UE A and UE B bearers will be reported to the parent node. The total weights may also be transmitted, or equivalently the weights may be normalized. In practice, these weights will be used for the RLC bearers provided to the IAB.
[0164] Assuming that the reporting weight of UE A = 3 and the reporting weight of UE B = 1, the RLC bearer of IAB will be filled with three times the amount of data for UE A as for UE B. The weights can be further reported to the top of the IAB tree by appropriate scaling.
[0165] For example, if the parent node is another IAB node that also serves UE C, the MAC scheduler will use weight IAB and weight C. Fig.10 shown.
[0166] The MAC scheduler may need to take into account the number of IAB UEs addressed by the IAB bearer. For example, under equal radio conditions, the weight IAB may be twice the weight of UE C (however, other implementations are possible, this is just an example).
[0167] The weight reported to the parent node would then be (in this case):
[0168] Weight A = Weight IAB * Weight A / (Weight A + Weight B) = 2 * 3 / 4 = 3 / 2
[0169] Weight B = Weight IAB * Weight B / (Weight A + Weight B) = 2 * 1 / 4 = 1 / 2
[0170] Weight C = 1
[0171] These weights correspond to the relative data ratios to be used when feeding the RLC bearers of the IAB at the IAB Host.
[0172] More generally, weights may be reported to the parent IAB node for each UE and each bearer among all UEs / bearers sharing the same aggregated IAB bearers served by the parent IAB node. These weights correspond to the relative data ratios to be used when feeding the IAB's RLC bearers at the parent IAB node: assuming that all UEs / bearers have full buffer traffic, the parent node will have to use these relative weights to feed the IAB's RLC bearers to match the downstream scheduling. How the child IAB node sets these weights is implementation dependent. This is an indication from the child IAB node that the weights will be used as input to the IAB bearers to match the scheduling of the child IAB node. For example, in the case where the child IAB node is an access IAB node serving multiple UEs, the expected weights will match the weights used by the IAB access node MAC scheduler.
[0173] The weights are updated and reported to the top of the tree based on the weights from each node MAC scheduler. The bearer weights within an IAB bearer do not depend on the RF conditions of the serving IAB node but only on the RF conditions of the following nodes. The weight of an IAB bearer relative to other IAB bearers / UEs will depend on the RF of the serving IAB node from the MAC scheduler (depending on the implementation).
[0174] If anywhere in the tree a UE is in very bad condition, the weight from its access node will be around 0 and reported to the host, which will stop feeding the first IAB bearer to that UE.
[0175] Without such information, the host will continue to feed signals to the UE without any clue, which will lead to: 1) waste of resources on the IAB bearer; 2) large number of drops at the access IAB node.
[0176] If a UE multiplexes multiple bearers in an IAB bearer, optionally, the relative weights may be per UE only, with an implicit understanding that all bearers will have the same priority (i.e., the parent node will apply the same weight to each bearer, equal to the UE's weight divided by the number of bearers).
[0177] Equivalently, the relative weights may be replaced by the corresponding relative costs (in terms of radio resources) or relative maximum throughputs. Relative scheduling weights may help alleviate congestion on child IAB nodes. However, congestion may not be completely prevented.
[0178] It will be appreciated that this information allows a bottom-up scheduling approach whereby scheduling decisions (weights) from the access IAB node (serving the UE) are communicated upstream so that the intermediate IAB nodes and the donor IAB node feed the corresponding weights to the IAB bearers.
[0179] Fig.11 The absolute scheduling cost provided according to an embodiment of the present invention is shown. When relative weights (or costs) are used, the parent IAB node only has information about priorities, which is applied to the scheduling of UEs / bearers multiplexed within the RLC bearers of the same IAB.
[0180] In the above example, at the intermediate node, equivalent radio conditions for the IAB bearer and the UE C bearer at the intermediate node are assumed. Then, knowing that the IAB bearer serves 2 UEs, the intermediate node MAC scheduler sets the weight IAB to twice the UE C weight.
[0181] Another strategy to extend the concept of radio-aware scheduling would be to provide the MAC scheduler at the intermediate (or host) IAB node with the absolute scheduling cost (e.g., in terms of radio resources) downstream of the MAC scheduler. The cost can be expressed in standardized units, such as resource elements / bit (time*frequency*spatial layers / bit).
[0182] Reference Fig.11 For example, the cost of UE A and UE B over the access link (from IAB node X) may be CA=1 and CB=3 respectively. If we assume the same radio conditions, the cost of IAB backhaul and the cost of UE C are CIABX=2 and CC=2 (from IAB node Y) respectively.
[0183] The scheduler on IAB node Y might use this information, for example to allocate resources among UEs in a fair and proportional manner, taking into account the total cost downstream. In this example:
[0184] Cost A = CA + CIABX = 3
[0185] Cost B = CB + CIABX = 5
[0186] Cost C = CC = 2
[0187] UEs may be scheduled inversely proportional to their costs, i.e. in the example above:
[0188] Weight A = 1 / 3
[0189] Weight B = 1 / 5
[0190] Weight C = 1 / 2
[0191] The weights may be reported further to the top of the IAB tree with appropriate aggregation, e.g., only summing up the cost of each link for a given UE. However, other aggregation strategies are possible. For example, the cost on an IAB backhaul link may be considered different from the weight of its access link, so as not to penalize too many UEs at the tail of the tree.
[0192] With this embodiment, the top-level scheduler will make the primary scheduling decisions.
[0193] In case a UE multiplexes multiple bearers in an IAB bearer, the absolute weight / cost may be per UE only, not per bearer, as it can be expected that the cost will be the same for each bearer of the same UE.
[0194] Equivalently, the absolute costs can be replaced by the corresponding absolute weights (the achievable throughput per resource element, or the equivalent number of bits achievable per given time*frequency*space layer unit).
[0195] Absolute costs can help alleviate congestion on child IAB nodes, but they cannot prevent it. They are primarily used to ensure fairness between UEs.
[0196] It will be appreciated that this information allows for a top-down scheduling approach, as the top scheduler in the IAB tree (at the host IAB) will be able to perform scheduling decisions based on the estimated total cost for that UE due to the reporting in the traffic control information.
[0197] Regarding the maximum achievable throughput, the above-mentioned absolute cost signal can be utilized to indicate the maximum achievable throughput of each UE (or equivalently, the maximum number of time*frequency*spatial layer resources that can be used by the UE per time unit if an absolute cost / weight signal is sent).
[0198] This helps to take into account additional capabilities of the UE, such as bandwidth, CA capabilities, in a dynamic manner depending on, for example, activated cells.
[0199] As mentioned before, both relative or absolute weight / cost information can help alleviate congestion on the child IAB nodes, but it cannot prevent it. Some additional information is needed, such as receive window or buffer status information.
[0200] The purpose of this metric is to provide transmit buffer information on a per-UE / RB (multiplexed within an RLC bearer of an IAB) basis regarding the receive window (e.g., available memory for the corresponding bearer, or available number of PDUs that can be received) or buffer status (queued data for transmission and maximum value). Providing such information prevents overload (congestion) and discarded SDUs. In addition, fairness can be ensured by ensuring equal transmit buffer queues between UEs.
[0201] In the previous example, when considering aggregated IAB bearers (e.g., serving UE A and UE B), the IAB node can report the queue size for each UE / bearer. The relative queue size can be used as the relative inverse data ratio to be used when feeding the RLC bearers of the IAB. That is, the receive window or buffer status information for each UE / bearer avoids signaling the relative weights.
[0202] In the given example, UE A is served 3 times more than UE B. Based on the initial UE / bearer queue sizes, the IAB node will adjust the reported queue size ratio to 3 / 4 for UE A and 1 / 4 for UE B.
[0203] Optionally, assuming that multiple bearers of the same UE will share the same receive window or transmit buffer within the child IAB node, the receive window or buffer status may be provided on a per-UE basis (multiplexed within the RLC bearer of the IAB).
[0204] With respect to the number of UEs served on the IAB link and the number of bearers per UE, this requires the MAC scheduling to be scaled accordingly. However, this information may also be configured / derived from the control plane instead.
[0205] Regarding the receive window, instead of providing information on a per UE / bearer basis, this information is provided on a per (aggregated) IAB bearer basis (e.g. the available memory of the corresponding IAB bearer, or the available number of PDUs that can be received). This approach can be used if combined with per UE / bearer weight reporting (relative or absolute).
[0206] If weights are reported, they can ensure fairness and can correct the initial feed radio over the IAB bearer. The only remaining requirement is to prevent congestion, so a per-aggregate bearer receive window is sufficient. This has the advantage of reducing the overhead associated with frequent flow control feedback reporting.
[0207] Regarding providing receive window information based on the IAB bearer, since it will no longer be UE / bearer dependent, one option is to enhance the adaptation layer to provide the IAB bearer information (i.e., use a generic UE / bearer ID to indicate that the information is not specific to a given UE / bearer, but is related to the IAB bearer). Another option is to include this information in the RLC layer, since the aggregated IAB bearers are transported over RLC channels. This information can be included in the RLC control PDU, or carried in the header of the RLC data PDU. Another option is to include this information in the MAC layer, since one MAC transport block is dedicated to the function of one mobile terminal. This information can be included in a MAC control element or in the MAC PDU header. If multiple IAB bearers are configured for the same mobile terminal, they can be distinguished at the MAC level, since they are associated with different logical channels.
[0208] With regard to the receive window information, different granularities may be used. A lower overhead / less granularity is used to indicate whether reception is possible (memory is available for the corresponding UE / bearer or aggregated IAB bearers), in which case the transmitter is allowed to transmit, and if not (memory is not available for the corresponding UE / bearer or aggregated IAB bearers), in which case transmission is prohibited.
[0209] Flow control information may be reported based on the usual mechanisms, such as by polling, periodically, or based on a trigger.
[0210] Although not shown in detail, any device or apparatus forming part of the network may include at least a processor, a storage unit and a communication interface, wherein the processor unit, the storage unit and the communication interface are configured to perform the method of any aspect of the present invention. More options and selections will be introduced below.
[0211] The signal processing functions of the embodiments of the present invention, especially the gNB and UE, can be implemented using a computing system or architecture known to those skilled in the art. A computing system such as a desktop, laptop or notebook computer, a handheld computing device (PDA, mobile phone, palmtop, etc.), a host, a server, a client, or any other type of dedicated or general-purpose computing device (which may be desirable or appropriate for a given application or environment) can be used. The computing system may include one or more processors, which may be implemented using a general-purpose or dedicated processing engine (such as a microprocessor, microcontroller, or other control module).
[0212] The computing system may also include a main memory, such as a random access memory (RAM) or other dynamic memory, for storing information and instructions to be executed by the processor. Such a main memory may also be used to store temporary variables or other intermediate information during the execution of instructions executed by the processor. The computing system may also include a read-only memory (ROM) or other static storage device for storing static information and instructions for the processor.
[0213] The computing system may also include an information storage system, which may include, for example, a media drive and a removable storage interface. The media drive may include a drive or other mechanism that supports fixed or removable storage media, such as a hard drive, a floppy disk drive, a tape drive, an optical drive, an optical drive (Compact Disc, CD) or a digital video drive (Digital Video Drive, DVD), a read or write drive (R or RW) or other removable or fixed media drive. The storage medium may include, for example, a hard disk, a floppy disk, a tape, an optical disk, a CD or DVD, or other fixed or removable media that is read and written by a media drive. The storage medium may include a computer-readable storage medium having specific computer software or data stored therein.
[0214] In alternative embodiments, the information storage system may include other similar components for allowing computer programs or other instructions or data to be loaded into the computing system. These components may include, for example, removable storage units and interfaces, such as program cartridges and cartridge interfaces, removable memory (e.g., flash memory or other removable memory modules) and memory slots, and other removable storage units, and interfaces that allow software and data to be transferred from the removable storage units to the computing system.
[0215] The computing system may also include a communication interface. Such a communication interface may be used to allow software and data to be transferred between the computing system and an external device. Examples of communication interfaces may include a modem, a network interface (e.g., an Ethernet or other NIC card), a communication port (e.g., a Universal Serial Bus (USB) port), a PCMCIA slot and card, etc. The software and data transferred through the communication interface are in the form of a signal, which may be electronic, electromagnetic, optical, or other signal capable of being received by the communication interface medium.
[0216] In this document, the terms "computer program product", "computer-readable medium", etc. may be generally used to refer to tangible media, such as memory, storage devices, or storage units. These and other forms of computer-readable media may store one or more instructions for use by a processor that makes up a computer system to cause the processor to perform specified operations. Such instructions, generally referred to as "computer program code" (which may be grouped in the form of a computer program or other grouping), enable a computing system to perform the functions of an embodiment of the present invention when executed. Note that the code may directly cause the processor to perform the specified operations, be compiled to perform the specified operations, and / or be combined with other software, hardware, and / or firmware elements (e.g., libraries for performing standard functions) to perform the specified operations.
[0217] The non-transitory computer readable medium may include at least one of the following group: a hard disk, a CD-ROM, an optical storage device, a magnetic storage device, a read-only memory, a programmable read-only memory, an erasable programmable read-only memory, an EPROM, an electrically erasable programmable read-only memory, and a flash memory. In an embodiment where the components are implemented using software, the software may be stored in a computer readable medium and loaded into a computing system using, for example, a removable storage drive. When executed by a processor in a computer system, the control module (in this embodiment, software instructions or executable computer program code) causes the processor to perform the functions of the present invention as described herein.
[0218] Furthermore, the concepts of the present invention may be applied to any circuit used to perform signal processing functions within a network component. It is further contemplated that, for example, semiconductor manufacturers may employ the concepts of the present invention in designing standalone devices, such as microcontrollers of digital signal processors (DSPs), application-specific integrated circuits (ASICs), and / or any other subsystem components.
[0219] It should be understood that, for the sake of clarity, the above description describes embodiments of the present invention with reference to a single processing logic. However, the concepts of the present invention may also be implemented by a plurality of different functional units and processors to provide signal processing functionality. Therefore, references to specific functional units are only considered references to appropriate means for providing the functionality, rather than indications of a strict logical or physical structure or organization.
[0220] Aspects of the present invention may be implemented in any suitable form, including hardware, software, firmware or any combination thereof. The present invention may be selectively implemented at least in part as computer software or configurable module components running on one or more data processors and / or digital signal processors, such as FPGA devices.
[0221] Therefore, the components and assemblies of the embodiments of the present invention can be implemented physically, functionally and logically in any suitable manner. In fact, the function can be implemented in a single unit, multiple units or as a part of other functional units. Although the present invention is described in conjunction with some embodiments, the present invention is not limited to the specific form described herein. On the contrary, the scope of the present invention is limited to the appended claims. In addition, although features can be described in conjunction with specific embodiments, those skilled in the art will recognize that the various features of the described embodiments can be combined according to the present invention. In the claims, the word "comprising" does not exclude the presence of other elements or steps.
[0222] Furthermore, although individually listed, a plurality of means, components or method steps may be implemented by, for example, a single unit or processor. In addition, although individual features may be included in different claims, these features may be advantageously combined together, and the inclusion in different claims does not imply that a combination of features is not feasible and / or advantageous. Furthermore, the inclusion of a feature in one claim category does not imply a limitation to that category, but rather indicates that the feature is equally applicable to other claim categories where appropriate.
[0223] Furthermore, the order of features in the claims does not imply any specific order in which the features must be performed and in particular the order of individual steps in a method claim does not imply that the steps must be performed in this order. Rather, the steps may be performed in any suitable order. Furthermore, singular references do not exclude a plurality. Thus, references to "a", "an", "first", "second" etc do not exclude a plurality.
[0224] Although the present invention has been described in conjunction with some embodiments, the present invention is not limited to the specific forms described herein. On the contrary, the scope of the present invention is limited to the appended claims. In addition, although features may appear to be described in conjunction with specific embodiments, those skilled in the art will recognize that the various features of the described embodiments may be combined according to the present invention. In the claims, the terms "comprise" or "comprising" do not exclude the presence of other elements.
Claims
1. A method for providing flow control information in a direction opposite to data flow in an integrated access backhaul network of an adaptation layer, the integrated access backhaul network comprising a plurality of IAB nodes, It is characterized in that The method comprises: Upon polling or triggering from a second IAB node among the multiple IAB nodes, a first IAB node among the multiple IAB nodes transmits hop-by-hop flow control information of an IAB bearer to the second IAB node, wherein the hop-by-hop flow control information is provided for the IAB bearers configured at the first IAB node and the second IAB node, and the hop-by-hop flow control information indicates available storage space for the corresponding bearer at the first IAB node, wherein the second IAB node is allowed to transmit data of the flow only if storage space is available at the first IAB node.
2. The method according to claim 1, It is characterized in that The method is performed in the adaptation layer.
3. The method according to claim 1, It is characterized in that The hop-by-hop flow control information includes a UE bearer specific ID and / or a routing ID.
4. The method according to claim 1, It is characterized in that The hop-by-hop flow control information includes an IAB node or an IAB host address.
