WO2019184890A1 - Procédé et appareil de transmission d'informations - Google Patents

Procédé et appareil de transmission d'informations 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
Application number
PCT/CN2019/079591
Other languages
English (en)
Chinese (zh)
Inventor
朱元萍
戴明增
石小丽
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP19775569.7A priority Critical patent/EP3761698A4/fr
Publication of WO2019184890A1 publication Critical patent/WO2019184890A1/fr
Priority to US17/029,986 priority patent/US11419010B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/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

L'invention concerne un procédé et un appareil de transmission d'informations. Le procédé comprend les étapes suivantes : un nœud relais détermine des premières informations, les premières informations comprenant au moins un élément parmi les informations suivantes : un état de mémoire cache de la granularité du nœud relais, un état de mémoire cache de la granularité d'une RB entre le nœud relais et au moins un premier nœud, un état de mémoire cache de la granularité de chaque nœud dudit premier nœud, un état de cache de la granularité d'une RB entre chaque nœud dudit premier nœud et un nœud enfant, et ledit premier nœud étant un nœud enfant du nœud relais ; et le nœud relais envoie, à un deuxième nœud, un premier paquet transportant les premières informations. De cette manière, un retour d'informations de régulation de flux dans un scénario de réseautage IAB à sauts multiples/connexions multiples est mise en œuvre, de sorte qu'un réglage de commande de flux rationnel est réalisé sur le deuxième nœud.
PCT/CN2019/079591 2018-03-26 2019-03-25 Procédé et appareil de transmission d'informations WO2019184890A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19775569.7A EP3761698A4 (fr) 2018-03-26 2019-03-25 Procédé et appareil de transmission d'informations
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.6 2018-03-26
CN201810254395.6A CN110366206A (zh) 2018-03-26 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 (fr) 2019-10-03

Family

ID=68059286

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/079591 WO2019184890A1 (fr) 2018-03-26 2019-03-25 Procédé et appareil de transmission d'informations

Country Status (4)

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

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021238750A1 (fr) * 2020-05-27 2021-12-02 索尼集团公司 Dispositif électronique, procédé de communication sans fil et support de stockage lisible par ordinateur
WO2021247404A1 (fr) * 2020-06-03 2021-12-09 Qualcomm Incorporated Gestion d'une configuration de liaison terrestre dans un réseau sans fil à sauts multiples
WO2022031068A1 (fr) * 2020-08-05 2022-02-10 Samsung Electronics Co., Ltd. Procédé et appareil de régulation de flux
CN114930752A (zh) * 2020-01-10 2022-08-19 联想（新加坡）私人有限公司 连续数据分组反馈

Families Citing this family (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110475267B (zh) * 2018-05-11 2021-09-17 华为技术有限公司 一种配置方法、数据传输方法和装置
CN116916458A (zh) 2018-06-21 2023-10-20 中兴通讯股份有限公司 信息传输方法及装置
CN110636644B (zh) * 2018-06-21 2023-03-07 中兴通讯股份有限公司 信息传输方法及装置
GB2574876A (en) * 2018-06-21 2019-12-25 Tcl Communication Ltd Transmission techniques in a cellular network
KR20200013576A (ko) * 2018-07-30 2020-02-07 주식회사 케이티 5g 무선 릴레이를 위한 흐름 제어 방법 및 장치
EP4236440A3 (fr) 2018-08-10 2023-10-18 Ofinno, LLC Informations de liaison terrestre sans fil
US11076306B2 (en) 2018-09-21 2021-07-27 Qualcomm Incorporated Relay nodes with multi-connected cellular backhaul
CN111107010B (zh) * 2018-10-25 2022-11-25 华为技术有限公司 传输控制方法和装置
EP3949680B1 (fr) * 2019-04-01 2023-11-01 Telefonaktiebolaget Lm Ericsson (Publ) Procédés et agencements pour gérer un temps aller-retour associé à la fourniture d'un flux de données par l'intermédiaire d'un réseau de communication à accès multiples
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 (fr) * 2020-02-21 2021-08-26 日本電信電話株式会社 Dispositif de commande, procédé de commande et programme
CN113472492B (zh) * 2020-03-30 2023-04-07 维沃移动通信有限公司 流控消息的传输方法和设备
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 维沃移动通信有限公司 延时指示的方法、配置方法及装置
CN114501339B (zh) * 2020-10-23 2022-11-08 大唐移动通信设备有限公司 多媒体广播业务的处理方法、装置及存储介质
GB2607083A (en) * 2021-05-27 2022-11-30 Canon Kk Flow control feedback in an integrated access and backhaul network
CN113473394B (zh) * 2021-07-21 2022-05-27 厦门骐俊物联科技股份有限公司 一种数字对讲机及其自适应中继方法

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 (fr) * 2010-01-11 2014-03-12 Nokia Solutions & Networks Oy Procédé et appareil
EP2553963B1 (fr) * 2010-04-02 2020-07-22 InterDigital Patent Holdings, Inc. Procédé et appareil de prise en charge de communications via un noeud relais
CN102045851B (zh) * 2011-01-25 2013-09-04 华中科技大学 一种中继网络中的上行资源分配方法和装置
WO2012122670A1 (fr) * 2011-03-14 2012-09-20 Telefonaktiebolaget L M Ericsson (Publ) Procédé et dispositif relatifs à une technique de relais
EP2686968B1 (fr) * 2011-03-14 2018-07-11 Telefonaktiebolaget LM Ericsson (publ) Noeud de relais, station de base radio donneuse et procédés dans ceux-ci
US11075687B2 (en) * 2017-03-23 2021-07-27 Apple Inc. Advanced radio resource management in next-gen multi-hop relaying cellular network
CN109842440B (zh) * 2017-11-27 2021-08-27 华为技术有限公司 一种通信方法、通信节点和系统
CN110035042B (zh) * 2018-01-12 2020-08-07 华为技术有限公司 一种数据传输方法及装置
CN110351747B (zh) * 2018-04-04 2024-03-01 北京三星通信技术研究有限公司 用于配置中继节点的方法和设备
CN110351024B (zh) * 2018-04-04 2021-06-15 华为技术有限公司 数据传输方法和装置
CN110831095B (zh) * 2018-08-11 2021-11-19 华为技术有限公司 通信方法和通信装置
EP4236161A3 (fr) * 2019-01-09 2023-10-25 Ofinno, LLC Configuration de ressources de noeuds d'accès intégré et de liaison terrestre
US11343737B2 (en) * 2019-02-06 2022-05-24 Ofinno, Llc Base station backhaul link information
CN111586749B (zh) * 2019-02-15 2023-02-07 华为技术有限公司 一种下行缓存状态反馈方法及装置
CN111866988A (zh) * 2019-04-30 2020-10-30 北京三星通信技术研究有限公司 信息配置方法、信息交互方法、以及地址信息更新方法

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 (8)

* 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 (fr) * 2020-05-27 2021-12-02 索尼集团公司 Dispositif électronique, procédé de communication sans fil et support de stockage lisible par ordinateur
WO2021247404A1 (fr) * 2020-06-03 2021-12-09 Qualcomm Incorporated Gestion d'une configuration de liaison terrestre dans un réseau sans fil à sauts multiples
US11672031B2 (en) 2020-06-03 2023-06-06 Qualcomm Incorporated Managing a backhaul configuration in a wireless multi-hop network
WO2022031068A1 (fr) * 2020-08-05 2022-02-10 Samsung Electronics Co., Ltd. Procédé et appareil de régulation de flux
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

Also Published As

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

Similar Documents

Publication Publication Date Title
WO2019184890A1 (fr) Procédé et appareil de transmission d'informations
EP3806542B1 (fr) Procédé et appareil de modification de chemin
WO2019214747A1 (fr) Procédé de configuration, procédé et appareil de transmission de données
WO2019192535A1 (fr) Procédé et dispositif de transmission de données
CN111586749B (zh) 一种下行缓存状态反馈方法及装置
US11496923B2 (en) Data transmission method and apparatus used in wireless backhaul network
CN112567796A (zh) 用于集成接入和回程承载管理的方法、装置和系统
WO2020038172A1 (fr) Appareil et procédé de commande de flux
WO2021027860A1 (fr) Procédé de routage, procédé de génération de bsr appareil et support de stockage
WO2020063504A1 (fr) Procédé et dispositif de transmission de données pour réseau de liaison terrestre sans fil
BR112015019401B1 (pt) Rede de acesso via rádio de evolução de longo prazo
WO2014114101A1 (fr) Procédé et appareil de transmission de données multiflux
WO2020088472A1 (fr) Procédé et appareil de communication
WO2018082597A1 (fr) Procédé et dispositif de contrôle d'encombrement, et station de base
WO2021062803A1 (fr) Procédé et dispositif de transmission de paquets de données
US20230388894A1 (en) Method and apparatus for packet rerouting
WO2015064054A1 (fr) Station de base sans fil, procédé d'équilibrage de charges de trafic et support d'informations ayant un programme stocké sur ce dernier
WO2020192654A1 (fr) Procédé et appareil de configuration de porteuse de contrôle de liaison radio (rlc)
WO2020164557A1 (fr) Procédé de communication et dispositif associé
TWI695607B (zh) 一種通過無線回程網路傳輸資料的方法和設備
WO2022202835A1 (fr) Procédé de commande de communication
WO2021026936A1 (fr) Procédé et appareil de traitement d'une défaillance d'une liaison terrestre
WO2022239707A1 (fr) Procédé de commande de communication
WO2022153989A1 (fr) Procédé de commande de communication
WO2022202976A1 (fr) Procédé de commande de communication

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