H04W40/24

METHODS, WIRELESS COMMUNICATIONS NETWORKS AND INFRASTRUCTURE EQUIPMENT

A method comprising receiving, at a first equipment acting as a donor node connected to a core network part of the wireless network, from a second equipment, information relating to each of a plurality of different communications paths from the second equipment to the first equipment via one or more other equipment acting as relay nodes, determining, based on the received information, that either at least a part of a new communications path exists between the first of the equipment and the second of the equipment or at least a part of a previously known communications path no longer exists between the first of the equipment and the second of the equipment, and updating a communications path list by either adding the at least the part of the new communications path or deleting the at least the part of the previously known communications path that no longer exists.

IMPROVED F1 SETUP DURING IAB HANDOVER
20230239755 · 2023-07-27 ·

According to some embodiments, a network node is capable of operating as an integrated access and backhaul (IAB) node comprising a distributed unit (DU) and a mobile termination (MT). The IAB node performs a method comprising: obtaining (2012) configuration information for establishing an interface between the IAB node DU and a target IAB donor central unit (CU); and after a handover of the IAB node to the target donor, establishing (2114) the interface between the IAB node DU and the target IAB donor CU based on the obtained configuration information.

DEFAILT PATH ASSIGNMENT IN IAB NETWORKS
20230007565 · 2023-01-05 ·

According to some embodiments, a method performed by an integrated access and backhaul (IAB) donor control unit (CU) network node comprises obtaining a first mapping between a first traffic type and a first communication path. The first communication path is for communicating the first traffic type between the IAB donor CU network node and an IAB network node. The method further comprises transmitting the first mapping to the IAB network node.

DEFAILT PATH ASSIGNMENT IN IAB NETWORKS
20230007565 · 2023-01-05 ·

According to some embodiments, a method performed by an integrated access and backhaul (IAB) donor control unit (CU) network node comprises obtaining a first mapping between a first traffic type and a first communication path. The first communication path is for communicating the first traffic type between the IAB donor CU network node and an IAB network node. The method further comprises transmitting the first mapping to the IAB network node.

ROUTE CALCULATION METHOD, DEVICE, AND SYSTEM

A route calculation method, device, and system. The route calculation method includes: receiving, by a first device, a service request message, where the service request message is used to request the first device to determine a transmission path of a borne service requested by the service request message to be established; and determining, by the first device, a transmission path of the service based on the service request message and first bearing capability information, where the first bearing capability information is used to indicate an actual bearing capability of each link on the transmission path. According to the foregoing solution, the system can calculate a route and configure the service based on an actual service bearing capability of each link of a network.

ROUTE CALCULATION METHOD, DEVICE, AND SYSTEM

A route calculation method, device, and system. The route calculation method includes: receiving, by a first device, a service request message, where the service request message is used to request the first device to determine a transmission path of a borne service requested by the service request message to be established; and determining, by the first device, a transmission path of the service based on the service request message and first bearing capability information, where the first bearing capability information is used to indicate an actual bearing capability of each link on the transmission path. According to the foregoing solution, the system can calculate a route and configure the service based on an actual service bearing capability of each link of a network.

Systems and methods for routing and topology management of computer networks with steerable beam antennas

This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.

Systems and methods for routing and topology management of computer networks with steerable beam antennas

This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.

Distributed access and/or backhaul for non-terrestrial nodes

A method of establishing one or more links for an integrated access and backhaul for a network, where the network includes a non-terrestrial node and a terrestrial node, includes determining a plurality of links to form between a non-terrestrial node and a number of nodes in the network and causing the plurality of links to be formed. The method also includes determining a plurality of routing paths for backhaul between the non-terrestrial node to a central server, providing instructions for backhaul between the non-terrestrial node and the central server using the plurality of routing paths, and transmitting a first set of data to backhaul via a first routing path of the plurality of routing paths and a second set of data to backhaul via a second routing path of the plurality of routing paths.

METHOD AND APPARATUS FOR SELECTING USER PLANE FUNCTION

The present application relates to a method and apparatus for selecting user plane function. One embodiment of the subject disclosure provides a method for selecting User Plane Function (UPF), comprising: getting, by a Session Management Function (SMF), application information in a Protocol Data Unit (PDU) session during a PDU Session Establishment procedure or during Domain Name System (DNS) Query processing; and selecting, by the SMF, the UPF based on the application information.