WO2019184890A1 - 一种信息传输方法和装置 - Google Patents

一种信息传输方法和装置 Download PDF

Info

Publication number
WO2019184890A1
WO2019184890A1 PCT/CN2019/079591 CN2019079591W WO2019184890A1 WO 2019184890 A1 WO2019184890 A1 WO 2019184890A1 CN 2019079591 W CN2019079591 W CN 2019079591W WO 2019184890 A1 WO2019184890 A1 WO 2019184890A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
granularity
relay node
information
relay
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.)
Ceased
Application number
PCT/CN2019/079591
Other languages
English (en)
French (fr)
Inventor
朱元萍
戴明增
石小丽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to EP19775569.7A priority Critical patent/EP3761698A4/en
Publication of WO2019184890A1 publication Critical patent/WO2019184890A1/zh
Priority to US17/029,986 priority patent/US11419010B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/12—Flow control between communication endpoints using signalling between network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/40—Monitoring; Testing of relay systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/155—Ground-based stations
    • H04B7/15528—Control of operation parameters of a relay station to exploit the physical medium
    • H04B7/15542—Selecting at relay station its transmit and receive resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0278—Traffic management, e.g. flow control or congestion control using buffer status reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers

Definitions

  • the present application relates to the field of communications technologies, and in particular, to an information transmission method and apparatus.
  • the high-frequency carrier In order to meet the ultra-high capacity requirements in the fifth generation (5G) system, the high-frequency carrier has been eagerly attracted due to its relatively low frequency and richer frequency resources, and has been selected as the main working frequency band of the 5G system.
  • the high-frequency carrier propagation characteristics are poor, the occlusion attenuation is severe, and the coverage is not wide. Therefore, a large number of densely deployed small stations are needed in the hotspot area. Accordingly, it is costly and fiber-optic for the large number of densely deployed small stations. Deployment is difficult.
  • IAB integrated access and backhaul
  • multi-hop wireless relay and multi-connection scenarios can be supported.
  • IAB networking scenario for multi-hop/multi-connection how to design the feedback information of each link so that the nodes capable of flow control (for example, (the upper node or the multi-link shunt anchor) can obtain feedback information according to the obtained information. It is an urgent problem to carry out flow control adjustment with reasonable granularity.
  • the embodiment of the present application provides an information transmission method and device, so as to implement flow control information feedback in a multi-hop/multi-connection IAB networking scenario.
  • an embodiment of the present application provides an information transmission method, including:
  • the relay node determines first information, where the first information includes at least one of: a buffer status of the relay node granularity, a radio bearer RB granularity between the relay node and the at least one first node Cache state, a cache state of each first node granularity in the at least one first node, a cache state of RB granularity between each of the at least one first node and the child node; the at least A first node is a child node of the relay node; the relay node sends a first packet carrying the first information to the second node.
  • the relay node can send a buffer state of different granularity of different links between itself and its child nodes to the second node, thereby making the second node
  • the flow control of each link can be reasonably adjusted according to the content of the first information.
  • the relay node determines the first information, including the following three implementation manners:
  • the relay node monitors its own buffer status to obtain a buffer status of the relay node granularity, and a buffer status of a radio bearer RB granularity between the relay node and the at least one first node. Decoding the state of each first node granularity in at least one of the first nodes.
  • the relay node receives a second packet that is sent by the at least one first node, and obtains, from the second packet, a granularity of each first node in the at least one first node. a cache state, a cache state of RB granularity between each of the first node and the child node in the at least one first node.
  • Embodiment 3 The relay node monitors its own buffer status, and receives a buffer status sent by the at least one first node, to obtain a buffer status of the relay node granularity, and the relay node and the at least one a radio bearer RB granularity cache state between the first nodes, a cache state of each of the at least one first node granularity, between each of the at least one first node and the child node The RB granularity of the cache state.
  • the content of the first information determined by the relay node is different by using different implementation manners, so that the flow control strategy of the destination node can be flexibly adapted.
  • the first packet further includes first indication information, which is used to indicate that the first packet is a packet that includes flow control feedback information.
  • the relay node determines the location according to the first indication information or the destination address carried in the second packet.
  • the second node is a destination node that receives the first packet.
  • the relay node can determine that the second node is the destination node according to the service type or the destination address, and can ensure that the first packet containing the first information can be accurately sent to the destination node.
  • the first information further includes a buffer status of the terminal DRB granularity, a buffer status of the terminal granularity, a buffer status of the terminal protocol data unit PDU session granularity, a buffer status of the terminal service quality flow granularity, and the middle information.
  • the first information may further include various information of a link between the relay node and the at least one first node, so that the second node can synthesize various link information to perform flow control of different links. Prevent link congestion.
  • the relay node sends the first packet carrying the first information to the second node, including the following two situations:
  • the relay node periodically sends the first packet to the second node.
  • the relay node when the preset event is triggered, the relay node sends the first packet to the second node.
  • the first message is sent in a peer GTP layer, a peer adaptation layer or a peer control layer between the relay node and the second node.
  • the different sending manners of the first message are applicable to different protocol stack architectures.
  • the relay node determines that the missing data packet sequence number not fed back to the second node is a chain that can be identified at the second node and the relay node and is in between Serial number serialized on the road.
  • an information transmission method including:
  • the terminal determines the first information, where the first information includes at least one of the following: a link state indication of the access link of the terminal, a data packet sequence number received by the terminal device, and the terminal device determining Lost unsuccessfully received data packet sequence number, link quality information of the access link of the terminal, average or minimum transmission delay of the access link of the terminal; the terminal sends the carrying number to the destination node The first message of a message.
  • an embodiment of the present application provides an information transmission apparatus, which is applied to a relay node, and includes:
  • a processing unit configured to determine first information, where the first information includes at least one of: a buffer state of the relay node granularity, a radio bearer between the relay node and at least one first node a cache state of the RB granularity, a cache state of each of the at least one first node, and a cache state of the RB granularity between each of the at least one first node and the child node;
  • the at least one first node is a child node of the relay node, and the sending unit is configured to send the first message carrying the first information to the second node.
  • the processing unit is specifically configured to: monitor a buffer status of the relay node to obtain a buffer status of the relay node granularity, and between the relay node and the at least one first node a radio bearer RB granularity cache state, a cache state of each of the at least one first node granularity; or,
  • the first packet further includes first indication information, which is used to indicate that the first packet is a packet that includes flow control feedback information.
  • the processing unit is further configured to: determine, according to the first indication information or a destination address carried in the second packet, that the second node is to receive the first packet node.
  • the first information further includes a buffer status of the terminal DRB granularity, a buffer status of the terminal granularity, a buffer status of the terminal protocol data unit PDU session granularity, a buffer status of the terminal service quality flow granularity, and the middle information.
  • the sending unit is specifically configured to: periodically send the first packet to the second node; or send the first node to the second node when a preset event is triggered. A message.
  • the first message is sent in a peer GTP layer, a peer adaptation layer or a peer control layer between the relay node and the second node.
  • the relay node determines that the missing data packet sequence number not fed back to the second node is a chain that can be identified at the second node and the relay node and is in between Serial number serialized on the road.
  • an embodiment of the present application provides an information transmission apparatus, which is applied to a terminal, and includes:
  • a processing unit configured to determine first information, where the first information includes at least one of: a link state indication of an access link of the terminal, a data packet sequence number received by the terminal device, Determining, by the terminal device, the lost unsuccessfully received data packet sequence number, the link quality information of the access link of the terminal, the average or minimum transmission delay of the access link of the terminal, and the sending unit, configured to: Sending a first packet carrying the first information to the destination node.
  • an embodiment of the present application provides a relay device, where the relay device includes: a transceiver, a processor, and a memory; the memory is configured to store computer executable instructions; and the processor is configured to determine For information, the first information includes at least one of the following: a buffer status of the relay device granularity, a buffer status of a radio bearer RB granularity between the relay device and the at least one first device, a cache state of each first device granularity in the at least one first device, a cache state of an RB granularity between each of the at least one first device and the child device; the at least one first device is a sub-device of the relay device; when the processor executes the computer-executable instruction, the transceiver is configured to send a first message carrying the first information to the second device.
  • an embodiment of the present application provides a terminal, where the terminal includes: a transceiver, a processor, and a memory; the memory is configured to store computer executable instructions; and the processor is configured to determine the first information, where The first information includes at least one of the following: a link state indication of the access link of the terminal, a data packet sequence number received by the terminal device, and the terminal device determines that the lost data is unsuccessfully received. a packet sequence number, link quality information of an access link of the terminal, an average or minimum transmission delay of an access link of the terminal; when the processor executes the computer executable instruction, the The transceiver is configured to send the first packet carrying the first information to the destination node.
  • an embodiment of the present application provides a computer program product, including a computer program, which when executed on a computer unit, causes the computer unit to implement the first aspect and its possible design. The method described.
  • an embodiment of the present application provides a computer program product, including a computer program, which when executed on a computer unit, causes the computer unit to implement the method as described in the second aspect.
  • an embodiment of the present application provides a computer program that, when executed on a computer unit, causes the computer unit to implement the method as described in the first aspect and its possible design.
  • the embodiment of the present application provides a computer program, when executed on a computer unit, causes the computer unit to implement the method as described in the second aspect.
  • an embodiment of the present application provides a computer readable storage medium, where a computer program is stored thereon, and when the computer program is executed on a computer, the computer is implemented as the first aspect and its possible The method described in the design.
  • the embodiment of the present application provides a computer readable storage medium, where a computer program is stored, and when the computer program is executed on a computer, the computer is implemented as described in the second aspect. method.
  • the embodiment of the present application provides a chip, including: a processing module and a communication interface, where the processing module is configured to perform the method as described in the first aspect and its possible design.
  • the embodiment of the present application provides a chip, including: a processing module and a communication interface, where the processing module is configured to perform the method as described in the second aspect.
  • FIG. 1 is a schematic diagram of a trunk network architecture according to an embodiment of the present application.
  • FIG. 2 is a schematic flowchart of an information transmission method in an embodiment of the present application.
  • FIG. 3A and FIG. 3B are schematic diagrams showing content of the first information in the embodiment of the present application.
  • 4A-4E are schematic diagrams of a two-hop user plane protocol architecture in the embodiment of the present application.
  • 5A to 5E are schematic diagrams showing a two-hop control plane protocol architecture in the embodiment of the present application.
  • FIG. 6A and FIG. 6B are schematic diagrams of a wireless relay networking scenario in which multiple access links are connected in an embodiment of the present application
  • FIG. 7A, 7B, and 7C are schematic diagrams of a multi-hop wireless relay networking scenario in the embodiment of the present application.
  • FIG. 8 is a schematic diagram of a wireless relay networking scenario in which multiple hops and access links are connected in multiple embodiments in the present application;
  • FIG. 9 is a schematic diagram of a multi-hop user plane and control plane protocol architecture in the embodiment of the present application.
  • FIG. 10 is a schematic structural diagram of an information transmission apparatus according to an embodiment of the present application.
  • FIG. 11 is a second schematic structural diagram of an information transmission apparatus according to an embodiment of the present application.
  • FIG. 12 is a schematic structural diagram of a relay device according to an embodiment of the present application.
  • FIG. 13 is a schematic structural diagram of a terminal in an embodiment of the present application.
  • FIG. 1 is a schematic diagram of a relay network architecture according to an embodiment of the present application, where the network element includes a terminal, a relay node, and a destination node, where:
  • a relay node configured to receive a first packet sent by the child node or the terminal, and send a first packet to the parent node or the distribution anchor of the relay node, optionally, the first The message can be flow control feedback information.
  • the relay node in the present application may provide a wireless access service for the terminal device, and transmit the service flow of the access link through the wireless backhaul link, and the relay node may also be called another name, such as an IAB node ( IAB node).
  • the destination node is a node with flow control capability, for example, a parent node of the host base station or the relay node or another relay node as a branching anchor point, and the like, and is used to receive the first report sent by the child node or the secondary node or the terminal. And adjusting the service allocation ratio or the sending rate of a certain granularity on each link according to the content in the first packet.
  • node B if node A has a higher-level node B, node B is called a parent node of node A, and if node A has a lower-level node C, node C is a child node of node A. Or node C is the secondary node of node A.
  • the UE3, the first node RN2, and the RN3 are child nodes of the relay node RN1, and the second-level child node RN4 is a child node of the first node RN2; correspondingly, the relay node RN1 is the first node RN2 and RN3 and the parent node of UE3.
  • the shunt anchor point refers to when at least two transmission paths are available between the node A and the node B, if at least two of the plurality of transmission paths are used for transmission between the node A and the node B Data, such as Node A receiving data sent via Node B from multiple transmission paths in a multi-connection manner, Node B may be referred to as a Shunt Anchor.
  • the terminal which may also be referred to as a user equipment (UE), is configured to send an anchor point of a radio resource control (RRC) layer/packet data convergence protocol (PDCP) layer to the radio resource control (RRC) layer.
  • RRC radio resource control
  • PDCP packet data convergence protocol
  • the anchor point of the RRC/PDCP layer of the terminal refers to a node where the protocol layer of the RRC/PDCP layer peering with the UE is located, for example, a host base station DgNB (Donor gNB), or a relay node.
  • a terminal in the embodiment of the present application refers to a terminal that directly accesses a relay node or indirectly accesses a relay node through another relay node, and provides an access service through the relay node.
  • the terminal may have multiple access links (Access Link, AL), the relay node and the host base station.
  • AL access links
  • the embodiment of the present application provides an information transmission method, and the specific process is as follows:
  • Step 200 The relay node determines first information, where the first information includes at least one of: a buffer state of the relay node granularity, and a wireless between the relay node and at least one first node. a buffer status of a radio bearer (RB) granularity, a buffer status of each first node granularity in the at least one first node, and an RB between each of the at least one first node and the child node a granular state of cache; the at least one first node is a child of the relay node.
  • RB radio bearer
  • Step 210 The relay node sends a first packet carrying the first information to the second node.
  • step 200 when the relay node determines the first information, it may be determined by the following three implementation manners.
  • the relay node monitors its own buffer status to obtain a buffer status of the relay node granularity, and a buffer status of the RB granularity between the relay node and the at least one first node, a cache state of each of the at least one first node granularity.
  • the buffer status of the UE granularity, the buffer status of the UE RB granularity, the buffer status of the packet/protocol data unit (PDU) session granularity, and the quality of service of the UE The quality of the service, the QoS, and the Cache of the granularity of the flow.
  • the first information further carries an identifier corresponding to each of the cached states, and is used to indicate a node or a radio bearer or a PDU corresponding to the cached state. Session or QoS flow.
  • the relay node RN1 in FIG. 1 is taken as an example to describe the content included in the first information in the first implementation manner.
  • the first information specifically includes at least one of the following information.
  • the buffer status of the relay node RN1 granularity for example, the total buffer status S of the relay node RN1.
  • a buffer status of the first node particle size for example, comprises: buffer status S relay node RN1 to RN2 RN2 allocated, the relay node RN1 to RN3 RN3 S allocated buffer status and the like.
  • the buffer status of the RB granularity between the relay node RN1 and the first node specifically including, for example, the buffer status allocated by the relay node RN1 for the first radio bearer (for example, RN2 RB1) between the relay node RN1 and RN2.
  • S RN2-RB1 the relay node RN1 is a buffer state S RN3-RB2 assigned to a second radio bearer (for example, RN3 RB2) between the relay node RN1 and RN3.
  • A4) size of the buffer status of the UE specifically includes for example: a relay node RN1 to the buffer allocated state S UE1 UE1, the relay node RN1 to the buffer allocated state UE2 S UE2, the relay node RN1 to the buffer allocated state S UE3 UE3 Wait.
  • the buffer status of the UE PDU session granularity specifically including, for example, the buffer status S UE1-A allocated by the relay node RN1 for the first PDU session of UE1 (such as PDU session A), and the second PDU of the relay node RN1 being UE1
  • the cache state S UE1-B assigned by the session (such as PDU session B).
  • the buffer status of the UE RB granularity specifically including, for example, the buffer status A 11 allocated by the relay node RN1 for the first radio bearer (such as UE1 RB1) of UE1, and the second radio bearer of the relay node RN1 being UE1 (such as UE1) RB2) allocated buffer state A 12 , buffer node A 21 allocated by relay node RN1 for UE 2's first radio bearer (UE2 RB1), and relay node RN1 allocated buffer for UE3's first radio bearer (eg UE3 RB1) State A 31 and so on.
  • the buffer status A 11 allocated by the relay node RN1 for the first radio bearer such as UE1 RB1 of UE1
  • the second radio bearer of the relay node RN1 being UE1 (such as UE1) RB2) allocated buffer state A 12
  • buffer node A 21 allocated by relay node RN1 for UE 2's first radio bearer (UE2 RB1) and relay node
  • the buffer status of the UE QoS flow granularity specifically including, for example, the buffer status Q 11 allocated by the relay node RN1 for the first QoS flow of UE1 (such as UE1 QoS flow1), and the second QoS flow of the relay node RN1 for UE1 ( The buffer state Q 12 allocated by the UE1 QoS flow 2), the buffer state Q 21 allocated by the relay node RN1 for the first QoS flow of the UE 2 (such as UE2 QoS flow 1), and the like.
  • the first information further carries an identifier corresponding to each cache state.
  • the identifier corresponding to the total cache state S of the relay node RN1 is the identifier of the RN1, and the foregoing A2) buffer status of the relay node RN1 to RN2 RN2 S assigned identifier corresponding to the identifier RN2; relay node RN1 above A3) is allocated to the RB1 between RN2 and RN1 RN2 the buffer status S RN2-RB1 corresponding identifier
  • the identifier corresponding to the cache state S UE1-A is the identifier of the UE1 and the UE1 PDU session A ID; the identifier corresponding to the cache state A 11 allocated by the relay node RN1 in the A6) to the UUE1RB1 is the identifier of the UE1, and the UE1 RB1 ID; The identifier corresponding to the buffer state Q 11 allocated by the relay node RN1 in the above A7) to the UE1 QoS flow1 is the identifier of the UE1 and the UE1 QoS flow1 ID.
  • the relay node receives the second packet that is sent by the at least one first node, and obtains each of the at least one first node from the second packet.
  • a buffering state of the node granularity, a buffering state of the RB granularity between each of the at least one first node and the child node optionally, a buffering state of the UE granularity, and a buffering state of the UE RB granularity
  • a buffering state of the PDU session granularity of the UE and a buffering state of the QoS flow granularity of the UE.
  • the first information further carries an identifier corresponding to each buffering state, and is used to indicate the node corresponding to the buffering state or Radio bearer or PDU session or QoS flow.
  • the relay node RN1 in FIG. 1 is taken as an example to describe the content included in the first information in the second implementation manner.
  • the first information specifically includes:
  • the buffer status of the RB granularity between the first node RN2 and the child node specifically including, for example, the buffer status P RN4-RB1 allocated by the RN2 for the first radio bearer (such as RN4 RB 1) between RN4 and RN2.
  • the buffer state of the child node granularity of the first node RN2 in the foregoing B2) is the buffer state of the UE granularity, and the first node RN2 and the child in the above B3)
  • the buffer status of the RB granularity between nodes that is, the buffer status of the UE RB granularity.
  • UE buffer status particle size for example, comprises: a first node RN2 buffer status is allocated to UE1 UE1 P, buffer status of the first node RN2 UE2 assigned P UE2 like.
  • a buffer status of the UE PDU session particle size for example, comprises: a first node RN2 of buffer status UE1 PDU session A distribution P UE1-A, the cache for the first node RN2 UE1 PDU session B state distribution P UE1-B, etc. .
  • the buffer status of the UE RB granularity specifically, for example, the buffer status X 11 allocated by the first node RN2 for the UE1 RB1, the buffer status X 12 allocated by the first node RN2 for the UE1 RB2, and the first node RN2 allocated for the UE2 RB1 Cache status X 21 and so on.
  • QoS flow granularity UE buffer status for example, comprises: a first node RN2 of the buffer allocated state UE1 QoS flow1 Y 11, to the first node RN2 buffer allocated state UE1 QoS flow2 Y 12; node RN2 of UE2 The cache state Y 21 allocated by QoS flow1 and the buffer state Y 22 allocated by the first node RN2 for UE2 QoS flow2.
  • the first information further carries an identifier corresponding to each buffer state.
  • the RN2 is the VR4 RB1 allocated buffer state P RN4-RB1 corresponding to the identifier of the RN4
  • the identifier of the RN4 RB 1 refers to the related examples in the foregoing first implementation manner.
  • the relay node monitors its own buffer status, and receives a buffer status sent by the at least one first node, to obtain a buffer status of the relay node granularity, and the relay node and the a cache state of a radio bearer RB granularity between the at least one first node, a cache state of each first node granularity in the at least one first node, and each of the at least one first node and the first node Cache granularity of RB granularity between nodes, optionally, cache state of UE granularity, cache state of UE RB granularity, cache state of PDU session granularity of UE, cache state of QoS flow granularity of UE; optional
  • the first information further carries an identifier corresponding to each cache state, and is used to indicate a node or a radio bearer or a PDU session or a QoS flow corresponding to the cache state.
  • the relay node RN1 receives the buffer state that its child node assumes to be sent by the first node RN2, and the cache state of the RN1 itself.
  • the partial information is subjected to a merge operation of the union to determine the first information, and the first information may include at least one of the following contents:
  • the buffer state of the relay node RN1 granularity that is, the total cache state S of the relay node RN1.
  • the particle size of the buffer status of the first node for example, comprises: buffer status S relay node RN1 to RN2 RN2 allocated, the relay node RN1 to RN3 RN3 S allocated buffer status and the like.
  • the buffer status of the RB granularity between the relay node RN1 and the first node specifically including, for example, the buffer status allocated by the relay node RN1 for the first radio bearer (for example, RN2 RB1) between the relay node RN1 and RN2.
  • S RN2-RB1 the relay node RN1 is a buffer state S RN3-RB2 assigned to the RN3 RB2 by the second radio bearer between the relay node RN1 and RN3.
  • the buffer status of the RB granularity between the first node RN2 and the child node specifically including, for example, the buffer status P RN4-RB1 allocated by the RN2 for the first radio bearer (such as RN4 RB 1) between RN4 and RN2.
  • the buffer state of the child node granularity of the first node RN2 in the above C5) is the buffer state of the UE granularity
  • the first node RN2 and the child in the above C6 The buffer status of the RB granularity between nodes, that is, the buffer status of the UE RB granularity.
  • state of the UE buffer size for example, comprises: a relay node RN1 to the buffer allocated state S UE1 UE1, buffer status of the first node RN2 distribution P UE1 UE1, UE2 is allocated the relay node RN1 of the buffer status S UE2 The first node RN2 allocates the buffer state P UE2 and the like to the UE2 .
  • the buffer status of the UE PDU session granularity specifically including, for example, the buffer status S UE1-A allocated by the relay node RN1 for the UE1 PDU session A , and the buffer status P UE1-A allocated by the first node RN2 for the UE1 PDU session A , The buffer state S UE1- B allocated by the relay node RN1 for the UE1 PDU session B, the buffer state P UE1-B allocated by the first node RN2 for the UE1 PDU sessionB, and the like.
  • the buffer status of the UE RB granularity specifically including, for example, the buffer status A 11 allocated by the relay node RN1 for the UE1 RB1, the buffer status X 11 allocated by the first node RN2 for the UE1 RB1, and the relay node RN1 allocated for the UE1 RB2.
  • Cache state A 12 buffer state A 21 allocated by relay node RN1 for UE2 RB1, buffer state X 21 allocated by UE1 RB1 by first node RN1, cache state A 31 allocated to UE3 RB1 by relay node RN1, and the like.
  • the QoS state of the UE QoS flow granularity specifically, for example, the buffer state Q 11 allocated by the relay node RN1 for the UE1 QoS flow1, the buffer state Y 11 allocated by the first node RN2 for the UE1 QoS flow1, and the relay node RN1 being the UE1 buffer status assigned QoS flow2 Q 12, the first node RN2 allocated to UE1 QoS flow2 buffer status Y 12, the relay node RN1 to UE2 QoS flow1 allocated buffer status Q 21, the first node RN2 is allocated buffers UE2 QoS flow1 State Y 21 , the first node RN2 is the buffer state Y 22 assigned to the UE2 QoS flow 2, and the like.
  • the first information also carries an identifier corresponding to each cache state, and the identifier corresponding to the specific cache state may be referred to the related examples in the foregoing first and second implementation manners.
  • the merging operation used in the example is only one implementation of the merging operation, and may be other merging operations, such as taking the maximum value, taking the minimum value, summing, etc., which is not specifically limited in this application.
  • the buffer status of the relay node granularity refers to the local cache status of the relay node, that is, the summary information of the buffer status at the relay node, for example, the relay node is all served by the UE (including a UE directly connected by a relay node, and a UE indirectly served by the relay node, that is, a UE connected to another relay node that needs to establish a backhaul link with the base station via the relay node, or a radio bearer granularity of the UE.
  • a secondary relay node or a UE accessing the serving cell of the relay node.
  • all first nodes of the relay node RN1 include: a first node RN2, a first node RN3, and a UE3.
  • the buffering state of the RB granularity between the relay node and the first node refers to a buffer state of the relay node, and a corresponding to each RB corresponding to the relay node and the first node respectively Cache status. For example, if the relay node performs cache management and allocation according to the RB between the sub-nodes and the relay node, the RB granularity of the relay node and the first node is the cache state.
  • the buffer state corresponding to a certain RB (referred to as the target RB) between the node and the first node is the relay node, and the data packet to be transmitted via the first node and to be mapped to the target RB Summary information of the cache status of the radio bearers of all UEs.
  • the cache state of the first node granularity refers to the summary information of the cache state associated with the first node in the cache state of the relay node. For example, if the relay node performs buffer allocation and management according to each child node, the cache state of the first node granularity is the cache state allocated by the relay node to the first node; or, if the relay is The node performs buffer management and allocation according to the granularity of the RB between each sub-node and the relay node, and the buffer state of the first node granularity is the relay node, the first node and the relay node.
  • the cache state of the UE granularity may be a cache state corresponding to a certain UE in a buffer state of the relay node.
  • the relay node performs buffer management and allocation according to the granularity of the UE, and the buffer status of the UE granularity is the buffer status corresponding to a certain UE at the relay node; or the relay node follows the
  • the radio bearer of the UE performs buffer management and allocation for the granularity
  • the buffer status of the UE granularity is a summary of the buffer status of all radio bearers that the UE needs to transmit data packets through the relay node at the relay node. information.
  • the buffer status of the UE granularity is a buffer status corresponding to a certain UE in a buffer status of the relay node at the relay node, and the relay node.
  • the received sub-node summarizes the cached state corresponding to the UE included in the second packet, and summarizes the summarized information.
  • the cache state of the UE RB granularity may be a cache state corresponding to a specific radio bearer of a certain UE in the buffer of the relay node.
  • the relay node performs buffer management and allocation according to the granularity of the UE RB, and the buffer status of the UE RB granularity is the buffer status of the specific radio bearer corresponding to a certain UE at the relay node.
  • the buffer status of the UE RB granularity is a buffer status corresponding to a specific radio bearer of a certain UE in a buffer status of the relay node at the relay node, and The buffered state corresponding to the specific radio bearer of the UE included in the second packet received by the relay node, and the summarized information is summarized.
  • the buffer status of the PDU session granularity of the UE may be a buffer status corresponding to a specific PDU session of a certain UE in the buffer status of the relay node. For example, if the relay node can identify the PDU session of the UE corresponding to the data packet (for example, in a multi-hop IAB network composed of layer 3 relays, the relay node can maintain a general packet radio service tunnel corresponding to the UE PDU session.
  • the general packet radio service tunnel protocol (GTP) tunnel so that the PDU session of the UE can be identified, the relay node can perform buffer management and allocation based on the granularity of the UE PDU session, and the buffer status of the UE PDU session granularity is At the relay node, a cache state corresponding to a specific PDU session of a certain UE.
  • the buffer status of the PDU session granularity of the UE is a buffer status corresponding to a specific PDU session of a certain UE in a buffer status of the relay node at the relay node.
  • the cache state of the QoS flow granularity of the UE may be a cache state corresponding to a specific QoS flow of a certain UE in the buffer state of the relay node. For example, if the relay node can identify the QoS flow of the UE corresponding to the data packet (for example, in a multi-hop IAB network composed of layer 3 relays, the relay node can maintain a GTP tunnel corresponding to the UE PDU session, the UE The data packet can carry the QoS flow tag QFI in the GTP header, so the relay node can identify the QoS flow of the UE, and the relay node can perform buffer management and allocation based on the QoS flow of the UE, where the UE The cache state of the QoS flow granularity is the cache state of the specific QoS flow corresponding to a certain UE at the relay node.
  • a buffering state of the QoS flow granularity of the UE is a buffering state corresponding to a specific QoS flow of a certain UE in a buffering state of the relay node at the relay node. And summarizing the aggregated information corresponding to the specific QoS flow of the UE included in the second packet by the child node received by the relay node.
  • the radio bearer described in this application may be a data radio bearer (DRB), or a signaling radio bearer (SRB) or an RLC bearer (RLC bearer).
  • DRB data radio bearer
  • SRB signaling radio bearer
  • RLC bearer RLC bearer
  • the buffering state of a certain granularity B at a certain node A in the present application may be a physical buffer allocated according to the granularity B at the node A, or may be a receiving/sending window according to the granularity B at the node A.
  • the allocated physical cache (in this case, it can be understood that the buffer state of the granularity B is determined by the total number of packets or the number of packets that can be accommodated in the receiving/transmitting window corresponding to the granularity B, and the receiving/transmitting window is used.
  • the effective reception/transmission range of the data corresponding to the granularity B is defined.
  • the cache status described in the present application is composed of at least one of the following contents: 1) the total amount of data already in the cache, for example, the sum of the amounts of data in a given granularity cache, the total data
  • the quantity can be described by an exact value (such as a single digit in bytes or bits, accurate to the natural number of digits) or in a range (such as dividing the total amount of data into a finite range, each range corresponding to a value
  • the feedback overhead can be reduced for description
  • 2) the sequence number of the data packet in the cache including, for example, the minimum value of the data packet sequence number in a given granularity cache, the maximum value of the data packet sequence number in a given granularity cache, a given granularity Enumeration of all packet sequence numbers in the cache, etc.
  • the total size of the cache such as the total amount of data that can be accommodated in the cache, or the number of packets that can be accommodated
  • the summary information of the cache state described in the present application refers to a summary cache state obtained by performing a merge operation on a plurality of cache states that need to be summarized.
  • the merging operation may be a summation, for example, the total amount of data in the cache included in the plurality of cache states that need to be summarized, the number of data packets in the cache, the total size of the cache, and the remaining of the cache. Items such as space are summed separately, and the summed result is used as the content in the summary information; or the maximum value is taken, for example, the "maximum value of the packet number in the cache" included in the plurality of cache states that need to be summarized.
  • the maximum value is taken as the "maximum value of the serial number of the data packet in the cache" in the summary information; or the minimum value, for example, the minimum value of the serial number of the data packet in the cache included in the plurality of cache states that need to be summarized
  • the minimum value is taken as the "minimum value of the packet number in the cache" in the summary information; or the union of multiple sets is taken, for example, if the cache state contains "an enumeration of all packet numbers in the cache", Then treat it as set 1, and take the union of set 1 in multiple cache states that need to be aggregated to get set 2, and use set 2 as the "cache" in the summary information.
  • the specific form and order in which the summary relates to the merging operation is not limited in the present application.
  • the first information further includes a link state indication between the relay node and the at least one first node (eg, the link state is an outage/blockage or a link recovery, a packet sequence number that the relay node has successfully sent to the first node or the UE (which may be a maximum value of a packet sequence number that has been successfully transmitted to the first node or the UE, or Is an enumeration of all packet numbers that have not been successfully sent to the first node or the UE, and the relay node determines the packet sequence number that is lost and has not been fed back to the second node, the relay node and Link signal quality between the at least one first node, bandwidth or transmission rate of the relay node granularity, bandwidth or transmission rate of the UE granularity, bandwidth or transmission rate of the UE radio bearer granularity, the relay node and the An average or minimum transmission delay of the link between the at least one first node (refers to an average/minimum one-way transmission delay of the link
  • the round trip time (RTT) of the link between the relay node and the at least one first node starts from the data sent by the relay node, and the first node receives the data from the relay node.
  • the total response time (such as acknowledgment ACK or negative acknowledgment NACK).
  • the first information in the embodiment of the present application may further include link information between the n-th sub-node of the relay node and the n+1-level sub-node of the relay node (n is a positive integer greater than or equal to 1 And a summary of the link information of the segments between the relay node and its n-level child nodes, where the link information may be, for example, link state indication, link signal quality, link average or minimum transmission delay , link bandwidth or transmission rate, etc.
  • the n-level child node of the relay node is connected to the child node of the relay node through an n-hop link.
  • the first node directly connects to the relay node through a one-hop link, so the first node is a relay.
  • the level 1 child node of the node, the child node of the first node is the level 2 child node of the relay node, and so on.
  • the type of the first node may be a relay node or a terminal.
  • the first packet further includes first indication information, where the first packet is used to indicate that the first packet is a packet that includes flow control feedback information.
  • the specific implementation process is: the relay node determines that the second node is the destination node that receives the first packet. The relay node sends a first packet carrying the first information to the second node.
  • the relay node determines that the second node is a destination node that receives the first packet, and has at least the following two modes:
  • the relay node determines, according to the first indication information, that the second node is a destination node that receives the first packet, for example, the first packet includes a service type indication, indicating that the service type of the first information is a flow and a flow. Controlling the related feedback information, the relay node may determine that the second node is the destination node that receives the first message.
  • the relay node determines, according to the destination address carried in the second packet, the second node is the destination node that receives the first packet, for example, the destination address carried in the second packet.
  • the identifier of the second node, or the destination address carried in the second packet is a multicast/broadcast address identifier, and the node corresponding to the multicast/broadcast address identifier includes the second node.
  • the identifier of the second node may be, for example, an IP address of the second node, a MAC address, a relay node identifier (RN ID), a cell identifier of the second node service, and a base station identifier (such as a next-generation Node B identifier gNB). ID), a local unique identifier assigned by the host base station to the second node, a UE ID when the UE part is included in the second node, and the like, and the specific node identifier type is not limited.
  • the relay node After the relay node determines that the second node is the destination node that receives the first packet, the relay node sends the first packet carrying the first information to the second node.
  • the relay node sends the first packet carrying the first information to the second node.
  • the relay node determines that the second node is a destination node that receives the first packet, and the first information is carried in the first packet and sent directly to the second node.
  • the relay node that is the sink node does not perform any processing on the received first information, and is carried in the first packet generated by the relay node, and directly sent to the second node, and may also directly be the first The information is sent to the second node.
  • the relay node determines that the second node is a destination node that receives the first packet, and the first information is aggregated and then carried in the first packet to be sent to the second node. In this implementation manner, the relay node aggregates part or all of the received second packet and then carries it in the first packet generated by the relay node, and sends the packet to the second node.
  • the UE granularity or the UE radio bearer granularity or the PDU session granularity of the UE or the QoS flow granularity of the UE may be separately summarized, or the bandwidth/transmission rate of the relay node granularity or the UE granularity or the UE radio bearer granularity may be used.
  • the merging operation may be an operation such as summation, taking a maximum value, taking a minimum value, taking a union, etc., and may refer to the foregoing merging operation involved in the summary of the cache state.
  • the relay node may periodically send the first packet to the second node when the first node sends the first packet to the second node; or, when the preset event is triggered, the relay node sends the first packet to the second node.
  • the second node sends the first packet.
  • the relay node involved in the embodiment of the present application has a layer 3 relay according to the protocol function supported by the relay node.
  • the data packet forwarded through the relay node is, for example, an Internet Protocol (IP) packet.
  • IP Internet Protocol
  • Other PDUs carried in PDU sessions of UEs such as Ethernet Ethernet), Layer 2 relays (data packets forwarded via relay nodes are, for example, PDCP Protocol Data Units (PDUs) or Service Data Adaptation Protocols ( Service Data Adaptation Protocol (SDAP) PDU or radio link control (RLC) PDU or medium access control (MAC) PDU, etc.
  • layer 3+ layer 2 hybrid networking scenarios where In the mixed networking scenario, an optional way is that when there are multiple links on the backhaul link, the relay node that is the offload anchor is the layer 3 relay, and the relay nodes in other locations are in layer 2.
  • the specific feedback granularity may be the UE.
  • the first message sent by the relay node may be sent in a peer GTP layer between the relay node and the second node, or between the relay node and the second node.
  • the transmission is performed in an adaptation layer, or in a peer-to-peer control layer between the relay node and the second node, which will be exemplified below.
  • FIG. 4A to FIG. 4E are schematic diagrams showing a user plane protocol stack architecture in a two-hop relay group network field.
  • the number of relay nodes may also be any number, and the user can be extended to the single.
  • any other relay node may be added between RN2 and RN1, and then expanded to
  • the protocol stack on the interface between the newly added relay node and RN1/RN2 can be understood by referring to the protocol stack between RN1 and RN2.
  • the first packet fed back by the relay node may be carried in an Adapt PDU and sent to the second node.
  • the second node may be As another relay node or a donor base station (Donor gNB, DgNB) of the parent node of the relay node, optionally, if the host base station is in a form in which the centralized unit and the distributed unit are separated, the second node further It can be a distributed unit (Donor-DU) of the donor base station or a centralized unit (Donor-CU) of the donor base station.
  • the first message fed back by the relay node may be carried in the Adapt PDU and sent to the second node, where the second node may be the parent node of the relay node.
  • Another relay node or a host base station optionally, if the host base station is in a form in which the centralized unit and the distributed unit are separated, the second node may also be a distributed unit of the host base station or a centralized type of the base station.
  • the first message fed back by the relay node may be carried in the GTP PDU and sent to the second node.
  • the second node may be the host base station, optionally, if the host base station is a centralized unit In a form separated from the distributed unit, the second node may also be a centralized unit of the donor base station.
  • the first message fed back by the relay node may be carried in the Adapt PDU and sent to the second node, where the second node may be the parent node of the relay node.
  • Another relay node or a host base station optionally, if the host base station is in a form in which the centralized unit and the distributed unit are separated, the second node may also be a distributed unit of the host base station or a centralized type of the base station.
  • the first message fed back by the relay node may be carried in the GTP PDU and sent to the second node.
  • the second node may be another relay node that is the parent node of the relay node.
  • the host base station optionally, if the host base station is in a form of a centralized unit and a distributed unit, the second node may also be a distributed unit of the host base station or a centralized unit of the host base station.
  • the first packet fed back by the relay node may be carried in the Adapt PDU and sent to the second node.
  • the second node may be the relay node.
  • Another relay node or a host base station of the parent node optionally, if the host base station is in a form of a centralized unit and a distributed unit, the second node may also be a distributed unit or a host base station of the host base station. Centralized unit.
  • the first message fed back by the relay node may be carried in the GTP PDU and sent to the second node.
  • the second node may be the relay.
  • Another relay node or a host base station of the parent node of the node may be in a form of a centralized unit and a distributed unit.
  • the second node may also be a centralized unit of the host base station.
  • the host base station (DgNB) in the embodiment of the present application is a complete functional entity, and does not consider the form of a centralized unit (CU) and a distributed unit (DU), it is not necessary.
  • the protocol stack on the interface between the CU and the DU the DgNB reserves the protocol stack that is equivalent to the relay node and the UE on the access network side.
  • the peer layer of the PDCP protocol layer of the UE is located in the centralized unit of the donor base station or the donor base station. If the UE feeds back the first packet through the PDCP PDU, the UE sends the first packet to the centralized base unit of the host base station or the donor base station through the at least one relay node; or, as shown in FIG. 4D and FIG. 4E
  • the peer layer of the PDCP protocol layer of the UE is located in the relay node (for example, RN2 in FIG. 4), and the UE sends the first packet to the relay node (for example, 4A to RN2) in Fig. 4E.
  • the protocol stacks shown in FIG. 4A to FIG. 4E may be flexibly changed according to actual applications.
  • UDP layer for Figure 4B, in one possible design, there may be no peer between RN2 and DgNB/Donor-CU.
  • UDP layer for Figure 4C, in a possible design, there may be no peer UDP layer between RN2 and RN1, and RN1 and Donor-DU; for Figure 4E, between RN2 and RN1, and between RN1 and Donor-CU
  • the peer layer between RN1 and RN2 may also be replaced by an IP layer, similarly between RN1 and DgNB/Donor-DU
  • the peer-to-peer Adapt layer can also be replaced by the IP layer; for Figure 4E, in a possible design, the peer IP layer between RN2 and RN1, or the peer IP layer between RN1 and DgNB/Donor-CU, It can be replaced by the Adapt layer;
  • each protocol layer PDU refers to a data packet that is processed by the protocol layer and then handed over to the next protocol layer.
  • FIG. 4A to FIG. 5E are schematic diagrams showing a control plane protocol stack structure in a two-hop relay group network field.
  • the number of relay nodes may also be any, and the user can be extended to single-hop. Or any multi-hop relay networking scenario.
  • RN1 in FIG. 5A to FIG. 5E is removed, it will evolve into a single-hop relay networking scenario; or, in actual application, any other relay node may be added between RN2 and RN1, and then expanded to
  • the protocol stack on the interface between the newly added relay node and RN1/RN2 can be understood by referring to the protocol stack between RN1 and RN2.
  • the manner in which the first packet is sent is also different.
  • the first packet fed back by the relay node may be carried in the T1 layer message (or the PDU of the T1 layer) and sent to the second node.
  • the second node may be a host base station.
  • the host base station is in a form of a centralized unit and a distributed unit, the second node may also be a centralized unit of the host base station.
  • the T1 protocol layer may be, for example, an F1-AP layer, and may be used to send information between the relay node and the second node, including, for example, a connection management related message between the two, and a UE-related context.
  • the control plane message of the configuration information, the RRC message of the UE, and the like is not limited.
  • the first packet fed back by the relay node may be carried in the T1 layer message (or the PDU of the T1 layer) and sent to the second node.
  • the node may be another relay node or a host base station that is the parent node of the relay node. Alternatively, if the host base station is in a form in which the centralized unit and the distributed unit are separated, the second node may also be a host.
  • the T1 protocol layer may be, for example, an F1-AP layer, and may be used to send information between the relay node and the second node, including, for example, a connection management related message between the two, and a UE-related context.
  • the control plane message of the configuration information, the RRC message of the UE, and the like is not limited.
  • the first packet fed back by the relay node may be carried in the T1 layer message (or the PDU of the T1 layer) and sent to the second node.
  • the node may be another relay node or a host base station that is the parent node of the relay node. Alternatively, if the host base station is in a form in which the centralized unit and the distributed unit are separated, the second node may also be a host.
  • the T1 protocol layer may be, for example, an NG-AP layer, and may be used to send information between the relay node and the second node, including, for example, an NG connection management related message between the two, and the UE is in the NG interface.
  • the control plane message of the content such as the configuration information does not limit its name.
  • the peer layer of the RRC protocol layer of the UE is located in the centralized unit of the donor base station or the donor base station. If the UE feeds back the first packet through the control layer RRC message (RRC PDU), the UE sends the first packet to the central base station or the centralized unit of the donor base station through the intermediate relay node; or, In the protocol stack architecture shown in FIG. 5E, the peer layer of the RRC protocol layer of the UE is located in a relay node that provides access services for the UE (for example, RN2 in FIG. 5D and FIG. 5E), and the UE will The first message is sent to the relay node (e.g., RN2 in Figure 5D, Figure 5E).
  • the relay node e.g., RN2 in Figure 5D, Figure 5E.
  • the relay node may carry the flow control feedback message through the control layer RRC message.
  • the UE may refer to the UE.
  • the peer layer of the RRC protocol layer of the relay node may be located in a centralized unit of the donor base station or the donor base station or another access service for the relay node.
  • a relay node ie, the parent node of the relay node).
  • the protocol stacks shown in FIG. 5A to FIG. 5E can be flexibly changed according to actual applications.
  • SCTP layer for Figure 5B, in one possible design, there may be no peer between RN2 and DgNB/Donor-CU.
  • SCTP layer for Figure 5C, in a possible design, between RN2 and RN1, and RN1 and Donor-DU may have no peer SCTP layer; for Figure 5E, between RN2 and RN1, and between RN1 and Donor-CU There may be no peer SCTP layer; for Figure 5C and Figure 5D, in a possible design, the peer layer between RN1 and RN2 may also be replaced by an IP layer, similarly, the RN1 and DgNB/host base stations are distributed.
  • the peer layer between peers can also be replaced by the IP layer; for Figure 5E, the peer IP layer between RN2 and RN1, and/or the peer IP layer between RN1 and DgNB/Donor-CU, can be Adapted by Adapt Layer replacement; optionally, there may be no peer GTP layer and UDP layer between the centralized unit of the donor base station and the distributed unit of the donor base station; optionally, the distributed unit between the RN1 and the donor base station is in the BL There can be a peer Adapt layer or IP layer above -L2.
  • the SDAP represents a Service Data Adaptation Protocol
  • L2 is a link layer protocol corresponding to the interface between the CU and the DU
  • L1 is an interface between the CU and the DU.
  • Physical layer protocol In the protocol stack of the present application, the SDAP represents a Service Data Adaptation Protocol, L2 is a link layer protocol corresponding to the interface between the CU and the DU, and L1 is an interface between the CU and the DU. Physical layer protocol.
  • BL-L2 represents a link layer protocol stack of a wireless backhaul link, and includes at least one of the following protocol layers: SDAP layer, PDCP layer, RLC layer, MAC layer; BL-L1
  • the physical layer protocol of the wireless backhaul link that is, the PHY layer; the specific function of the foregoing protocol layer depends on the specific communication technology (such as LTE technology or NR technology) used in the wireless backhaul link, and may include the definition of the specific communication technology.
  • the wireless backhaul link the link corresponding to the Un interface, refers to the backhaul link between the relay node and another relay node, or the relay node A backhaul link with the host base station.
  • Adapt represents an adaptation layer, which can carry any one or more of the following information: information for packet routing, information for QoS mapping, and packet type. Indication, flow control feedback information, etc.
  • the Adapt layer may be above all protocol layers included in BL-L2, for example, BL-L2 includes an RLC layer and a MAC layer, and the Adapt layer is above the RLC layer; or, the Adapt layer may also be in BL-L2 Between any two protocol layers included, for example, the Adapt layer is between the RLC layer and the MAC layer; or the Adapt layer may also be between the BL-L2 and BL-L1 layers; or, the Adapt layer
  • the function can also be extended by the function of any layer or any of the multiple layers included in BL-L2, without the need for a new adaptation layer.
  • the scenario of the IAB networking in the present application may also include a scenario in which the Layer 2 relay and the Layer 3 relay hybrid networking, and the user plane and control plane protocol functions supported by the Layer 2 relay may refer to FIG. 4A-FIG. It is understood that any of 4C and any of FIGS. 5A-5C understand that the user plane and control plane protocol functions supported by the layer 3 relay can refer to any one of FIG. 4D to FIG. 4E and FIG. Any of 5D- Figure 5E is understood.
  • layer 3 relays can be considered as receiving in Figure 4A or Figure 4B or Figure 4C or Figure 5A or Figure 5B or Figure 5C or DgNB
  • the second node of the flow control feedback information of the UE or the UE is understood by referring to the flow control feedback information sending manner in the corresponding figure; when the layer 3 relay sends the flow control feedback information to the second node, the layer 3 may be relayed.
  • the second node may be another layer 3 relay or DgNB or donor-DU or donor-CU, refer to the flow control feedback information in the corresponding figure. The way to send is understood.
  • the scenario of the relay networking in the second embodiment is a wireless relay networking scenario in which the access link is connected.
  • FIG. 6A and FIG. 6B are only possible schematic diagrams of multiple connections of the access link, and the wireless relay networking scenario of the AL multiple connection is not limited to the networking scenario of FIG. 6A and FIG. 6B.
  • DgNB Donor gNodeB
  • Each relay node will The node that provides the backhaul service is treated as the only parent.
  • the RN1 and the RN2 form a dual connection to provide an access service for the UE, and the UE has an access link between the RN1 and the RN2, and the RN2 and the RN1 respectively.
  • the parent node is DgNB, which is the offloaded anchor point (also known as the split point or the sink point).
  • path one UE-RN1-DgNB
  • path two UE-RN2-DgNB.
  • the DgNB can know the status of its link with RN1 (ie, the backhaul link of path 1) and its link with RN2 (ie, the backhaul link in path 2) according to the measurement, but cannot know RN1.
  • RN1 The link state between the UEs and the link state between the RNs and the UEs. Therefore, the RN1 needs to send the flow control feedback information to enable the DgNB to know the status of the RN1-UE link in the path one, and the RN2 sends the flow control feedback.
  • the information enables the DgNB to know the status of the RN2-UE link in the second path, so that the DgNB makes a reasonable flow control decision according to the overall situation of each link included in the path 1 and the path 2.
  • the RN1 and the DgNB form a dual connection to provide access services for the UE
  • the parent node of the RN1 is also a DgNB, that is, an offloaded anchor point (also called For the split point or convergence point)
  • there are two optional paths for data transmission between the UE and the DgNB path one: UE-DgNB, and path two: UE-RN1-DgNB.
  • the DgNB can know the state of its direct link with the UE (ie, the access link of path one) and its link with RN1 (ie, the backhaul link in path 2) according to the measurement, but cannot know the RN1.
  • the relay node involved in the networking scenario of FIG. 6A and FIG. 6B may be a layer 3 relay or a layer 2 relay.
  • the corresponding user plane protocol architecture may refer to FIG. 4A to FIG. 4E to remove the evolved RN1.
  • Protocol architecture corresponding control plane protocol architecture can refer to FIG. 5A to FIG. 5E to remove RN1 from the evolved protocol architecture.
  • the following is a description of the content and transmission mode of the flow control feedback information by using the relay node as the RN1 in FIG. 6A as an example.
  • the content and transmission mode of the flow control feedback information of the RN2 in FIG. 6A and the RN1 in FIG. 6B can be referred to FIG. 6A.
  • RN1 in the understanding.
  • the content of the flow control feedback information that the relay node RN1 needs to send to the DgNB includes any one or more of the following information.
  • a buffering state of the radio bearer granularity of the UE at the relay node RN1 for example, a buffer space corresponding to the UE DRB
  • an identifier corresponding to the radio bearer of the UE for example, the identifier of the UE and the UE DRB ID, or with the UE
  • the DRB one-to-one corresponding GTP tunnel endpoint identifier TEID).
  • the buffering state of the UE granularity at the relay node RN1 for example, the buffer space corresponding to the UE, and optionally, the identifier of the UE.
  • QFI QoS flow identifier
  • the sequence number (SN) of the data packet that the relay node RN1 has successfully transmitted to the UE may be a sequence number that is allocated by the DgNB and is identifiable by the relay node RN1.
  • the sequence number may also be identified by the UE, for example, the sequence number is in a PDCP protocol data unit (PDU).
  • PDU PDCP protocol data unit
  • the carried SN that is, the PDCP SN, or the SN carried in the RLC service data unit (SDU)/RLC PDU, that is, the RLC SN.
  • the sequence number is a sequence number that can be identified at both DgNB and RN1 and consecutively numbered on the link between the two. For example, in the scenario shown in FIG. 6A, it may be allocated by the offload anchor DgNB for the data packet.
  • the serial number is consecutively numbered on a part of the links included in the offloaded path one (for example, a backhaul link between the DgNB and the RN1), and the serial number may be in a new protocol layer (for example, an adaptation layer).
  • the sequence number may also be a PDCP SN allocated by the DgNB, or an RLC SN or the like.
  • Link quality information where is the link quality information of the access link (RN1-UE).
  • the link quality information includes uplink and/or downlink reference signal received power (Reference Signal Received Power, RSRP), reference signal received quality (RSRQ), received signal strength indicator (RSSI), and signal to interference and noise ratio (SINR).
  • RSRP Reference Signal Received Power
  • RSSI received signal strength indicator
  • SINR signal to interference and noise ratio
  • link bandwidth or transmission rate here the available/average bandwidth or transmission rate on the access link (RN1-UE), the available/average bandwidth or transmission rate, which may correspond to the relay node granularity (ie RN1)
  • the granularity or the cell granularity of the UE or the UE granularity or the UE radio bearer granularity or the PDU session granularity of the UE or the QoS flow granularity of the UE optionally including the specific RN1 identifier or the cell identifier of the RN1 service where the UE is located or The identity of the UE or the identifier corresponding to the UE radio bearer or the PDU session identifier of the UE or the QoS flow identifier of the UE.
  • an indication of the degree of load of the relay node RN1 for example, an evaluation value of a load level obtained by considering the sum of services of all UEs served by the relay node RN1, which may be a level indication with a limited range of values
  • the indication may be used by the upper-level node, such as the host base station, to determine whether the number of resources to be adjusted to the RN1, and whether the network topology or the routing policy needs to be adjusted, and the resource may be a wireless transmission resource of a time, a frequency, a space, or the like.
  • Average/minimum transmission delay of the link such as the average/minimum unidirectional transmission delay (uplink and/or downlink) of the access link, or the average/minimum loopback delay RTT of the access link.
  • the relay node RN1 sends the flow control feedback information to the DgNB, which may be sent to the DgNB periodically, or may be triggered by a trigger event, for example, the access link is blocked or restored, and the buffer status of the specific granularity at the RN1 is exceeded or lower.
  • the relay node RN1 detects a packet loss or the like on the link between RN1 and DgNB.
  • the period of the flow control feedback information and the trigger event may be sent by the core network device or the DgNB to the relay node RN1 through configuration information, or may be negotiated and determined by the RN1 and the DgNB.
  • the relay nodes RN1 and DgNB can identify the GTP tunnel identifier according to the GTP tunnel identifier.
  • the UE and the DRB of the UE, the flow control feedback information may be carried in a GTP packet (ie, a GTP PDU), and the information about the radio bearer granularity of the UE is included in the foregoing feedback content, such as a buffer status or a chain of the UE radio bearer granularity.
  • the path bandwidth/transmission rate does not need to carry the radio bearer identifier of the UE.
  • the flow control feedback information is carried in the GTP packet, and the foregoing feedback is provided.
  • the content includes the radio bearer granularity of the UE (such as the buffer status or the link transmission rate/bandwidth of the UE radio bearer granularity)
  • the radio bearer identifier of the UE needs to be carried.
  • the flow control feedback information may be carried in the header information added by the adaptation layer, or a new adaptation layer special packet (for example, an adaptation layer control PDU) may be defined.
  • the newly defined adaptation layer special packet may carry the special packet indication information, and is used to indicate that the packet is a packet that includes flow control feedback information.
  • the relay node RN1 may send the flow control feedback information to the DgNB through the control layer message, where the control layer message may be, for example, an RRC message, or between the relay node RN1 and the DgNB. Messages of the T1 protocol layer, etc.
  • the manner of carrying the flow control feedback information may be understood according to the protocol structure between the relay node and the DgNB, and the multiple manners for sending the first packet introduced in the first embodiment.
  • the packet that includes the flow control feedback information sent by the relay node RN1 may also carry the destination address of the flow control feedback information, that is, the node identifier that needs to receive the flow control feedback information, for example, in this embodiment.
  • the identity of the DgNB may further include the first indication information, where the packet is used to indicate that the packet is a packet that includes flow control feedback information.
  • the host base station node DgNB may determine or adjust a service distribution ratio/send rate of a certain granularity on each link according to the content in the flow control feedback information, for example, if DgNB Receiving the flow control feedback information sent by the relay node, including the remaining cache space state corresponding to the UE DRB 1, the DgNB may control the data volume of the UE DRB1 to be sent to the relay node not exceeding (less than or equal to) the remaining cache. size of space.
  • the specific manner and method for performing flow control on the shunt anchor point in the present application are not limited.
  • the flow of the flow control feedback information enables the upper-level node DgNB to know the access link status of the RN1-UE and perform certain granularity in time (such as the UE radio bearer or UE).
  • Flow control of granularity or UE QoS flow granularity for example, adjusting the transmission rate to prevent the RN1-UE link from being in a state of congestion or starvation; in addition, in the scenario of a multi-connection relay network, the relay node is directed to the offload anchor DgNB The feedback of the flow control information packet is performed, so that the traffic distribution anchor DgNB can perform flow control of a certain granularity (such as RN granularity or UE radio bearer or UE granularity or UE QoS flow granularity) according to the state of the split link, thereby further Reasonable traffic distribution on multiple links.
  • a certain granularity such as RN granularity or UE radio bearer or UE granularity or UE QoS flow granularity
  • the relay networking scenario of the third embodiment is a multi-hop relay networking scenario. For details, refer to FIG. 7A, FIG. 7B, and FIG. 7C.
  • the path between the UE and the DgNB is UE-RN2-RN1-DgNB. Therefore, if the host base station DgNB can know the two chains RN2-UE and RN1-RN2 In the state of the road, DgNB can make flow control decisions according to a certain granularity as needed.
  • the DgNB as the offload anchor also needs to know the two paths between it and the UE (path 1: UE-RN3-RN1- In DgNB, path 2: UE-RN3-RN2-DgNB, the link state of multiple downstream links (UE-RN3, RN3-RN1, RN3-RN2), so that DgNB performs flow control decision according to a certain granularity as needed.
  • the path one UE-RN3-RN1-DgNB, which is a multi-hop relay.
  • the other is path 2: UE-RN2-DgNB, and the split anchor of the two paths is DgNB.
  • path 2 the feedback mode of the flow control information packet sent by the RN2 to the DgNB can be understood by referring to the description in the second embodiment.
  • the multi-hop relay multiple pieces are involved.
  • the DgNB For the traffic control information packet feedback of the link, for the DgNB, except for the backhaul link status of the DgNB and the RN1, the DgNB has no status for the status of the links of the RN1-RN3 and the RN3-UE. It is known that these two links are part of path one, and the two link states affect the transmission of data packets on path one.
  • the relay node involved in the architecture of FIG. 7A, FIG. 7B, and FIG. 7C may be a layer 3 relay or a layer 2 relay.
  • the corresponding user plane protocol architecture may be as shown in FIG. 4A to FIG.
  • the surface protocol architecture can be referred to FIG. 5A to FIG. 5E.
  • the functions involved in the information refer to the corresponding description of RN1 in FIG. 7C.
  • the functions involved in transmitting or receiving the flow control feedback information of RN2 in FIG. 7A and RN3 in FIG. 7B can refer to the corresponding RN3 in FIG. 7C. Description for understanding.
  • the RN3 needs to send the flow control feedback information 1 to the RN1, and the content, the triggering manner, and the sending manner of the flow control feedback information 1 can be implemented by referring to the description in the second embodiment.
  • the RN1 in the embodiment of the DgNB is replaced with the RN1 in the embodiment, and the RN1 in the second embodiment is replaced with the RN3 in the embodiment.
  • the RN1 may directly forward the information to the DgNB, or the content of the flow control feedback information 1 may be carried in the flow control feedback information 2 generated by the RN1 and sent to the DgNB.
  • the content in the flow control feedback information 1 may be included, and/or the flow control feedback information describing the RN1-RN3 link, where the RN1-RN3 chain is described
  • the content of the flow control feedback information of the road includes at least one of the following information:
  • link status indication here is a link status indication of the backhaul link (RN1-RN3), the link status includes: link blocking, link recovery, and any of the two link states .
  • RN3 is a child node of RN1, and the flow control feedback information 2 sent by RN1 may include summary information of the cache state related to RN3 at RN1, and the identifier of RN3.
  • the flow control feedback information 2 sent by RN1 may include the buffer status of a certain radio bearer (or a radio bearer on the RN1-RN3 interface) of RN3, and the RN3 of the RN3.
  • the identity and the identity of the wireless bearer may include the buffer status of a certain radio bearer (or a radio bearer on the RN1-RN3 interface) of RN3, and the RN3 of the RN3.
  • the buffer status of the UE radio bearer granularity for example, the buffer space corresponding to the UE DRB
  • the identifier corresponding to the radio bearer of the UE for example, the identifier of the UE and the UE DRB ID, or UE DRB one-to-one corresponding GTP tunnel endpoint identifier TEID.
  • the sequence number may be a sequence number that is allocated by the DgNB and identifiable by the relay node RN1.
  • the sequence number may also be identified by its child node (such as RN3) or the UE, for example, the sequence number is a PDCP protocol data unit.
  • the SN carried in the SN that is, the PDCP SN, or the SN carried in the RLC SDU/PDU, that is, the RLC SN.
  • the sequence number may be a sequence number assigned by the offload anchor DgNB to the data packet, the sequence number being on a part of the link included in the offloaded path (eg, link RN3-RN1-DgNB, or link RN1) -DgNB) is consecutively numbered, and the sequence number can be carried in the processing of the newly added protocol layer (for example, the adaptation layer) (that is, carried in the adapted Adapt PDU processed by the adaptation layer), or in the GTP layer. The process is carried (ie, carried in the GTP PDU of the message processed by the GTP layer).
  • the sequence number may also be a PDCP SN allocated by the DgNB, or an RLC SN or the like.
  • Link quality information here is the quality information of the backhaul link between RN1 and RN3 (hereinafter referred to as RN1-RN3); optionally, information indicating which segment of the link is specifically, for example, using RN3
  • the identifier indicates that the link quality information corresponds to links RN1-RN3.
  • the backhaul link quality information may include at least one of uplink and/or downlink RSRP, RSRQ, RSSI, and SINR of the link.
  • the RN1 can obtain the link quality information of the RN3 ⁇ RN1 uplink by measurement, and for the link quality information of the downlink RN1 ⁇ RN3, the RN1 can be informed by the measurement report sent by the RN3.
  • Link bandwidth or transmission rate here is the backhaul link between the relay node RN1 and its child nodes (such as RN1-RN3), the RN1 granularity/the cell granularity of the RN1 service where the RN3 is located/RN3 granularity/RN3 Radio bearer granularity/UE granularity/UE radio bearer granularity/UE PDU session granularity/UE QoS flow granularity available/average bandwidth or transmission rate; optionally, the corresponding RN1 identity/RN3 RN1 service The cell identity/identity of the RN3/the radio bearer identity of the RN3/the identity of the UE/the identity corresponding to the UE radio bearer/the PDU session identity of the UE/the QoS flow identity of the UE.
  • the indication of the degree of load of the relay node RN1 may be a level indication with a limited range of values, which may be used for a superior node such as a host
  • the base station determines whether the number of resources to be RN1 needs to be adjusted, and whether the network topology or the routing policy needs to be adjusted, and the resources may be transmission resources of time, frequency, space, and the like.
  • Average/minimum transmission delay of the link such as the average/minimum one-way transmission delay (uplink and/or downlink) of the backhaul link between the relay node RN1 and its child node RN3, or RN1 and RN3
  • the RN1 sends the flow control feedback information 2 to the DgNB, which may be sent to the DgNB periodically or triggered by a trigger event.
  • the triggering event includes, for example, the access link blocking or recovery of the RN1-RN3, and the RN1 receiving the flow control feedback of the RN3.
  • Information 1 the buffer state of a specific granularity at RN1 exceeds or falls below a certain threshold, and the relay node RN1 detects a packet loss on the link between RN1 and DgNB.
  • the period of the flow control feedback information and the trigger event may be sent by the core network device or the DgNB to the RN1 through configuration information, or may be negotiated and determined by the RN1 and the DgNB.
  • the trigger mode of the flow control feedback information 1 is sent by the RN3 to the RN1, and can be understood by referring to the feedback trigger mode of the second embodiment, and can be sent periodically or triggered by a trigger event.
  • the RN3 sends the flow control feedback information 1 to the RN1.
  • the three methods in the second embodiment can be referred to.
  • the packet containing the flow control feedback information 1 sent by the RN3 may include the destination node identifier of the flow control feedback information 1, that is, the node identifier that needs to receive the flow control feedback information 1, for example, RN1.
  • the packet that includes the flow control feedback information 1 may further include first indication information, where the packet is a packet that includes flow control feedback information.
  • the RN1 sends the flow control feedback information 2 to the DgNB, and may also refer to the three methods in the second embodiment, that is, the flow control feedback information 2 is carried by the GTP data packet, or the adaptation layer information is used (for example, the adaptation layer control)
  • the PDU or the adaptation layer header information carries the flow control feedback information 2, or carries the flow control feedback information through a control layer message such as an RRC message or a T1 protocol layer message, whether it is any of these methods.
  • the packet containing the flow control feedback information 2 sent by the RN1 may include an identifier of the destination node of the flow control feedback information 2, for example, an identifier of the DgNB.
  • the packet that includes the flow control feedback information 2 may further include first indication information, where the packet is a packet that includes flow control feedback information.
  • the node that receives the flow control feedback information is not the destination node or the unique destination node that receives the flow control feedback information, the node sends the received flow control feedback information to the destination node; and determines whether the node is The destination node or the unique destination node may be determined by the destination node identifier in the data packet carrying the flow control feedback information.
  • the destination node identifier in the data packet carrying the flow control feedback information is the identifier of the node
  • the node is the destination node
  • the destination node identifier in the data packet carrying the flow control feedback information is a multicast address identifier
  • the multicast address identifier corresponds to a group of member nodes, wherein the group member node includes the node.
  • the local node is not the only destination node, and the node may continue to send the flow control feedback information received by the other member nodes corresponding to the multicast address identifier, and may also be combined with the first indication information, for example, if The first indication information carried by the data packet indicates that the carried content is flow control feedback information, and the node is capable of executing the flow. Node control decision-making, then this node is the destination node, the node if the parent node of this node for the implementation of traffic control decisions, the parent node to the destination node.
  • the node that receives the flow control feedback information can perform the flow control decision, the node can adjust the service allocation ratio/send rate of a certain granularity on each link according to the content in the flow control feedback information, for example, if the DgNB receives the The report indicates that a certain link (for example, RN1-RN3) is in the outage state, and the DgNB will not send any data packets of the UE directly or indirectly served by the RN3 to the RN1 before the link is restored, or actively carry out the network.
  • the topology is updated to establish a connection with RN3 through other nodes.
  • the specific manner and method for performing flow control on a node in the present application are not limited.
  • the flow control information of the multi-hop wireless relay network can be fed back, so that the node with the flow control decision-making capability, for example, the DgNB can know the status of each link included in each path between the UE and the UE, thereby
  • the flow control of a certain granularity (such as UE radio bearer granularity or UE granularity or relay radio bearer granularity or relay node granularity) can be performed in time, for example, adjusting the data transmission rate of a certain node or a certain link on a path To avoid certain nodes or links on the path from being congested or starved.
  • the relay node performs feedback on the flow control information packet to the offloaded anchor point, such as the DgNB or other relay node, so that the shunt anchor point can learn each segment involved in the different path.
  • the state of the hop link facilitates flow control of a certain granularity and more reasonable adjustment of services or traffic on different paths or links.
  • a multi-hop and access link multi-connection networking scenario is considered.
  • the UE has an access link with RN2 and RN1, and the parent node of RN1 and RN2 is RN3.
  • the parent node of RN3 is DgNB, and there are two paths between DgNB and UE, namely path one: UE-RN1-RN3-DgNB, and path two: UE-RN2-RN3-DgNB, and RN3 is path one and path two.
  • the shunt anchor or convergence point is considered.
  • the network topology is the same as that shown in FIG. 7A. Therefore, the RN2 and the RN1 send the flow control feedback information 1 of the respective access link to the RN3.
  • the DgNB in the second embodiment is replaced with the RN3 in the embodiment, and details are not described herein again.
  • the RN3 may forward the flow control feedback information 1 to the DgNB, or may be carried by the RN3 in the flow control feedback information 2 and sent to the DgNB, where the flow control feedback information 2, may include the flow control feedback information sent by the RN1, the flow control feedback information sent by the RN2, the flow control feedback information describing the RN1-RN3 link, and the flow control feedback information describing the RN2-RN3 link or A variety.
  • the content of the flow control feedback information describing the RN1-RN3 link can be understood by referring to the description in the third embodiment.
  • the RN1 and the RN3 in the corresponding description of the third embodiment are interchanged; the description RN2-RN3 chain
  • the description RN2-RN3 chain For the content of the flow control feedback information of the path, refer to the description of the content of the flow control feedback information of the RN1-RN3 link in the third embodiment, and replace the RN1 in the corresponding description in the third embodiment with the embodiment.
  • the RN3 in the third embodiment is replaced with the RN2 in the embodiment.
  • the RN3 since there is only one link between the RN3 and the DgNB, if the RN3 can perform the flow control decision, the DgNB does not need to know the two paths that the RN3 reaches the UE (ie, RN3-RN2-UE, and RN3-RN1- The link status of each segment of the UE). Therefore, in addition to the foregoing manner, from the perspective of reducing the flow control feedback overhead, the RN3 may further summarize some of the contents of the flow control feedback information related to the two links, and then feed back to the DgNB, that is, the RN3 may use the flow.
  • the part of the content included in the control feedback information 2 is subjected to a summary process, and then the aggregated result is generated together with the remaining content that does not need to be aggregated, and new flow control feedback information 2 is generated and sent to the DgNB.
  • the RN3 may not The cache status is fed back to DgNB, but the information is summarized and then summarized by DgNB.
  • the flow control feedback information 2 fed back by the RN3 includes summary information corresponding to the buffer remaining space of the UE DRB1, which is L 3 + ⁇ i L ij , where i is the label of the transmission path between the RN3 and the UE, and j is the first
  • the space, ⁇ is a summation operation; similarly, the flow control feedback information 2 fed back by the RN3 may further include summary information of buffer states of other granularities (such as UE granularity, UE PDU session granularity, UE QoS flow granularity, etc.).
  • the cache state may also include other content.
  • the link bandwidth or the transmission rate in the flow control feedback information 2 sent by the RN3 to the DgNB may be between the RN3 and the UE.
  • Summary information of link available/average bandwidth or transmission rate for example ⁇ i min j ⁇ R ij ⁇ , where i is the label of the transmission link between RN3 and the UE, and j is the middle of the ith link following identification node (RN3, including) a, R ij is understood that the i-th transmission link
  • the available bandwidth or transmission rate of the link between the node j and its child nodes, min ⁇ is the minimum value operation; optionally, the average/minimum of the links included in the flow control feedback information 2 sent by the RN3 to the DgNB
  • the feedback triggering mode of the flow control feedback information and the manner of sending the flow control feedback information in this embodiment can be understood by referring to the corresponding description in the third embodiment.
  • the RN1 in the corresponding description in the third embodiment can be replaced by the embodiment.
  • the RN3 in the corresponding description in the third embodiment is replaced with the RN1 or the RN2 in the embodiment.
  • the relay node RN3 which is a branching node/aggregation node, summarizes the flow control information of the child node and then feeds back to the DgNB to reduce the feedback overhead; or the RN3 can also be based on the child nodes RN1 and/or RN2.
  • the flow control feedback information is sent to obtain the link status of each segment on the two paths between the UE and the UE, so that it is convenient to perform flow control of a certain granularity when needed.
  • the DgNB in the second to fourth embodiments of the present application may be a complete functional entity, that is, a host base station that does not consider a centralized unit and a distributed unit separated form.
  • the DgNB may also be centralized.
  • the function of DgNB in Embodiment 2 to Embodiment 4 can be shared by the corresponding distributed unit of the host base station (Donor-DU) and/or the centralized unit of the host base station (Donor) -CU) is replaced.
  • the application scenario of the fifth embodiment is different from the first three embodiments in that the first three embodiments are the manner in which the relay node sends feedback of the flow control feedback information.
  • the flow control feedback information is performed by the UE. Send.
  • the content of the flow control feedback information may include at least one of the following information:
  • the link status indication here is the link status indication of the access link, including any one of two states: link blocking and link recovery. If the UE has multiple access links, it is also necessary to indicate which link (for example, the identity of the relay node carrying the access, or the cell identity of the access).
  • the maximum value of the sequence number of the data packet received by the UE may be, for example, a PDCP SN or an RLC SN.
  • sequence number of the data packet that the UE considers to be lost or unsuccessfully received the sequence number being identifiable at both the UE and the relay node RN or DgNB providing the access service for the UE, and on the link between the two Serial numbers that are consecutively numbered, which may be, for example, a PDCP SN or an RLC SN.
  • Link quality information where is the link quality information of the access link.
  • the link quality information includes uplink and/or downlink RSRP, RSRQ, RSSI, SINR, and link transmission rate ( For example, at least one of the average transmission rate of the link over a period of time.
  • Average/minimum transmission delay of the link here is the average/minimum one-way transmission delay or loopback delay of the access link.
  • the UE sends the flow control feedback information to the DgNB or the relay node, which may be sent periodically or triggered by a trigger event, including, for example, the access link blocking or recovering, and the UE detecting that the access link has a data packet loss (such as reordering timer timeout).
  • a trigger event including, for example, the access link blocking or recovering, and the UE detecting that the access link has a data packet loss (such as reordering timer timeout).
  • the period of the flow control feedback information and the trigger event may be sent to the UE by the core network device or the DgNB or the relay node through configuration information.
  • the UE may carry the flow control feedback information through the RRC message of the control layer or through the PDCP PDU (for example, the PDCP status report).
  • the destination node of the flow control feedback information is the node where the peer layer of the UE PDCP layer and/or the RRC layer is located, for example, In the IAB network protocol architecture shown in FIG. 4A or FIG. 4B or FIG. 4C, the peer layer of the PDCP protocol layer of the UE is located in the donor base station DgNB or the centralized unit Donor-CU of the donor base station, if the UE carries the flow control through the PDCP PDU.
  • the UE sends the flow control feedback information to the DgNB or the Donor-CU through at least one relay node; or, for the IAB network protocol architecture shown in FIG. 4D or FIG. 4E, the UE's PDCP protocol layer pair
  • the equal layer is located at the relay node (for example, RN2 in the figure). If the UE carries the flow control feedback information through the PDCP PDU, the UE sends the flow control feedback information to the relay node RN2; or, in FIG. 5A or In the IAB network protocol architecture shown in FIG. 5B or FIG.
  • the peer layer of the RRC protocol layer of the UE is located in the donor base station DgNB or the centralized unit Donor-CU of the donor base station, if the UE is carried by the control layer RRC message (RRC PDU) Flow control feedback information, the UE will The flow control feedback information is sent to the DgNB or the Donor-CU through at least one relay node; or, for the IAB network protocol architecture shown in FIG. 5D or FIG. 5E, the peer layer of the RRC protocol layer of the UE is located at the relay node (for example, RN2) in the figure, if the UE carries the flow control feedback information through the RRC message, the UE sends the flow control feedback information to the relay node RN2.
  • the relay node for example, RN2
  • the RN3 in FIG. 8 adopts the layer 3 architecture
  • the RN1 (RN2) adopts the layer 2 architecture
  • the corresponding multi-hop user plane and The control plane protocol architecture is shown in Figure 9.
  • the interface between the relay nodes in FIG. 9 is denoted by Un, but the present invention does not limit the interface name between the relay nodes.
  • the RN2 may send the location to the RN3 through the GTP tunnel corresponding to the UE DRB that receives the PDCP PDU after receiving the PDCP PDU.
  • the PDCP PDU is encapsulated in a GTP PDU, and then mapped to a radio bearer of the RN2 to be sent to the RN3; or the PDCP PDU carrying the flow control feedback information is to be adapted by the RN2 Processing, and then mapping to a radio bearer of the RN2, the processing of the adaptation layer, including the addition of the adaptation information and the QoS mapping, the adaptation information comprising at least one of the following information:
  • the radio bearer for example, the data radio bearer DRB or the signaling radio bearer SRB of the UE
  • the identifier of the UE the PDU session ID of the UE, the QoS flow ID of the UE, and the destination node identifier
  • the QoS mapping that is, the RN2 according to a certain mapping Rules (such as mapping from the DRB/SRB/logical channel of the Uu interface to the DRB/SRB/logical channel of the Un interface), from the radio bearer
  • the RN2 And then sent to the RN2, or the RN2 according to the core network element or the parent node of the host base station DgNB or RN2, for example, the QoS parameter configuration corresponding to the DRB/QoS flow of the UE and the QoS parameter configuration of the DRB of the RN2, Locally generated mapping rules.
  • the RRC message of the UE may be carried by the RN2 in the T1 protocol layer message and sent to the RN3, for example, at the T1 protocol layer.
  • An RRC container is configured in the message, and is used to carry an RRC message of the UE or an RRC message sent to the UE.
  • the RRC message of the UE may also be processed by the RN2 through the RN2.
  • the bearer (DRB or SRB of the RN2) is sent to the RN3 or the DgNB, and the processing of the adaptation layer includes the addition of the adaptation information and the QoS mapping, and the adaptation information includes at least one of the following information: the radio bearer of the UE
  • the identifier (for example, the RN2 receives the SRB ID of the UE RRC message), the identifier of the UE, the PDU session ID of the UE, the QoS flow ID of the UE, and the destination node identifier; the QoS mapping, that is, the RN2 according to a certain mapping rule (eg, from the Uu interface) Mapping of the SRB/logical channel to the DRB/SRB/logical channel of the Un interface), from the bearer/logical channel of the Uu interface receiving the RRC message carrying the flow control feedback information or in the data packet containing the RRC message Indicates the QoS requirement identifier, mapped to R
  • the radio bearer (for example, RN2S
  • FIG. 9 is only a schematic diagram of a possible multi-hop user plane and control plane protocol architecture.
  • the node (or anchor point) where the RRC/PDCP peer layer of the UE is located may be in the DgNB, or in the RN serving the UE, or on any of the backhaul links. On the RN, this application does not specifically limit this.
  • the UE sends the flow control feedback information to the node where the peer layer of the PDCP/RRC protocol stack is located by using the PDCP PDU or the RRC message, which can be used as a supplement to the relay node to send the flow control feedback information scheme.
  • a feedback information transmission scheme is provided when the node does not have a feedback channel.
  • an information transmission apparatus 1000 includes : Processing unit 1001 and transmitting unit 1002. among them,
  • the processing unit 1001 is configured to determine first information, where the first information includes at least one of: a buffer status of the relay node granularity, and a wireless between the relay node and the at least one first node. a cache state of the RB granularity, a cache state of each of the at least one first node, and a cache state of the RB granularity between each of the at least one first node and the child node;
  • the at least one first node is a child node of the relay node;
  • the sending unit 1002 is configured to send, to the second node, the first packet that carries the first information.
  • processing unit 1001 is specifically configured to:
  • the first packet further includes first indication information, where the first packet is used to indicate that the first packet is a packet that includes flow control feedback information.
  • processing unit 1001 is further configured to:
  • the first information further includes a buffer status of the terminal DRB granularity, a buffer status of the terminal granularity, a buffer status of the terminal protocol data unit PDU session granularity, a buffer status of the terminal service quality flow granularity, the relay node and a link state indication between the at least one first node, a data packet sequence number successfully sent to the first node or terminal, and a data packet sequence number that the relay node determines to be lost and not fed back to the second node
  • the sending unit 1002 is specifically configured to:
  • the first packet is sent in a peer-to-peer general packet radio service tunneling protocol GTP layer, a peer adaptation layer or a peer control layer between the relay node and the second node.
  • GTP general packet radio service tunneling protocol
  • the relay node determines that the missing data packet sequence number that is not fed back to the second node is identifiable at both the second node and the relay node and is on the link between the two. Serial number serial number.
  • an information transmission apparatus 1100 includes: a processing unit 1101. And transmitting unit 1102. among them,
  • the processing unit 1101 is configured to determine first information, where the first information includes at least one of: a link state indication of an access link of the terminal, a data packet sequence number received by the terminal device, Determining, by the terminal device, a lost or unsuccessfully received data packet sequence number, link quality information of an access link of the terminal, and an average or minimum transmission delay of an access link of the terminal;
  • the sending unit 1102 is configured to send, to the destination node, the first packet that carries the first information.
  • each unit above is only a division of logical functions, and the actual implementation may be integrated into one physical entity in whole or in part, or may be physically separated.
  • these units may all be implemented in the form of software by means of processing component calls; or may be implemented entirely in hardware; some units may be implemented in software in the form of processing component calls, and some units may be implemented in hardware.
  • the processing unit may be a separately set processing element, or may be integrated in a certain chip. Alternatively, it may be stored in a memory in the form of a program, and a function of the unit is called and executed by a certain processing element.
  • the implementation of other units is similar. In addition, all or part of these units can be integrated or implemented independently.
  • each step of the above method or each of the above units may be completed by an integrated logic circuit of hardware in the processor element or an instruction in a form of software.
  • the above receiving unit is a unit for controlling reception, and can receive information through a receiving device of a terminal device or a network device, such as an antenna and a radio frequency device.
  • the above sending unit is a unit for controlling transmission, and can transmit information through a transmitting device of a terminal device or a network device, such as an antenna and a radio frequency device.
  • the above units may be one or more integrated circuits configured to implement the above methods, such as one or more application specific integrated circuits (ASICs), or one or more digital signal processors ( Digital signal processor (DSP), or one or more field programmable gate arrays (FPGAs), and the like.
  • ASICs application specific integrated circuits
  • DSP Digital signal processor
  • FPGAs field programmable gate arrays
  • the processing element can be a general purpose processor, such as a central processing unit (CPU) or other processor that can invoke the program.
  • CPU central processing unit
  • these units can be integrated and implemented in the form of a system-on-a-chip (SOC).
  • SOC system-on-a-chip
  • the embodiment of the present application further provides a relay device, which is used to implement the process of performing the relay node in the foregoing method embodiment.
  • the relay device 1200 includes: a transceiver. 1201. The processor 1202 and the memory 1203.
  • the memory 1203 is configured to store computer executable instructions; when the processor 1202 executes the computer executable instructions, the relay device 1200 is caused to perform the method shown in FIG. 2 above.
  • the information transmission apparatus in the embodiment shown in FIG. 10 described above can be implemented by the relay device 1200 shown in FIG.
  • the structure of the relay device 1200 does not constitute a limitation on the embodiments of the present application.
  • the present application further provides a terminal.
  • the terminal 1300 includes: a transceiver 1301 , a processor 1302 , and a memory 1303 .
  • the memory 1303 is configured to store computer executable instructions
  • the processor 1302 is configured to determine first information, where the first information includes at least one of: a link state indication of an access link of the terminal, and a data packet received by the terminal device.
  • the sequence number the terminal device determines a lost or unsuccessfully received data packet sequence number, link quality information of the access link of the terminal, and an average or minimum transmission delay of the access link of the terminal.
  • the transceiver 1301 When the processor 1302 executes the computer executable instruction, the transceiver 1301 is configured to send a first message carrying the first information to the destination node. It can be understood that the information transmission apparatus in the above embodiment shown in FIG. 11 can be implemented by the terminal 1300 shown in FIG. The structure of the terminal 1300 does not constitute a limitation on the embodiments of the present application.
  • the processor may be a central processing unit (CPU), a network processor (NP), a hardware chip, or any combination thereof.
  • the memory may include a volatile memory such as a random access memory (RAM); the memory may also include a non-volatile memory such as a read-only memory. , ROM), flash memory, hard disk drive (HDD) or solid-state drive (SSD); the memory may also include a combination of the above types of memory.
  • embodiments of the present application can be provided as a method, system, or computer program product. Therefore, the embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Moreover, embodiments of the present application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present application. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG.
  • These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

一种信息传输方法和装置，该方法包括：中继节点确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继节点粒度的缓存状态，所述中继节点与至少一个第一节点之间的RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；所述至少一个第一节点是所述中继节点的子节点；所述中继节点向第二节点发送携带第一信息的第一报文，这样实现在多跳/多连接的IAB组网场景下的流控信息反馈，使第二节点进行合理的流控调整。

Description

一种信息传输方法和装置
本申请要求在2018年3月26日提交中国专利局、申请号为201810254395.6、发明名称为《一种信息传输方法和装置》的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种信息传输方法和装置。
背景技术
为满足第五代(the fifth generation，5G)系统中的超高容量需求，高频载波由于拥有相对低频更丰富的频率资源而受到热切关注，被选择为5G系统的主要工作频段。高频载波传播特性较差，受遮挡衰减严重，覆盖范围不广，故而在热点区域需要大量密集部署小站，相应地，为这些大量密集部署的小站提供光纤回传的代价很高且光纤部署难度大。引入了无线中继的接入回传一体化(Integrated Access and Backhaul，IAB)技术为解决上述问题提供了思路：其接入链路(Access Link)和回传链路(Backhaul Link)皆采用无线传输方案，避免光纤部署。
面向5G的无线中继组网场景中，多跳无线中继和多连接场景都可以支持。在针对多跳/多连接的IAB组网场景，如何设计各条链路的反馈信息，以便能够进行流量控制的节点(例如(上级节点或多链路的分流锚点)可以根据获得的反馈信息进行合理粒度的流控调整，是亟需解决的问题。
发明内容
本申请实施例提供一种信息传输方法和装置，以实现在多跳/多连接的IAB组网场景下的流控信息反馈。
本申请实施例提供的具体技术方案如下：
第一方面，本申请实施例提供一种信息传输方法，包括：
中继节点确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继节点粒度的缓存状态，所述中继节点与至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；所述至少一个第一节点是所述中继节点的子节点；所述中继节点向第二节点发送携带第一信息的第一报文。
通过采用本申请提供的方法，在多跳/多连接的IAB组网场景下中继节点能够向第二节点发送自身及其子节点之间不同链路不同粒度的缓存状态，从而使得第二节点能够根据第一信息的内容合理调整各条链路的流量控制。
一种可能的设计中，所述中继节点确定第一信息，包括以下三种实现方式：
实现方式一，所述中继节点监测自身的缓存状态得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态。
实现方式二，所述中继节点接收所述至少一个第一节点分别发送的第二报文，分别从所述第二报文中获取所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态。
实现方式三，所述中继节点监测自身的缓存状态，以及接收所述至少一个第一节点发送的缓存状态，得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态。
通过上述设计，采用不同的实现方式中继节点所确定的第一信息的内容也有所不同，从而可以灵活适应目的节点不同的流量控制策略。
一种可能的设计中，所述第一报文中还包括第一指示信息，用于表明所述第一报文为包含流控反馈信息的报文。
一种可能的设计中，在所述中继节点向第二节点发送第一报文之前，所述中继节点根据所述第一指示信息或所述第二报文中携带的目的地址确定所述第二节点是接收所述第一报文的目的节点。
通过上述设计，中继节点能够根据业务类型或目的地址，来判断第二节点是目的节点，能够保证包含第一信息的第一报文能够准确发送至目的节点。
一种可能的设计中，所述第一信息还包括终端DRB粒度的缓存状态、终端粒度的缓存状态、终端协议数据单元PDU会话粒度的缓存状态、终端服务质量流粒度的缓存状态、所述中继节点和所述至少一个第一节点之间的链路状态指示、成功发送至所述第一节点或终端的数据包序号、所述中继节点确定丢失的未反馈至所述第二节点的数据包序号、所述中继节点和所述至少一个第一节点之间的链路质量信息、所述中继节点粒度的带宽或传输速率、终端粒度的带宽或传输速率、终端的RB粒度的带宽或传输速率、终端PDU会话粒度的带宽或传输速率、终端服务质量流粒度的带宽或传输速率、所述中继节点和所述至少一个第一节点之间的链路的平均或最小传输时延、数据包在所述中继节点处的平均等待时间或最小等待时间、所述中继节点的负载程度指示中的至少一种。
通过上述设计，第一信息中还可以包括中继节点和至少一个第一节点之间的链路的各种信息，这样第二节点能够综合各种链路信息来进行不同链路的流量控制，防止出现链路拥塞状态。
一种可能的设计中，所述中继节点向第二节点发送携带所述第一信息的第一报文，包括以下两种情形：
情形一，所述中继节点周期性向所述第二节点发送所述第一报文。
情形二，当预设的事件触发时，所述中继节点向所述第二节点发送所述第一报文。
一种可能的设计中，所述第一报文在所述中继节点与所述第二节点之间对等的GTP层，对等的适配层或对等的控制层中发送。
通过上述设计，第一报文的不同发送方式适用于不同的协议栈架构。
一种可能的设计中，所述中继节点确定丢失的未反馈至所述第二节点的数据包序号是在所述第二节点和中继节点处均可以识别且在两者之间的链路上被连续编号的序号。
第二方面，本申请实施例提供一种信息传输方法，包括：
终端确定第一信息，所述第一信息包括如下信息中的至少一种：所述终端的接入链路的链路状态指示、所述终端设备接收到的数据包序号、所述终端设备确定丢失的未成功接 收的数据包序号、所述终端的接入链路的链路质量信息、所述终端的接入链路的的平均或最小传输时延；所述终端向目的节点发送携带第一信息的第一报文。
第三方面，本申请实施例提供一种信息传输装置，应用于中继节点，包括：
处理单元，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继节点粒度的缓存状态，所述中继节点与至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；所述至少一个第一节点是所述中继节点的子节点；发送单元，用于向第二节点发送携带第一信息的第一报文。
一种可能的设计中，所述处理单元具体用于：监测所述中继节点的缓存状态得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态；或，
接收所述至少一个第一节点分别发送的第二报文，分别从所述第二报文中获取所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；或
监测所述中继节点的缓存状态，以及接收所述至少一个第一节点发送的缓存状态，得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态。
一种可能的设计中，所述第一报文中还包括第一指示信息，用于表明所述第一报文为包含流控反馈信息的报文。
一种可能的设计中，所述处理单元还用于：根据所述第一指示信息或所述第二报文中携带的目的地址确定所述第二节点是接收所述第一报文的目的节点。
一种可能的设计中，所述第一信息还包括终端DRB粒度的缓存状态、终端粒度的缓存状态、终端协议数据单元PDU会话粒度的缓存状态、终端服务质量流粒度的缓存状态、所述中继节点和所述至少一个第一节点之间的链路状态指示、成功发送至所述第一节点或终端的数据包序号、所述中继节点确定丢失的未反馈至所述第二节点的数据包序号、所述中继节点和所述至少一个第一节点之间的链路质量信息、所述中继节点粒度的带宽或传输速率、终端粒度的带宽或传输速率、终端的RB粒度的带宽或传输速率、终端PDU会话粒度的带宽或传输速率、终端服务质量流粒度的带宽或传输速率、所述中继节点和所述至少一个第一节点之间的链路的平均或最小传输时延、数据包在所述中继节点处的平均等待时间或最小等待时间、所述中继节点的负载程度指示中的至少一种。
一种可能的设计中，所述发送单元具体用于：周期性向所述第二节点发送所述第一报文；或，当预设的事件触发时，向所述第二节点发送所述第一报文。
一种可能的设计中，所述第一报文在所述中继节点与所述第二节点之间对等的GTP层，对等的适配层或对等的控制层中发送。
一种可能的设计中，所述中继节点确定丢失的未反馈至所述第二节点的数据包序号是在所述第二节点和中继节点处均可以识别且在两者之间的链路上被连续编号的序号。
第四方面，本申请实施例提供一种信息传输装置，应用于终端，包括：
处理单元，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述终端的接入链路的链路状态指示、所述终端设备接收到的数据包序号、所述终端设备确定丢失 的未成功接收的数据包序号、所述终端的接入链路的链路质量信息、所述终端的接入链路的的平均或最小传输时延；发送单元，用于向目的节点发送携带第一信息的第一报文。
第五方面，本申请实施例提供一种中继设备，该中继设备包括：收发器，处理器和存储器；所述存储器，用于存储计算机可执行指令；所述处理器，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继设备粒度的缓存状态，所述中继设备与至少一个第一设备之间的无线承载RB粒度的缓存状态，所述至少一个第一设备中每个第一设备粒度的缓存状态，所述至少一个第一设备中每个第一设备与子设备之间的RB粒度的缓存状态；所述至少一个第一设备是所述中继设备的子设备；当所述处理器执行所述计算机可执行指令时，所述收发器，用于向第二设备发送携带第一信息的第一报文。
第六方面，本申请实施例提供一种终端，该终端包括：收发器，处理器和存储器；所述存储器，用于存储计算机可执行指令；所述处理器，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述终端的接入链路的链路状态指示、所述终端设备接收到的数据包序号、所述终端设备确定丢失的未成功接收的数据包序号、所述终端的接入链路的链路质量信息、所述终端的接入链路的的平均或最小传输时延；当所述处理器执行所述计算机可执行指令时，所述收发器，用于向目的节点发送携带第一信息的第一报文。
第七方面，本申请实施例提供一种计算机程序产品，包括计算机程序，该计算机程序在某一计算机单元上执行时，将会使所述计算机单元实现如第一方面及其可能的设计中所述的方法。
第八方面，本申请实施例提供一种计算机程序产品，包括计算机程序，该计算机程序在某一计算机单元上执行时，将会使所述计算机单元实现如第二方面所述的方法。
第九方面，本申请实施例提供一种计算机程序，该计算机程序在某一计算机单元上执行时，将会使所述计算机单元实现如第一方面及其可能的设计中所述的方法。
第十方面，本申请实施例提供一种计算机程序，该计算机程序在某一计算机单元上执行时，将会使所述计算机单元实现如第二方面所述的方法。
第十方面，本申请实施例提供一种计算机可读存储介质，其上存储有计算机程序，该计算机程序在某一计算机上执行时，将会使所述计算机实现如第一方面及其可能的设计中所述的方法。
第十二方面，本申请实施例提供一种计算机可读存储介质，其上存储有计算机程序，该计算机程序在某一计算机上执行时，将会使所述计算机实现如第二方面所述的方法。
第十三方面，本申请实施例提供一种芯片，包括：处理模块与通信接口，所述处理模块用于执行如第一方面及其可能的设计中所述的方法。
第十四方面，本申请实施例提供一种芯片，包括：处理模块与通信接口，所述处理模块用于执行如第二方面所述的方法。
附图说明
图1为本申请实施例的中继网路架构图；
图2为本申请实施例中的信息传输方法流程示意图；
图3A、图3B为本申请实施例中第一信息的内容示意图；
图4A～图4E为本申请实施例中的两跳的用户面协议架构示意图；
图5A～图5E为本申请实施例中的两跳的控制面协议架构示意图；
图6A和图6B为本申请实施例中的接入链路多连接的无线中继组网场景示意图；
图7A、图7B和图7C为本申请实施例中的多跳无线中继组网场景示意图；
图8为本申请实施例中的多跳及接入链路多连接的无线中继组网场景示意图；
图9为本申请实施例中的多跳的用户面和控制面协议架构示意图；
图10为本申请实施例中信息传输装置的结构示意图之一；
图11为本申请实施例中信息传输装置的结构示意图之二；
图12为本申请实施例中中继设备的结构示意图；
图13为本申请实施例中终端的结构示意图。
具体实施方式
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述。
图1所示为本申请实施例的中继网络架构图，涉及的网元包括终端、中继节点和目的节点，其中：
中继节点(Relay Node，RN)，用于接收子节点或终端发送的第一报文，并向中继节点的父节点或分流锚点发送第一报文，可选的，所述第一报文可以是流控反馈信息。应理解，本申请中的中继节点，可为终端设备提供无线接入服务，并通过无线回传链路传输接入链路的业务流，中继节点也可以叫其他名称，例如IAB节点(IAB node)。
目的节点，是具有流控能力的节点，例如宿主基站或中继节点的父节点或作为分流锚点的另一中继节点等，用于接收子节点或次级节点或终端发送的第一报文，并根据第一报文中的内容调整各条链路上一定粒度的业务分配比例或发送速率。
应理解，根据节点之间的层级关系，如果节点A存在上一级节点B，节点B称为该节点A的父节点，如果节点A存在下一级节点C，节点C为节点A的子节点，或者说节点C为节点A的次级节点。例如，图1中，UE3、第一节点RN2以及RN3为中继节点RN1的子节点，二级子节点RN4为第一节点RN2的子节点；相应的，中继节点RN1为第一节点RN2和RN3以及UE3的父节点。
分流锚点，指的是当节点A和节点B之间有可用的多条传输路径时，若所述多条传输路径中的至少两条传输路径被用于在节点A和节点B之间传输数据，如节点A通过多连接的方式从多个传输路径接收经由节点B发来的数据时，节点B可被称为分流锚点。
终端，也可以称为用户设备(User Equipment，UE)，用于向其无线资源控制RRC(radio resource control，RRC)层/分组数据汇聚协议(packet data convergence protocol，PDCP)层的锚点发送包含流控反馈信息的第一报文。所述终端的RRC/PDCP层的锚点，指的是与UE的RRC/PDCP层对等协议层所在的节点，例如是宿主基站DgNB(Donor gNB)，或者是中继节点。本申请实施例中的终端指的是直接接入中继节点或通过其他中继节点间接接入中继节点的终端，通过中继节点为其提供接入服务。
需要说明的是，为终端提供接入服务的节点(包括中继节点和宿主基站)可以有多个，即终端可以存在多条接入链路(Access Link，AL)，中继节点与宿主基站节点之间可以存在多条回传链路(Backhaul Link，BL)，且每条回传链路上也可以存在多个中继节点，即回传链路可以是多跳中继链路。
实施例一
基于图1所示的中继组网架构示意图，参阅图2所示，本申请实施例提供一种信息传输方法，具体流程如下所示：
步骤200：中继节点确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继节点粒度的缓存状态，所述中继节点与至少一个第一节点之间的无线承载(radio bearer，RB)粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；所述至少一个第一节点是所述中继节点的子节点。
步骤210：所述中继节点向第二节点发送携带第一信息的第一报文。
具体的，步骤200中，所述中继节点确定第一信息时，可以通过以下三种实现方式确定。
第一种实现方式中，所述中继节点监测自身的缓存状态得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态。可选的，还可以得到UE粒度的缓存状态，UE RB粒度的缓存状态，UE的分组/协议数据单元(packet/protocol data unit，PDU)会话(session)粒度的缓存状态，UE的服务质量(quality of service，QoS)流(flow)粒度的缓存状态；可选的，所述第一信息中还携带有各个缓存状态具体对应的标识，用于指示该缓存状态对应的节点或无线承载或PDU会话或QoS flow。
以中继节点为图1中的中继节点RN1为例，来详细说明第一种实现方式中第一信息中包含的内容，如图3A所示，第一信息具体包括如下信息中的至少一种：
A1)中继节点RN1粒度的缓存状态，例如：中继节点RN1的总缓存状态S。
A2)第一节点粒度的缓存状态，具体包括例如：中继节点RN1为RN2分配的缓存状态S RN2、中继节点RN1为RN3分配的缓存状态S RN3等。
A3)中继节点RN1和第一节点之间的RB粒度的缓存状态，具体包括例如：中继节点RN1为中继节点RN1和RN2之间的第一无线承载(例如RN2 RB1)分配的缓存状态S RN2-RB1，中继节点RN1为中继节点RN1和RN3之间的第二无线承载(例如RN3 RB2)分配的缓存状态S RN3-RB2等。
A4)UE粒度的缓存状态，具体包括例如：中继节点RN1为UE1分配的缓存状态S UE1、中继节点RN1为UE2分配的缓存状态S UE2，中继节点RN1为UE3分配的缓存状态S UE3等。
A5)UE PDU session粒度的缓存状态，具体包括例如：中继节点RN1为UE1的第一PDU会话(如PDU session A)分配的缓存状态S UE1-A、中继节点RN1为UE1的第二PDU会话(如PDU session B)分配的缓存状态S UE1-B等。
A6)UE RB粒度的缓存状态，具体包括例如：中继节点RN1为UE1的第一无线承载(如UE1 RB1)分配的缓存状态A 11、中继节点RN1为UE1的第二无线承载(如UE1 RB2)分配的缓存状态A 12，中继节点RN1为UE2的第一无线承载(UE2 RB1)分配的缓存状态A 21，中继节点RN1为UE3的第一无线承载(如UE3 RB1)分配的缓存状态A 31等。
A7)UE QoS flow粒度的缓存状态，具体包括例如：中继节点RN1为UE1的第一QoS flow(如UE1 QoS flow1)分配的缓存状态Q 11、中继节点RN1为UE1的第二QoS flow(如UE1 QoS flow2)分配的缓存状态Q 12，中继节点RN1为UE2的第一QoS flow(如UE2 QoS  flow1)分配的缓存状态Q 21等。
需要说明的是，可选的，第一信息中还携带有各个缓存状态具体对应的标识，例如，上述A1)中继节点RN1的总缓存状态S对应的标识为RN1的标识；上述A2)中的中继节点RN1为RN2分配的缓存状态S RN2对应的标识为RN2的标识；上述A3)中的中继节点RN1为RN1和RN2之间的RN2 RB1分配的缓存状态S RN2-RB1对应的标识为RN2 RB1的ID及RN2的标识；上述A4)中的中继节点RN1为UE1分配的缓存状态S UE1对应的标识为UE1的标识；上述A5)中的中继节点RN1为UE1 PDU session A分配的缓存状态S UE1-A对应的标识为UE1的标识以及UE1 PDU session A ID；上述A6)中的中继节点RN1为UUE1RB1分配的缓存状态A 11对应的标识为UE1的标识、UE1 RB1 ID；上述A7)中的中继节点RN1为UE1 QoS flow1分配的缓存状态Q 11对应的标识为UE1的标识、UE1 QoS flow1 ID。
第二种实现方式中，所述中继节点接收所述至少一个第一节点分别发送的第二报文，分别从所述第二报文中获取所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态，可选的，还可以得到UE粒度的缓存状态，UE RB粒度的缓存状态，UE的PDU session粒度的缓存状态，UE的QoS flow粒度的缓存状态；可选的，所述第一信息中还携带有各个缓存状态具体对应的标识，用于指示该缓存状态对应的节点或无线承载或PDU会话或QoS flow。
以中继节点为图1中的中继节点RN1为例，来详细说明第二种实现方式中第一信息中包含的内容，如图3B所示，第一信息具体包括：
B1)第一节点RN2处的总缓存状态P。
B2)第一节点RN2的子节点粒度的缓存状态，具体包括例如：第一节点RN2为RN4分配的缓存状态P RN4。
B3)第一节点RN2与子节点之间的RB粒度的缓存状态，具体包括例如：RN2为RN4和RN2之间的第一无线承载(如RN4 RB 1)分配的缓存状态P RN4-RB1等。
需要说明的是，如果第一节点RN2的子节点为UE时，上述B2)中的第一节点RN2的子节点粒度的缓存状态即为UE粒度的缓存状态，上述B3)中第一节点RN2和子节点之间的RB粒度的缓存状态，即UE RB粒度的缓存状态。
B4)UE粒度的缓存状态，具体包括例如：第一节点RN2为UE1分配的缓存状态P UE1、第一节点RN2为UE2分配的缓存状态P UE2等。
B5)UE PDU session粒度的缓存状态，具体包括例如：第一节点RN2为UE1 PDU session A分配的缓存状态P UE1-A、第一节点RN2为UE1 PDU session B分配的缓存状态P UE1-B等。
B6)UE RB粒度的缓存状态，具体包括例如：第一节点RN2为UE1 RB1分配的缓存状态X 11、第一节点RN2为UE1 RB2分配的缓存状态X 12；第一节点RN2为UE2 RB1分配的缓存状态X 21等。
B7)UE QoS flow粒度的缓存状态，具体包括例如：第一节点RN2为UE1 QoS flow1分配的缓存状态Y 11、第一节点RN2为UE1 QoS flow2分配的缓存状态Y 12；第一节点RN2为UE2 QoS flow1分配的缓存状态Y 21、第一节点RN2为UE2 QoS flow2分配的缓存状态Y 22。
需要说明的是，可选的，第一信息中还携带有各个缓存状态具体对应的标识，例如，上述B3)中，RN2为RN4 RB1分配的缓存状态P RN4-RB1对应的标识为RN4的标识、RN4  RB 1的标识，其它缓存状态对应的标识，可以参阅上述第一种实现方式中的相关举例说明。
第三种实现方式中，所述中继节点监测自身的缓存状态，以及接收所述至少一个第一节点发送的缓存状态，得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态，可选的，还可以得到UE粒度的缓存状态，UE RB粒度的缓存状态，UE的PDU session粒度的缓存状态，UE的QoS flow粒度的缓存状态；可选的，所述第一信息中还携带有各个缓存状态具体对应的标识，用于指示该缓存状态对应的节点或无线承载或PDU会话或QoS flow。
以中继节点为图1中的中继节点RN1为例，一种可能的设计中，中继节点RN1接收其子节点假设为第一节点RN2发送的缓存状态，与RN1自身的缓存状态中的部分信息进行取并集的合并操作来确定第一信息，此时第一信息可以包含如下内容中的至少一种：
C1)中继节点RN1粒度的缓存状态，即中继节点RN1的总缓存状态S。
C2)第一节点粒度的缓存状态，具体包括例如：中继节点RN1为RN2分配的缓存状态S RN2、中继节点RN1为RN3分配的缓存状态S RN3等。
C3)中继节点RN1和第一节点之间的RB粒度的缓存状态，具体包括例如：中继节点RN1为中继节点RN1和RN2之间的第一无线承载(例如RN2 RB1)分配的缓存状态S RN2-RB1，中继节点RN1为中继节点RN1和RN3之间的第二无线承载为RN3 RB2分配的缓存状态S RN3-RB2等。
C4)第一节点RN2处的总缓存状态P。
C5)第一节点RN2的子节点粒度的缓存状态，具体包括例如：第一节点RN2为RN4分配的缓存状态P RN4。
C6)第一节点RN2与子节点之间的RB粒度的缓存状态，具体包括例如：RN2为RN4和RN2之间的第一无线承载(如RN4 RB 1)分配的缓存状态P RN4-RB1等。
需要说明的是，如果第一节点RN2的子节点为UE时，上述C5)中的第一节点RN2的子节点粒度的缓存状态即为UE粒度的缓存状态，上述C6)中第一节点RN2和子节点之间的RB粒度的缓存状态，即UE RB粒度的缓存状态。
C7)UE粒度的缓存状态，具体包括例如：中继节点RN1为UE1分配的缓存状态S UE1、第一节点RN2为UE1分配的缓存状态P UE1、中继节点RN1为UE2分配的缓存状态S UE2、第一节点RN2为UE2分配的缓存状态P UE2等。
C8)UE PDU session粒度的缓存状态，具体包括例如：中继节点RN1为UE1 PDU session A分配的缓存状态S UE1-A、第一节点RN2为UE1 PDU session A分配的缓存状态P UE1-A，中继节点RN1为UE1 PDU session B分配的缓存状态S UE1-B、第一节点RN2为UE1 PDU sessionB分配的缓存状态P UE1-B等。
C9)UE RB粒度的缓存状态，具体包括例如：中继节点RN1为UE1 RB1分配的缓存状态A 11、第一节点RN2为UE1 RB1分配的缓存状态X 11，中继节点RN1为UE1 RB2分配的缓存状态A 12；中继节点RN1为UE2 RB1分配的缓存状态A 21、第一节点RN2为UE2 RB1分配的缓存状态X 21；中继节点RN1为UE3 RB1分配的缓存状态A 31等。
C10)UE QoS flow粒度的缓存状态，具体包括例如：中继节点RN1为UE1 QoS flow1分配的缓存状态Q 11、第一节点RN2为UE1 QoS flow1分配的缓存状态Y 11，中继节点RN1 为UE1 QoS flow2分配的缓存状态Q 12、第一节点RN2为UE1 QoS flow2分配的缓存状态Y 12，中继节点RN1为UE2 QoS flow1分配的缓存状态Q 21、第一节点RN2为UE2 QoS flow1分配的缓存状态Y 21、第一节点RN2为UE2 QoS flow2分配的缓存状态Y 22等。
需要说明的是，可选的，第一信息中还携带有各个缓存状态具体对应的标识，具体缓存状态对应的标识，可以参阅上述第一种和第二种实现方式中的相关举例说明。
值得指出的是，上述对于第三种实现方式的举例中确定第一信息时，需要对部分内容(例如第C7项至第C10项)进行了取并集的合并操作，需说明的是，本例中使用的取并集操作只是合并操作的一种实现形式，也可以是其他的合并操作形式，例如取最大值、取最小值、求和等运算，本申请对此不作具体限定。
需要说明的是，中继节点粒度的缓存状态指的是中继节点本地的缓存状态，即中继节点处缓存状态的汇总信息，例如是该中继节点为所服务的所有UE(包括与该中继节点直接连接的UE，以及该中继节点间接服务的UE——即连接到其他需经由该中继节点与基站建立回传链路的中继节点的UE)或UE的无线承载粒度的缓存状态的汇总信息，或者是该中继节点处所有第一节点粒度的缓存状态的汇总信息，所述第一节点为所述中继节点的子节点，例如是连接到所述中继节点的次级中继节点，或者是接入到所述中继节点服务小区的UE。例如，图1中，中继节点RN1的所有第一节点包含：第一节点RN2、第一节点RN3和UE3。
所述中继节点与第一节点之间的RB粒度的缓存状态，指的是所述中继节点的缓存状态中，与中继节点和第一节点之间的分别特定于每个RB对应的缓存状态。例如，若所述中继节点按照各个子节点与所述中继节点之间的RB为粒度进行缓存管理和分配，则中继节点与第一节点之间的RB粒度的缓存状态即为所述中继节点处，该第一节点与所述中继节点之间的某个RB的缓存状态；或者，若所述中继节点按照UE的无线承载为粒度进行缓存管理和分配，则所述中继节点与第一节点之间的某个RB(记为目标RB)对应的缓存状态即为所述中继节点处，需经由该第一节点传输数据包的且将被映射到该目标RB的所有UE的无线承载的缓存状态的汇总信息。
所述第一节点粒度的缓存状态，指的是所述中继节点的缓存状态中，与第一节点相关的缓存状态的汇总信息。例如，若所述中继节点按照各个子节点进行缓存分配和管理，则第一节点粒度的缓存状态即为所述中继节点为该第一节点分配的缓存状态；或者，若所述中继节点按照各个子节点与所述中继节点之间的RB为粒度进行缓存管理和分配，则第一节点粒度的缓存状态即为所述中继节点处，该第一节点与所述中继节点之间的所有RB的缓存状态的汇总信息；或者，若所述中继节点按照UE为粒度进行缓存管理和分配，则第一节点粒度的缓存状态即为所述中继节点处，需经由该第一节点传输数据包的所有UE的缓存状态的汇总信息；或者，若所述中继节点按照UE的无线承载为粒度进行缓存管理和分配，则第一节点粒度的缓存状态即为所述中继节点处，需经由该第一节点传输数据包的所有UE的无线承载的缓存状态的汇总信息。
所述UE粒度的缓存状态，一种可能的方式中，可以是所述中继节点的缓存状态中，与某个UE对应的缓存状态。例如，所述中继节点按照UE为粒度进行缓存管理和分配，则所述UE粒度的缓存状态即为所述中继节点处，某个UE对应的缓存状态；或者，所述中继节点按照UE的无线承载为粒度进行缓存管理和分配，则所述UE粒度的缓存状态即为所述中继节点处，某个UE需经由该中继节点传输数据包的所有无线承载的缓存状态的 汇总信息。另一种可能的方式中，所述UE粒度的缓存状态，是在所述中继节点处，对所述中继节点的缓存状态中与某个UE对应的缓存状态，以及所述中继节点收到的子节点在第二报文中包括的与该UE对应的缓存状态，进行汇总后的汇总信息。
所述UE RB粒度的缓存状态，一种可能的方式中，可以是所述中继节点的缓存中，与某个UE的特定无线承载对应的缓存状态。例如，所述中继节点按照UE RB为粒度进行缓存管理和分配，则所述UE RB粒度的缓存状态即为所述中继节点处，对应于某个UE的特定无线承载的缓存状态。另一种可能的方式中，所述UE RB粒度的缓存状态，是在所述中继节点处，对所述中继节点的缓存状态中与某个UE的特定无线承载对应的缓存状态，以及所述中继节点收到的子节点在第二报文中包括的与该UE的特定无线承载对应的缓存状态，进行汇总后的汇总信息。
UE的PDU session粒度的缓存状态，一种可能的方式中，可以是所述中继节点的缓存状态中，与某个UE的特定PDU session对应的缓存状态。例如若中继节点可以识别出数据包对应的UE的PDU session(例如对于一种由层3中继组成的多跳IAB网络中，中继节点可以维护与UE PDU session对应的通用分组无线业务隧道协议(general packet radio service tunnel protocol，GTP)隧道，故能识别出UE的PDU session)，则中继节点可以基于UE PDU session为粒度进行缓存管理和分配，所述UE PDU session粒度的缓存状态即为所述中继节点处，对应于某个UE的特定PDU session的缓存状态。另一种可能的方式中，所述UE的PDU session粒度的缓存状态，是在所述中继节点处，对所述中继节点的缓存状态中与某个UE的特定PDU session对应的缓存状态，以及所述中继节点收到的子节点在第二报文中包括的与该UE的特定PDU session对应的缓存状态，进行汇总后的汇总信息。
UE的QoS flow粒度的缓存状态，一种可能的方式中，可以是所述中继节点的缓存状态中，与某个UE的特定QoS flow对应的缓存状态。例如若中继节点可以识别出数据包对应的UE的QoS flow(例如对于一种由层3中继组成的多跳IAB网络中，中继节点可以维护与UE PDU session对应的GTP隧道，UE的数据包在GTP头部中可以携带QoS flow的标签QFI，故中继节点可以识别出UE的QoS flow)，则中继节点可以基于UE的QoS flow为粒度进行缓存管理和分配，所述UE的QoS flow粒度的缓存状态即为所述中继节点处，对应于某个UE的特定QoS flow的缓存状态。另一种可能的方式中，所述UE的QoS flow粒度的缓存状态，是在所述中继节点处，对所述中继节点的缓存状态中与某个UE的特定QoS flow对应的缓存状态，以及所述中继节点收到的子节点在第二报文中包括的与该UE的特定QoS flow对应的缓存状态，进行汇总后的汇总信息。
本申请中所述的无线承载，可以是数据无线承载(data radio bearer，DRB)，或信令无线承载(signal radio bearer，SRB)或RLC承载(RLC bearer)。
本申请中的某节点A处的某种粒度B的缓存状态，可以是与该节点A处按照该粒度B分配的物理缓存，还可以是与该节点A处按照该粒度B的接收/发送窗口分配的物理缓存(这种情况下，可以理解为该粒度B的缓存状态由对应该粒度B的接收/发送窗口能容纳的数据包总量或数据包数量所确定，所述接收/发送窗口用于限定对应于粒度B的数据的有效接收/发送范围)。具体地，本申请中所述的缓存状态，由以下内容中的至少一项组成：1)缓存中已有的数据总量，例如，给定粒度缓存中的数据量的总和，所述数据总量可以是以精确值(如以字节或比特为单位，精确到自然数位数的个位)进行描述或者以一定范围(如将数据总量分为有限个范围，每个范围对应于一个值，如此可减小反馈开销)进行描述； 2)缓存中的数据包的序号，包括例如给定粒度缓存中数据包序号的最小值、给定粒度缓存中数据包序号的最大值、给定粒度缓存中所有数据包序号的枚举等；3)缓存中的数据包的数量；4)缓存的总空间大小，例如缓存中可容纳的数据总量，或者缓存中可容纳的数据包的数量等；5)缓存的剩余空间大小，例如缓存中还可新增的数据总量，或缓存中还可新增的数据包的数量等。
本申请中所述的缓存状态的汇总信息，指的是将需要进行汇总的多个缓存状态进行合并操作后得到的汇总缓存状态。所述合并操作，可以是求和，例如可以对需要进行汇总的多个缓存状态中包括的缓存中已有的数据总量、缓存中的数据包的数量、缓存的总空间大小、缓存的剩余空间等项目分别进行求和，求和后的结果作为汇总信息中的内容；或者是取最大值，例如在需要进行汇总的多个缓存状态中所包含的“缓存中数据包序号的最大值”中取最大值，作为汇总信息中的“缓存中数据包序号的最大值”；或者是取最小值，例如在需要进行汇总的多个缓存状态中所包含的“缓存中数据包序号的最小值”中取最小值，作为汇总信息中的“缓存中数据包序号的最小值”；或者是对多个集合取并集，例如若缓存状态中包含“缓存中所有数据包序号的枚举”，则将其视为集合1，并对需要进行汇总的多个缓存状态中的集合1取并集得到集合2，将集合2作为汇总信息中的“缓存中所有数据包序号的枚举”；或者，还可以是上述几种操作形式的任意多种组合。本申请中对汇总涉及合并操作的具体形式和顺序不予限制。
一种可能的设计中，所述第一信息还包括所述中继节点和所述至少一个第一节点之间的链路状态指示(例如链路状态为链路阻断(outage/blockage)或者链路恢复(resume))、所述中继节点已成功发送至所述第一节点或UE的数据包序号(可以是当前已成功发送至第一节点或UE的数据包序号的最大值，或者是所有没反馈过的已成功发送至第一节点或UE的数据包序号的枚举)、所述中继节点确定丢失的且尚未向第二节点反馈的数据包序号、所述中继节点和所述至少一个第一节点之间的链路信号质量、中继节点粒度的带宽或传输速率、UE粒度的带宽或传输速率、UE无线承载粒度的带宽或传输速率、所述中继节点和所述至少一个第一节点之间的链路的平均或最小传输时延(指的中继节点和所述至少一个第一节点之间链路的平均/最小单向传输时延(上行和/或下行)，或中继节点和所述至少一个第一节点之间链路的平均/最小回环时延)、数据包在中继节点处的平均等待时间或最小等待时间、中继节点的负载程度指示中的至少一种，其中，第二节点是中继节点的父节点或目的节点。
其中，中继节点和所述至少一个第一节点之间链路的回环时延(round trip time，RTT，指的是从中继节点发送数据开始，到中继节点收到来第一节点对该数据的应答(如确认应答ACK或否认应答NACK)总共经历的时间。
需要说明的是，本申请实施例的第一信息还可包括中继节点的n级子节点和中继节点的n+1级子节点之间的链路信息(n为大于等于1的正整数)，以及中继节点到其n级子节点之间各段链路信息的汇总，这里的链路信息，可以是诸如链路状态指示、链路信号质量、链路的平均或最小传输时延、链路带宽或传输速率等。所述中继节点的n级子节点，即通过n跳链路连接到中继节点的子节点，例如，第一节点直接通过一跳链路与中继节点连接，故第一节点为中继节点的1级子节点，第一节点的子节点即为中继节点的2级子节点，依此类推。
其中，第一节点的类型可以是中继节点，也可以是终端。
可选的，所述第一报文中还包括第一指示信息，用于表明所述第一报文为包含流控反馈信息的报文。
具体的，步骤210中所述中继节点向第二节点发送第一报文时，具体的实现过程为：所述中继节点确定所述第二节点是接收所述第一报文的目的节点，所述中继节点向所述第二节点发送携带所述第一信息的第一报文。
其中，所述中继节点确定所述第二节点是接收所述第一报文的目的节点，至少有以下两种方式：
方式一，所述中继节点根据所述第一指示信息确定第二节点为接收第一报文的目的节点，例如第一报文中包含业务类型指示，表明第一信息的业务类型为与流控相关的反馈信息，则所述中继节点可确定第二节点为接收第一报文的目的节点。
方式二，所述中继节点根据从第一节点接收到第二报文中携带的目的地址确定第二节点为接收第一报文的目的节点，例如所述第二报文中携带的目的地址为第二节点的标识，或者所述第二报文中携带的目的地址为一个组播/广播地址标识，与所述组播/广播地址标识对应的节点中包括所述第二节点。
本申请中，第二节点的标识，可以是例如第二节点的IP地址、MAC地址、中继节点标识(RN ID)、第二节点服务的小区标识、基站标识(如下一代节点B标识gNB ID)、宿主基站为第二节点分配的局部(local)唯一的标识、第二节点中包含UE部分时的UE ID等，对于具体的节点标识类型不予限定。
进一步的，所述中继节点确定所述第二节点是接收所述第一报文的目的节点后，所述中继节点向所述第二节点发送携带所述第一信息的第一报文时，可以通过以下两种方式实现：
方式一：所述中继节点确定所述第二节点是接收所述第一报文的目的节点，将所述第一信息携带在所述第一报文中直接向第二节点发送，这种实现方式中，作为汇聚节点的中继节点对接收到的第一信息不进行任何处理，携带在中继节点生成的第一报文中，直接发送给第二节点，当然也可以直接将第一信息发送给第二节点。
方式二：所述中继节点确定所述第二节点是接收所述第一报文的目的节点，将所述第一信息进行汇总后携带在所述第一报文中向第二节点发送。这种实现方式中，中继节点对接收到的第二报文中的部分或者全部内容进行汇总后携带在中继节点生成的第一报文中，发送给第二节点。例如，可以对UE粒度或UE无线承载粒度或UE的PDU session粒度或UE的QoS flow粒度的缓存状态分别进行汇总，也可以对中继节点粒度或UE粒度或UE无线承载粒度的带宽/传输速率分别进行汇总，还可以对链路的平均传输时延或最小传输时延进行汇总，所述对带宽/传输速率以及平均/最小传输时延的汇总操作，同样涉及对多项内容的合并，所述合并操作，可以是求和、取最大值、取最小值、取并集等运算，可以参考前述对缓存状态的汇总涉及的合并操作进行理解。
其中，所述中继节点向第二节点发送第一报文时，可以周期性向所述第二节点发送所述第一报文；或，当预设的事件触发时，所述中继节点向所述第二节点发送所述第一报文。
其中，按照中继节点最高支持的协议功能，本申请实施例中涉及的中继节点有层3中继(经由中继节点转发的数据包为例如因特网协议IP(Internet Protocol，IP)数据包或者其他诸如以太网Ethernet等类型UE的PDU session中承载的PDU)、层2中继(经由中继节点转发的数据包为例如PDCP协议数据单元(Protocol data unit，PDU)或服务数据适配 协议(Service Data Adaptation Protocol，SDAP)PDU或无线链路控制(radio link control，RLC)PDU或媒介接入控制(Medium access control，MAC)PDU等)、以及层3+层2混合组网的场景，其中混合组网的场景中，一种可选的方式是在回传链路有多条链路时，作为分流锚点的中继节点为层3中继，其他位置的中继节点为层2中继。
在这些不同的协议架构下，中继节点的反馈粒度存在差异，例如对于层2中继，在反馈缓存状态和数据包的接收(反馈丢包)/发送状态时，具体的反馈粒度可以是UE无线承载粒度，或者UE粒度，或者RN的无线承载粒度或RN粒度等；又如对于层3中继，反馈粒度除上述粒度之外，还可以是UE的PDU会话粒度或UE的QoS flow粒度等。
需要说明的是，根据中继节点支持的协议功能的差异，第一报文的发送方式也有多种可能。例如，中继节点发送的第一报文可以在所述中继节点与所述第二节点之间对等的GTP层中发送，或者在所述中继节点与所述第二节点之间对等的适配层中发送，或者在所述中继节点与所述第二节点之间对等的控制层中发送，下面进行举例说明。
示意性地，图4A～图4E给出了两跳中继组网场下的用户面协议栈架构示意图，当然，实际应用时，中继节点的数量也可以是任意个，可以拓展用户到单跳或任意多跳的中继组网场景。例如，将图4A～图4E中的RN1去掉，就演变为单跳中继组网场景；又或者，实际应用时可以在RN2和RN1之间，增加任意多的其他中继节点，就拓展为大于两跳的多跳中继组网场景，新增加的中继节点和RN1/RN2之间接口上的协议栈，可参考RN1和RN2之间的协议栈进行理解。
对于图4A所示的用户面协议栈架构示意图，中继节点反馈的第一报文可以携带在适配层(Adapt)PDU中，向第二节点发送，此时，所述第二节点可以是作为该中继节点的父节点的另一中继节点或者宿主基站(Donor gNB，DgNB)，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的分布式单元(Donor-DU)或者宿主基站的集中式单元(Donor-CU)。
对于图4B所示的用户面协议栈架构示意图，中继节点反馈的第一报文可以携带在Adapt PDU中，向第二节点发送，所述第二节点可以是作为该中继节点的父节点的另一中继节点或者宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的分布式单元或者宿主基站的集中式单元；或者，中继节点反馈的第一报文可以携带在GTP PDU中，向第二节点发送，此时，所述第二节点可以是宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的集中式单元。
对于图4C所示的用户面协议栈架构示意图，中继节点反馈的第一报文可以携带在Adapt PDU中，向第二节点发送，所述第二节点可以是作为该中继节点的父节点的另一中继节点或者宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的分布式单元或者宿主基站的集中式单元；或者，中继节点反馈的第一报文可以携带在GTP PDU中，向第二节点发送，此时，所述第二节点可以是作为该中继节点的父节点的另一中继节点或者宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是是宿主基站的分布式单元或者宿主基站的集中式单元。
对于图4D所示的用户面协议栈架构示意图，中继节点反馈的第一报文可以携带在Adapt PDU中，向第二节点发送，此时，所述第二节点可以是作为该中继节点的父节点的 另一中继节点或者宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的分布式单元或者宿主基站的集中式单元。
对于图4E所示的用户面协议栈架构示意图，中继节点的反馈的第一报文可以携带在GTP PDU中，向第二节点发送，此时，所述第二节点可以是作为该中继节点的父节点的另一中继节点或者宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的集中式单元。
值得注意的是，本申请实施例中的宿主基站(DgNB)若是一个完整的功能实体，不考虑集中式单元(centralized unit，CU)和分布式单元(distributed unit，DU)分离的形态，则无需示意图中CU和DU之间接口上的协议栈，DgNB在面向接入网侧保留与中继节点以及与UE之间对等的协议栈即可。
进一步的，对于UE反馈第一报文的方案，图4A、图4B、图4C所示的用户面协议栈架构中，UE的PDCP协议层的对等层位于宿主基站或者宿主基站的集中式单元，若UE通过PDCP PDU反馈第一报文，则UE会将所述第一报文经过至少一个中继节点发送给宿主基站或者宿主基站的集中式单元；或者，对于图4D、图4E所示的用户面协议栈架构中，UE的PDCP协议层的对等层位于中继节点(例如图4中的RN2)，则UE会将所述第一报文发送给所述中继节点(例如图4A～图4E中的RN2)。
此外，图4A～图4E中所示的协议栈可以根据实际应用的不同进行灵活变化，例如，对于图4B，一种可能的设计中，RN2和DgNB/Donor-CU之间可以没有对等的UDP层；对于图4C，一种可能的设计中，RN2和RN1之间，以及RN1和Donor-DU可以没有对等的UDP层；对于图4E，RN2和RN1之间，以及RN1和Donor-CU可以没有对等的UDP层；对于图4C和图4D，一种可能的设计中，RN1和RN2之间对等的Adapt层也可由IP层替代，类似地，RN1和DgNB/Donor-DU之间对等的Adapt层也可以由IP层替代；对于图4E，一种可能的设计中，RN2和RN1之间对等的IP层，或RN1和DgNB/Donor-CU之间对等的IP层，可由Adapt层替代；可选的，Donor-CU和Donor-DU之间也可以没有对等的GTP层和/或UDP层；可选的，RN1和Donor-DU之间在BL-L2之上可以有对等的Adapt层或IP层。
可以理解的是，每一个协议层的PDU(例如GTP PDU，或Adapt PDU等)，指的是经过该协议层处理后交给下一个协议层的数据包。
进一步的，图4A～图5E给出了两跳中继组网场下的控制面协议栈架构示意图，当然，实际应用时，中继节点的数量也可以是任意个，可以拓展用户到单跳或任意多跳的中继组网场景。例如，将图5A～图5E中的RN1去掉，就演变为单跳中继组网场景；又或者，实际应用时可以在RN2和RN1之间，增加任意多的其他中继节点，就拓展为大于两跳的多跳中继组网场景，新增加的中继节点和RN1/RN2之间接口上的协议栈，可参考RN1和RN2之间的协议栈进行理解。
进一步的，根据中继节点支持的协议功能的差异，第一报文的发送方式也不同，下面进行举例说明。
对于图5B所示的控制面协议栈架构示意图，中继节点反馈的第一报文可以携带在T1层消息(或T1层的PDU)中，向第二节点发送。此时，所述第二节点可以是宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的集中式单元。可选的，所述T1协议层可以是例如F1-AP层，可用于在中继节点 和第二节点之间发送信息，包含例如两者之间的连接管理相关的消息、UE相关的上下文的配置信息、UE的RRC消息等内容的控制面消息，对其名称不予限定。
对于图5C所示的控制面协议栈架构示意图，中继节点反馈的第一报文可以携带在T1层消息(或T1层的PDU)中，向第二节点发送，此时，所述第二节点可以是作为该中继节点的父节点的另一中继节点或者宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的分布式单元或者宿主基站的集中式单元。可选的，所述T1协议层可以是例如F1-AP层，可用于在中继节点和第二节点之间发送信息，包含例如两者之间的连接管理相关的消息、UE相关的上下文的配置信息、UE的RRC消息等内容的控制面消息，对其名称不予限定。
对于图5E所示的控制面协议栈架构示意图，中继节点反馈的第一报文可以携带在T1层消息(或T1层的PDU)中，向第二节点发送，此时，所述第二节点可以是作为该中继节点的父节点的另一中继节点或者宿主基站，可选的，若宿主基站是集中式单元和分布式单元分离的形态，则所述第二节点还可以是宿主基站的集中式单元。可选的，所述T1协议层可以是例如NG-AP层，可用于在中继节点和第二节点之间发送信息，包含例如两者之间的NG连接管理相关的消息、UE在NG接口的配置信息等内容的控制面消息，对其名称不予限定。
对于由UE通过控制层消息反馈第一报文的方案，图5A、图5B、图5C所示的协议栈架构中，UE的RRC协议层的对等层位于宿主基站或者宿主基站的集中式单元，若UE通过控制层RRC消息(RRC PDU)反馈第一报文，则UE会将所述第一报文经过中间的中继节点发送给宿主基站或者宿主基站的集中式单元；或者，对于图5D、图5E所示的协议栈架构中，UE的RRC协议层的对等层位于为UE提供接入服务的中继节点(例如图5D、图5E中的RN2)，则UE会将所述第一报文发送给所述中继节点(例如图5D、图5E中的RN2)。
可选的，若中继节点还具有与UE类似的协议栈功能，故而中继节点可以通过控制层RRC消息携带流控反馈消息，当中继节点通过RRC消息携带流控反馈信息时，可参考UE通过控制层消息携带流控反馈信息的方案进行理解，中继节点的RRC协议层的对等层可位于宿主基站或宿主基站的集中式单元或为所述中继节点提供接入服务的另一中继节点(即所述中继节点的父节点)。
此外，图5A～图5E中所示的协议栈可以根据实际应用的不同进行灵活变化，例如，对于图5B，一种可能的设计中，RN2和DgNB/Donor-CU之间可以没有对等的SCTP层；对于图5C，一种可能的设计中，RN2和RN1之间，以及RN1和Donor-DU可以没有对等的SCTP层；对于图5E，RN2和RN1之间，以及RN1和Donor-CU可以没有对等的SCTP层；对于图5C和图5D，一种可能的设计中，RN1和RN2之间对等的Adapt层也可由IP层替代，类似地，RN1和DgNB/宿主基站的分布式单元之间对等的Adapt层也可以由IP层替代；对于图5E，RN2和RN1之间对等的IP层，和/或RN1和DgNB/Donor-CU之间对等的IP层，可由Adapt层替代；可选的，宿主基站的集中式单元和宿主基站的分布式单元之间也可以没有对等的GTP层和UDP层；可选的，RN1和宿主基站的分布式单元之间在BL-L2之上可以有对等的Adapt层或IP层。
其中，本申请所涉及的协议栈中，SDAP表示业务数据应用协议(Service Data Adaptation Protocol)，L2是CU和DU之间接口上对应的链路层协议，L1是CU和DU之间接口上对 应的物理层协议。
本申请所涉及的协议栈中，BL-L2表示无线回传链路的链路层协议栈，包括如下协议层中的至少一项：SDAP层，PDCP层，RLC层，MAC层；BL-L1表示无线回传链路的物理层协议，即PHY层；上述协议层的具体功能依赖于无线回传链路具体采用的通信技术(如LTE技术或NR技术)，可包含具体通信技术中定义的各个协议层的部分功能或者全部功能；所述无线回传链路，对应于Un接口的链路，指的是中继节点和另一中继节点之间的回传链路，或者中继节点和宿主基站之间的回传链路。
本申请所涉及的协议栈中，Adapt表示适配层(adaptation layer)，可携带以下信息中的任意一种或多种：用于数据包路由的信息、用于QoS映射的信息、数据包类型指示、流控反馈信息等。所述Adapt层可以在BL-L2包含的所有协议层之上，例如BL-L2包含RLC层和MAC层，所述Adapt层在RLC层之上；或者，所述Adapt层还可以在BL-L2包含的任意两个协议层之间，例如所述Adapt层在RLC层和MAC层之间；或者所述Adapt层还可以在BL-L2和BL-L1层之间；或者，所述Adapt层的功能还可以通过在BL-L2包含的任意层或任意多个层的功能上扩展，无需新增的适配层。
本申请中的IAB组网场景，还可以包括由层2中继和层3中继混合组网的场景，所述层2中继支持的用户面和控制面协议功能可分别参考图4A-图4C中的任一种以及图5A-图5C中的任一种进行理解，所述层3中继支持的用户面和控制面协议功能可分别参考图4D-图4E中的任一种以及图5D-图5E中的任一种进行理解。对于两种类型中继混合组网中的层2中继而言，层3中继可被视为图4A或图4B或图4C或图5A或图5B或图5C或中的DgNB，作为接收中继或UE的流控反馈信息的第二节点，参考对应图中的流控反馈信息发送方式进行理解；当层3中继向第二节点发送流控反馈信息时，可将层3中继视为图4D或图4E或图5D或图5E中的中继节点，所述第二节点可以是其他层3中继或DgNB或donor-DU或donor-CU，参考对应图中的流控反馈信息发送方式进行理解。
下面通过几个中继组网场景，来详细说明图2所示方法。
实施例二
实施例二的中继组网场景是接入链路多连接的无线中继组网场景，具体可参阅图6A和图6B所示。图6A和图6B仅为接入链路多连接的可能的示意图，AL多连接的无线中继组网场景不局限于图6A和图6B的组网场景。
在无线中继组网场景下，中继节点和为中继提供回传服务的中继节点或宿主基站(Donor gNodeB，DgNB)节点之间有明确的层级关系，每一个中继节点将为其提供回传服务的节点视为唯一的父节点。在如图6A所示的AL多连接的无线中继组网场景中，RN1和RN2组成双连接为UE提供接入服务，UE与RN1和RN2之间分别有一条接入链路，RN2和RN1的父节点均为DgNB，即分流的锚点(又可称为分流点或汇聚点)。此时，在UE和DgNB之间的数据传输有两条可选的路径，路径一：UE-RN1-DgNB，和路径二：UE-RN2-DgNB。DgNB可以根据测量知晓其与RN1之间的链路(即路径一的回传链路)以及其与RN2之间的链路(即路径二中的回传链路)的状态，但无法知晓RN1-UE之间的链路状态以及RN2-UE之间的链路状态，故需要RN1通过发送流控反馈信息使DgNB了解路径一中RN1-UE这一段链路的状况，RN2通过发送流控反馈信息使DgNB了解路径二中RN2-UE这一段链路的状况，以便DgNB根据路径一和路径二包含的各段链路的整体情况，进行合理的流量控制决策。
类似地，在4B所示的AL多连接的无线中继组网场景中，RN1和DgNB组成双连接为UE提供接入服务，RN1的父节点亦为DgNB，即分流的锚点(又可称为分流点或汇聚点)，UE和DgNB之间的数据传输有两条可选的路径，路径一：UE-DgNB，和路径二：UE-RN1-DgNB。DgNB可以根据测量知晓其与UE的直连链路(即路径一的接入链路)以及其与RN1之间的链路(即路径二中的回传链路)的状态，但无法知晓RN1-UE之间的链路状态，故需要RN1通过发送流控反馈信息使DgNB了解路径二中RN1-UE这一段链路的状况，以便DgNB根据路径一和路径二包含的各段链路的整体情况，进行合理的流量控制决策。
需要说明的是，图6A和图6B的组网场景中涉及的中继节点可以为层3中继或者层2中继，相应用户面协议架构可参考图4A～图4E中将RN1去掉演变的协议架构，相应控制面协议架构可参考图5A～图5E所示中将RN1去掉演变的协议架构。
下面以中继节点为图6A中的RN1为例来说明流控反馈信息的内容和发送方式，图6A中的RN2以及图6B中的RN1的流控反馈信息的内容和发送方式可以参阅图6A中的RN1进行理解。
一)中继节点RN1需要向DgNB发送的流控反馈信息的内容包括以下信息中的任意一种或多种。
2)中继节点RN1粒度的缓存状态，可选的，还包括中继节点RN1的标识。
3)中继节点RN1处UE无线承载粒度的缓存状态(例如UE DRB对应的缓存空间)，可选的，还包括与UE无线承载对应的标识(例如UE的标识以及UE DRB ID，或者与UE DRB一一对应的GTP隧道端点标识TEID)。
4)中继节点RN1处UE粒度的缓存状态，例如UE对应的缓存空间，可选的，还包括UE的标识。
5)中继节点RN1处UE PDU session粒度的缓存状态，可选的，还包括UE PDU session的标识以及UE的标识。
6)中继节点RN1处UE QoS flow粒度的缓存状态，可选的，还包括UE的QoS flow的标识如QFI(QoS flow identifier)以及UE的标识。
7)中继节点RN1已经成功发送给UE的数据包的最大序号(sequence number，SN)。所述序号可以是由DgNB分配的，且中继节点RN1可识别的序号，可选的，所述序号还可以被UE识别，例如所述序号为PDCP协议数据单元(Protocol data unit，PDU)中携带的SN，即PDCP SN，或者为RLC业务数据单元(service data unit，SDU)/RLC PDU中携带的SN，即RLC SN。
8)被中继节点RN1认为丢失的且没有向DgNB反馈过的数据包序号。所述序号是在DgNB和RN1处均可以识别且在两者之间的链路上被连续编号的序号，例如在图6A所示的场景中，可以是由分流锚点DgNB为数据包分配的序号，所述序号在分流的路径一中包含的部分链路(例如在DgNB和RN1之间的回传链路)上被连续编号，所述序号可以在新增的协议层(例如适配层)的处理过程中携带(即携带在经适配层处理后的报文Adapt PDU中)，或者在GTP层的处理过程中携带(即携带在经GTP层处理后的报文GTP PDU中)；或者，在没有多路径分流的场景中，所述序号还可以是DgNB分配的PDCP SN，或者RLC SN等。
9)链路质量信息，这里为接入链路(RN1-UE)的链路质量信息，可选的，所述链路 质量信息包括上行和/或下行参考信号接收功率(Reference Signal Received Power，RSRP)、参考信号接收质量(Reference Signal Received Quality，RSRQ)、接收信号强度指示(Receive Signal Strength Indicator，RSSI)、信干噪比(SINR)中的至少一项。
10)链路带宽或传输速率，这里为接入链路(RN1-UE)上的可用/平均带宽或传输速率，所述可用/平均带宽或传输速率，可以对应于中继节点粒度(即RN1粒度)或UE所在的小区粒度或UE粒度或UE无线承载粒度或UE的PDU会话粒度或UE的QoS flow粒度，可选的，还包含具体对应的RN1标识或UE所在的RN1服务的小区标识或UE的标识或与UE无线承载对应的标识或UE的PDU会话标识或UE的QoS flow标识。
11)中继节点RN1的负载程度指示，例如，考虑中继节点RN1服务的所有UE的业务之和得出的一个负载程度的评估值，可以是一个取值范围有限的级别(level)指示，该指示可用于上级节点如宿主基站决定是否需要调整给RN1的资源数量，以及是否需要调整网络拓扑或者路由策略，所述资源可以是时间、频率、空间等维度的无线传输资源。
12)链路的平均/最小传输时延，例如接入链路的平均/最小单向传输时延(上行和/或下行)，或接入链路的平均/最小回环时延RTT。
13)数据包在中继节点RN1处的平均/最小等待时间，例如，可以由中继节点RN1统计其收到数据包的等待时间得到，等待时间T＝T S-T R，其中，T R表示中继节点RN1收到数据包的时间，T S表示中继节点RN1发出该数据包的时间。
二)流控反馈信息的反馈触发方式
其中，中继节点RN1向DgNB发送流控反馈信息，可以周期性向DgNB发送，也可以由触发事件触发，触发事件包括例如接入链路阻断或恢复、RN1处特定粒度的缓存状态超过或低于一定门限、中继节点RN1检测到在RN1和DgNB之间的链路上有数据包丢失等。流控反馈信息的周期和触发事件，可以由核心网设备或DgNB通过配置信息发送给中继节点RN1，或由RN1和DgNB进行协商确定。
三)流控反馈信息的发送方式
一种可能的设计中，若中继节点RN1和DgNB之间建立与UE DRB一一对应的GTP传输隧道来发送用户面数据包，此时，中继节点RN1和DgNB可以根据GTP隧道标识识别出UE以及UE的DRB，所述流控反馈信息可以在GTP报文(即GTP PDU)中携带，且在前述反馈内容中若包含UE无线承载粒度的信息(如UE无线承载粒度的缓存状态或链路带宽/传输速率)时无需额外携带UE的无线承载标识。若DgNB和中继节点之间的GTP隧道是与UE的PDU session一一对应，而不是UE的DRB，在这种情况下，若通过GTP报文携带所述流控反馈信息，且在前述反馈内容中包含UE无线承载粒度的信息(如UE无线承载粒度的缓存状态或链路传输速率/带宽)时，还需要携带UE的无线承载标识。
另一种可能的设计中，若中继节点和DgNB之间基于适配层携带用于路由的信息和QoS映射的信息(包括例如UE ID、UE DRB ID、UE的逻辑信道ID、QoS flow ID、PDU session ID等)，此时所述流控反馈信息，可以在适配层添加的头信息中携带，或者定义一个新的适配层特殊报文(例如适配层控制PDU)，专门用于携带所述流控反馈信息，这个新定义的适配层特殊报文中，可携带特殊包指示信息，用于表明所述报文为包含流控反馈信息的报文。
另一种可能的设计中，中继节点RN1可以将流控反馈信息通过控制层报文向DgNB发送，所述控制层报文可以是例如RRC消息，或者是中继节点RN1与DgNB之间对等的 T1协议层的消息等。
具体携带流控反馈信息的方式，可以根据中继节点和DgNB之间的协议架构，参考实施例一中介绍的发送第一报文的多种方式进行理解。
可选的，中继节点RN1发送的包含流控反馈信息的报文中，还可以携带流控反馈信息的目的地址，即需要接收所述流控反馈信息的节点标识，例如本实施例中的DgNB的标识。可选的，包含所述流控反馈信息的报文中还可以包含第一指示信息，用于表明所述报文为包含流控反馈信息的报文。
所述宿主基站节点DgNB接收到中继节点发送的流控反馈信息后，可根据流控反馈信息中的内容确定或调整各条链路上一定粒度的业务分配比例/发送速率，例如，如果DgNB收到中继节点发送的流控反馈信息中，包含UE DRB 1对应剩余的缓存空间状态，则DgNB可以控制其向中继节点发送UE DRB1的数据量不超过(小于或等于)所述剩余缓存空间大小。本申请中对于分流锚点进行流量控制的具体方式和方法不予限定。
采用上述方案，在单跳中继组网的场景下，通过流控反馈信息的发送，可以使上级节点DgNB了解RN1-UE的接入链路状态，及时进行一定粒度(譬如UE无线承载或UE粒度或UE QoS flow粒度等)的流控，例如调整发送速率，避免RN1-UE链路处于拥塞或饥饿状态；此外，在多连接中继组网的场景下，中继节点向分流锚点DgNB进行流控信息报文的反馈，以使分流锚点DgNB能够根据分流链路的状态，进行一定粒度(譬如RN粒度或UE无线承载或UE粒度或UE QoS flow粒度等)的流控，从而更合理的进行多条链路上的流量分配。
实施例三
实施例三的中继组网场景是多跳中继组网场景，具体可参阅图7A，图7B和图7C所示。
如图7A所示的多跳中继组网场景中，UE与DgNB之间的路径为UE-RN2-RN1-DgNB，因此，若宿主基站DgNB能知晓RN2-UE以及RN1-RN2这两条链路的状态，则DgNB可以根据需要按照一定粒度进行流量控制决策。
如图7B所示的多跳及回传链路多连接的组网场景中，作为分流锚点的DgNB，同样需要知道其与UE之间的两条路径(路径一：UE-RN3-RN1-DgNB，路径二：UE-RN3-RN2-DgNB)中，多个下游链路(UE-RN3，RN3-RN1，RN3-RN2)的链路状态，以便DgNB根据需要按照一定粒度进行流量控制决策。
在如图7C所示的多跳及接入链路多连接的组网场景中，UE与DgNB之间的两条路径，一条是路径一：UE-RN3-RN1-DgNB，为多跳中继链路；另一条是路径二：UE-RN2-DgNB，两条路径的分流锚点为DgNB。这种情况下，在路径二，RN2向DgNB进行流控信息报文的反馈方式，可以参考实施例二中的描述进行理解；而在路径一，由于有多跳中继，则会涉及多条链路的流控信息报文反馈，对于分流锚点DgNB而言，除了DgNB与RN1的回传链路状态之外，对于RN1-RN3以及RN3-UE这两段链路的状态，DgNB均无从得知，但这两条链路作为路径一的组成部分，这两段链路状态会影响路径一上数据包的传输。
需要说明的是，图7A、图7B和图7C的架构中涉及的中继节点可以为层3中继或者层2中继，相应用户面协议架构可参考图4A～图4E所示，相应控制面协议架构可参考图5A～图5E所示。
下面以中继节点为图7C中链路一的RN3和RN1为例来说明流控反馈信息的内容和发 送方式，图7A中的RN1以及图7B中的RN1和RN2在发送或接收流控反馈信息中涉及的功能可以参阅图7C中对RN1的相应描述进行理解，图7A中的RN2和图7B中的RN3在发送或接收流控反馈信息中涉及的功能可参阅图7C中对RN3的相应描述进行理解。
一)中继节点RN1需要向DgNB发送的流控反馈信息的内容
在本实施例三中，首先，RN3需要向RN1发送流控反馈信息1，所述流控反馈信息1的内容、触发方式以及发送方式，均可参考实施例二中的描述，理解时将实施例二中的DgNB换成本实施例中的RN1，将实施例二中的RN1换成本实施例中的RN3即可。
对于RN3发送的流控反馈信息1，RN1可以直接转发给DgNB，或者将流控反馈信息1中的内容携带在RN1生成的流控反馈信息2中发送给DgNB。
具体的，在RN1向DgNB发送的流控反馈信息2中，可以包含流控反馈信息1中的内容，和/或，描述RN1-RN3链路的流控反馈信息，所述描述RN1-RN3链路的流控反馈信息的内容包括如下信息中的至少一项：
1)链路状态指示，这里为回传链路(RN1-RN3)的链路状态指示，所述链路状态包括：链路阻断、链路恢复这两种链路状态中的任一种。
2)中继节点RN1处，RN1粒度的缓存状态；可选的，还包括中继节点RN1的标识。
3)中继节点RN1处，RN1的子节点粒度的缓存状态；可选的，还包含RN1的子节点的标识。例如图7C中RN3为RN1的子节点，则RN1发送的流控反馈信息2中，可包含RN1处与RN3相关的缓存状态的汇总信息，以及RN3的标识。
4)中继节点RN1处，RN1的子节点的无线承载粒度的缓存状态；可选的，还包含RN1的子节点的标识以及无线承载标识。例如图7C中RN3为RN1的子节点，故RN1发送的流控反馈信息2中，可包含RN3的某个无线承载(或者说RN1-RN3接口上的某个无线承载)的缓存状态、RN3的标识以及该无线承载的标识。
5)中继节点RN1处，UE无线承载粒度的缓存状态(例如UE DRB对应的缓存空间)；可选的，还包括与UE无线承载对应的标识(例如UE的标识以及UE DRB ID，或者与UE DRB一一对应的GTP隧道端点标识TEID)。
6)中继节点RN1处，UE粒度的缓存状态；可选的，还包括UE的标识。
7)中继节点RN1处，UE PDU session粒度的缓存状态；可选的，还包括UE的标识以及UE PDU session的标识。
8)中继节点RN1处，UE QoS flow粒度的缓存状态；可选的，还包括UE的标识以及UE的QoS flow的标识如QFI。
9)中继节点RN1已经成功发送给其子节点(如RN3)或UE的数据包的最大序号。所述序号可以是由DgNB分配的，且中继节点RN1可识别的序号，可选的，所述序号还可以被其子节点(如RN3)或UE识别，例如所述序号为PDCP协议数据单元中携带的SN，即PDCP SN，或者为RLC SDU/PDU中携带的SN，即RLC SN。
10)被中继节点RN1认为丢失的且没有向DgNB反馈过的数据包序号，所述序号是在DgNB和RN1处均可以识别且在两者之间的链路上被连续编号的序号，例如在图7C所示的场景中，可以是由分流锚点DgNB为数据包分配的序号，所述序号在分流的路径包含的部分链路上(例如链路RN3-RN1-DgNB，或链路RN1-DgNB)被连续编号，所述序号可以在新增的协议层(例如适配层)的处理过程中携带(即携带在经适配层处理后的报文Adapt PDU中)，或者在GTP层的处理过程中携带(即携带在经GTP层处理后的报文GTP  PDU中)。或者，在没有多路径分流的场景中，所述序号还可以是DgNB分配的PDCP SN，或者RLC SN等。
11)链路质量信息，这里为RN1与RN3之间的回传链路(以下用RN1-RN3表示)质量信息；可选的，还包括指示具体是哪一段链路的信息，例如用RN3的标识指示所述链路质量信息对应于链路RN1-RN3。所述回传链路质量信息可以包括该链路的上行和/或下行RSRP、RSRQ、RSSI、SINR中的至少一项。具体的，RN1可以通过测量获得RN3→RN1上行链路的链路质量信息，对于下行链路RN1→RN3的链路质量信息，RN1可以通过RN3向其发送的测量报告获知。
12)链路带宽或传输速率，这里为中继节点RN1和其子节点之间的回传链路(如RN1-RN3)上，RN1粒度/RN3所在的RN1服务的小区粒度/RN3粒度/RN3无线承载粒度/UE粒度/UE无线承载粒度/UE的PDU session粒度/UE的QoS flow粒度的可用/平均带宽或传输速率；可选的，还包含具体对应的RN1的标识/RN3所在的RN1服务的小区标识/RN3的标识/RN3的无线承载标识/UE的标识/与UE无线承载对应的标识/UE的PDU session标识/UE的QoS flow标识。
13)中继节点RN1的负载程度指示，例如，考虑经由RN1传输的所有UE的业务之和得出的一个评估值，可以是一个取值范围有限的level指示，该指示可用于上级节点如宿主基站决定是否需要调整给RN1的资源数量，以及是否需要调整网络拓扑或者路由策略，所述资源可以是时间、频率、空间等维度的传输资源。
14)链路的平均/最小传输时延，例如中继节点RN1和其子节点RN3之间的回传链路的平均/最小单向传输时延(上行和/或下行)，或者RN1和RN3之间的回传链路的平均/最小回环时延RTT。
15)数据包在中继节点RN1处的平均/最小等待时间，例如，可以由RN1统计其收到数据包的等待时间得到，等待时间T＝T S-T R，其中，T R表示RN1收到数据包的时间，T S表示RN1发出该数据包的时间。
二)流控反馈信息的反馈触发方式
其中，RN1向DgNB发送流控反馈信息2，可以周期性向DgNB发送，也可以由触发事件触发，触发事件包括例如RN1-RN3的接入链路阻断或恢复、RN1收到RN3的流控反馈信息1、RN1处特定粒度的缓存状态超过或低于一定门限、中继节点RN1检测到在RN1和DgNB之间的链路上有数据包丢失等。流控反馈信息的周期和触发事件，可以由核心网设备或DgNB通过配置信息发送给RN1，或由RN1和DgNB进行协商确定。
需要说明的是，RN3向RN1发送流控反馈信息1的触发方式，可以参考实施例二的反馈触发方式进行理解，可以周期性发送或由触发事件触发发送。
三)流控反馈信息的发送方式
1)RN3向RN1发送流控反馈信息1，可以参考实施例二中的三种方式。值得注意的是，在RN3发送的包含流控反馈信息1的报文中，可以包含所述流控反馈信息1的目的节点标识，即需要接收所述流控反馈信息1的节点标识，例如RN1的标识或DgNB的标识等。可选的，包含所述流控反馈信息1的报文中还可以包含第一指示信息，用于表明所述报文为包含流控反馈信息的报文。
2)RN1向DgNB发送流控反馈信息2，也可以参考实施例二中的三种方式，即通过GTP数据包携带所述流控反馈信息2，或者通过适配层信息(例如适配层控制PDU或者适 配层头信息)携带所述流控反馈信息2，或者通过RRC消息或T1协议层消息等控制层报文携带所述流控反馈信息，无论是这几种方式的任意一种，在RN1发送的包含流控反馈信息2的报文中，可以包含所述流控反馈信息2的目的节点的标识，例如DgNB的标识。可选的，包含所述流控反馈信息2的报文中还可以包含第一指示信息，用于表明所述报文为包含流控反馈信息的报文。
进一步的，若接收到流控反馈信息的节点并非接收流控反馈信息的目的节点或唯一的目的节点，则该节点向所述目的节点的发送接收到的流控反馈信息；判断本节点是否是目的节点或唯一的目的节点，具体的，可以通过携带流控反馈信息的数据包中的目的节点标识来判断，例如携带流控反馈信息的数据包中的目的节点标识为本节点的标识，则本节点即为目的节点，又如携带流控反馈信息的数据包中的目的节点标识为组播地址标识，该组播地址标识对应于一组成员节点，其中，该组成员节点中包含本节点，则本节点不是唯一的目的节点，本节点可以继续向所述组播地址标识对应的其他成员节点发送其收到的流控反馈信息；还可以结合其中的第一指示信息来判断，例如若数据包携带的第一指示信息表明携带内容为流控反馈信息，且本节点是可以执行流量控制决策的节点，则本节点即为目的节点，倘若本节点的父节点为执行流量控制决策的节点，则父节点为目的节点。
接收流控反馈信息的节点，如果可以进行流量控制决策，则该节点可根据流控反馈信息中的内容调整各条链路上一定粒度的业务分配比例/发送速率，例如，如果DgNB收到的报告中表明某一段链路(例如RN1-RN3)处于outage状态，则DgNB会在这一段链路恢复之前，不再向RN1发送任何由RN3直接或者间接服务的UE的数据包，或者主动进行网络拓扑更新，通过其他节点与RN3建立连接。本申请中对于节点进行流量控制的具体方式和方法不予限定。
采用上述方案，可以实现多跳无线中继网络的流控信息的反馈，使得有流量控制决策能力的节点例如DgNB可以获知其与UE之间各条路径所包含的每一段链路的状态，从而能及时进行一定粒度(例如UE无线承载粒度或UE粒度或中继无线承载粒度或中继节点粒度等)的流控，例如调整一条路径上的某个节点或某段链路上的数据发送速率，避免该路径上的某些节点或某些链路处于拥塞或饥饿状态。此外，在多连接中继组网场景下，中继节点向分流的锚点例如DgNB或其他中继节点进行流控信息报文的反馈，以使分流锚点能够获知不同路径所涉及的每一段跳链路的状态，方便进行一定粒度的流控，更合理的调整不同路径或链路上的业务或流量。
实施例四
实施例四中考虑多跳及接入链路多连接的组网场景，具体可以参阅图8所示，UE与RN2和RN1之间均有接入链路，RN1和RN2的父节点为RN3，RN3的父节点为DgNB，DgNB和UE之间的路径有两条，分别为路径一：UE-RN1-RN3-DgNB，以及路径二：UE-RN2-RN3-DgNB，RN3为路径一和路径二的分流锚点或汇聚点。
从UE和RN3之间的网络拓扑关系来看，与图7A所示的网络拓扑无异，故RN2和RN1向RN3发送各自接入链路的流控反馈信息1，可以参考实施例二中的描述进行理解，理解时将实施例二中的DgNB替换为此实施例中的RN3，此处不再赘述。
RN3收到RN1或RN2发来的流控反馈信息1后，可以将所述流控反馈信息1转发给DgNB，或者由RN3携带在流控反馈信息2中发送给DgNB，所述流控反馈信息2中，可以包含RN1发送的流控反馈信息、RN2发送的流控反馈信息、描述RN1-RN3链路的流控 反馈信息、描述RN2-RN3链路的流控反馈信息中的任意一种或多种。所述描述RN1-RN3链路的流控反馈信息的内容可参考实施例三中的描述进行理解，理解时需将实施例三相应描述中的RN1和RN3互换；所述描述RN2-RN3链路的流控反馈信息的内容，可参考实施例三中对RN1-RN3链路的流控反馈信息的内容的描述进行理解，理解时需将实施例三相应描述中的RN1替换为本实施例中的RN3，将实施例三中的RN3替换为本实施例中的RN2。
本实施例中，由于RN3与DgNB之间的链路只有一个，若RN3可进行流量控制决策，则DgNB可无需知晓RN3到达UE的两条路径(即RN3-RN2-UE，以及RN3-RN1-UE)的各段链路状态。因此，除了前述方式外，从减少流控反馈开销的角度，RN3还可以将这两条链路相关的流控反馈信息中的部分内容进行汇总处理后再向DgNB反馈，即RN3可以将上述流控反馈信息2中所包含的部分内容进行汇总处理，然后将汇总后的结果和其余无需汇总处理的内容一起生成新的流控反馈信息2发送给DgNB。对于图8所示的场景，如果RN3向DgNB反馈流控反馈信息2中，包含UE/UE无线承载/UE的PDU session/UE的QoS flow粒度的缓存状态，则RN3可以不一一将各个节点处的缓存状态反馈给DgNB，而是先进行汇总后，再给DgNB汇总后的信息。例如，RN3反馈的流控反馈信息2中包含对应于UE DRB1的缓存剩余空间的汇总信息，为L 3+∑ iL ij，其中i为RN3和UE之间的传输路径的标号，j为第i条路径上除RN3之外的中继节点的标识，L ij为第i个传输路径中第j个节点处对应于UE DRB1的缓存剩余空间，L 3为RN3处对应于UE DRB1的缓存剩余空间，∑{}为求和运算；类似地，RN3反馈的流控反馈信息2中还可以包含其他粒度(如UE粒度、UE PDU会话粒度、UE的QoS flow粒度等)的缓存状态的汇总信息，缓存状态还可以包括其他内容，具体可参考实施例一中的相关描述；可选的，RN3向DgNB发送的流控反馈信息2中的链路带宽或传输速率，可以是RN3与UE之间的链路可用/平均带宽或传输速率的汇总信息，例如为∑ imin j{R ij}，其中i为RN3和UE之间的传输链路的标号，j为第i条链路上的中继节点(也包括RN3)的标识，R ij可理解为第i个传输链路上节点j和其子节点之间的链路可用带宽或传输速率，min{}为取最小值运算；可选的，RN3向DgNB发送的流控反馈信息2中，包含的链路的平均/最小传输时延，可以是RN3与UE之间的链路的平均/最小时延的汇总信息，例如为min {i＝1,2,…}∑ i∑ j{T ij}，其中i为RN3和UE之间的传输链路的标号，j为第i条链路上的中继节点(也包括RN3)的标识，T ij可理解为第i个传输链路上节点j和其子节点之间的链路平均/最小单向传输时延或者回环时延。
本实施例中的流控反馈信息的反馈触发方式以及流控反馈信息的发送方式可参考实施例三中的相应描述进行理解，理解时可以将实施例三相应描述中的RN1替换为本实施例中的RN3，将实施例三相应描述中的RN3替换为本实施例中的RN1或RN2。
采用上述方案，作为分流节点/汇聚节点的中继节点RN3，对子节点的流控信息进行汇总处理后，向DgNB反馈，可减少反馈的开销；或者RN3还可以根据子节点RN1和/或RN2发送的流控反馈信息，获知其与UE之间的两条路径上的各段链路状态，便于在需要的时候进行一定粒度的流控。
值得注意的是，本申请实施例二～实施例四中的DgNB可以是一个完整的功能实体，即不考虑集中式单元和分布式单元分离形态的宿主基站，可选的，DgNB还可以是集中式单元和分布式单元分离的形态，则实施例二～实施例四中的DgNB的功能，可以被对应的宿主基站的分布式单元(Donor-DU)和/或宿主基站的集中式单元(Donor-CU)所替代。
实施例五
实施例五的应用场景与前三个实施例的不同在于，前三个实施例中都是中继节点发送流控反馈信息的反馈的方式，本实施例五中，将由UE进行流控反馈信息的发送。
一)流控反馈信息的内容，可以包括如下信息中的至少一种：
1)链路状态指示，这里为接入链路的链路状态指示，包括：链路阻断、链路恢复这两种链路状态这两种状态中的任一种。如果UE有多条接入链路，还需指明是哪一条链路(例如携带接入的中继节点的标识，或接入的小区标识)。
2)UE接收到的数据包的序号的最大值，所述序号可以是例如PDCP SN或RLC SN。
3)UE认为丢失或未成功接收的数据包的序号，所述序号是在UE和为UE提供接入服务的中继节点RN或DgNB处均可以识别，且在两者之间的链路上被连续编号的序号，所述序号可以是例如PDCP SN或RLC SN。
4)链路质量信息，这里为接入链路的链路质量信息，可选的，所述链路质量信息包括上行和/或下行的RSRP、RSRQ、RSSI、SINR、链路的传输速率(例如链路在一段时间内的平均传输速率)中的至少一项。
5)链路的平均/最小传输时延，这里为接入链路的平均/最小单向传输时延或回环时延。
二)流控反馈信息的反馈触发方式
UE向DgNB或中继节点发送流控反馈信息，可以周期性发送，也可以由触发事件触发，触发事件包括例如接入链路阻断或恢复、UE检测到接入链路有数据包丢失(如重排序定时器超时)等。流控反馈信息的周期和触发事件，可由核心网设备或DgNB或中继节点通过配置信息发送给UE。
三)流控反馈信息的发送方式
UE可以通过控制层的RRC消息或者通过PDCP PDU(例如PDCP状态报告)携带流控反馈信息，流控反馈信息的目的节点是UE PDCP层和/或RRC层的对等层所在的节点，例如，在图4A或图4B或图4C所示的IAB网络协议架构中，UE的PDCP协议层的对等层位于宿主基站DgNB或者宿主基站的集中式单元Donor-CU，若UE通过PDCP PDU携带流控反馈信息，则UE会将所述流控反馈信息经过至少一个中继节点发送给DgNB或者Donor-CU；或者，对于图4D或图4E所示的IAB网络协议架构，UE的PDCP协议层的对等层位于中继节点(例如图中的RN2)，若UE通过PDCP PDU携带流控反馈信息，则UE会将所述流控反馈信息发送给所述中继节点RN2；或者，在图5A或图5B或图5C所示的IAB网络协议架构中，UE的RRC协议层的对等层位于宿主基站DgNB或者宿主基站的集中式单元Donor-CU，若UE通过控制层RRC消息(RRC PDU)携带流控反馈信息，则UE会将所述流控反馈信息经过至少一个中继节点发送给DgNB或者Donor-CU；或者，对于图5D或图5E所示的IAB网络协议架构，UE的RRC协议层的对等层位于中继节点(例如图中的RN2)，若UE通过RRC消息携带流控反馈信息，则UE会将所述流控反馈信息发送给所述中继节点RN2。
本实施例中，若考虑层2中继和层3中继混合组网的场景，即图8中的RN3采用层3架构，RN1(RN2)采用层2架构，相应的多跳的用户面和控制面协议架构如图9所示。为便于描述，图9中中继节点之间的接口用Un表示，但本发明对中继节点之间的接口名称不予限制。
一种可能的设计中，若UE采用PDCP PDU携带所述流控反馈信息，RN2在收到所述PDCP PDU后，可通过与接收所述PDCP PDU的UE DRB对应的GTP隧道，向RN3发送 所述UE的PDCP PDU，所述PDCP PDU被封装在GTP PDU中，然后映射到RN2的某个无线承载上向RN3发送；或者，所述携带流控反馈信息的PDCP PDU将被RN2进行适配层处理，然后映射到RN2的某个无线承载上向RN3发送，所述适配层的处理，包括适配信息的添加以及QoS映射，所述适配信息包含如下信息中的至少一种：UE的无线承载(例如UE的数据无线承载DRB或信令无线承载SRB)标识、UE的标识、UE的PDU session ID、UE的QoS flow ID、目的节点标识；所述QoS映射，即RN2根据一定的映射规则(如从Uu接口的DRB/SRB/逻辑信道到Un接口的DRB/SRB/逻辑信道的映射)，从接收所述PDCP PDU的Uu接口的无线承载或者逻辑信道或者所述PDCP PDU中的表明QoS要求的标识(如区分服务码点DSCP)，将所述PDCP PDU再映射到RN2和RN3之间的Un接口承载(例如RN2DRB)上向RN3发送，所述映射规则可以是核心网网元或宿主基站DgNB生成后发送至RN2的，或由RN2根据从核心网网元或宿主基站DgNB或RN2的父节点收到的例如UE的DRB/QoS flow相应的QoS参数配置以及RN2的DRB的QoS参数配置等信息，在本地生成的映射规则。
另一种可能的设计中，若UE采用控制层的RRC消息发送所述流控反馈信息，则所述UE的RRC消息可以被RN2携带在T1协议层消息中发送至RN3，例如在T1协议层消息中设置RRC容器(container)，用于携带UE的RRC消息或发往UE的RRC消息；或者，所述UE的RRC消息还可以在RN2进行适配层的处理后，通过RN2的某个无线承载(RN2的DRB或SRB)向RN3或DgNB发送，所述适配层的处理，包括适配信息的添加以及QoS映射，所述适配信息包含如下信息中的至少一种：UE的无线承载标识(例如RN2接收UE RRC消息的SRB ID)、UE的标识、UE的PDU session ID、UE的QoS flow ID、目的节点标识；所述QoS映射，即RN2根据一定的映射规则(如从Uu接口的SRB/逻辑信道到Un接口的DRB/SRB/逻辑信道的映射)，从接收携带所述流控反馈信息的RRC消息的Uu接口的承载/逻辑信道或者包含所述RRC消息的数据包中的表明QoS要求的标识，映射到RN2和RN3之间的无线承载上(例如RN2SRB)向RN3发送，所述映射规则可以是核心网网元或宿主基站DgNB生成后发送至RN2的，或由RN2根据从核心网网元或宿主基站DgNB或RN2的父节点收到的例如UE的DRB/QoS flow相应的QoS参数配置以及RN2的DRB的QoS参数配置等信息，在本地生成的映射规则。
需要说明的是，图9只是一种可能的多跳的用户面和控制面协议架构示意图。比如，当中继节点不只一跳时，此时，UE的RRC/PDCP的对等层所在的节点(或锚点)可能在DgNB，或在服务UE的RN，或在回传链路的任意一个RN上，本申请对此不作具体限定。
采用上述方案，由UE通过PDCP PDU或者RRC消息，向其PDCP/RRC协议栈的对等层所在的节点发送流控反馈信息，可作为中继节点发送流控反馈信息方案的补充，在中继节点没有反馈通道时提供一种反馈信息发送方案。
基于以上实施例，本申请实施例提供一种信息传输装置，应用于中继节点，用于实现上述方法实施例中中继节点的执行过程，参阅图10所示，一种信息传输装置1000包括：处理单元1001和发送单元1002。其中，
处理单元1001，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继节点粒度的缓存状态，所述中继节点与至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；所述至少一个第一节点是所述中 继节点的子节点；
发送单元1002，用于向第二节点发送携带第一信息的第一报文。
可选的，所述处理单元1001具体用于：
监测所述中继节点的缓存状态得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态；或，
接收所述至少一个第一节点分别发送的第二报文，分别从所述第二报文中获取所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；或
监测所述中继节点的缓存状态，以及接收所述至少一个第一节点发送的缓存状态，得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态。
可选的，所述第一报文中还包括第一指示信息，用于表明所述第一报文为包含流控反馈信息的报文
可选的，所述处理单元1001还用于：
根据所述第一指示信息或所述第二报文中携带的目的地址确定所述第二节点是接收所述第一报文的目的节点。
可选的，所述第一信息还包括终端DRB粒度的缓存状态、终端粒度的缓存状态、终端协议数据单元PDU会话粒度的缓存状态、终端服务质量流粒度的缓存状态、所述中继节点和所述至少一个第一节点之间的链路状态指示、成功发送至所述第一节点或终端的数据包序号、所述中继节点确定丢失的未反馈至所述第二节点的数据包序号、所述中继节点和所述至少一个第一节点之间的链路质量信息、所述中继节点粒度的带宽或传输速率、终端粒度的带宽或传输速率、终端的RB粒度的带宽或传输速率、终端PDU会话粒度的带宽或传输速率、终端服务质量流粒度的带宽或传输速率、所述中继节点和所述至少一个第一节点之间的链路的平均或最小传输时延、数据包在所述中继节点处的平均等待时间或最小等待时间、所述中继节点的负载程度指示中的至少一种。
可选的，所述发送单元1002具体用于：
周期性向所述第二节点发送所述第一报文；或，
当预设的事件触发时，向所述第二节点发送所述第一报文。
可选的，所述第一报文在所述中继节点与所述第二节点之间对等的通用分组无线业务隧道协议GTP层，对等的适配层或对等的控制层中发送。
可选的，所述中继节点确定丢失的未反馈至所述第二节点的数据包序号是在所述第二节点和中继节点处均可以识别且在两者之间的链路上被连续编号的序号。
基于以上实施例，本申请实施例提供一种信息传输装置，应用于终端，用于实现上述方法实施例中终端的执行过程，参阅图11所示，一种信息传输装置1100包括：处理单元1101和发送单元1102。其中，
处理单元1101，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述终端的接入链路的链路状态指示、所述终端设备接收到的数据包序号、所述终端设备确定丢失的或未成功接收的数据包序号、所述终端的接入链路的链路质量信息、所述终端的接 入链路的的平均或最小传输时延；
发送单元1102，用于向目的节点发送携带第一信息的第一报文。
应理解以上各个单元的划分仅仅是一种逻辑功能的划分，实际实现时可以全部或部分集成到一个物理实体上，也可以物理上分开。且这些单元可以全部以软件通过处理元件调用的形式实现；也可以全部以硬件的形式实现；还可以部分单元以软件通过处理元件调用的形式实现，部分单元以硬件的形式实现。例如处理单元可以为单独设立的处理元件，也可以集成在某一个芯片中实现，此外，也可以以程序的形式存储于存储器中，由某一个处理元件调用并执行该单元的功能。其它单元的实现与之类似。此外这些单元全部或部分可以集成在一起，也可以独立实现。这里所述的处理元件可以是一种集成电路，具有信号的处理能力。在实现过程中，上述方法的各步骤或以上各个单元可以通过处理器元件中的硬件的集成逻辑电路或者软件形式的指令完成。此外，以上接收单元是一种控制接收的单元，可以通过终端设备或网络设备的接收装置，例如天线和射频装置接收信息。以上发送单元是一种控制发送的单元，可以通过终端设备或网络设备的发送装置，例如天线和射频装置发送信息。
例如，以上这些单元可以是被配置成实施以上方法的一个或多个集成电路，例如：一个或多个特定集成电路(application specific integrated circuit，ASIC)，或，一个或多个数字信号处理器(digital signal processor，DSP)，或，一个或者多个现场可编程门阵列(field programmable gate array，FPGA)等。再如，当以上某个单元通过处理元件调度程序的形式实现时，该处理元件可以是通用处理器，例如中央处理器(central processing unit，CPU)或其它可以调用程序的处理器。再如，这些单元可以集成在一起，以片上系统(system-on-a-chip，SOC)的形式实现。
基于以上实施例，本申请实施例还提供了一种中继设备，用于实现上述方法实施例中中继节点的执行过程，参阅图12所示，所述中继设备1200中包括：收发器1201、处理器1202、存储器1203。
所述存储器1203，用于存储计算机可执行指令；当处理器1202执行所述计算机可执行指令时，使中继设备1200执行上述如图2所示的方法。
可以理解的，上述图10所示实施例中的信息传输装置可以以图12所示的中继设备1200实现。中继设备1200的结构并不构成对本申请实施例的限定。
基于以上实施例，本申请还提供了一种终端，参阅图13所示，所述终端1300中包括：收发器1301、处理器1302、存储器1303。
所述存储器1303，用于存储计算机可执行指令；
所述处理器1302，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述终端的接入链路的链路状态指示、所述终端设备接收到的数据包序号、所述终端设备确定丢失的或未成功接收的数据包序号、所述终端的接入链路的链路质量信息、所述终端的接入链路的的平均或最小传输时延。
当所述处理器1302执行所述计算机可执行指令时，所述收发器1301，用于向目的节点发送携带第一信息的第一报文。可以理解的，上述图11所示实施例中的信息传输装置可以以图13所示的终端1300实现。终端1300的结构并不构成对本申请实施例的限定。
在上述图12和图13中，处理器可以是中央处理器(central processing unit，CPU)，网络处理器(network processor，NP)，硬件芯片或者其任意组合。存储器可以包括易失性 存储器(volatile memory)，例如随机存取存储器(random access memory，RAM)；存储器也可以包括非易失性存储器(non-volatile memory)，例如只读存储器(read-only memory，ROM)，快闪存储器(flash memory)，硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)；存储器还可以包括上述种类的存储器的组合。
本领域内的技术人员应明白，本申请实施例可提供为方法、系统、或计算机程序产品。因此，本申请实施例可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请实施例可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请实施例是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请的精神和范围。这样，倘若本申请实施例的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (20)

  1. 一种信息传输方法，其特征在于，包括：
    中继节点确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继节点粒度的缓存状态，所述中继节点与至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；所述至少一个第一节点是所述中继节点的子节点；
    所述中继节点向第二节点发送携带第一信息的第一报文。
  2. 如权利要求1所述的方法，其特征在于，所述中继节点确定第一信息，包括：
    所述中继节点监测自身的缓存状态得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态；或，
    所述中继节点接收所述至少一个第一节点分别发送的第二报文，分别从所述第二报文中获取所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；或
    所述中继节点监测自身的缓存状态，以及接收所述至少一个第一节点发送的缓存状态，得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态。
  3. 如权利要求1或2所述的方法，其特征在于，所述第一报文中还包括第一指示信息，用于表明所述第一报文为包含流控反馈信息的报文。
  4. 如权利要求3所述的方法，其特征在于，在所述中继节点向第二节点发送第一报文之前，所述方法还包括：
    所述中继节点根据所述第一指示信息或所述第二报文中携带的目的地址确定所述第二节点是接收所述第一报文的目的节点。
  5. 如权利要求1所述的方法，其特征在于，所述第一信息还包括终端无线承载RB粒度的缓存状态、终端粒度的缓存状态、终端协议数据单元PDU会话粒度的缓存状态、终端服务质量流粒度的缓存状态、所述中继节点和所述至少一个第一节点之间的链路状态指示、成功发送至所述第一节点或终端的数据包序号、所述中继节点确定丢失的未反馈至所述第二节点的数据包序号、所述中继节点和所述至少一个第一节点之间的链路质量信息、所述中继节点粒度的带宽或传输速率、终端粒度的带宽或传输速率、终端的RB粒度的带宽或传输速率、终端PDU会话粒度的带宽或传输速率、终端服务质量流粒度的带宽或传输速率、所述中继节点和所述至少一个第一节点之间的链路的平均或最小传输时延、数据包在所述中继节点处的平均等待时间或最小等待时间、所述中继节点的负载程度指示中的至少一种。
  6. 如权利要求1-5任一项所述的方法，其特征在于，所述中继节点向第二节点发送携带所述第一信息的第一报文，包括：
    所述中继节点周期性向所述第二节点发送所述第一报文；或，
    当预设的事件触发时，所述中继节点向所述第二节点发送所述第一报文。
  7. 如权利要求6所述的方法，其特征在于，所述第一报文在所述中继节点与所述第二节点之间对等的通用分组无线业务隧道协议GTP层，对等的适配层或对等的控制层中发送。
  8. 如权利要求5所述的方法，其特征在于，所述中继节点确定丢失的未反馈至所述第二节点的数据包序号是在所述第二节点和中继节点处均可以识别且在两者之间的链路上被连续编号的序号。
  9. 一种信息传输方法，其特征在于，包括：
    终端确定第一信息，所述第一信息包括如下信息中的至少一种：所述终端的接入链路的链路状态指示、所述终端设备接收到的数据包序号、所述终端设备确定丢失的或未成功接收的数据包序号、所述终端的接入链路的链路质量信息、所述终端的接入链路的的平均或最小传输时延；
    所述终端向目的节点发送携带第一信息的第一报文。
  10. 一种信息传输装置，应用于中继节点，其特征在于，包括：
    处理单元，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继节点粒度的缓存状态，所述中继节点与至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；所述至少一个第一节点是所述中继节点的子节点；
    发送单元，用于向第二节点发送携带第一信息的第一报文。
  11. 如权利要求10所述的装置，其特征在于，所述处理单元具体用于：
    监测所述中继节点的缓存状态得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态；或，
    接收所述至少一个第一节点分别发送的第二报文，分别从所述第二报文中获取所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态；或
    监测所述中继节点的缓存状态，以及接收所述至少一个第一节点发送的缓存状态，得到所述中继节点粒度的缓存状态，所述中继节点与所述至少一个第一节点之间的无线承载RB粒度的缓存状态，所述至少一个第一节点中每个第一节点粒度的缓存状态，所述至少一个第一节点中每个第一节点与子节点之间的RB粒度的缓存状态。
  12. 如权利要求10或11所述的装置，其特征在于，所述第一报文中还包括第一指示信息，用于表明所述第一报文为包含流控反馈信息的报文。
  13. 如权利要求11所述的装置，其特征在于，所述处理单元还用于：
    根据所述第一指示信息或所述第二报文中携带的目的地址确定所述第二节点是接收所述第一报文的目的节点。
  14. 如权利要求10所述的装置，其特征在于，所述第一信息还包括终端DRB粒度的缓存状态、终端粒度的缓存状态、终端协议数据单元PDU会话粒度的缓存状态、终端服务质量流粒度的缓存状态、所述中继节点和所述至少一个第一节点之间的链路状态指示、成功发送至所述第一节点或终端的数据包序号、所述中继节点确定丢失的未反馈至所述第二节点的数据包序号、所述中继节点和所述至少一个第一节点之间的链路质量信息、所述 中继节点粒度的带宽或传输速率、终端粒度的带宽或传输速率、终端的RB粒度的带宽或传输速率、终端PDU会话粒度的带宽或传输速率、终端服务质量流粒度的带宽或传输速率、所述中继节点和所述至少一个第一节点之间的链路的平均或最小传输时延、数据包在所述中继节点处的平均等待时间或最小等待时间、所述中继节点的负载程度指示中的至少一种。
  15. 如权利要求10-14任一项所述的装置，其特征在于，所述发送单元具体用于：
    周期性向所述第二节点发送所述第一报文；或，
    当预设的事件触发时，向所述第二节点发送所述第一报文。
  16. 如权利要求15所述的装置，其特征在于，所述第一报文在所述中继节点与所述第二节点之间对等的通用分组无线业务隧道协议GTP层，对等的适配层或对等的控制层中发送。
  17. 如权利要求14所述的装置，其特征在于，所述中继节点确定丢失的未反馈至所述第二节点的数据包序号是在所述第二节点和中继节点处均可以识别且在两者之间的链路上被连续编号的序号。
  18. 一种信息传输装置，应用于终端，其特征在于，包括：
    处理单元，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述终端的接入链路的链路状态指示、所述终端设备接收到的数据包序号、所述终端设备确定丢失的或未成功接收的数据包序号、所述终端的接入链路的链路质量信息、所述终端的接入链路的的平均或最小传输时延；
    发送单元，用于向目的节点发送携带第一信息的第一报文。
  19. 一种中继设备，其特征在于，该中继设备包括：收发器，处理器和存储器；所述存储器，用于存储计算机可执行指令；
    所述处理器，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述中继设备粒度的缓存状态，所述中继设备与至少一个第一设备之间的无线承载RB粒度的缓存状态，所述至少一个第一设备中每个第一设备粒度的缓存状态，所述至少一个第一设备中每个第一设备与子设备之间的RB粒度的缓存状态；所述至少一个第一设备是所述中继设备的子设备；
    当所述处理器执行所述计算机可执行指令时，所述收发器，用于向第二设备发送携带第一信息的第一报文。
  20. 一种终端，其特征在于，该终端包括：收发器，处理器和存储器；所述存储器，用于存储计算机可执行指令；
    所述处理器，用于确定第一信息，所述第一信息包括如下信息中的至少一种：所述终端的接入链路的链路状态指示、所述终端设备接收到的数据包序号、所述终端设备确定丢失的未成功接收的数据包序号、所述终端的接入链路的链路质量信息、所述终端的接入链路的的平均或最小传输时延；
    当所述处理器执行所述计算机可执行指令时，所述收发器，用于向目的节点发送携带第一信息的第一报文。
PCT/CN2019/079591 2018-03-26 2019-03-25 一种信息传输方法和装置 Ceased WO2019184890A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19775569.7A EP3761698A4 (en) 2018-03-26 2019-03-25 INFORMATION TRANSMISSION PROCESS AND APPARATUS
US17/029,986 US11419010B2 (en) 2018-03-26 2020-09-23 Information transmission method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810254395.6A CN110366206A (zh) 2018-03-26 2018-03-26 一种信息传输方法和装置
CN201810254395.6 2018-03-26

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/029,986 Continuation US11419010B2 (en) 2018-03-26 2020-09-23 Information transmission method and apparatus

Publications (1)

Publication Number Publication Date
WO2019184890A1 true WO2019184890A1 (zh) 2019-10-03

Family

ID=68059286

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/079591 Ceased WO2019184890A1 (zh) 2018-03-26 2019-03-25 一种信息传输方法和装置

Country Status (4)

Country Link
US (1) US11419010B2 (zh)
EP (1) EP3761698A4 (zh)
CN (1) CN110366206A (zh)
WO (1) WO2019184890A1 (zh)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021238750A1 (zh) * 2020-05-27 2021-12-02 索尼集团公司 电子设备、无线通信方法和计算机可读存储介质
WO2021247404A1 (en) * 2020-06-03 2021-12-09 Qualcomm Incorporated Managing a backhaul configuration in a wireless multi-hop network
WO2022031068A1 (en) * 2020-08-05 2022-02-10 Samsung Electronics Co., Ltd. Method and apparatus for flow control
CN114079945A (zh) * 2020-08-18 2022-02-22 维沃移动通信有限公司 业务管理方法和节点
CN114930752A (zh) * 2020-01-10 2022-08-19 联想（新加坡）私人有限公司 连续数据分组反馈

Families Citing this family (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3759966A1 (en) * 2018-03-28 2021-01-06 Sony Corporation Methods, wireless communications networks and infrastructure equipment
CN110475267B (zh) 2018-05-11 2021-09-17 华为技术有限公司 一种配置方法、数据传输方法和装置
EP3794759A1 (en) * 2018-06-20 2021-03-24 Convida Wireless, Llc Efficient buffer management in multi-hops data forwarding
GB2574876A (en) * 2018-06-21 2019-12-25 Tcl Communication Ltd Transmission techniques in a cellular network
CN110636644B (zh) * 2018-06-21 2023-03-07 中兴通讯股份有限公司 信息传输方法及装置
CN116916458A (zh) 2018-06-21 2023-10-20 中兴通讯股份有限公司 信息传输方法及装置
KR20200013576A (ko) * 2018-07-30 2020-02-07 주식회사 케이티 5g 무선 릴레이를 위한 흐름 제어 방법 및 장치
EP4236440A3 (en) 2018-08-10 2023-10-18 Ofinno, LLC Wireless backhaul link information
US11076306B2 (en) * 2018-09-21 2021-07-27 Qualcomm Incorporated Relay nodes with multi-connected cellular backhaul
CN112715055B (zh) * 2018-09-28 2024-03-22 夏普株式会社 无线电接入网络和用于加速的网络接入的方法
CN111107010B (zh) * 2018-10-25 2022-11-25 华为技术有限公司 传输控制方法和装置
WO2020204771A1 (en) * 2019-04-01 2020-10-08 Telefonaktiebolaget Lm Ericsson (Publ) Methods and arrangements for managing round trip time associated with provision of a data flow via a multi-access communication network
US10833984B1 (en) * 2019-05-02 2020-11-10 At&T Intellectual Property I, L.P. Integrated access backhaul network metric exchange for 5G or other next generation network
JP7310324B2 (ja) * 2019-06-06 2023-07-19 日本電気株式会社 無線基地局、無線通信システム、フロー制御方法及びプログラム
CN117440433A (zh) * 2019-06-28 2024-01-23 瑞典爱立信有限公司 用于流控制的方法和装置
US11490390B2 (en) * 2019-08-28 2022-11-01 Qualcomm Incorporated Enhanced resource management for mobile integrated access backhaul (IAB)
WO2021166251A1 (ja) * 2020-02-21 2021-08-26 日本電信電話株式会社 制御装置、制御方法及びプログラム
CN113472492B (zh) * 2020-03-30 2023-04-07 维沃移动通信有限公司 流控消息的传输方法和设备
KR102945930B1 (ko) 2020-05-15 2026-03-30 지티이 코포레이션 이중 연결 하에서의 사이드링크 릴레이 통신을 위한 방법
US11589388B2 (en) * 2020-05-26 2023-02-21 Qualcomm Incorporated Sharing channel occupancy time of a node in an integrated access backhaul network
CN113950074B (zh) * 2020-07-16 2024-05-14 维沃移动通信有限公司 延时指示的方法、配置方法及装置
CN120785487A (zh) * 2020-08-19 2025-10-14 华为技术有限公司 用于多链路无线传输的设备和方法
CN114125881B (zh) * 2020-08-28 2024-09-03 深圳市中兴微电子技术有限公司 接口数据的处理方法、发送端设备和接收端设备
CN114501339B (zh) * 2020-10-23 2022-11-08 大唐移动通信设备有限公司 多媒体广播业务的处理方法、装置及存储介质
GB2607083B (en) * 2021-05-27 2024-07-17 Canon Kk Flow control feedback in an integrated access and backhaul network
CN113490156B (zh) * 2021-07-01 2024-03-12 腾讯科技（深圳）有限公司 多播广播业务的通信方法、装置、介质及电子设备
CN113473394B (zh) * 2021-07-21 2022-05-27 厦门骐俊物联科技股份有限公司 一种数字对讲机及其自适应中继方法
CN119653515A (zh) * 2023-09-15 2025-03-18 华为技术有限公司 通信方法及相关装置
CN121645254A (zh) * 2024-09-04 2026-03-10 展讯通信（上海）有限公司 通信方法及装置、计算机可读存储介质
CN121173744B (zh) * 2025-09-19 2026-03-10 北京中航通用科技有限公司 周期性信息缓存空间均衡及流控控制方法及系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101605355A (zh) * 2009-06-12 2009-12-16 中国科学技术大学 一种用于LTE-advanced网络中继节点上的ROHC混合工作方式
CN102056242A (zh) * 2009-10-28 2011-05-11 大唐移动通信设备有限公司 一种回程链路流量控制的方法、系统和设备
CN102448058A (zh) * 2011-01-10 2012-05-09 华为技术有限公司 一种Un接口上的数据保护方法与装置
CN102598821A (zh) * 2009-10-30 2012-07-18 高通股份有限公司 用于在无线通信系统中提供中继回程通信的装置和方法
CN102958122A (zh) * 2011-08-24 2013-03-06 中兴通讯股份有限公司 群组切换时的承载控制方法及装置
CN106034314A (zh) * 2015-03-10 2016-10-19 电信科学技术研究院 一种数据传输方法及装置

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010258920A (ja) * 2009-04-27 2010-11-11 Ntt Docomo Inc 移動通信システム
CN101877860B (zh) * 2009-04-28 2016-01-20 中兴通讯股份有限公司 中继节点、服务网关、中继数据的传输方法及系统
US8576714B2 (en) * 2009-05-29 2013-11-05 Futurewei Technologies, Inc. System and method for relay node flow control in a wireless communications system
US8687590B2 (en) * 2009-10-02 2014-04-01 Blackberry Limited System and method for handover between relays
US8406192B2 (en) * 2009-10-02 2013-03-26 Research In Motion Limited Handover mechanisms with synchronous PDCP protocol under various relay architectures
EP2524536A4 (en) * 2010-01-11 2014-03-12 Nokia Solutions & Networks Oy METHOD AND APPARATUS
US20110261747A1 (en) * 2010-04-02 2011-10-27 Interdigital Patent Holdings, Inc. Method and apparatus for supporting communication via a relay node
CN102045851B (zh) * 2011-01-25 2013-09-04 华中科技大学 一种中继网络中的上行资源分配方法和装置
US9282565B2 (en) * 2011-03-14 2016-03-08 Telefonaktiebolaget L M Ericsson (Publ) Relay node, donor radio base station and methods therein
WO2012122670A1 (en) * 2011-03-14 2012-09-20 Telefonaktiebolaget L M Ericsson (Publ) Method and device relating to relay technique
CN110463339B (zh) * 2017-03-23 2022-10-11 苹果公司 下一代多跳中继蜂窝网络中的高级无线电资源管理
CN109842440B (zh) * 2017-11-27 2021-08-27 华为技术有限公司 一种通信方法、通信节点和系统
CN112039944A (zh) * 2018-01-12 2020-12-04 华为技术有限公司 一种数据传输方法及装置
CN110351024B (zh) * 2018-04-04 2021-06-15 华为技术有限公司 数据传输方法和装置
CN110351747B (zh) * 2018-04-04 2024-03-01 北京三星通信技术研究有限公司 用于配置中继节点的方法和设备
CN110831095B (zh) * 2018-08-11 2021-11-19 华为技术有限公司 通信方法和通信装置
EP3785480B1 (en) * 2019-01-09 2023-03-29 Ofinno, LLC Resource configuration for integrated access and backhaul nodes
US11343737B2 (en) * 2019-02-06 2022-05-24 Ofinno, Llc Base station backhaul link information
CN111586749B (zh) * 2019-02-15 2023-02-07 华为技术有限公司 一种下行缓存状态反馈方法及装置
CN118921713A (zh) * 2019-04-30 2024-11-08 北京三星通信技术研究有限公司 信息配置方法、信息交互方法、以及地址信息更新方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101605355A (zh) * 2009-06-12 2009-12-16 中国科学技术大学 一种用于LTE-advanced网络中继节点上的ROHC混合工作方式
CN102056242A (zh) * 2009-10-28 2011-05-11 大唐移动通信设备有限公司 一种回程链路流量控制的方法、系统和设备
CN102598821A (zh) * 2009-10-30 2012-07-18 高通股份有限公司 用于在无线通信系统中提供中继回程通信的装置和方法
CN102448058A (zh) * 2011-01-10 2012-05-09 华为技术有限公司 一种Un接口上的数据保护方法与装置
CN102958122A (zh) * 2011-08-24 2013-03-06 中兴通讯股份有限公司 群组切换时的承载控制方法及装置
CN106034314A (zh) * 2015-03-10 2016-10-19 电信科学技术研究院 一种数据传输方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3761698A4

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114930752A (zh) * 2020-01-10 2022-08-19 联想（新加坡）私人有限公司 连续数据分组反馈
CN114930752B (zh) * 2020-01-10 2024-01-09 联想（新加坡）私人有限公司 用于连续数据分组反馈的装置及其方法
WO2021238750A1 (zh) * 2020-05-27 2021-12-02 索尼集团公司 电子设备、无线通信方法和计算机可读存储介质
WO2021247404A1 (en) * 2020-06-03 2021-12-09 Qualcomm Incorporated Managing a backhaul configuration in a wireless multi-hop network
US11672031B2 (en) 2020-06-03 2023-06-06 Qualcomm Incorporated Managing a backhaul configuration in a wireless multi-hop network
WO2022031068A1 (en) * 2020-08-05 2022-02-10 Samsung Electronics Co., Ltd. Method and apparatus for flow control
GB2598089A (en) * 2020-08-05 2022-02-23 Samsung Electronics Co Ltd Flow control
GB2598089B (en) * 2020-08-05 2023-10-04 Samsung Electronics Co Ltd Flow control
CN114079945A (zh) * 2020-08-18 2022-02-22 维沃移动通信有限公司 业务管理方法和节点

Also Published As

Publication number Publication date
US11419010B2 (en) 2022-08-16
US20210007011A1 (en) 2021-01-07
EP3761698A1 (en) 2021-01-06
CN110366206A (zh) 2019-10-22
EP3761698A4 (en) 2021-05-05

Similar Documents

Publication Publication Date Title
WO2019184890A1 (zh) 一种信息传输方法和装置
EP3806542B1 (en) Path changing method and apparatus
CN112567796B (zh) 用于集成接入和回程承载管理的方法、装置和系统
US11496923B2 (en) Data transmission method and apparatus used in wireless backhaul network
US12587940B2 (en) Method and apparatus for packet rerouting
WO2019214747A1 (zh) 一种配置方法、数据传输方法和装置
CN110351024A (zh) 数据传输方法和装置
WO2021027860A1 (zh) 路由方法、bsr的生成方法、装置和存储介质
WO2020063504A1 (zh) 用于无线回传网络的数据传输方法和装置
WO2014114101A1 (zh) 数据多流传输方法及装置
WO2020192654A1 (zh) 配置无线链路控制rlc承载的方法和装置
WO2021062803A1 (zh) 一种数据包传输方法及装置
CN108064058A (zh) 拥塞控制方法及装置、基站
WO2020088472A1 (zh) 通信方法及装置
JP7823168B2 (ja) 通信制御方法、中継ノード、通信システム、プログラム及びチップセット
CN105684507A (zh) 无线基站、业务负载均衡方法和存储有程序的存储介质
WO2020164557A1 (zh) 一种通信方法及相关装置
JP7587029B2 (ja) 通信制御方法
CN116530136A (zh) 用于管理无线通信网络中的服务质量的方法和装置
WO2021026936A1 (zh) 一种处理回传链路发生链路失败的方法及装置
JP7720903B2 (ja) 通信制御方法
JP7614343B2 (ja) 通信制御方法、中継ノード及びプロセッサ
RU2782866C2 (ru) Архитектура с агрегированием технологий для систем связи стандарта долгосрочного развития
WO2022202976A1 (ja) 通信制御方法

Legal Events

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

Ref document number: 19775569

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019775569

Country of ref document: EP

Effective date: 20201001