WO2022022734A1 - 拥塞处理方法、装置、设备和存储介质 - Google Patents

拥塞处理方法、装置、设备和存储介质 Download PDF

Info

Publication number
WO2022022734A1
WO2022022734A1 PCT/CN2021/109968 CN2021109968W WO2022022734A1 WO 2022022734 A1 WO2022022734 A1 WO 2022022734A1 CN 2021109968 W CN2021109968 W CN 2021109968W WO 2022022734 A1 WO2022022734 A1 WO 2022022734A1
Authority
WO
WIPO (PCT)
Prior art keywords
congestion
node
congestion information
downlink
information
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2021/109968
Other languages
English (en)
French (fr)
Inventor
王丽萍
陈琳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to US18/018,701 priority Critical patent/US20230308941A1/en
Priority to KR1020237005459A priority patent/KR20230043893A/ko
Priority to EP21848767.6A priority patent/EP4192092A4/en
Priority to CA3186816A priority patent/CA3186816A1/en
Publication of WO2022022734A1 publication Critical patent/WO2022022734A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0289—Congestion control
    • 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/0247—Traffic management, e.g. flow control or congestion control based on conditions of the access network or the infrastructure network
    • 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/0284—Traffic management, e.g. flow control or congestion control detecting congestion or overload during communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices
    • H04W88/085—Access point devices with remote components
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W92/00—Interfaces specially adapted for wireless communication networks
    • H04W92/04—Interfaces between hierarchically different network devices
    • H04W92/12—Interfaces between hierarchically different network devices between access points and access point controllers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W92/00—Interfaces specially adapted for wireless communication networks
    • H04W92/16—Interfaces between hierarchically similar devices
    • H04W92/22—Interfaces between hierarchically similar devices between access point controllers

Definitions

  • the present application relates to the field of communication technologies, for example, to a congestion processing method, apparatus, device, and storage medium.
  • Release 17 can support the inter donor migration between host nodes of Integrated Access and Backhaul (IAB) nodes and support multi-path transmission enhancement of IAB nodes.
  • IAB Integrated Access and Backhaul
  • the complex topology makes the optional paths for data transmission more abundant, but it is more prone to data congestion.
  • the present application provides a congestion processing method, apparatus, device and storage medium to solve the problem of data transmission after path congestion.
  • An embodiment of the present application provides a congestion processing method, and the method is applied to a first node, including:
  • Congestion information is received, wherein the congestion information is used for the first node to perform congestion processing; and congestion processing is performed based on the congestion information.
  • the embodiment of the present application further provides a congestion processing method, and the method is applied to the second node, including:
  • the congestion information includes downlink congestion information or uplink congestion information; send the congestion information to the first node through an F1 Application Protocol (F1 Application Protocol, F1AP) interface.
  • F1 Application Protocol F1 Application Protocol, F1AP
  • the embodiment of the present application further provides a congestion processing method, and the method is applied to a third node, including:
  • DRB Downlink congestion data radio bearer
  • the embodiment of the present application further provides a congestion processing device, the device is configured on the first node, and includes:
  • the receiving module is configured to receive congestion information, wherein the congestion information is used for the first node to perform congestion processing; the processing module is configured to perform congestion processing based on the congestion information.
  • the embodiment of the present application further provides a congestion processing device, the device is configured on the second node, and includes:
  • the first determining module is configured to determine congestion information, wherein the congestion information includes downlink congestion information or uplink congestion information; the first sending module is configured to send the congestion information to the No. 1 through F1AP interface. a node.
  • the embodiment of the present application further provides a congestion processing device, the device is configured on a third node, and includes:
  • the second determining module is configured to determine congestion information, wherein the congestion information includes downlink congestion data radio bearer DRB information; the second sending module is configured to send the congestion information to the first node through the E1AP interface.
  • the embodiment of the present application also provides a device, including:
  • one or more processors comprising: a memory configured to store one or more programs; when the one or more programs are executed by the one or more processors, cause the one or more processors to implement the Congestion processing methods provided by application embodiments.
  • An embodiment of the present application further provides a storage medium, where the storage medium stores a computer program, and when the computer program is executed by a processor, implements the congestion processing method provided by the embodiment of the present application.
  • FIG. 1 is a flowchart of a congestion processing method provided by an embodiment of the present application
  • FIG. 2 is a flowchart of a congestion processing method provided by an embodiment of the present application
  • FIG. 3 is a flowchart of a congestion processing method provided by an embodiment of the present application.
  • FIG. 4 is a schematic diagram of downlink end-to-end flow control performed by a control plane provided by an embodiment of the present application
  • FIG. 5 is a schematic diagram of downlink end-to-end flow control performed by a control plane provided by an embodiment of the present application
  • FIG. 6 is a schematic diagram of downlink end-to-end flow control performed by a control plane provided by an embodiment of the present application
  • FIG. 7 is a schematic diagram of uplink end-to-end flow control performed by a control plane provided by an embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of a congestion processing apparatus provided by an embodiment of the present application.
  • FIG. 9 is a schematic structural diagram of a congestion processing apparatus provided by an embodiment of the present application.
  • FIG. 10 is a schematic structural diagram of a congestion processing apparatus provided by an embodiment of the present application.
  • FIG. 11 is a schematic structural diagram of a device provided by an embodiment of the present application.
  • this embodiment provides a congestion processing method, and the congestion processing method is mainly applied to the first node.
  • the congestion processing method provided by this embodiment mainly includes steps S11 and S12 .
  • the first node is a Central Unit-Control Plane (Central Unit-Control Plane, CU-CP).
  • CU-CP Central Unit-Control Plane
  • the congestion information includes one or more of the following:
  • Downlink congestion information uplink congestion information, downlink congestion data radio bearer DRB information.
  • the downlink congestion information includes one or more of the following:
  • the radio link layer control protocol (Radio Link Control, RLC) channel identifier of the wireless backhaul of the congested link; the routing identifier of the congested link; the IAB sub-node identifier of the congested link; the downlink data transmission efficiency of the congested link.
  • RLC Radio Link Control
  • the downlink data transmission efficiency includes one or more of the following:
  • the ratio of the actual downlink buffer to the supported downlink buffer the ratio of the data rate of the egress wireless backhaul RLC channel to the data rate of the ingress wireless backhaul RLC channel.
  • the uplink congestion information includes one or more of the following:
  • BSR Buffer Status Report
  • the wireless backhaul RLC channel identifier includes an ingress wireless backhaul RLC channel identifier and/or an egress wireless backhaul RLC channel identifier.
  • the IAB sub-node identifier includes a Backhaul Adaptation Protocol (BAP) address and/or an Internet Protocol (Internet Protocol, IP) address.
  • BAP Backhaul Adaptation Protocol
  • IP Internet Protocol
  • the uplink data transmission efficiency includes: the ratio of the actual line buffer to the supportable uplink buffer.
  • the downlink congestion data radio bearer DRB information includes one or more of the following:
  • Congested DRB identifier the identifier of the user equipment (User Equipment, UE) to which the congested DRB belongs; the congested General Packet Radio Service (General Packet Radio Service, GPRS) tunnel protocol tunnel endpoint identifier; the required data volume of the congested DRB; congestion The required data rate of the DRB.
  • UE User Equipment
  • GPRS General Packet Radio Service
  • the manner of receiving the link congestion information includes one of the following:
  • the second node refers to an IAB node, and the second node may be a node whose links with child nodes are congested. It may also be a node that is congested in downlink transmission with a backhaul RLC (Backhaul RLC, BH RLC) channel between the child nodes.
  • backhaul RLC Backhaul RLC, BH RLC
  • the three nodes refer to the IAB nodes whose own DRBs are congested.
  • this embodiment provides a congestion processing method, and the congestion processing method is mainly applied to the second node.
  • the congestion processing method provided by this embodiment mainly includes steps S21 and S22.
  • the congestion information includes one or more of the following:
  • Downlink congestion information uplink congestion information, downlink congestion data radio bearer DRB information.
  • the downlink congestion information includes one or more of the following:
  • the downlink data transmission efficiency includes one or more of the following:
  • the ratio of the actual downlink buffer to the supported downlink buffer the ratio of the data rate of the egress wireless backhaul RLC channel to the data rate of the ingress wireless backhaul RLC channel.
  • the uplink congestion information includes one or more of the following:
  • the wireless backhaul RLC channel identifier includes an ingress wireless backhaul RLC channel identifier and/or an egress wireless backhaul RLC channel identifier.
  • the IAB sub-node identifier includes a Wireless Backhaul Adaptation Protocol BAP address and/or an IP address.
  • the uplink data transmission efficiency includes: the ratio of the actual line buffer to the supportable uplink buffer.
  • this embodiment provides a congestion processing method, and the congestion processing method is mainly applied to a third node.
  • the congestion processing method provided by this embodiment mainly includes steps S31 and S32 .
  • the downlink congestion data radio bearer DRB information includes one or more of the following:
  • the congested DRB identifier the identifier of the UE to which the congested DRB belongs; the congested GPRS tunneling protocol tunnel endpoint identifier; the required data volume of the congested DRB; the required data rate of the congested DRB.
  • the manner in which the first node performs congestion processing based on congestion information, and the information exchange between the second node and the first node, and the information exchange between the third node and the first node may refer to the descriptions in the following embodiments. It is not repeated in the embodiment.
  • a method for downlink end-to-end congestion processing on a control plane is provided.
  • Fig. 4 is used as an example for description.
  • a link is congested as an example for description.
  • the first step the downlink data arrives from the core network to the centralized unit-user plane (CU-User Plane, CU-UP), the CU-UP transmits the downlink data to the IAB3 through each IAB node, and the IAB3 transmits the downlink to its child nodes.
  • CU-User Plane CU-User Plane
  • the CU-UP transmits the downlink data to the IAB3 through each IAB node
  • the IAB3 transmits the downlink to its child nodes.
  • Step 2 IAB3 summarizes the detected downlink congestion information of its child nodes, and then reports it to the CU-CP through the F1AP message.
  • Downlink congestion information includes one or more of the following:
  • the link identifier of the congested link for example: a routing identifier (Identifier, ID); the identifier of the IAB sub-node of the congested link; the downlink data transmission efficiency of the congested link.
  • ID routing identifier
  • IAB sub-node the identifier of the IAB sub-node of the congested link
  • Downlink data transmission efficiency includes one or more of the following:
  • the ratio of the actual downlink buffer to the supported downlink buffer the ratio of the data rate of the egress wireless backhaul RLC channel to the data rate of the ingress wireless backhaul RLC channel.
  • the IAB sub-node identifier includes a wireless backhaul adaptation protocol BAP address and/or an IP address.
  • Step 3 The CU-CP receives the downlink congestion information sent by IAB3, and identifies, from the congestion information, that IAB3 has a downlink congested link, that is, the link between IAB3 and IAB4 is congested. At the same time, the CU-CP also learns that the downlink transmission between IAB3 and its child node IAB5 and between IAB3 and its child node IAB6 is smooth.
  • Step 4 Combined with the overall network topology, CU-CP chooses to remap the downlink data transmitted by the original path (IAB3->IAB4) link at IAB3 to the new path (IAB3->IAB5) link for transmission.
  • the CU-CP sends a new [BAP MAPPING CONFIGURATION]F1 message to the IAB-Donor Distribution Unit (DU) to reconfigure the route ID of the downlink data to be transmitted to the original path (IAB3->IAB4) link, that is, to modify The correspondence between the IP header and the BAP routing ID makes these data finally transmitted through the new path (IAB3->IAB5) link.
  • DU IAB-Donor Distribution Unit
  • the CU-CP sends a new [BAP MAPPING CONFIGURATION] F1 message to IAB3, and reconfigures the mapping table at IAB3, so that the entry of the downlink data transmitted by the original path (IAB3->IAB4) link at IAB3
  • the egress BH RLC channel corresponding to the BH RLC channel is the BH RLC channel on the link of the new path (IAB3->IAB5).
  • Step 5 The IAB-Donor DU receives the new routing configuration information and updates it and replies with confirmation information to the CU-CP. Subsequently, the IP data packets are transmitted to the new routing path.
  • Step 6 IAB3 receives the new data mapping table (traffic mapping) configuration information and updates it and replies with confirmation information to the CU-CP. Subsequently, the newly received downlink data transmitted by the original path (IAB3->IAB4) link is transmitted to the newly configured egress BH RLC channel on the new path (IAB3->IAB5) link.
  • IAB3->IAB4 the new data mapping table (traffic mapping) configuration information
  • a method for downlink end-to-end congestion processing on a control plane is provided.
  • Fig. 5 is taken as an example for description.
  • a BH RLC channel is congested as an example for description.
  • Step 1 Downlink data arrives at CU-UP from the core network, CU-UP transmits the downlink data to IAB3 via each IAB node, and IAB3 transmits downlink data to UE3 via IAB4.
  • the IAB detects the transmission of downlink data to IAB4 via the BH RLC channel. It is detected that the downlink transmission of a BH RLC channel 2 between IAB3 and its child node IAB4 is congested.
  • Step 2 The IAB3 summarizes the detected downlink congestion information of the BH RLC channel 2, and reports it to the CU-CP through the F1AP message.
  • Downlink congestion information includes one or more of the following:
  • the wireless backhaul radio link layer control protocol RLC channel identifier of the congested link ; the route identifier of the congested link, such as: route ID; the IAB sub-node identifier of the congested link; the downlink data transmission efficiency of the congested link.
  • Downlink data transmission efficiency includes one or more of the following:
  • the ratio of the actual downlink buffer to the supported downlink buffer the ratio of the data rate of the egress wireless backhaul RLC channel to the data rate of the ingress wireless backhaul RLC channel.
  • the wireless backhaul RLC channel identifier includes an ingress wireless backhaul RLC channel identifier and/or an egress wireless backhaul RLC channel identifier.
  • the IAB sub-node identifier includes a wireless backhaul adaptation protocol BAP address and/or an IP address.
  • Step 3 The CU-CP receives the downlink congestion information sent by the IAB3, and identifies from the congestion information that the IAB3 has downlink-congested egress BH RLC channel 2.
  • Step 4 Combined with the overall network topology, the CU-CP chooses to remap the downlink data transmitted from IAB3 to the original path exit BH RLC channel 2 to the exit BH RLC channel 1 or exit BH RLC channel 3 for transmission.
  • the CU-CP sends a new [BAP MAPPING CONFIGURATION]F1 message to IAB3, and reconfigures the mapping table at IAB3, so that the entry BH of the downlink data transmitted to the original path exit BH RLC channel 2 at IAB3 corresponds to the exit BH of the RLC channel
  • the RLC channel is egress BH RLC channel 1 or egress BH RLC channel 3.
  • Step 5 IAB3 receives the new data mapping table (traffic mapping) configuration information and updates it and replies with confirmation information to the CU-CP. Subsequently, the newly received downlink data transmitted to the original path exit BH RLC channel 2 is transmitted to the new path exit BH RLC channel 1 or exit BH RLC channel 3.
  • new data mapping table traffic mapping
  • a method for downlink end-to-end congestion processing on a control plane is provided.
  • Fig. 6 is used as an example for description.
  • the first step the downlink data arrives from the core network to the CU-UP, the CU-UP transmits the downlink data to the IAB3 through each IAB node, and the IAB3 sends the downlink data to the UE.
  • Step 2 The IAB3 feeds back the Downlink Data Delivery Status (DDDS) information to the CU-UP.
  • DDDS information includes the required data amount of the UE's DRB, the required data rate, and the data packets successfully transmitted by the air interface. serial number (Serial Number, SN) information, etc.
  • Step 3 The CU-UP receives the DDDS information sent by the IAB3, determines which DRBs of the UE2 accessing the IAB3 are congested, and summarizes the information into the downlink transmission congestion indication information.
  • the downlink congestion data radio bearer DRB information includes one or more of the following:
  • the congested DRB identifier ; the identifier of the UE to which the congested DRB belongs; the congested GPRS tunnel protocol tunnel endpoint identifier; the required data volume of the congested DRB; the required data rate of the congested DRB.
  • Step 4 The CU-UP sends the downlink transmission congestion indication information to the CU-CP through the E1AP message.
  • Step 5 The CU-CP receives the downlink transmission congestion indication information sent by the CU-UP, and returns an acknowledgement response to the CU-UP. Combined with the overall network topology, the CU-CP re-plans a new downlink transmission path in the IAB network for the congested DRB. It can be considered to modify the mapping relationship between the quality of service flow (QoS flow) at the CP-UP and the DRB, that is, the data on the original downlink congested DRB is transmitted through other DRBs.
  • the routing ID of the IP packet at the Donor DU can also be modified, that is, the original downlink congested data packet is transmitted through other routing paths.
  • the CU-CP After the CU-CP re-plans the path, it sends the updated QoS flow to DRB mapping table to the CU-UP through E1AP, or sends the updated routing table to the IAB Donor DU node through F1AP.
  • Step 6 The CU-UP receives the new QoS flow to DRB mapping table and updates it and replies with confirmation information to the CU-CP. Subsequently, the CU-UP transmits the QoS flow data packets to the new DRB. Or the IAB-Donor DU receives the new routing configuration information and updates it and replies with confirmation information to the CU-CP. Subsequently, the IAB-Donor DU transmits the IP packet to the new routing path.
  • a method for handling congestion in an uplink end-to-end on a control plane is provided.
  • Fig. 7 is used as an example for description.
  • the uplink data reaches the access node IAB1 from UE1, then is transmitted to IAB4->Donor DU through IAB2/IAB3, and finally reaches CU-UP and continues to be transmitted to the core network.
  • the IAB4 applies BSR judgment for the amount of uplink data transmitted to its child nodes, and allocates uplink resources to each IAB child node in combination with the currently available uplink resources.
  • the amount of uplink data at IAB2 is large and IAB4 does not have enough uplink resources to allocate, link congestion between uplink IAB2 ⁇ ->IAB4 occurs.
  • Step 2 IAB4 detects that the link between uplink IAB2 ⁇ ->IAB4 is congested.
  • the IAB4 summarizes the uplink congestion information and reports it to the CU-CP through the F1AP message.
  • the uplink congestion information includes one or more of the following:
  • the radio backhaul RLC channel identifier of the congested link identifier of the congested link; the link identifier of the congested link, such as: route ID; the identifier of the IAB child node of the congested link; the buffer status report BSR reported by the child node of the congested link; Upstream data transmission efficiency.
  • the wireless backhaul RLC channel identifier includes an ingress wireless backhaul RLC channel identifier and/or an egress wireless backhaul RLC channel identifier.
  • the IAB sub-node identifier includes a wireless backhaul adaptation protocol BAP address and/or an IP address.
  • the uplink data transmission efficiency includes: the ratio of the actual row buffer to the supported uplink buffer.
  • Step 3 The CU-CP receives the uplink congestion information sent by the IAB4, and identifies from the congestion information that the IAB4 has an uplink congested link, that is, the link between the IAB2 and the IAB4 is congested. At the same time, the CU-CP also learns that the uplink transmission between IAB4 and its child node IAB3 is smooth.
  • Step 4 Combined with the overall network topology, CU-CP chooses to remap the uplink data transmitted from IAB1 to the original path (IAB1->IAB2) link to the new path (IAB1->IAB3) link for transmission .
  • the CU-CP sends a new F1 message to IAB1, modifies the routing ID of the data packet transmitted from UE1 to IAB1, and configures a new Mapping table for IAB1, so that the link to the original path (IAB1->IAB2) is transmitted at IAB1.
  • the egress BH RLC channel corresponding to the uplink data is the BH RLC channel on the new path (IAB1->IAB3) link.
  • Step 5 The IAB1 receives the new routing configuration information and the mapping (mapping) configuration table and updates it and replies with confirmation information to the CU-CP. Then, the uplink data packets of UE1 are transmitted to the new routing path.
  • this embodiment provides a congestion processing apparatus, and the congestion processing apparatus is mainly applied to the first node.
  • the congestion processing apparatus provided in this embodiment mainly includes a receiving module 81 and a processing module 82.
  • the receiving module 81 is configured to receive congestion information, wherein the congestion information is used for the first node to perform congestion processing; the processing module 82 is configured to perform congestion processing based on the congestion information.
  • the congestion information includes one or more of the following:
  • Downlink congestion information uplink congestion information, downlink congestion data radio bearer DRB information.
  • the downlink congestion information includes one or more of the following:
  • the downlink data transmission efficiency includes one or more of the following:
  • the ratio of the actual downlink buffer to the supported downlink buffer the ratio of the data rate of the egress wireless backhaul RLC channel to the data rate of the ingress wireless backhaul RLC channel.
  • the uplink congestion information includes one or more of the following:
  • the wireless backhaul RLC channel identifier includes an ingress wireless backhaul RLC channel identifier and/or an egress wireless backhaul RLC channel identifier.
  • the IAB sub-node identifier includes a Wireless Backhaul Adaptation Protocol BAP address and/or an IP address.
  • the uplink data transmission efficiency includes: the ratio of the actual line buffer to the supportable uplink buffer.
  • the downlink congestion data radio bearer DRB information includes one or more of the following:
  • the congested DRB identifier ; the identifier of the UE to which the congested DRB belongs; the congested GPRS tunnel protocol tunnel endpoint identifier; the required data volume of the congested DRB; the required data rate of the congested DRB.
  • the manner of receiving the link congestion information includes one of the following:
  • the congestion processing apparatus provided in this embodiment can execute the congestion processing method provided by any embodiment of the present application, and has corresponding functional modules and effects for performing the method. For technical details not described in detail in this embodiment, reference may be made to the congestion processing method provided by any embodiment of this application.
  • the included units and modules are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be realized; in addition, the names of the functional units are also It is only for the convenience of distinguishing from each other, and is not intended to limit the protection scope of the present application.
  • this embodiment provides a congestion processing apparatus, and the congestion processing apparatus is mainly applied to the second node.
  • the congestion processing apparatus provided in this embodiment mainly includes a first determination module 91, The first sending module 92 .
  • the first determining module 91 is configured to determine congestion information, wherein the congestion information includes downlink congestion information or uplink congestion information; the first sending module 92 is configured to send the congestion information through the F1AP interface to the first node.
  • the congestion information includes one or more of the following:
  • Downlink congestion information uplink congestion information, downlink congestion data radio bearer DRB information.
  • the downlink congestion information includes one or more of the following:
  • the downlink data transmission efficiency includes one or more of the following:
  • the ratio of the actual downlink buffer to the supported downlink buffer the ratio of the data rate of the egress wireless backhaul RLC channel to the data rate of the ingress wireless backhaul RLC channel.
  • the uplink congestion information includes one or more of the following:
  • the wireless backhaul RLC channel identifier includes an ingress wireless backhaul RLC channel identifier and/or an egress wireless backhaul RLC channel identifier.
  • the IAB sub-node identifier includes a Wireless Backhaul Adaptation Protocol BAP address and/or an IP address.
  • the uplink data transmission efficiency includes: the ratio of the actual line buffer to the supportable uplink buffer.
  • the congestion processing apparatus provided in this embodiment can execute the congestion processing method provided by any embodiment of the present application, and has corresponding functional modules and effects for performing the method. For technical details not described in detail in this embodiment, reference may be made to the congestion processing method provided by any embodiment of this application.
  • the included units and modules are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be realized; in addition, the names of the functional units are also It is only for the convenience of distinguishing from each other, and is not intended to limit the protection scope of the present application.
  • this embodiment provides a congestion processing apparatus, and the congestion processing apparatus is mainly applied to a third node.
  • the congestion processing apparatus provided by this embodiment mainly includes a second determining module 101 and a The second sending module 102 .
  • the second determining module 101 is configured to determine congestion information, wherein the congestion information includes downlink congestion data radio bearer DRB information; the second sending module 102 is configured to send the congestion information to the first node through the E1AP interface .
  • the downlink congestion data radio bearer DRB information includes one or more of the following:
  • the congested DRB identifier ; the UE identifier to which the congested DRB belongs; the congested GPRS tunneling protocol tunnel endpoint identifier; the required data volume of the congested DRB; the required data rate of the congested DRB.
  • the congestion processing apparatus provided in this embodiment can execute the congestion processing method provided by any embodiment of the present application, and has corresponding functional modules and effects for performing the method. For technical details not described in detail in this embodiment, reference may be made to the congestion processing method provided by any embodiment of this application.
  • the included units and modules are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be realized; in addition, the names of the functional units are also It is only for the convenience of distinguishing from each other, and is not intended to limit the protection scope of the present application.
  • FIG. 11 is a schematic structural diagram of a device provided by an embodiment of the present application.
  • the device includes a processor 111 , a memory 112 , an input device 113 , an output device 114 and Communication device 115; the number of processors 111 in the device may be one or more, and one processor 111 is taken as an example in FIG. 11; the processor 111, memory 112, input device 113 and output device 114 in the device can be For connection in other ways, in FIG. 11, the connection by bus is taken as an example.
  • the memory 112 can be used to store software programs, computer-executable programs, and modules.
  • the processor 111 executes various functional applications and data processing of the device by running the software programs, instructions, and modules stored in the memory 112 , that is, implements any method provided by the embodiments of the present application.
  • the memory 112 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the device, and the like. Additionally, memory 112 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, memory 112 may include memory located remotely from processor 111, which may be connected to the device through a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
  • the input device 113 may be used to receive input numerical or character information, and to generate key signal input related to user settings and function control of the device.
  • the output device 114 may include a display device such as a display screen.
  • the communication device 115 may include a receiver and a transmitter.
  • the communication device 115 is configured to transmit and receive information according to the control of the processor 111 .
  • the processor 111 executes various functional applications and data processing by running the program stored in the system memory 112, for example, to implement the congestion processing method provided in the embodiment of the present application, the method include:
  • Congestion information is received, wherein the congestion information is used for the first node to perform congestion processing; and congestion processing is performed based on the congestion information.
  • the processor 111 may also implement the technical solution of the congestion processing method provided by any embodiment of the present application.
  • the hardware structure and function of the device reference may be made to the content explanation of this embodiment.
  • the processor 111 executes various functional applications and data processing by running the program stored in the system memory 112, for example, to implement the congestion processing method provided by the embodiment of the present application, the method include:
  • congestion information includes downlink congestion information or uplink congestion information; and send the congestion information to the first node through the F1AP interface.
  • the processor 111 may also implement the technical solution of the congestion processing method provided by any embodiment of the present application.
  • the hardware structure and function of the device reference may be made to the content explanation of this embodiment.
  • the processor 111 executes various functional applications and data processing by running the program stored in the system memory 112, for example, to implement the congestion processing method provided by the embodiment of the present application, the method include:
  • congestion information includes downlink congestion data radio bearer DRB information; and send the congestion information to the first node through an E1AP interface.
  • the processor 111 may also implement the technical solution of the congestion processing method provided by any embodiment of the present application.
  • the hardware structure and function of the device reference may be made to the content explanation of this embodiment.
  • the embodiments of the present application further provide a storage medium containing computer-executable instructions, where the computer-executable instructions are used to execute a congestion processing method when executed by a computer processor, and the The method is applied to the first node, including:
  • Congestion information is received, wherein the congestion information is used for the first node to perform congestion processing; and congestion processing is performed based on the congestion information.
  • a storage medium containing computer-executable instructions provided by an embodiment of the present application the computer-executable instructions of which are not limited to the above method operations, and can also perform related operations in the congestion processing method provided by any embodiment of the present application .
  • the embodiments of the present application further provide a storage medium containing computer-executable instructions, where the computer-executable instructions are used to execute a congestion processing method when executed by a computer processor, and the The method is applied to the second node, including:
  • congestion information includes downlink congestion information or uplink congestion information; and send the congestion information to the first node through the F1AP interface.
  • a storage medium containing computer-executable instructions provided by an embodiment of the present application the computer-executable instructions of which are not limited to the above method operations, and can also perform related operations in the congestion processing method provided by any embodiment of the present application .
  • the embodiments of the present application further provide a storage medium containing computer-executable instructions, where the computer-executable instructions are used to execute a congestion processing method when executed by a computer processor, and the The method is applied to the third node, including:
  • congestion information includes downlink congestion data radio bearer DRB information; and send the congestion information to the first node through an E1AP interface.
  • a storage medium containing computer-executable instructions provided by an embodiment of the present application the computer-executable instructions of which are not limited to the above method operations, and can also perform related operations in the congestion processing method provided by any embodiment of the present application .
  • the present application can be implemented by software and necessary general-purpose hardware, and can also be implemented by hardware.
  • the technical solution of the present application can be embodied in the form of a software product in essence, and the computer software product can be stored in a computer-readable storage medium, such as a floppy disk of a computer, a read-only memory (Read-Only Memory, ROM), a random access A memory (Random Access Memory, RAM), a flash memory (FLASH), a hard disk or an optical disk, etc., includes a plurality of instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) method described.
  • a computer device which may be a personal computer, a server, or a network device, etc.
  • the term user terminal covers any suitable type of wireless user equipment, such as a mobile telephone, portable data processing device, portable web browser or vehicle mounted mobile station.
  • the various embodiments of the present application may be implemented in hardware or special purpose circuits, software, logic, or any combination thereof.
  • some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that may be executed by a controller, microprocessor or other computing device, although the application is not limited thereto.
  • Embodiments of the present application may be implemented by the execution of computer program instructions by a data processor of a mobile device, eg in a processor entity, or by hardware, or by a combination of software and hardware.
  • Computer program instructions may be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or written in any combination of one or more programming languages source or object code.
  • ISA Instruction Set Architecture
  • the block diagrams of any logic flow in the figures of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions.
  • Computer programs can be stored on memory.
  • the memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology such as, but not limited to, read only memory (ROM), random access memory (RAM), optical memory devices and systems (Digital Versatile Discs). (Digital Video Disc, DVD) or optical disc (Compact Disk, CD (Compact Disk,) etc.
  • Computer readable media may include non-transitory storage media.
  • Data processors may be of any type suitable for the local technical environment, such as but not Limited to general-purpose computers, special-purpose computers, microprocessors, digital signal processors (Digital Signal Processing, DSP), application-specific integrated circuits (Application Specific Integrated Circuit, ASIC), programmable logic devices (Field-Programmable Gate Array, FPGA) and based on A processor with a multi-core processor architecture.
  • DSP Digital Signal Processing
  • ASIC Application Specific Integrated Circuit
  • FPGA Field-Programmable Gate Array

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本文公开一种拥塞处理方法、装置、设备和存储介质。拥塞处理方法应用于第一节点，包括：接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理；基于所述拥塞信息进行拥塞处理。

Description

拥塞处理方法、装置、设备和存储介质 技术领域
本申请涉及通信技术领域，例如涉及一种拥塞处理方法、装置、设备和存储介质。
背景技术
版本17(Release17)中可以支持集成接入和回程(Integrated Access and Backhaul，IAB)节点的宿主节点间的移动(inter donor migration)以及支持IAB节点的多路径传输增强。复杂的拓扑结构使得数据传输可选择的路径更加丰富，但更容易发生数据拥塞。
发明内容
本申请提供一种拥塞处理方法、装置、设备和存储介质，以解决路径拥塞后数据的传输问题。
本申请实施例提供一种拥塞处理方法，所述方法应用于第一节点，包括：
接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理；基于所述拥塞信息进行拥塞处理。
本申请实施例还提供一种拥塞处理方法，所述方法应用于第二节点，包括：
确定拥塞信息，其中，所述拥塞信息包括下行链路拥塞信息或上行链路拥塞信息；通过F1应用协议(F1 Application Protocol，F1AP)接口将所述拥塞信息发送至第一节点。
本申请实施例还提供一种拥塞处理方法，所述方法应用于第三节点，包括：
确定拥塞信息，其中，所述拥塞信息包括下行拥塞数据无线承载(Data Radio Bearer，DRB)信息；通过E1AP接口将所述拥塞信息发送至第一节点。
本申请实施例还提供一种拥塞处理装置，所述装置配置于第一节点，包括：
接收模块，被配置为接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理；处理模块，被配置为基于所述拥塞信息进行拥塞处理。
本申请实施例还提供一种拥塞处理装置，所述装置配置于第二节点，包括：
第一确定模块，被配置为确定拥塞信息，其中，所述拥塞信息包括下行链路拥塞信息或上行链路拥塞信息；第一发送模块，被配置为通过F1AP接口将所 述拥塞信息发送至第一节点。
本申请实施例还提供一种拥塞处理装置，所述装置配置于第三节点，包括：
第二确定模块，被配置为确定拥塞信息，其中，所述拥塞信息包括下行拥塞数据无线承载DRB信息；第二发送模块，被配置为通过E1AP接口将所述拥塞信息发送至第一节点。
本申请实施例还提供一种设备，包括：
一个或多个处理器；存储器，被配置为存储一个或多个程序；当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如本申请实施例提供的拥塞处理方法。
本申请实施例还提供一种存储介质，所述存储介质存储有计算机程序，所述计算机程序被处理器执行时实现如本申请实施例提供的拥塞处理方法。
附图说明
图1是本申请实施例提供的一种拥塞处理方法的流程图；
图2是本申请实施例提供的一种拥塞处理方法的流程图；
图3是本申请实施例提供的一种拥塞处理方法的流程图；
图4是本申请实施例提供的控制面进行下行端到端的流控的示意图；
图5是本申请实施例提供的控制面进行下行端到端的流控的示意图；
图6是本申请实施例提供的控制面进行下行端到端的流控的示意图；
图7是本申请实施例提供的控制面进行上行端到端的流控的示意图；
图8是本申请实施例提供的一种拥塞处理装置的结构示意图；
图9是本申请实施例提供的一种拥塞处理装置的结构示意图；
图10是本申请实施例提供的一种拥塞处理装置的结构示意图；
图11是本申请实施例提供的一种设备的结构示意图。
具体实施方式
下文中将结合附图对本申请的实施例进行说明
在附图的流程图示出的步骤可以在诸如一组计算机可执行指令的计算机系统中执行。并且，虽然在流程图中示出了逻辑顺序，但是在一些情况下，可以以不同于此处的顺序执行所示出或描述的步骤。
在一个实施例中，本实施例提供一种拥塞处理方法，所述拥塞处理方法主要应用于第一节点，如图1所示，本实施例提供的拥塞处理方法主要包括步骤S11、S12。
S11、接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理。
S12、基于所述拥塞信息进行拥塞处理。
在本实施例中，所述第一节点是集中单元-控制面(Central Unit-Control Plane，CU-CP)。
在一个示例性的实施方式中，所述拥塞信息包括如下一个或多个：
下行链路拥塞信息，上行链路拥塞信息，下行拥塞数据无线承载DRB信息。
在一个示例性的实施方式中，所述下行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传无线链路层控制协议(Radio Link Control，RLC)信道标识；拥塞链路的路由标识；拥塞链路的IAB子节点标识；拥塞链路的下行数据传输效率。
在一个示例性的实施方式中，下行数据传输效率包括如下一个或多个：
实际下行缓存与可支持下行缓存的比值；出口无线回传RLC信道数据速率与入口无线回传RLC信道数据速率的比值。
在一个示例性的实施方式中，所述上行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传RLC信道标识；拥塞链路的链路标识；拥塞链路的IAB子节点标识；拥塞链路的子节点上报的缓冲状态报告(Buffer Status Report，BSR)；拥塞链路的上行数据传输效率。
在一个示例性的实施方式中，所述无线回传RLC信道标识包括入口无线回传RLC信道标识和/或出口无线回传RLC信道标识。
在一个示例性的实施方式中，所述IAB子节点标识包括无线回传适配协议(Backhaul Adaptation Protocol，BAP)地址和/或互联网协议(Internet Protocol，IP)地址。
在一个示例性的实施方式中，所述上行数据传输效率包括：实际上行缓存与可支持上行缓存的比值。
在一个示例性的实施方式中，所述下行拥塞数据无线承载DRB信息包括如下一个或多个：
拥塞的DRB标识；拥塞DRB所属于用户设备(User Equipment，UE)的标识；拥塞的通用分组无线业务(General Packet Radio Service，GPRS)隧道协 议隧道端点标识；拥塞DRB的所需的数据量；拥塞DRB的所需数据的速率。
在一个示例性的实施方式中，接收链路拥塞信息的方式包括如下之一：
接收第二节点通过F1AP接口发送的下行链路拥塞信息或上行链路拥塞信息；接收第三节点通过E1AP接口发送的下行拥塞数据无线承载DRB信息。
所述第二节点是指IAB节点，第二节点可以是与子节点之间的链路发生拥塞的节点。也可以是与子节点之间的一条回程RLC(Backhaul RLC，BH RLC)信道的下行传输发生拥塞的节点。
所述三节点是指本身的DRB拥塞的IAB节点。
在一个实施例中，本实施例提供一种拥塞处理方法，所述拥塞处理方法主要应用于第二节点，如图2所示，本实施例提供的拥塞处理方法主要包括步骤S21、S22。
S21、确定拥塞信息，其中，所述拥塞信息包括下行链路拥塞信息或上行链路拥塞信息。
S22、通过F1AP接口将所述拥塞信息发送至第一节点。
在一个示例性的实施方式中，所述拥塞信息包括如下一个或多个：
下行链路拥塞信息，上行链路拥塞信息，下行拥塞数据无线承载DRB信息。
在一个示例性的实施方式中，所述下行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传无线链路层控制协议RLC信道标识；拥塞链路的路由标识；拥塞链路的IAB子节点标识；拥塞链路的下行数据传输效率。
在一个示例性的实施方式中，下行数据传输效率包括如下一个或多个：
实际下行缓存与可支持下行缓存的比值；出口无线回传RLC信道数据速率与入口无线回传RLC信道数据速率的比值。
在一个示例性的实施方式中，所述上行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传RLC信道标识；拥塞链路的链路标识；拥塞链路的IAB子节点标识；拥塞链路的子节点上报的缓冲状态报告BSR；拥塞链路的上行数据传输效率。
在一个示例性的实施方式中，所述无线回传RLC信道标识包括入口无线回传RLC信道标识和/或出口无线回传RLC信道标识。
在一个示例性的实施方式中，所述IAB子节点标识包括无线回传适配协议 BAP地址和/或IP地址。
在一个示例性的实施方式中，所述上行数据传输效率包括：实际上行缓存与可支持上行缓存的比值。
在一个实施例中，本实施例提供一种拥塞处理方法，所述拥塞处理方法主要应用于第三节点，如图3所示，本实施例提供的拥塞处理方法主要包括步骤S31、S32。
S31、确定拥塞信息，其中，所述拥塞信息包括下行拥塞数据无线承载DRB信息。
S32、通过E1AP接口将所述拥塞信息发送至第一节点。
在一个示例性的实施方式中，所述下行拥塞数据无线承载DRB信息包括如下一个或多个：
拥塞的DRB标识；拥塞DRB所属于UE的标识；拥塞的GPRS隧道协议隧道端点标识；拥塞DRB的所需的数据量；拥塞DRB的所需数据的速率。
第一节点基于拥塞信息进行拥塞处理的方式，以及第二节点与第一节点之间的信息交互，以及第三节点与第一节点之间的信息交互可以参照下述实施例中的描述，本实施例中不再赘述。
在一个实施例中，提供一种控制面进行下行端到端的拥塞处理方法。以图4为例进行说明。本实施例中以一条链路发生拥塞为例进行说明。
第一步：下行数据从核心网到达集中单元-用户面(CU-User Plane，CU-UP)，CU-UP将下行数据经各个IAB节点传输到IAB3，IAB3对向其子节点传输的下行链路数据的传输情况进行检测。检测到IAB3与其子节点IAB4之间的下行链路发生拥塞；IAB3与其子节点IAB5之间的下行链路传输通畅；IAB3与其子节点IAB6之间的下行链路传输通畅。
第二步：IAB3将检测到的与其子节点的下行链路拥塞信息进行汇总，然后通过F1AP消息向CU-CP上报。
下行链路拥塞信息包括如下一个或多个：
拥塞链路的链路标识，例如：路由标识(Identifier，ID)；拥塞链路的IAB子节点标识；拥塞链路的下行数据传输效率。
下行数据传输效率包括如下一个或多个：
实际下行缓存与可支持下行缓存的比值；出口无线回传RLC信道数据速率与入口无线回传RLC信道数据速率的比值。
所述IAB子节点标识包括无线回传适配协议BAP地址和/或IP地址。
第三步：CU-CP接收IAB3发送的下行链路拥塞信息，从拥塞信息中识别出IAB3有下行拥塞的链路，即IAB3与IAB4之间的链路发生拥塞。同时CU-CP也了解到IAB3与其子节点IAB5之间、IAB3与其子节点IAB6之间的下行链路传输通畅。
第四步：CU-CP结合整体的网络拓扑结构，选择将IAB3处原始路径(IAB3->IAB4)链路传输的下行数据，重新映射到新路径(IAB3->IAB5)链路进行传输。
CU-CP向IAB-Donor分布单元(Distributed Unit，DU)发送新的[BAP MAPPING CONFIGURATION]F1消息，重新配置要往原始路径(IAB3->IAB4)链路传输的下行数据的路由ID，即修改IP头和BAP路由ID的对应关系使这些数据最终通过新路径(IAB3->IAB5)链路进行传输。
此外，CU-CP向IAB3发送新的[BAP MAPPING CONFIGURATION]F1消息，重新配置IAB3处的地图(mapping)映射表，使得在IAB3处原始路径(IAB3->IAB4)链路传输的下行数据的入口BH RLC信道对应的出口BH RLC信道为新路径(IAB3->IAB5)链路上的BH RLC信道。
第五步：IAB-Donor DU接收新的路由配置信息并进行更新同时向CU-CP回复确认信息。随后，将IP数据包往新的路由路径传输。
第六步：IAB3接收新的数据映射表(traffic mapping)配置信息并进行更新同时向CU-CP回复确认信息。随后，将新接收到的原始路径(IAB3->IAB4)链路传输的下行数据，往新路径(IAB3->IAB5)链路上新配置的出口BH RLC信道上传输。
在一个实施例中，提供一种控制面进行下行端到端的拥塞处理方法。以图5为例进行说明。本实施例中以一条BH RLC信道拥塞为例进行说明。
第一步：下行数据从核心网到达CU-UP，CU-UP将下行数据经各个IAB节点传输到IAB3，IAB3再将下行数据经IAB4传输到UE3。IAB对通过BH RLC信道向IAB4传输的下行链路数据的传输情况进行检测。检测到IAB3与其子节点IAB4之间有一条BH RLC信道2的下行传输发生拥塞。
第二步：IAB3将检测到的BH RLC信道2的下行链路拥塞信息进行汇总， 然后通过F1AP消息向CU-CP上报。
下行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传无线链路层控制协议RLC信道标识；拥塞链路的路由标识，例如：路由ID；拥塞链路的IAB子节点标识；拥塞链路的下行数据传输效率。
下行数据传输效率包括如下一个或多个：
实际下行缓存与可支持下行缓存的比值；出口无线回传RLC信道数据速率与入口无线回传RLC信道数据速率的比值。
所述无线回传RLC信道标识包括入口无线回传RLC信道标识和/或出口无线回传RLC信道标识。
所述IAB子节点标识包括无线回传适配协议BAP地址和/或IP地址。
第三步：CU-CP接收IAB3发送的下行链路拥塞信息，从拥塞信息中识别出IAB3有下行拥塞的出口BH RLC信道2。
第四步：CU-CP结合整体的网络拓扑结构，选择将IAB3处往原始路径出口BH RLC信道2传输的下行数据，重新映射到出口BH RLC信道1或出口BH RLC信道3进行传输。CU-CP向IAB3发送新的[BAP MAPPING CONFIGURATION]F1消息，重新配置IAB3处的mapping映射表，使得在IAB3处往原始路径出口BH RLC信道2传输的下行数据的入口BH RLC信道对应的出口BH RLC信道为出口BH RLC信道1或出口BH RLC信道3。
第五步：IAB3接收新的数据映射表(traffic mapping)配置信息并进行更新同时向CU-CP回复确认信息。随后，将新接收到的往原始路径出口BH RLC信道2传输的下行数据，往新路径出口BH RLC信道1或出口BH RLC信道3上传输。
在一个实施例中，提供一种控制面进行下行端到端的拥塞处理方法。以图6为例进行说明。
第一步：下行数据从核心网到达CU-UP，CU-UP将下行数据经各个IAB节点传输到IAB3，IAB3将下行数据发送给UE。
第二步：IAB3向CU-UP反馈下行数据传送状态(Downlink Data Delivery Status，DDDS)信息，DDDS信息中包含UE的DRB的所需的数据量，所需数据的速率，空口成功传输的数据包的序列号(Serial Number，SN)信息等。
第三步：CU-UP接收IAB3发送的DDDS信息，判断接入IAB3的UE2的 DRB中有哪些发生了拥塞，并汇总为下行传输拥塞指示信息。
所述下行拥塞数据无线承载DRB信息包括如下一个或多个：
拥塞的DRB标识；拥塞的DRB所属UE的标识；拥塞的GPRS隧道协议隧道端点标识；拥塞DRB的所需的数据量；拥塞DRB的所需数据的速率。
第四步：CU-UP通过E1AP消息将下行传输拥塞指示信息发送给CU-CP。
第五步：CU-CP接收CU-UP发送的下行传输拥塞指示信息，并向CU-UP回复确认响应。CU-CP结合整体的网络拓扑结构，对拥塞的DRB在IAB网络中重新规划新的下行传输路径。可以考虑修改CP-UP处的服务质量流(Quality of Service flow，Qos flow)到DRB的映射关系，即将原始下行拥塞的DRB上的数据通过其它的DRB来传输。也可以修改Donor DU处的IP包的路由ID，即将原始下行拥塞的数据包通过其它的路由路径传输。CU-CP重新进行路径规划后，将更新后的Qos flow到DRB的映射关系表通过E1AP发送给CU-UP，或将更新后的路由表通过F1AP发送给IAB Donor DU节点。
第六步：CU-UP接收新的Qos flow到DRB的映射关系表并进行更新同时向CU-CP回复确认信息。随后，CU-UP将Qos flow的数据包往新的DRB上传输。或IAB-Donor DU接收新的路由配置信息并进行更新同时向CU-CP回复确认信息。随后，IAB-Donor DU将IP数据包往新的路由路径传输。
在一个实施例中，提供一种控制面进行上行端到端的拥塞处理方法。以图7为例进行说明。
第一步，上行数据从UE1到达接入节点IAB1，再通过IAB2/IAB3传输到IAB4->Donor DU，最后到达CU-UP并往核心网继续传输。IAB4对向其子节点传输的上行数据量申请BSR判断，结合当前的可用上行资源对各IAB子节点进行上行资源分配。当IAB2处的上行数据量很大，而IAB4没有足够的上行资源可以分配时就会出现上行IAB2<->IAB4之间的链路拥塞。
第二步：IAB4检测到上行IAB2<->IAB4之间的链路发生拥塞。IAB4将上行链路拥塞信息进行汇总，然后通过F1AP消息向CU-CP上报。
所述上行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传RLC信道标识；拥塞链路的链路标识，例如：路由ID；拥塞链路的IAB子节点标识；拥塞链路的子节点上报的缓冲状态报告BSR；拥塞链路的上行数据传输效率。
所述无线回传RLC信道标识包括入口无线回传RLC信道标识和/或出口无 线回传RLC信道标识。
所述IAB子节点标识包括无线回传适配协议BAP地址和/或IP地址。
所述上行数据传输效率包括：实际上行缓存与可支持上行缓存的比值。
第三步：CU-CP接收IAB4发送的上行链路拥塞信息，从拥塞信息中识别出IAB4有上行拥塞的链路，即IAB2与IAB4之间的链路发生拥塞。同时CU-CP也了解到IAB4与其子节点IAB3之间的上行链路传输通畅。
第四步：CU-CP结合整体的网络拓扑结构，选择将IAB1处往原始路径(IAB1->IAB2)链路传输的上行数据，重新映射到往新路径(IAB1->IAB3)链路进行传输。让UE1的数据通过IAB3直接到达IAB Donor-DU而后传输至CU-UP以达到缓解IAB2与IAB4之间链路拥塞的效果。CU-CP向IAB1发送新的F1消息，修改从UE1传给IAB1的数据包的路由ID并为IAB1配置新的Mapping表，使得在IAB1处要往原始路径(IAB1->IAB2)链路传输的上行数据对应的出口BH RLC信道为新路径(IAB1->IAB3)链路上的BH RLC信道。
第五步：IAB1接收新的路由配置信息和映射(mapping)配置表并进行更新同时向CU-CP回复确认信息。随后，将UE1的上行数据包往新的路由路径传输。
在一个实施例中，本实施例提供一种拥塞处理装置，所述拥塞处理装置主要应用于第一节点，如图8所示，本实施例提供的拥塞处理装置主要包括接收模块81和处理模块82。
接收模块81，被配置为接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理；处理模块82，被配置为基于所述拥塞信息进行拥塞处理。
在一个示例性的实施方式中，所述拥塞信息包括如下一个或多个：
下行链路拥塞信息，上行链路拥塞信息，下行拥塞数据无线承载DRB信息。
在一个示例性的实施方式中，所述下行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传无线链路层控制协议RLC信道标识；拥塞链路的路由标识；拥塞链路的IAB子节点标识；拥塞链路的下行数据传输效率。
在一个示例性的实施方式中，下行数据传输效率包括如下一个或多个：
实际下行缓存与可支持下行缓存的比值；出口无线回传RLC信道数据速率与入口无线回传RLC信道数据速率的比值。
在一个示例性的实施方式中，所述上行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传RLC信道标识；拥塞链路的链路标识；拥塞链路的IAB子节点标识；拥塞链路的子节点上报的缓冲状态报告BSR；拥塞链路的上行数据传输效率。
在一个示例性的实施方式中，所述无线回传RLC信道标识包括入口无线回传RLC信道标识和/或出口无线回传RLC信道标识。
在一个示例性的实施方式中，所述IAB子节点标识包括无线回传适配协议BAP地址和/或IP地址。
在一个示例性的实施方式中，所述上行数据传输效率包括：实际上行缓存与可支持上行缓存的比值。
在一个示例性的实施方式中，所述下行拥塞数据无线承载DRB信息包括如下一个或多个：
拥塞的DRB标识；拥塞DRB所属UE的标识；拥塞的GPRS隧道协议隧道端点标识；拥塞DRB的所需的数据量；拥塞DRB的所需数据的速率。
在一个示例性的实施方式中，接收链路拥塞信息的方式包括如下之一：
接收第二节点通过F1AP接口发送的下行链路拥塞信息或上行链路拥塞信息；接收第三节点通过E1AP接口发送的下行拥塞数据无线承载DRB信息。
本实施例中提供的拥塞处理装置可执行本申请任意实施例所提供的拥塞处理方法，具备执行该方法相应的功能模块和效果。未在本实施例中详尽描述的技术细节，可参见本申请任意实施例所提供的拥塞处理方法。
上述拥塞处理装置的实施例中，所包括的各个单元和模块只是按照功能逻辑进行划分的，但并不局限于上述的划分，只要能够实现相应的功能即可；另外，各功能单元的名称也只是为了便于相互区分，并不用于限制本申请的保护范围。
在一个实施例中，本实施例提供一种拥塞处理装置，所述拥塞处理装置主要应用于第二节点，如图9所示，本实施例提供的拥塞处理装置主要包括第一确定模块91、第一发送模块92。
第一确定模块91，被配置为确定拥塞信息，其中，所述拥塞信息包括下行链路拥塞信息或上行链路拥塞信息；第一发送模块92，被配置为通过F1AP接口将所述拥塞信息发送至第一节点。
在一个示例性的实施方式中，所述拥塞信息包括如下一个或多个：
下行链路拥塞信息，上行链路拥塞信息，下行拥塞数据无线承载DRB信息。
在一个示例性的实施方式中，所述下行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传无线链路层控制协议RLC信道标识；拥塞链路的路由标识；拥塞链路的IAB子节点标识；拥塞链路的下行数据传输效率。
在一个示例性的实施方式中，下行数据传输效率包括如下一个或多个：
实际下行缓存与可支持下行缓存的比值；出口无线回传RLC信道数据速率与入口无线回传RLC信道数据速率的比值。
在一个示例性的实施方式中，所述上行链路拥塞信息包括如下一个或多个：
拥塞链路的无线回传RLC信道标识；拥塞链路的链路标识；拥塞链路的IAB子节点标识；拥塞链路的子节点上报的缓冲状态报告BSR；拥塞链路的上行数据传输效率。
在一个示例性的实施方式中，所述无线回传RLC信道标识包括入口无线回传RLC信道标识和/或出口无线回传RLC信道标识。
在一个示例性的实施方式中，所述IAB子节点标识包括无线回传适配协议BAP地址和/或IP地址。
在一个示例性的实施方式中，所述上行数据传输效率包括：实际上行缓存与可支持上行缓存的比值。
本实施例中提供的拥塞处理装置可执行本申请任意实施例所提供的拥塞处理方法，具备执行该方法相应的功能模块和效果。未在本实施例中详尽描述的技术细节，可参见本申请任意实施例所提供的拥塞处理方法。
上述拥塞处理装置的实施例中，所包括的各个单元和模块只是按照功能逻辑进行划分的，但并不局限于上述的划分，只要能够实现相应的功能即可；另外，各功能单元的名称也只是为了便于相互区分，并不用于限制本申请的保护范围。
在一个实施例中，本实施例提供一种拥塞处理装置，所述拥塞处理装置主要应用于第三节点，如图10所示，本实施例提供的拥塞处理装置主要包括第二确定模块101和第二发送模块102。
第二确定模块101，被配置为确定拥塞信息，其中，所述拥塞信息包括下行拥塞数据无线承载DRB信息；第二发送模块102，被配置为通过E1AP接口将所述拥塞信息发送至第一节点。
在一个示例性的实施方式中，所述下行拥塞数据无线承载DRB信息包括如下一个或多个：
拥塞的DRB标识；拥塞DRB所属的UE标识；拥塞的GPRS隧道协议隧道端点标识；拥塞DRB的所需的数据量；拥塞DRB的所需数据的速率。
本实施例中提供的拥塞处理装置可执行本申请任意实施例所提供的拥塞处理方法，具备执行该方法相应的功能模块和效果。未在本实施例中详尽描述的技术细节，可参见本申请任意实施例所提供的拥塞处理方法。
上述拥塞处理装置的实施例中，所包括的各个单元和模块只是按照功能逻辑进行划分的，但并不局限于上述的划分，只要能够实现相应的功能即可；另外，各功能单元的名称也只是为了便于相互区分，并不用于限制本申请的保护范围。
本申请实施例还提供一种设备，图11是本申请实施例提供的一种设备的结构示意图，如图11所示，该设备包括处理器111、存储器112、输入装置113、输出装置114和通信装置115；设备中处理器111的数量可以是一个或多个，图11中以一个处理器111为例；设备中的处理器111、存储器112、输入装置113和输出装置114可以通过总线或其他方式连接，图11中以通过总线连接为例。
存储器112作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块。处理器111通过运行存储在存储器112中的软件程序、指令以及模块，从而执行设备的各种功能应用以及数据处理，即实现本申请实施例提供的任一方法。
存储器112可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据设备的使用所创建的数据等。此外，存储器112可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实例中，存储器112可包括相对于处理器111远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
输入装置113可用于接收输入的数字或字符信息，以及产生与设备的用户设置以及功能控制有关的键信号输入。输出装置114可包括显示屏等显示设备。
通信装置115可以包括接收器和发送器。通信装置115设置为根据处理器111的控制进行信息收发通信。
在上述设备是第一节点的情况下，处理器111通过运行存储在系统存储器112中的程序，从而执行各种功能应用以及数据处理，例如实现本申请实施例所提供的拥塞处理方法，该方法包括：
接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理；基于所述拥塞信息进行拥塞处理。
处理器111还可以实现本申请任意实施例所提供的拥塞处理方法的技术方案。该设备的硬件结构以及功能可参见本实施例的内容解释。
在上述设备是第二节点的情况下，处理器111通过运行存储在系统存储器112中的程序，从而执行各种功能应用以及数据处理，例如实现本申请实施例所提供的拥塞处理方法，该方法包括：
确定拥塞信息，其中，所述拥塞信息包括下行链路拥塞信息或上行链路拥塞信息；通过F1AP接口将所述拥塞信息发送至第一节点。
处理器111还可以实现本申请任意实施例所提供的拥塞处理方法的技术方案。该设备的硬件结构以及功能可参见本实施例的内容解释。
在上述设备是第三节点的情况下，处理器111通过运行存储在系统存储器112中的程序，从而执行各种功能应用以及数据处理，例如实现本申请实施例所提供的拥塞处理方法，该方法包括：
确定拥塞信息，其中，所述拥塞信息包括下行拥塞数据无线承载DRB信息；通过E1AP接口将所述拥塞信息发送至第一节点。
处理器111还可以实现本申请任意实施例所提供的拥塞处理方法的技术方案。该设备的硬件结构以及功能可参见本实施例的内容解释。
在一个示例性的实施方式中，本申请实施例还提供一种包含计算机可执行指令的存储介质，所述计算机可执行指令在由计算机处理器执行时用于执行一种拥塞处理方法，所述方法应用于第一节点，包括：
接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理；基于所述拥塞信息进行拥塞处理。
本申请实施例所提供的一种包含计算机可执行指令的存储介质，其计算机可执行指令不限于如上所述的方法操作，还可以执行本申请任意实施例所提供的拥塞处理方法中的相关操作。
在一个示例性的实施方式中，本申请实施例还提供一种包含计算机可执行指令的存储介质，所述计算机可执行指令在由计算机处理器执行时用于执行一种拥塞处理方法，所述方法应用于第二节点，包括：
确定拥塞信息，其中，所述拥塞信息包括下行链路拥塞信息或上行链路拥塞信息；通过F1AP接口将所述拥塞信息发送至第一节点。
本申请实施例所提供的一种包含计算机可执行指令的存储介质，其计算机可执行指令不限于如上所述的方法操作，还可以执行本申请任意实施例所提供的拥塞处理方法中的相关操作。
在一个示例性的实施方式中，本申请实施例还提供一种包含计算机可执行指令的存储介质，所述计算机可执行指令在由计算机处理器执行时用于执行一种拥塞处理方法，所述方法应用于第三节点，包括：
确定拥塞信息，其中，所述拥塞信息包括下行拥塞数据无线承载DRB信息；通过E1AP接口将所述拥塞信息发送至第一节点。
本申请实施例所提供的一种包含计算机可执行指令的存储介质，其计算机可执行指令不限于如上所述的方法操作，还可以执行本申请任意实施例所提供的拥塞处理方法中的相关操作。
通过以上关于实施方式的描述，本申请可借助软件及必需的通用硬件来实现，也可以通过硬件实现。本申请的技术方案本质上可以以软件产品的形式体现出来，该计算机软件产品可以存储在计算机可读存储介质中，如计算机的软盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、闪存(FLASH)、硬盘或光盘等，包括多个指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述的方法。
术语用户终端涵盖任何适合类型的无线用户设备，例如移动电话、便携数据处理装置、便携网络浏览器或车载移动台。
一般来说，本申请的多种实施例可以在硬件或专用电路、软件、逻辑或其任何组合中实现。例如，一些方面可以被实现在硬件中，而其它方面可以被实现在可以被控制器、微处理器或其它计算装置执行的固件或软件中，尽管本申请不限于此。
本申请的实施例可以通过移动装置的数据处理器执行计算机程序指令来实现，例如在处理器实体中，或者通过硬件，或者通过软件和硬件的组合。计算机程序指令可以是汇编指令、指令集架构(Instruction Set Architecture，ISA)指令、机器指令、机器相关指令、微代码、固件指令、状态设置数据、或者以一种或多种编程语言的任意组合编写的源代码或目标代码。
本申请附图中的任何逻辑流程的框图可以表示程序步骤，或者可以表示相互连接的逻辑电路、模块和功能，或者可以表示程序步骤与逻辑电路、模块和功能的组合。计算机程序可以存储在存储器上。存储器可以具有任何适合于本地技术环境的类型并且可以使用任何适合的数据存储技术实现，例如但不限于 只读存储器(ROM)、随机访问存储器(RAM)、光存储器装置和系统(数码多功能光碟(Digital Video Disc，DVD)或光盘(Compact Disk，CD(Compact Disk，)等。计算机可读介质可以包括非瞬时性存储介质。数据处理器可以是任何适合于本地技术环境的类型，例如但不限于通用计算机、专用计算机、微处理器、数字信号处理器(Digital Signal Processing，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、可编程逻辑器件(Field-Programmable Gate Array，FPGA)以及基于多核处理器架构的处理器。

Claims (17)

  1. 一种拥塞处理方法，应用于第一节点，包括：
    接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理；
    基于所述拥塞信息进行拥塞处理。
  2. 根据权利要求1所述的方法，其中，所述拥塞信息包括如下至少之一：
    下行链路拥塞信息，上行链路拥塞信息，下行拥塞数据无线承载DRB信息。
  3. 根据权利要求2所述的方法，其中，所述下行链路拥塞信息包括如下至少之一：
    拥塞链路的无线回传无线链路层控制协议RLC信道标识；
    拥塞链路的路由标识；
    拥塞链路的集成接入和回程IAB子节点标识；
    拥塞链路的下行数据传输效率。
  4. 根据权利要求3所述的方法，其中，所述下行数据传输效率包括如下至少之一：
    实际下行缓存与可支持下行缓存的比值；
    出口无线回传RLC信道数据速率与入口无线回传RLC信道数据速率的比值。
  5. 根据权利要求2所述的方法，其中，所述上行链路拥塞信息包括如下至少之一：
    拥塞链路的无线回传RLC信道标识；
    拥塞链路的链路标识；
    拥塞链路的IAB子节点标识；
    拥塞链路的子节点上报的缓冲状态报告BSR；
    拥塞链路的上行数据传输效率。
  6. 根据权利要求3或5所述的方法，其中，所述无线回传RLC信道标识包括入口无线回传RLC信道标识和出口无线回传RLC信道标识中的至少之一。
  7. 根据权利要求3或5所述的方法，其中，所述IAB子节点标识包括无线回传适配协议BAP地址和互联网协议IP地址中的至少之一。
  8. 根据权利要求5所述的方法，其中，所述上行数据传输效率包括：
    实际上行缓存与可支持上行缓存的比值。
  9. 根据权利要求2所述的方法，其中，所述下行拥塞DRB信息包括如下至 少之一：
    拥塞的DRB标识；
    拥塞DRB所属的用户设备UE标识；
    拥塞DRB的通用分组无线服务GPRS隧道协议隧道端点标识；
    拥塞DRB的所需的数据量；
    拥塞DRB的所需数据的速率。
  10. 根据权利要求1所述的方法，其中，接收所述拥塞信息的方式包括如下之一：
    接收第二节点通过F1应用协议F1AP接口发送的下行链路拥塞信息或上行链路拥塞信息；
    接收第三节点通过E1AP接口发送的下行拥塞数据无线承载DRB信息。
  11. 一种拥塞处理方法，应用于第二节点，包括：
    确定拥塞信息，其中，所述拥塞信息包括下行链路拥塞信息或上行链路拥塞信息；
    通过F1应用协议F1AP接口将所述拥塞信息发送至第一节点。
  12. 一种拥塞处理方法，应用于第三节点，包括：
    确定拥塞信息，其中，所述拥塞信息包括下行拥塞数据无线承载DRB信息；
    通过E1应用协议E1AP接口将所述拥塞信息发送至第一节点。
  13. 一种拥塞处理装置，配置于第一节点，包括：
    接收模块，被配置为接收拥塞信息，其中，所述拥塞信息用于第一节点进行拥塞处理；
    处理模块，被配置为基于所述拥塞信息进行拥塞处理。
  14. 一种拥塞处理装置，配置于第二节点，包括：
    第一确定模块，被配置为确定拥塞信息，其中，所述拥塞信息包括下行链路拥塞信息或上行链路拥塞信息；
    第一发送模块，被配置为通过F1应用协议F1AP接口将所述拥塞信息发送至第一节点。
  15. 一种拥塞处理装置，配置于第三节点，包括：
    第二确定模块，被配置为确定拥塞信息，其中，所述拥塞信息包括下行拥 塞数据无线承载DRB信息；
    第二发送模块，被配置为通过E1应用协议E1AP接口将所述拥塞信息发送至第一节点。
  16. 一种设备，包括：
    至少一个处理器；
    存储器，被配置为存储至少一个程序；
    当所述至少一个程序被所述至少一个处理器执行，使得所述至少一个处理器实现如权利要求1-12中任一项所述的拥塞处理方法。
  17. 一种存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求1-12中任一项所述的拥塞处理方法。
PCT/CN2021/109968 2020-07-31 2021-08-02 拥塞处理方法、装置、设备和存储介质 Ceased WO2022022734A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US18/018,701 US20230308941A1 (en) 2020-07-31 2021-08-02 Congestion processing method, device and storage medium
KR1020237005459A KR20230043893A (ko) 2020-07-31 2021-08-02 혼잡 처리 방법과 장치, 디바이스 및 저장 매체
EP21848767.6A EP4192092A4 (en) 2020-07-31 2021-08-02 METHOD AND APPARATUS FOR PROCESSING CLUTCH, DEVICE AND STORAGE MEDIUM
CA3186816A CA3186816A1 (en) 2020-07-31 2021-08-02 Congestion processing method and apparatus, and device and storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010761386.3 2020-07-31
CN202010761386.3A CN111918331B (zh) 2020-07-31 2020-07-31 拥塞处理方法、装置、设备和存储介质

Publications (1)

Publication Number Publication Date
WO2022022734A1 true WO2022022734A1 (zh) 2022-02-03

Family

ID=73287418

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/109968 Ceased WO2022022734A1 (zh) 2020-07-31 2021-08-02 拥塞处理方法、装置、设备和存储介质

Country Status (6)

Country Link
US (1) US20230308941A1 (zh)
EP (1) EP4192092A4 (zh)
KR (1) KR20230043893A (zh)
CN (1) CN111918331B (zh)
CA (1) CA3186816A1 (zh)
WO (1) WO2022022734A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20240334244A1 (en) * 2023-03-30 2024-10-03 Mavenir Systems, Inc. RAN and UE Driven L4S Marking and Processing for Congestion Management in an O-RAN Based Network Architecture

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111918331B (zh) * 2020-07-31 2025-10-31 中兴通讯股份有限公司 拥塞处理方法、装置、设备和存储介质
WO2022099509A1 (en) * 2020-11-11 2022-05-19 Nokia Shanghai Bell Co., Ltd. Methods, apparatuses, and computer readable media for controlling downlink transmissions in integrated access and backhaul network
CN116762397A (zh) * 2021-01-13 2023-09-15 富士通株式会社 信号的发送和接收方法、装置和通信系统
EP4422264A4 (en) * 2021-10-20 2025-03-19 Fujitsu Limited ROUTING METHOD AND APPARATUS, AND SYSTEM
JP2025535853A (ja) * 2022-11-03 2025-10-29 北京小米移動軟件有限公司 輻輳通知方法、装置、デバイス及び記憶媒体
CN116056143B (zh) * 2022-12-29 2026-04-24 维沃移动通信有限公司 网络拥塞处理方法、装置、电子设备和存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110366202A (zh) * 2018-03-26 2019-10-22 中兴通讯股份有限公司 空口链路拥塞反馈方法、装置及设备、存储介质
CN110636548A (zh) * 2019-09-30 2019-12-31 中兴通讯股份有限公司 一种流量控制方法、装置、节点和存储介质
WO2020032638A1 (en) * 2018-08-09 2020-02-13 Lg Electronics Inc. Method for performing access control and device supporting the same
CN111148163A (zh) * 2018-11-02 2020-05-12 华为技术有限公司 通信方法及装置
CN111918331A (zh) * 2020-07-31 2020-11-10 中兴通讯股份有限公司 拥塞处理方法、装置、设备和存储介质

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2009253900A (ja) * 2008-04-10 2009-10-29 Nippon Telegr & Teleph Corp <Ntt> 輻輳制御方法、輻輳制御装置、および輻輳制御システム
WO2020027491A1 (ko) * 2018-07-30 2020-02-06 주식회사 케이티 릴레이 노드에서 데이터를 처리하는 방법 및 그 장치
KR20200013576A (ko) * 2018-07-30 2020-02-07 주식회사 케이티 5g 무선 릴레이를 위한 흐름 제어 방법 및 장치
US12010548B2 (en) * 2018-09-07 2024-06-11 Apple Inc. Apparatus and method for congestion handling in radio access network
CN110536351B (zh) * 2019-02-15 2024-06-04 中兴通讯股份有限公司 Iab网络中信息处理方法、iab及计算机存储介质
CN111586749B (zh) * 2019-02-15 2023-02-07 华为技术有限公司 一种下行缓存状态反馈方法及装置
WO2021062597A1 (en) * 2019-09-30 2021-04-08 Lenovo (Beijing) Limited Methods and apparatuses for end-to-end flow control
CN114557023B (zh) * 2019-10-10 2025-11-04 联想(北京)有限公司 用于逐跳流量控制的方法及设备
US11284332B2 (en) * 2019-10-18 2022-03-22 Qualcomm Incorporated Network coding in an integrated access and backhaul network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110366202A (zh) * 2018-03-26 2019-10-22 中兴通讯股份有限公司 空口链路拥塞反馈方法、装置及设备、存储介质
WO2020032638A1 (en) * 2018-08-09 2020-02-13 Lg Electronics Inc. Method for performing access control and device supporting the same
CN111148163A (zh) * 2018-11-02 2020-05-12 华为技术有限公司 通信方法及装置
CN110636548A (zh) * 2019-09-30 2019-12-31 中兴通讯股份有限公司 一种流量控制方法、装置、节点和存储介质
CN111918331A (zh) * 2020-07-31 2020-11-10 中兴通讯股份有限公司 拥塞处理方法、装置、设备和存储介质

Non-Patent Citations (1)

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

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20240334244A1 (en) * 2023-03-30 2024-10-03 Mavenir Systems, Inc. RAN and UE Driven L4S Marking and Processing for Congestion Management in an O-RAN Based Network Architecture

Also Published As

Publication number Publication date
CN111918331A (zh) 2020-11-10
US20230308941A1 (en) 2023-09-28
CN111918331B (zh) 2025-10-31
CA3186816A1 (en) 2022-02-03
EP4192092A4 (en) 2024-08-14
EP4192092A1 (en) 2023-06-07
KR20230043893A (ko) 2023-03-31

Similar Documents

Publication Publication Date Title
EP4192092A1 (en) Congestion processing method and apparatus, and device and storage medium
US9173244B2 (en) Methods for establishing and using public path, M2M communication method, and systems thereof
US12289634B2 (en) Data transmission method and apparatus, first communication node, and second communication node
WO2019242748A1 (zh) 信息传输方法及装置
WO2020164596A1 (zh) 一种数据传输方法及装置
CN107770085B (zh) 一种网络负载均衡方法、设备及系统
US11356294B2 (en) Packet processing method and device
WO2021027860A1 (zh) 路由方法、bsr的生成方法、装置和存储介质
WO2018082597A1 (zh) 拥塞控制方法及装置、基站
EP3136779B1 (en) Cell and method and system for bandwidth management of backhaul network of cell
CN110636548B (zh) 一种流量控制方法、装置、节点和存储介质
CN101998547B (zh) 数据前转方法、基站和中继站
CN111049752A (zh) 多传输线路的负载均衡方法及装置
CN113784374A (zh) 一种用于基站的深度数据处理的装置及方法
CN105210346A (zh) 数据传输方法、发送端设备与接收端设备
WO2017067007A1 (zh) 服务质量的控制方法、设备及系统
WO2022012361A1 (zh) 一种通信方法及装置
CN103828481A (zh) 数据传输设备、通信系统及通信方法
US20240236756A9 (en) Adaptive forwarding handling of data packets
CN219459295U (zh) 一种应急通信系统
CN101309263B (zh) 数据传输的方法、装置和系统
CN112040565A (zh) 移动通信系统、方法及装置
CN114390593A (zh) 一种iab网络中的通信方法及其装置
CN108471633B (zh) 一种通信方法与通信系统
CN116321097B (zh) 应急通信系统及应急业务处理方法

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: 21848767

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 3186816

Country of ref document: CA

ENP Entry into the national phase

Ref document number: 20237005459

Country of ref document: KR

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 202317012583

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2021848767

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2021848767

Country of ref document: EP

Effective date: 20230228

NENP Non-entry into the national phase

Ref country code: DE