CN115996418A - BH RLC CH remapping method and device - Google Patents

BH RLC CH remapping method and device Download PDF

Info

Publication number
CN115996418A
CN115996418A CN202111211487.4A CN202111211487A CN115996418A CN 115996418 A CN115996418 A CN 115996418A CN 202111211487 A CN202111211487 A CN 202111211487A CN 115996418 A CN115996418 A CN 115996418A
Authority
CN
China
Prior art keywords
rlc
remapping
backhaul
message
backhaul node
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.)
Pending
Application number
CN202111211487.4A
Other languages
Chinese (zh)
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.)
Vivo Mobile Communication Co Ltd
Original Assignee
Vivo Mobile Communication 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 Vivo Mobile Communication Co Ltd filed Critical Vivo Mobile Communication Co Ltd
Priority to CN202111211487.4A priority Critical patent/CN115996418A/en
Publication of CN115996418A publication Critical patent/CN115996418A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Communication Control (AREA)

Abstract

The application discloses a BH RLC CH remapping method and device, wherein the BH RLC CH remapping method comprises the following steps: the first backhaul node receives a first message sent by a second backhaul node, wherein the first message comprises target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information at least comprises an ID of the BH RLC CH; the first backhaul node determines that a first BH RLC CH in the at least one BH RLC CH needs to be remapped according to target information; the first backhaul node determines a second BH RLC CH, wherein the second BH RLC CH is the BH RLC CH on the first backhaul link; the first backhaul node remaps data that needs to be transmitted over the first BH RLC CH to the second BH RLC CH for transmission.

Description

BH RLC CH remapping method and device
Technical Field
The application belongs to the technical field of wireless communication, and particularly relates to a BH RLC CH remapping method and device.
Background
The integrated wireless access and backhaul (IAB, integrated access and backhaul) system is a technology for New Radio (NR) Rel-16 to start to make standards. Fig. 1 shows a schematic diagram of an IAB system, fig. 2 shows a schematic diagram of a Centralized Unit-Distributed Unit (CU-DU) structure of an IAB system, and an IAB node includes a Distributed Unit (DU) function part and a mobile terminal (Mobile Termination, MT) function part, by means of which an access IAB node (i.e. IAB node) can find an upstream IAB node (parent IAB node) and establish a wireless connection with the DU of the upstream IAB node, which is called Backhaul link (BH). After an IAB node establishes a complete backhaul link, the IAB node opens its DU function, and the DU provides cell services, i.e. the DU may provide access services for a terminal (UE). A backhaul link comprises a host (or IAB node) having a directly connected wired transport network (Cable transport). In a backhaul link, all the IAB node DUs are connected to a Centralized Unit (CU) node, which configures the DUs via the F1-AP protocol. The CU configures the MT through RRC protocol. The Donor IAB node has no MT functional part.
The IAB system is introduced to solve the problem that the wired transmission network is not deployed in place when the access points are densely deployed. I.e. without a wired transmission network, the access point may rely on wireless backhaul.
The wireless links between the IAB nodes are called backhaul links, and backhaul link wireless link control channels (Backhaul Radio Link Control channel, BH RLC CH) are configured on the backhaul links to perform wireless backhaul.
In the related art, if a problem occurs in one backhaul link, another backhaul link may be used to split data transmission, which is also called re-routing (re-routing).
At present, in the related art, data may be rerouted with a granularity of per BAP routing ID, please refer to fig. 3, fig. 3 is a schematic diagram of a method for rerouting data with a granularity of per BAP routing ID in an IAB system, and if a bad BAP routing ID1 link between an IAB node 2 (IAB 2) and a downstream IAB node (IAB 4) occurs, the data transmitted according to the BAP routing ID1 may be rerouted onto a route of the BAP routing ID 2.
The rerouting scheme for the BH RLC CH is similar to the BAP routing ID, i.e., data is transferred (rerouted) from one backhaul link to another backhaul link to alleviate the congestion level of data transmission. But the above described rerouting scheme cannot be used when:
1) When the IAB node has only one output link (egress link);
2) When the IAB node has a plurality of egress links, but can not find the replaceable BAP routing ID on other egress links;
3) When no alternative BH RLC CH is configured on the other egress link of the IAB node.
Therefore, normal transmission of BH RLC CH data cannot be guaranteed.
Disclosure of Invention
The embodiment of the application provides a BH RLC CH remapping method and device, which can solve the problem that normal transmission of BH RLC CH data cannot be guaranteed when data is rerouted by granularity of per BH RLC CH.
In a first aspect, a BH RLC CH remapping method is provided, including:
a first backhaul node receives a first message sent by a second backhaul node, wherein the first message comprises target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information at least comprises an identity ID of the BH RLC CH;
the first backhaul node determines that a first BH RLC CH in the at least one BH RLC CH needs to be remapped according to the target information;
the first backhaul node determines a second BH RLC CH, which is a BH RLC CH on the first backhaul link;
The first backhaul node remaps data to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.
In a second aspect, a BH RLC CH remapping method is provided, further including:
the second backhaul node sends a first message to a first backhaul node, wherein the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, the target information includes at least an ID of the BH RLC CH, and the first message is used for indicating whether the at least one BH RLC CH needs to be remapped.
In a third aspect, there is provided a BH RLC CH remapping apparatus, including:
a first receiving module, configured to receive a first message sent by a second backhaul node, where the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information includes at least an ID of the BH RLC CH;
a first determining module, configured to determine, according to the target information, that a first BH RLC CH of the at least one BH RLC CH needs to be remapped;
A second determining module, configured to determine a second BH RLC CH, where the second BH RLC CH is a BH RLC CH on the first backhaul link;
and the remapping module is used for remapping the data which needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.
In a fourth aspect, there is provided a BH RLC CH remapping apparatus, including:
a first sending module, configured to send a first message to a first backhaul node, where the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, the target information includes at least an ID of the BH RLC CH, and the first message is used to indicate whether the at least one BH RLC CH needs to be remapped.
In a fifth aspect, there is provided a backhaul node comprising a processor, a memory and a program or instruction stored on the memory and executable on the processor, the program or instruction when executed by the processor implementing the steps of the method according to the first or second aspect.
In a sixth aspect, a backhaul node is provided, including a processor and a communication interface, where the communication interface is configured to receive a first message sent by a second backhaul node, where the first message includes target information of at least one BH RLC CH on a first backhaul link, where the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information includes at least an ID of the BH RLC CH; the processor is configured to determine, according to the target information, that a first BH RLC CH of the at least one BH RLC CH needs to be remapped; determining a second BH RLC CH, wherein the second BH RLC CH is the BH RLC CH on the first backhaul link; and remapping the data which needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.
In a seventh aspect, a backhaul node is provided, including a processor and a communication interface, where the communication interface is configured to send a first message to a first backhaul node, where the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, the target information includes at least an ID of the BH RLC CH, and the first message is used to indicate whether the at least one BH RLC CH needs to be remapped.
In an eighth aspect, there is provided a readable storage medium having stored thereon a program or instructions which when executed by a processor, performs the steps of the method according to the first aspect or performs the steps of the method according to the second aspect.
In a ninth aspect, there is provided a chip comprising a processor and a communication interface, the communication interface and the processor being coupled, the processor being for running a program or instructions to implement the method according to the first aspect or to implement the method according to the second aspect.
In a tenth aspect, a computer program/program product is provided, stored in a non-transitory storage medium, the computer program/program product being executed by at least one processor to implement the steps of the method as described in the first aspect, or the program/program product being executed by at least one processor to implement the steps of the method as described in the second aspect.
In the embodiment of the present application, when the BH RLC CH needs to be remapped (for example, when congestion occurs), the IAB node can remap the data transmitted by the BH RLC CH that needs to be remapped onto another BH RLC CH on the same backhaul link for transmission, and even if the IAB node has only one output link (egress link) or multiple egress links but cannot find the replaceable BAP routing ID on the other egress links or no replaceable BH RLC CH is configured on the other egress links of the IAB node, normal transmission of the BH RLC CH data can be ensured.
Drawings
FIG. 1 is a schematic diagram of an IAB system;
FIG. 2 is a schematic view of CU-DU structure of IAB system;
FIG. 3 is a schematic diagram of a method of rerouting data at a granularity of per BAP routing ID for an IAB system;
fig. 4 is a flowchart of a BH RLC CH remapping method according to an embodiment of the present disclosure;
FIG. 5 is a schematic diagram of an F1-U protocol stack of an IAB system;
fig. 6 is a schematic diagram of a format of a flow control message based on a BH RLC CH;
FIG. 7 is a diagram illustrating a format of a flow control message based on BAP routing ID
Fig. 8 is a schematic diagram of sending a flow control message of an IAB system;
fig. 9 is a schematic diagram of a BH RLC CH remapping method according to an embodiment of the present application;
Fig. 10 is a schematic diagram of a BH RLC CH remapping method according to another embodiment of the present application;
fig. 11 is a schematic structural diagram of a BH RLC CH remapping device according to an embodiment of the present application;
fig. 12 is a schematic structural diagram of a BH RLC CH remapping device according to another embodiment of the present application;
fig. 13 is a schematic structural diagram of a backhaul node according to an embodiment of the present application;
fig. 14 is a schematic hardware structure of a backhaul node according to an embodiment of the present application.
Detailed Description
Technical solutions in the embodiments of the present application will be clearly described below with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present application are within the scope of the protection of the present application.
The terms first, second and the like in the description and in the claims, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the application are capable of operation in sequences other than those illustrated or otherwise described herein, and that the terms "first" and "second" are generally intended to be used in a generic sense and not to limit the number of objects, for example, the first object may be one or more. Furthermore, in the description and claims, "and/or" means at least one of the connected objects, and the character "/" generally means a relationship in which the associated object is an "or" before and after.
It is noted that the techniques described in embodiments of the present application are not limited to long term evolution (Long Term Evolution, LTE)/LTE evolution (LTE-Advanced, LTE-a) systems, but may also be used in other wireless communication systems, such as code division multiple access (Code Division Multiple Access, CDMA), time division multiple access (Time Division Multiple Access, TDMA), frequency division multiple access (Frequency Division Multiple Access, FDMA), orthogonal frequency division multiple access (Orthogonal Frequency Division Multiple Access, OFDMA), single-carrier frequency division multiple access (Single-carrier Frequency-Division Multiple Access, SC-FDMA), and other systems. The terms "system" and "network" in embodiments of the present application are often used interchangeably, and the techniques described may be used for both the above-mentioned systems and radio technologies, as well as other systems and radio technologies. The following description describes a New air interface (NR) system for purposes of example and uses NR terminology in much of the description that follows, but these techniques are also applicable to applications other than NR system applications, such as generation 6 (6) th Generation, 6G) communication system。
The BH RLC CH remapping method and apparatus provided in the embodiments of the present application are described in detail below with reference to the accompanying drawings by some embodiments and application scenarios thereof.
Referring to fig. 4, an embodiment of the present application provides a BH RLC CH remapping method, including:
step 41: a first backhaul node receives a first message sent by a second backhaul node, wherein the first message comprises target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information at least comprises an identity (Identity Document, ID) of the BH RLC CH;
the first backhaul node and the second backhaul node may be an IAB node and/or an IAB-donor-DU node. For example, one of the first backhaul node and the second backhaul node is an IAB-donor-DU, and the other is an IAB node.
The first backhaul link is configured with at least two BH RLC CHs, each BH RLC CH having a unique ID for identifying the BH RLC CH.
Step 42: the first backhaul node determines that a first BH RLC CH in the at least one BH RLC CH needs to be remapped according to the target information;
step 43: the first backhaul node determines a second BH RLC CH, which is a BH RLC CH on the first backhaul link;
step 44: the first backhaul node remaps data to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.
In the embodiment of the present application, when the BH RLC CH needs to be remapped (for example, when congestion occurs), the IAB node can remap the data transmitted by the BH RLC CH that needs to be remapped onto another BH RLC CH on the same backhaul link for transmission, and even if the IAB node has only one output link (egress link) or multiple egress links but cannot find the replaceable BAP routing ID on the other egress links or no replaceable BH RLC CH is configured on the other egress links of the IAB node, normal transmission of the BH RLC CH data can be ensured.
In this embodiment, optionally, the first message is a Flow Control (FC) message. And the information in the existing flow control message is used for judging whether the BH RLC CH needs to be remapped or not, so that the system is changed less and the cost is lower.
The flow control message is briefly described below.
In Rel-16, 3GPP agrees to adopt a Flow Control mechanism in The IAB network to solve data congestion (The DL hop-by-hop Flow Control is supported in IAB network) in downlink transmission, where The data congestion in downlink transmission refers to that The IAB node receives data from its parent IAB node and is less than The data sent to a downstream node or UE to cause data accumulation, and when The data accumulation has a risk of cache overflow, a Flow Control (FC) feedback (congested IAB node feedback Flow Control info to its parent IAB node) is sent to its parent node to warn congestion, and The IAB node receiving The Flow Control feedback controls The transmission rate of sending downlink data to The child IAB node.
The minimum feedback granularity of the flow control information may be based on the BH RLC CH, or based on the BAP routing ID.
The backhaul adaptive protocol layer (Backhaul Adaptation Protocol, BAP) is a newly introduced protocol layer in the IAB system, and is used for forwarding data, routing data packets, controlling flow, and the like, and a specific protocol stack is shown in fig. 5.
Referring to fig. 6 and 7, fig. 6 is a diagram of a format of a flow control message based on a BH RLC CH, and fig. 7 is a diagram of a format of a flow control message based on a BAP routing ID. As can be seen from fig. 6, the flow control message may carry the ID and available buffer capacity of at least one BH RLC CH (Available Buffer Size).
In addition, there are 2 different types of flow control information in the IAB technology, namely, event-triggered flow control information and query (polling) -triggered flow control information. Based on event triggering, namely when the data accumulation reaches a certain threshold value, the IAB child node actively sends flow control information to the IAB parent node; based on the polling trigger, that is, when the father node of the IAB desires to know the complex buffering situation of the child node, the father node of the IAB sends polling information to the child node of the IAB so as to trigger the child node of the IAB to send polling flow control information to the father node of the IAB.
The flow control message in the embodiment of the application can be flow control information triggered based on an event, and can also be flow control information triggered based on query (polling).
If the flow control message in the embodiment of the present application is based on event triggered flow control information, the flow control message in the embodiment of the present application may only carry the BH RLC CH on the first backhaul link where data is accumulated to reach a certain threshold, or may also carry all the BH RLC CHs on the first backhaul link. If the flow control message in the embodiment of the present application is based on the flow control information triggered by polling, the flow control message in the embodiment of the present application carries all BH RLC CHs on the first backhaul link.
As shown in fig. 8, an example of a specific feedback on the flow control is that an IAB node may send downlink data to a UE through an IAB node 1, an IAB node 2 and an IAB node 3, and once a backhaul link between the IAB node 2 and the IAB node 3 encounters link congestion, the IAB node 2 may send a flow control message to its upstream node, i.e. the IAB node 1, and after receiving the flow control message, the IAB node 1 may stop or reduce sending new downlink data to the IAB node 2.
In this embodiment, optionally, the target information further includes an available buffer capacity of the BH RLC CH; the method further comprises the steps of:
the first backhaul node judges whether the BH RLC CH needs to be remapped according to whether the available buffer capacity of the BH RLC CH is smaller than or equal to a first threshold;
If the available buffer capacity of the BH RLC CH is less than or equal to a first threshold, the first backhaul node determines that the BH RLC CH needs to be remapped.
That is, the BH RLC CH with the available buffer capacity less than or equal to the first threshold is the BH RLC CH that needs to be remapped.
In an embodiment of the present application, optionally, the first threshold is predefined by a protocol or preconfigured by a network (CU).
In this embodiment of the present application, optionally, the first threshold value corresponding to each BH RLC CH is the same or different.
In this embodiment of the present invention, optionally, the first message may also be a newly introduced message, and is dedicated for the remapping process, that is, the first message is a message for carrying the target information of the BH RLC CH that needs to be remapped, and after the first backhaul node receives the first message, the BH RLC CH in the first message is considered to be the BH RLC CH that needs to be remapped.
In this embodiment of the present application, optionally, determining the second BH RLC CH includes: the first backhaul node selects a BH RLC CH, which is lower than or equal to the transmission priority of the first BH RLC CH and can be remapped, on the first backhaul link as the second BH RLC CH.
In this embodiment, optionally, the transmission priority of each BH RLC CH on the first backhaul link is configured by an IAB host Concentrating Unit (CU). Specifically, each BH RLC CH may be configured through F1AP signaling or RRC signaling when being established.
In this embodiment, optionally, the BH RLC CH that can be remapped is a BH RLC CH with an available buffer capacity greater than a first threshold.
In this embodiment of the present application, optionally, determining the second BH RLC CH includes:
if there are at least two second BH RLC CHs, the first backhaul node performs one of the following operations:
selecting the second BH RLC CH with the lowest transmission priority from the at least two second BH RLC CH as the second BH RLC CH for remapping;
selecting the second BH RLC CH with the largest available buffer capacity from the at least two second BH RLC CH as the second BH RLC CH for remapping;
selecting the second BH RLC CH with the least remapping times from the at least two second BH RLC CHs as the second BH RLC CH for remapping;
and randomly selecting one second BH RLC CH from the at least two second BH RLC CH as the second BH RLC CH for remapping.
In this embodiment, a remapping number counter may be configured for each second BH RLC CH, that is, each second BH RLC CH corresponds to one remapping number counter, and if a second BH RLC CH is selected for remapping, the first backhaul node increments by one the count of the remapping number counter of the second BH RLC CH for remapping.
In this embodiment, optionally, the remapping number counter counts from 0 until the second BH RLC CH is cleared when it cannot be remapped.
In this embodiment, optionally, remapping the data that needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission further includes:
the first backhaul node stops remapping of the first BH RLC CH if at least one of the following conditions is satisfied:
all the second BH RLC CH corresponding to the first BH RLC CH becomes non-remappable;
the first BH RLC CH becomes unnecessary for remapping.
In this embodiment, optionally, the second BH RLC CH that cannot be remapped is a BH RLC CH with an available buffer capacity smaller than or equal to a first threshold.
In this embodiment, optionally, the first BH RLC CH that does not need to be remapped is a BH RLC CH with an available buffer capacity greater than a first threshold.
In this embodiment of the present application, optionally, the BH RLC CH remapping method further includes: the first backhaul node determines whether the first BH RLC CH becomes unnecessary to be remapped.
In this embodiment, optionally, the determining, by the first backhaul node, whether the first BH RLC CH becomes unnecessary to perform remapping includes:
the first backhaul node receives a second message sent by the second backhaul node, wherein the second message comprises target information of the first BH RLC CH;
and the first backhaul node judges whether the first BH RLC CH becomes unnecessary to be remapped according to the target information of the first BH RLC CH in the second message.
The second message may be a newly introduced message dedicated to transmitting the first BH RLC CH that becomes unnecessary for remapping.
In this embodiment, optionally, the target information in the second message further includes an available buffer capacity of the BH RLC CH; the first backhaul node determining, according to the target information of the first BH RLC CH in the second message, whether the first BH RLC CH becomes unnecessary to remap includes:
The first backhaul node judges whether the first BH RLC CH becomes unnecessary to be remapped according to whether the available buffer capacity of the first BH RLC CH is greater than or equal to a second threshold value (this mode is passive contact remapping);
if the available buffer capacity of the first BH RLC CH is greater than or equal to the second threshold, the first backhaul node determines that the first BH RLC CH becomes unnecessary to perform remapping (this is active contact remapping).
In this embodiment, optionally, the second threshold is predefined by a protocol or preconfigured by a network.
In this embodiment, optionally, the second threshold value corresponding to each of the first BH RLC CH is the same or different.
The BH RLC CH remapping method in the above embodiment is described below with reference to a specific application scenario.
Embodiment one: selection of second BH RLC CH
In this embodiment, referring to fig. 9, two backhaul links are provided between the IAB1 and the IAB4, which are BH link1 and BH link2, respectively, and the IAB node on the BH link1 includes: the IAB nodes on the IAB1, IAB2, and IAB4, BH link2 include: IAB1, IAB3 and IAB4, and BH link1 has 5 BH RLC CH, namely BH RLC CH1, BH RLC CH2, BH RLC CH3, BH RLC CH4 and BH RLC CH5.
IAB1 receives a downlink flow control (DLFC) message sent by IAB2, and can obtain Table 1 (the first two columns are the target information carried by DLFC, and the second two columns are the information known by IAB1 node itself) in combination with DLFC message IAB 1:
TABLE 1
Figure BDA0003309105960000121
The IAB1 node may perform on-state remapping transmission on the BH RLC CH that needs to be on-state remapping, that is, remap the BH RLC CH that needs to be on-state remapping on the BH link1 to other BH RLC CHs that do not need to be on-state remapping on the BH link1 (the related scheme is to reroute the BH RLC CH that needs to be on-state remapping on the BH link1 to the BH link 2), where in this embodiment, whether the IAB1 node has one or more egress links, the remapping is performed only on the same link):
the BH RLC CH1 may optionally be remapped to the second BH RLC CH to CH3 and CH5.
The BH RLC CH2 may optionally be remapped to the second BH RLC CH to CH3 and CH5.
The BH RLC CH4 may optionally be remapped to CH5 as the second BH RLC CH.
In this embodiment, optionally, if there are at least two second BH RLC CHs in one BH RLC CH (first BH RLC CH) to be remapped, IAB1 performs one of the following operations:
selecting a BH RLC CH with the lowest transmission priority from the at least two second BH RLC CH as a second BH RLC CH for remapping;
Selecting the BH RLC CH with the largest available buffer capacity from the at least two second BH RLC CH as a second BH RLC CH for remapping;
selecting the BH RLC CH with the least remapping times from the at least two second BH RLC CH as the second BH RLC CH for remapping;
and randomly selecting one BH RLC CH from the at least two second BH RLC CH as a second BH RLC CH for remapping.
In this embodiment of the present application, when the number of remaps of the at least two second BH RLC CHs is the same, further, the selection may be arbitrarily selected based on implementation, or selected based on transmission priority, or selected based on available buffer capacity.
The method needs to maintain a remapping number counter for each second BH RLC CH that can be remapped, and the number counter for the second BH RLC CH is incremented by 1 each time a first BH RLC CH selects the second BH RLC CH for remapping transmission.
Suppose that IAB1 selects a remapped BH RLC CH for the BH RLC CH that needs to turn on the remap as shown in table 2:
TABLE 2
First BH RLC CH BH RLC CH that can be remapped
BH RLC CH1 BH RLC CH5
BH RLC CH2 BH RLC CH3
BH RLC CH4 BH RLC CH5
The number of remaps counter for BH RLC CH3 is 1; the number of remaps counter for BH RLC CH5 is 2.
Embodiment two: stopping remapping of first BH RLC CH
Time 1: the obtained information table 3 shows that the IAB1 receives the DL flow control message sent by the IAB 2:
TABLE 3 Table 3
Figure BDA0003309105960000131
Suppose that IAB1 selects a remapped BH RLC CH for the BH RLC CH that needs to turn on the remap as shown in table 4:
TABLE 4 Table 4
First BH RLC CH BH RLC CH that can be remapped
BH RLC CH1 BH RLC CH5
BH RLC CH2 BH RLC CH3
BH RLC CH4 BH RLC CH5
Time 2: the obtained information of the DL flow control message sent by the IAB2 received by the IAB1 is shown in table 5:
TABLE 5
Figure BDA0003309105960000141
It can be seen that the BH RLC CH4 releases the state of requiring the starting of the remapping due to the remapping transmission, but the BH RLC CH1 and the BH RLC CH2 are still in the state of requiring the starting of the remapping; and the BH RLC CH5 becomes a state in which remapping needs to be turned on due to carrying excessive remapping data; the IAB1 node receives the DL flow control message and then performs the following operations on each BH RLC CH:
BH RLC CH1: since the BH RLC CH5 used for remapping becomes a state in which remapping needs to be started, and the second BH RLC CH which is now available for selection is BH RLC CH3, the BH RLC CH5 is changed to BH RLC CH3 for remapping;
BH RLC CH2: since the BH RLC CH5 used for remapping is changed into a state requiring the remapping to be started, and the second BH RLC CH which is available for selection at present is BH RLC CH3 and BH RLC CH4, and since the BH RLC CH4 has lower priority, the remapping is carried out by changing from BH RLC CH5 to BH RLC CH 4;
BH RLC CH3: no remapping is required;
BH RLC CH4: assuming 35% is the configured de-remapped threshold (i.e., the second threshold), the BH RLC CH4 stops the remapping operation and resumes normal data transmission.
BH RLC CH5: remapping is required but BH RLC CH5 has no alternative second BH RLC CH and therefore does nothing.
To sum up, at time 2, iab1 selects a remapped BH RLC CH for the BH RLC CH that needs to turn on the remap as shown in table 6:
TABLE 6
Figure BDA0003309105960000151
In the above embodiment, the first backhaul node selects the second BH RLC CH for remapping for the first BH RLC CH, and in other embodiments of the present application, optionally, the second BH RLC CH may also be a remapped BH RLC CH configured for the first BH RLC CH in advance.
That is, the remapped BH RLC CH configured for at least one BH RLC CH (may be all the BH RLC CH) on the first backhaul link may be used as the second BH RLC CH after it is determined that the BH RLC CH needs to be remapped. In this way, the first backhaul link does not need to perform the operation of selecting the second BH RLC CH, thereby saving time delay and power consumption.
In this embodiment, optionally, the second BH RLC CH has an IAB host CU configuration.
In this embodiment of the present application, optionally, the QoS characteristics and/or transmission priorities of the second BH RLC CH and the first BH RLC CH are the same or similar.
In this embodiment, optionally, the second BH RLC CH is only used for data transmission of the remapping of the first BH RLC CH, that is, the remapped second BH RLC CH configured for the first BH RLC CH in advance is not normally used for transmitting data, and is only used for transmitting data that needs to be transmitted by the corresponding first BH RLC CH when the corresponding first BH RLC CH needs to be remapped.
In the foregoing embodiments of the present application, optionally, the first backhaul link is an uplink backhaul link or a downlink backhaul link.
Referring to fig. 10, the embodiment of the present application further provides a BH RLC CH remapping method, including:
step 101: the second backhaul node sends a first message to a first backhaul node, wherein the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, the target information includes at least an ID of the BH RLC CH, and the first message is used for indicating whether the at least one BH RLC CH needs to be remapped.
The indication may be an implicit indication or a display indication.
In the embodiment of the present application, the backhaul node sends a first message to another backhaul node on the same link, so that another backhaul node can determine whether the BH RLC CH needs to be remapped according to the first message.
Optionally, the BH RLC CH remapping method in the embodiment of the present application further includes:
the second backhaul node sends a second message to the first backhaul node, where the second message includes target information of the first BH RLC CH, and the second message is used to indicate whether the first BH RLC CH becomes unnecessary to be remapped. The indication may be an implicit indication or an explicit indication.
Optionally, the first message is a flow control message.
Optionally, the target information further includes an available buffer capacity of the BH RLC CH; and the BH RLC CH needing remapping is the BH RLC CH with the available buffer capacity smaller than or equal to a first threshold value.
Optionally, the target information of the second message further includes an available buffer capacity of the BH RLC CH; and under the condition that the available buffer capacity is larger than a first threshold value, the first BH RLC CH corresponding to the available buffer capacity does not need to be subjected to remapping.
It should be noted that, in the BH RLC CH remapping method provided in the embodiments of the present application, the execution body may be a BH RLC CH remapping device, or a control module in the BH RLC CH remapping device for executing the BH RLC CH remapping method. In the embodiment of the present application, a method for executing BH RLC CH remapping by a virtual device is taken as an example, and the BH RLC CH remapping device provided in the embodiment of the present application is described.
Referring to fig. 11, the embodiment of the present application further provides a BH RLC CH remapping apparatus 110, including:
a first receiving module 111, configured to receive a first message sent by a second backhaul node, where the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information includes at least an ID of the BH RLC CH;
a first determining module 112, configured to determine that, if the first BH RLC CH of the at least one BH RLC CH needs to be remapped according to the target information;
a second determining module 113, configured to determine a second BH RLC CH, where the second BH RLC CH is a BH RLC CH on the first backhaul link;
Remapping module 114, for remapping data to be transmitted over the first BH RLC CH to the second BH RLC CH for transmission.
In the embodiment of the present application, when the BH RLC CH needs to be remapped (for example, when congestion occurs), the IAB node can remap the data transmitted by the BH RLC CH that needs to be remapped onto another BH RLC CH on the same backhaul link for transmission, and even if the IAB node has only one output link (egress link) or multiple egress links but cannot find the replaceable BAP routing ID on the other egress links or no replaceable BH RLC CH is configured on the other egress links of the IAB node, normal transmission of the BH RLC CH data can be ensured.
Optionally, the first message is a flow control message.
Optionally, the target information further includes an available buffer capacity of the BH RLC CH; the BH RLC CH remapping apparatus 110 further includes:
a first judging module, configured to judge whether the BH RLC CH needs to be remapped according to whether the available buffer capacity of the BH RLC CH is less than or equal to a first threshold; and if the available buffer capacity of the BH RLC CH is smaller than or equal to a first threshold value, judging that the BH RLC CH needs to be remapped.
Optionally, the first threshold value corresponding to each BH RLC CH is the same or different.
Optionally, the first message is a message for carrying target information of the BH RLC CH that needs to be remapped.
Optionally, the first determining module 112 is configured to select, as the second BH RLC CH, a BH RLC CH that has a transmission priority on the first backhaul link lower than or equal to the transmission priority of the first BH RLC CH and can be remapped.
Optionally, the transmission priority of each BH RLC CH on the first backhaul link is configured by the IAB host concentration unit CU.
Optionally, the BH RLC CH that can be remapped is a BH RLC CH with an available buffer capacity greater than a first threshold.
Optionally, the first determining module 112 is further configured to perform one of the following operations if there are at least two second BH RLC CHs:
selecting the second BH RLC CH with the lowest transmission priority from the at least two second BH RLC CH as the second BH RLC CH for remapping;
selecting the second BH RLC CH with the largest available buffer capacity from the at least two second BH RLC CH as the second BH RLC CH for remapping;
Selecting the second BH RLC CH with the least remapping times from the at least two second BH RLC CHs as the second BH RLC CH for remapping;
and randomly selecting one second BH RLC CH from the at least two second BH RLC CH as the second BH RLC CH for remapping.
Optionally, the BH RLC CH remapping apparatus 110 further includes:
and the counting module is used for adding one to the count of the remapping frequency counter of the second BH RLC CH for remapping.
Optionally, each of the second BH RLC CH corresponds to one of the remapping times counters, and the remapping times counter counts from 0 until the second BH RLC CH is cleared when it cannot be remapped.
Optionally, the BH RLC CH remapping apparatus 110 further includes:
a stopping module for stopping remapping of the first BH RLC CH if at least one of the following conditions is met:
all the second BH RLC CH corresponding to the first BH RLC CH becomes non-remappable;
the first BH RLC CH becomes unnecessary for remapping.
Optionally, the second BH RLC CH that cannot be remapped is a BH RLC CH having an available buffer capacity less than or equal to the first threshold.
Optionally, the first BH RLC CH that does not need to be remapped is a BH RLC CH with an available buffer capacity greater than a first threshold.
Optionally, the BH RLC CH remapping apparatus 110 further includes:
and the second judging module is used for judging whether the first BH RLC CH is changed to be unnecessary to be remapped.
Optionally, the second judging module is configured to receive a second message sent by the second backhaul node, where the second message includes target information of the first BH RLC CH; and judging whether the first BH RLC CH is changed to be unnecessary to be remapped according to the target information of the first BH RLC CH in the second message.
Optionally, the target information in the second message further includes an available buffer capacity of the BH RLC CH; the second judging module is configured to judge whether the first BH RLC CH becomes unnecessary to be remapped according to whether the available buffer capacity of the first BH RLC CH is greater than or equal to a second threshold; and if the available buffer capacity of the first BH RLC CH is greater than or equal to the second threshold, determining that the first BH RLC CH becomes unnecessary to be remapped.
Optionally, the second threshold is predefined by a protocol or preconfigured by a network.
Optionally, the second threshold value corresponding to each first BH RLC CH is the same or different.
Optionally, the second BH RLC CH is a remapped BH RLC CH configured in advance for the first BH RLC CH.
Optionally, the QoS characteristics and/or transmission priorities of the second BH RLC CH and the first BH RLC CH are the same or similar.
Optionally, the second BH RLC CH is only used for data transmission of the remapping of the first BH RLC CH.
The BH RLC CH remapping device provided in the embodiment of the present application can implement each process implemented by the method embodiment of fig. 4, and achieve the same technical effects, so that repetition is avoided, and no further description is given here.
Referring to fig. 12, the embodiment of the present application further provides a BH RLC CH remapping apparatus 120, including:
a first sending module 121, configured to send a first message to a first backhaul node, where the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, the target information includes at least an ID of the BH RLC CH, and the first message is used to indicate whether the at least one BH RLC CH needs to be remapped.
Optionally, the BH RLC CH remapping apparatus 120 further includes:
and the second sending module is used for sending a second message to the first backhaul node, wherein the second message comprises target information of the first BH RLC CH, and the second message is used for indicating whether the first BH RLC CH becomes unnecessary to be remapped.
Optionally, the first message is a flow control message.
Optionally, the target information further includes an available buffer capacity of the BH RLC CH; and the BH RLC CH needing remapping is the BH RLC CH with the available buffer capacity smaller than or equal to a first threshold value.
Optionally, the target information of the second message further includes an available buffer capacity of the BH RLC CH; and under the condition that the available buffer capacity is larger than a first threshold value, the first BH RLC CH corresponding to the available buffer capacity does not need to be subjected to remapping.
The BH RLC CH remapping device provided in the embodiment of the present application can implement each process implemented by the method embodiment of fig. 10, and achieve the same technical effects, so that repetition is avoided, and no further description is given here.
As shown in fig. 13, the embodiment of the present application further provides a backhaul node 130, which includes a processor 131, a memory 132, and a program or an instruction stored in the memory 132 and capable of running on the processor 131, where the program or the instruction implements each process of the BH RLC CH remapping method embodiment when executed by the processor 131, and the same technical effects can be achieved, so that repetition is avoided and no further description is given here.
The embodiment of the application also provides a backhaul node, which comprises a processor and a communication interface, wherein the communication interface is used for receiving a first message sent by a second backhaul node, the first message comprises target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information at least comprises an identity ID of the BH RLC CH; the processor is configured to determine, according to the target information, that a first BH RLC CH of the at least one BH RLC CH needs to be remapped; determining a second BH RLC CH, wherein the second BH RLC CH is the BH RLC CH on the first backhaul link; and remapping the data which needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.
The embodiment of the application further provides a backhaul node, which comprises a processor and a communication interface, wherein the communication interface is used for sending a first message to a first backhaul node, the first message comprises target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, the target information at least comprises an ID of the BH RLC CH, and the first message is used for indicating whether the at least one BH RLC CH needs to be remapped.
The backhaul node embodiment corresponds to the backhaul node method embodiment, and each implementation process and implementation manner of the method embodiment can be applied to the backhaul node embodiment, and the same technical effects can be achieved.
Specifically, the embodiment of the application also provides a backhaul node. As shown in fig. 14, the backhaul node 1400 includes: antenna 141, radio frequency device 142, baseband device 143. The antenna 141 is connected to the radio frequency device 142. In the uplink direction, the radio frequency device 142 receives information via the antenna 141, and transmits the received information to the baseband device 143 for processing. In the downlink direction, the baseband device 143 processes information to be transmitted, and transmits the processed information to the radio frequency device 142, and the radio frequency device 142 processes the received information and transmits the processed information through the antenna 141.
The above band processing means may be located in the baseband device 143, and the method performed by the backhaul node in the above embodiment may be implemented in the baseband device 143, where the baseband device 143 includes a processor 144 and a memory 145.
The baseband device 143 may, for example, include at least one baseband board, where a plurality of chips are disposed, as shown in fig. 14, where one chip, for example, a processor 144, is connected to the memory 145 to invoke a program in the memory 145 to perform the backhaul node operation shown in the above method embodiment.
The baseband device 143 may also include a network interface 146, such as a common public radio interface (common public radio interface, CPRI for short), for interacting with the radio frequency device 142.
Specifically, the backhaul node in the embodiment of the present application further includes: instructions or programs stored in the memory 145 and executable on the processor 144, the processor 144 invokes the instructions or programs in the memory 145 to perform the methods performed by the modules shown in fig. 11 or fig. 12, and achieve the same technical effects, and are not repeated here.
The embodiment of the present application further provides a readable storage medium, which may be volatile or non-volatile, and the readable storage medium stores a program or an instruction, where the program or the instruction implements each process of the BH RLC CH remapping method embodiment when executed by a processor, and the process can achieve the same technical effect, so that repetition is avoided and no further description is given here.
Wherein the processor is a processor in the terminal described in the above embodiment. The readable storage medium includes a computer readable storage medium such as a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk or an optical disk, and the like.
The embodiment of the present application further provides a chip, where the chip includes a processor and a communication interface, where the communication interface is coupled to the processor, where the processor is configured to run a program or an instruction, implement each process of the BH RLC CH remapping method embodiment, and achieve the same technical effect, so that repetition is avoided, and no further description is given here.
It should be understood that the chips referred to in the embodiments of the present application may also be referred to as system-on-chip chips, or the like.
Embodiments also provide a computer program/program product stored in a non-transitory storage medium, the computer program/program product being executed by at least one processor to implement the steps of the BH RLC CH remapping method described above.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element. Furthermore, it should be noted that the scope of the methods and apparatus in the embodiments of the present application is not limited to performing the functions in the order shown or discussed, but may also include performing the functions in a substantially simultaneous manner or in an opposite order depending on the functions involved, e.g., the described methods may be performed in an order different from that described, and various steps may also be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solutions of the present application may be embodied essentially or in a part contributing to the prior art in the form of a computer software product stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk), comprising several instructions for causing a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method described in the embodiments of the present application.
The embodiments of the present application have been described above with reference to the accompanying drawings, but the present application is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those of ordinary skill in the art without departing from the spirit of the present application and the scope of the claims, which are also within the protection of the present application.

Claims (32)

1. A method for remapping a feedback radio link control channel, BH RLC, CH, comprising:
a first backhaul node receives a first message sent by a second backhaul node, wherein the first message comprises target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information at least comprises an identity ID of the BH RLC CH;
the first backhaul node determines that a first BH RLC CH in the at least one BH RLC CH needs to be remapped according to the target information;
the first backhaul node determines a second BH RLC CH, which is a BH RLC CH on the first backhaul link;
the first backhaul node remaps data to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.
2. The method of claim 1, wherein the first message is a flow control message.
3. The method of claim 1 or 2, wherein the target information further comprises an available buffer capacity of the BH RLC CH;
the method further comprises the steps of:
The first backhaul node judges whether the BH RLC CH needs to be remapped according to whether the available buffer capacity of the BH RLC CH is smaller than or equal to a first threshold;
if the available buffer capacity of the BH RLC CH is less than or equal to a first threshold, the first backhaul node determines that the BH RLC CH needs to be remapped.
4. The method of claim 3 wherein the first threshold value for each BH RLC CH is the same or different.
5. The method according to claim 1 or 2, characterized in that the first message is a message for carrying target information of a BH RLC CH that needs to be remapped.
6. The method of claim 1 wherein the first backhaul node determining a second BH RLC CH comprises:
the first backhaul node selects a BH RLC CH, which is lower than or equal to the transmission priority of the first BH RLC CH and can be remapped, on the first backhaul link as the second BH RLC CH.
7. The method of claim 6, wherein the transmission priority of each BH RLC CH on the first backhaul link is configured by an IAB host concentration unit CU.
8. The method of claim 6 wherein the BH RLC CH that can be remapped is a BH RLC CH having an available buffer capacity greater than a first threshold.
9. The method of claim 1 or 6 wherein the first backhaul node determining a second BH RLC CH comprises:
if there are at least two second BH RLC CHs, the first backhaul node performs one of the following operations:
selecting the second BH RLC CH with the lowest transmission priority from the at least two second BH RLC CH as the second BH RLC CH for remapping;
selecting the second BH RLC CH with the largest available buffer capacity from the at least two second BH RLC CH as the second BH RLC CH for remapping;
selecting the second BH RLC CH with the least remapping times from the at least two second BH RLC CHs as the second BH RLC CH for remapping;
and randomly selecting one second BH RLC CH from the at least two second BH RLC CH as the second BH RLC CH for remapping.
10. The method as recited in claim 9, further comprising:
the first backhaul node increments a count of a remapping number counter of the second BH RLC CH for remapping.
11. The method of claim 10 wherein each of the second BH RLC CHs corresponds to one of the remapping number counters, the remapping number counters counting from 0 until the second BH RLC CHs are cleared when they cannot be remapped.
12. The method of claim 1 wherein remapping data that needs to be transmitted over the first BH RLC CH onto the second BH RLC CH for transmission further comprises:
the first backhaul node stops remapping of the first BH RLC CH if at least one of the following conditions is satisfied:
all the second BH RLC CH corresponding to the first BH RLC CH becomes non-remappable;
the first BH RLC CH becomes unnecessary for remapping.
13. The method of claim 12 wherein the second BH RLC CH that cannot be remapped is a BH RLC CH having an available buffer capacity less than or equal to a first threshold.
14. The method of claim 12 wherein the first BH RLC CH that does not require remapping is a BH RLC CH having an available buffer capacity greater than a first threshold.
15. The method as recited in claim 12, further comprising:
The first backhaul node determines whether the first BH RLC CH becomes unnecessary to be remapped.
16. The method of claim 15 wherein the first backhaul node determining whether the first BH RLC CH becomes unnecessary for remapping comprises:
the first backhaul node receives a second message sent by the second backhaul node, wherein the second message comprises target information of the first BH RLC CH;
and the first backhaul node judges whether the first BH RLC CH becomes unnecessary to be remapped according to the target information of the first BH RLC CH in the second message.
17. The method of claim 16 wherein the target information in the second message further comprises an available buffer capacity of the BH RLC CH;
the first backhaul node determining, according to the target information of the first BH RLC CH in the second message, whether the first BH RLC CH becomes unnecessary to perform remapping, including:
the first backhaul node judges whether the first BH RLC CH becomes unnecessary to be remapped according to whether the available buffer capacity of the first BH RLC CH is greater than or equal to a second threshold value;
And if the available buffer capacity of the first BH RLC CH is greater than or equal to the second threshold, the first backhaul node determines that the first BH RLC CH becomes unnecessary to be remapped.
18. The method of claim 17, wherein the second threshold is predefined by a protocol or preconfigured by a network.
19. The method of claim 17 wherein the second threshold value for each of the first BH RLC CHs is the same or different.
20. The method of claim 1 wherein the second BH RLC CH is a remapped BH RLC CH configured in advance for the first BH RLC CH.
21. The method of claim 20, wherein the QoS characteristics and/or transmission priorities of the second BH RLC CH and the first BH RLC CH are the same or similar.
22. The method of claim 20 wherein the second BH RLC CH is used only for data transmission for remapping of the first BH RLC CH.
23. The method of claim 1, wherein the first backhaul link is an uplink backhaul link or a downlink backhaul link.
24. A BH RLC CH remapping method, comprising:
The second backhaul node sends a first message to a first backhaul node, wherein the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, the target information includes at least an ID of the BH RLC CH, and the first message is used for indicating whether the at least one BH RLC CH needs to be remapped.
25. The method as recited in claim 24, further comprising:
the second backhaul node sends a second message to the first backhaul node, where the second message includes target information of the first BH RLC CH, and the second message is used to indicate whether the first BH RLC CH becomes unnecessary to be remapped.
26. The method of claim 24, wherein the first message is a flow control message.
27. The method of claim 24 or 26, wherein the target information further comprises an available buffer capacity of the BH RLC CH; and the BH RLC CH needing remapping is the BH RLC CH with the available buffer capacity smaller than or equal to a first threshold value.
28. The method of claim 25 wherein the destination information of the second message further comprises an available buffer capacity of the BH RLC CH; and under the condition that the available buffer capacity is larger than a first threshold value, the first BH RLC CH corresponding to the available buffer capacity does not need to be subjected to remapping.
29. A BH RLC CH remapping apparatus, comprising:
a first receiving module, configured to receive a first message sent by a second backhaul node, where the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and the second backhaul node, and the target information includes at least an ID of the BH RLC CH;
a first determining module, configured to determine, according to the target information, that a first BH RLC CH of the at least one BH RLC CH needs to be remapped;
a second determining module, configured to determine a second BH RLC CH, where the second BH RLC CH is a BH RLC CH on the first backhaul link;
and the remapping module is used for remapping the data which needs to be transmitted through the first BH RLC CH to the second BH RLC CH for transmission.
30. A BH RLC CH remapping apparatus, comprising:
the first sending module is configured to send a first message to a first backhaul node, where the first message includes target information of at least one BH RLC CH on a first backhaul link, the first backhaul link is a backhaul link between the first backhaul node and a second backhaul node, the target information includes at least an ID of the BH RLC CH, and the first message is used to indicate whether the at least one BH RLC CH needs to be remapped.
31. A backhaul node comprising a processor, a memory, and a program or instruction stored on the memory and executable on the processor, the program or instruction when executed by the processor implementing the steps of the BH RLC CH remapping method according to any one of claims 1-23, or the program or instruction when executed by the processor implementing the steps of the BH RLC CH remapping method according to any one of claims 24-28.
32. A readable storage medium having stored thereon a program or instructions which when executed by a processor performs the BH RLC CH remapping method according to any one of claims 1-23, or the steps of the BH RLC CH remapping method according to any one of claims 24-28.
CN202111211487.4A 2021-10-18 2021-10-18 BH RLC CH remapping method and device Pending CN115996418A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111211487.4A CN115996418A (en) 2021-10-18 2021-10-18 BH RLC CH remapping method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111211487.4A CN115996418A (en) 2021-10-18 2021-10-18 BH RLC CH remapping method and device

Publications (1)

Publication Number Publication Date
CN115996418A true CN115996418A (en) 2023-04-21

Family

ID=85992799

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111211487.4A Pending CN115996418A (en) 2021-10-18 2021-10-18 BH RLC CH remapping method and device

Country Status (1)

Country Link
CN (1) CN115996418A (en)

Similar Documents

Publication Publication Date Title
US8031658B2 (en) Method and apparatus for performing buffer status reporting
US8953443B2 (en) Method and apparatus for providing congestion management for a wireless communication network
EP3146682B1 (en) Method and system for managing flows in a network
US20210377787A1 (en) Downlink buffer status feedback method and apparatus
CN104137615B (en) Adaptive access channel overload controls
US9787595B2 (en) Evolved node-B and mobility management entity and user equipment and methods for supporting attended and unattended services
JP6953401B2 (en) Methods and devices for sending and receiving paging messages in mobile communication systems
AU2018409096B2 (en) Transmission control method, apparatus, and system
US9992793B2 (en) Method and apparatus for performing buffer status reporting
CN111866943B (en) Data transmission method and device
US20230269653A1 (en) Rerouting method and apparatus, and communication device
CN110138685B (en) Communication method and device
CN106304342B (en) Method and equipment for reporting
CN113498220A (en) User equipment and method thereof, base station and method thereof
CN115996418A (en) BH RLC CH remapping method and device
WO2017074362A1 (en) Multi-level data rate control for wireless networks
CN113259986B (en) Transmission method and network equipment
EP3737204B1 (en) Mobile communication system, method and device
US20240334242A1 (en) Control apparatus, control methods and non-transitory computer-readable storage medium
WO2022206544A1 (en) Data scheduling method and apparatus, and device
EP3105961B1 (en) Rbs, rnc and respective methods performed thereby for transmitting data to a ue
CN103716894B (en) Method and device for processing service data during bearing and preemption in LTE
US20240267780A1 (en) Communication control method and relay node
US20230388847A1 (en) Transmission path determining method and apparatus
CN115085877B (en) Information transmission method and device and IAB node

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