Embodiments of this application provide example communication methods and example devices. One example method includes sending information to a first node, where the information includes at least one of information about a first group of logical channel identities (LCIDs) or information about a second group of LCIDs, the first group of LCIDs includes an LCID used for access traffic, and the second group of LCIDs includes an LCID used for backhaul traffic. Another information can then be sent to the first node, where the another information is used to configure a radio link control (RLC) bearer of the first node, the RLC bearer includes a RLC layer entity and a logical channel, and when an LCID corresponding to the logical channel belongs to the first group of LCIDs, an upper protocol layer of a RLC layer is a packet data convergence protocol (PDCP) layer or an F1 interface protocol layer.

Methods, systems, and devices for wireless communications are described, in which a base station may determine a load balancing adjustment for traffic communicated through the base station. The load balancing adjustment may be provided at a beam level for one or more beams of a plurality of beams, at a network slice level for one or more network slice IDs of a number of network slice IDs, or combinations thereof. The base station may use the load balancing adjustment to identify one or more updated parameters for triggering a handover of at least one user equipment (UE) between beams or slice IDs of a same cell or different cells. The base station may format a mobility change request that indicates the one or more parameters that are updated, and transmit the mobility change request to another base station to establish parameters for handovers between the base stations.

The system obtains a first acyclic graph including multiple nodes and edges connecting the multiple nodes. A process to create a weave of the first acyclic graph produces a matching weave when executed on the first acyclic graph by different computing devices. An addition of a node to the first acyclic graph produces a second acyclic graph. The addition of the node to the first acyclic graph changes the weave of the first acyclic graph. The system obtains a process to reach a global consensus among the multiple computing devices. The process indicates a criterion to satisfy prior to reaching the global consensus and determines whether the multiple computing devices in the network satisfy the criterion. Upon determining that the criterion is satisfied, the system adds a finalize node to the first acyclic graph to obtain a third acyclic graph. A weave of the third acyclic graph cannot change.

This disclosure provides systems, methods and apparatus, including computer programs encoded on computer storage media, for load balancing network traffic in a wireless network. In one aspect, an access point may determine a plurality of client devices that are associated with an overloaded channel of the wireless network. The access point may identify a first client device of the plurality of client devices based, at least in part, on an airtime consumed on the overloaded channel. The access point may determine one or more alternate paths between the access point and the first client device. The access point may forecast airtime to be used by the first client device on channels of the one or more alternate paths, and steer wireless network traffic of the first client device to a first alternate path of the one or more alternate paths based, at least in part, on the forecasted airtime.

A method for load balancing in an Open Radio Access Network (O-RAN) system having an overloaded serving cell of a first base station includes: determining, by at least the first base station, radio-resource-usage efficiency of each one of a subset of user equipments (UEs) in the overloaded serving cell; determining, by at least the first base station, from the subset of UEs a list of candidate UEs for handover from the overloaded serving cell to a non-overloaded neighboring cell, based on one of i) per-UE average physical resource block (PRB) usage over a specified time period, or ii) per-UE average of measurements involving modulation-and-coding-scheme over a specified time period; and handing over, by the first base station, at least a selected number of UEs from the list of candidate UEs to the non-overloaded neighboring cell to implement load balancing.

With multiple communication channels available and range extenders, a number of paths may be available for communicating traffic in a wireless network. Traffic on paths in the wireless network may be load balanced to improve channel utilization and/or relieve an overloaded communication channel. To load balance the traffic, a first AP may determine candidate paths between a first AP and a client device, wherein at least one of the candidate paths traverses a second AP. The AP may determine available bandwidths of the candidate paths based, at least in part, on availability of communication channels of the candidate paths. The AP may steer a portion of the wireless network traffic of the client device to a first of the candidate paths based, at least in part, on the available bandwidths.

Real-time statistics of station RU needs are received. Additionally, real-time statistics of access point RU allocation are received. Real-time statistics for stations and access point history are stored. An artificial intelligence (AI) predictive model is generated for each station based on historical traffic needs. AI model to allocate access point RUs for specific stations in real-time.

The system obtains a first acyclic graph including multiple nodes and edges connecting the multiple nodes. A process to create a weave of the first acyclic graph produces a matching weave when executed on the first acyclic graph by different computing devices. An addition of a node to the first acyclic graph produces a second acyclic graph. The addition of the node to the first acyclic graph changes the weave of the first acyclic graph. The system obtains a process to reach a global consensus among the multiple computing devices. The process indicates a criterion to satisfy prior to reaching the global consensus and determines whether the multiple computing devices in the network satisfy the criterion. Upon determining that the criterion is satisfied, the system adds a finalize node to the first acyclic graph to obtain a third acyclic graph. A weave of the third acyclic graph cannot change.

In one embodiment, a process determines wireless station (STA) load and schedule of two or more access point (AP) radios. The process then develops a coordination between the two or more access point radios to limit downtime for one or more multi-link wireless devices capable of multi-link operation (MLO) on two or more channels. The process further causes the one or more multi-link wireless devices to move between access point radios based on the wireless station load and schedule and according to the coordination.

A method performed by a user device having a multiple connectivity configuration with a plurality of radio links to a plurality of network nodes in a radio communication network is provided. The user device can determine a change occurred in an amount of uplink data available for transmission in a first uplink buffer of the user device on a first radio link of a plurality of radio link to first network node. Responsive to the change, the user device can trigger a buffer status report for transmission to a second network node of the plurality of network nodes on a second radio link of the plurality of radio links for which a change in an amount of uplink data available for transmission in a second uplink buffer was not determined. A method performed by the first network node is also provided.