Method for improving nr throughput through adaptive lte control format indicator (CFI) determination in dynamic spectrum sharing

Abstract

The invention discloses a method, a system and a device. The present disclosure provides a network node configured for dynamic spectrum sharing of a first RAT and a second RAT, the network node configured to determine a first number of failed scheduling requests associated with the first RAT, determine a resource configuration for the first RAT and the second RAT for a first time period based on the first number of failed scheduling requests, and transmit the determined resource configuration to the second RAT for a second time period based on the determined resource configuration. And scheduling at least one transmission with at least one wireless device for a first time period based on the resource configuration.

Description

Technical Field

[0001] The present disclosure relates to wireless communication, and in particular, to adaptive control format indicator (CFI) determination in dynamic spectrum sharing. Background Art

[0002] The 3rd Generation Partnership Project (3GPP) has developed and is developing standards for 4th generation (4G) (also known as Long Term Evolution (LTE)) and 5th generation (5G) (also known as New Radio (NR)) wireless communication systems. Among other features, such systems also provide broadband communication between network nodes such as base stations and mobile wireless devices (WDs), as well as communication between network nodes and between wireless devices. 3GPP is also working on 6th generation (6G) wireless communication systems.

[0003] Spectrum Sharing

[0004] Existing 5G systems can include both new and legacy spectrum bands. This may require functions that enable operators to plan the evolution of network assets including both new and legacy spectrum bands and technologies, and that allow for seamless rollout of 5G with optimal end-user performance. Dynamic spectrum sharing (DSS) solutions can allow for intelligent, flexible, and rapid introduction and addition of 5G within existing 4G carriers, such as by introducing 5G on low / mid frequency bands for wide area coverage and in-building coverage. DSS software can dynamically share spectrum between, for example, 4G and 5G carriers. For example, handovers between carriers can occur within milliseconds, which can minimize spectrum waste and allow for optimal end-user performance.

[0005] In some existing systems for dynamic spectrum sharing, an arbiter (i.e., a unit or module implemented in computer / radio software and / or hardware) is employed that decides how radio resources can be allocated to LTE and NR in each time slot.

[0006] For example, if NR traffic is being transmitted over the air, one existing sharing algorithm takes into account two orthogonal frequency division multiplexing (OFDM) symbols for the LTE physical downlink control channel (PDCCH), one OFDM symbol for the NR PDCCH, and eleven OFDM symbols for the NR physical downlink shared channel (PDSCH).

[0007] Improved NR throughput in DSS cells is a desired feature of such systems. One way to improve NR throughput performance is to increase the number of OFDM symbols for the NR PDSCH at the expense of LTE PDCCH symbols.

[0008] For example, this may include setting one OFDM symbol for LTE PDCCH, one OFDM symbol for NR PDCCH, and twelve OFDM symbols for NRPDSCH via the configuration of the LTE control format indicator (CFI) Max parameter in dynamic spectrum sharing.

[0009] For example:

[0010] If the LTE CFI Max is 3, the LTE CFI value (e.g., determined by the LTE scheduler) can be 3, 2, 1, or 0.

[0011] If the LTE CFI Max is 2, the LTE CFI can be 2, 1, or 0.

[0012] If the LTE CFI Max is 1, the LTE CFI can be 1 or 0.

[0013] However, this static allocation method used in existing systems may be undesirable because the LTE PDCCH capacity may be statically reduced, which may potentially degrade the performance of high-priority traffic bands.

[0014] For example, existing systems may only allow a fixed number of OFDM symbols to be allocated to the NR PDSCH. The static LTE CFIMax = 1 method can increase the NR throughput performance by allowing NR to use one more OFDM symbol at the cost of the LTE PDCCH capacity, while potentially degrading the performance of high-priority LTE traffic bands.

[0015] The following examples illustrate the disadvantages of existing systems.

[0016] In the first example, described in Table 1 below, statically using one more ODFM symbol in the NR PDSCH in dynamic spectrum sharing increases the NR throughput by 13.3% (from 75.8 Mb / s to 85.9 Mb / s).

[0017]

[0018] Table 1: Example 1

[0019] In the second example, described in Table 2 below, statically sacrificing one ODFM symbol in the LTE PDCCH (for the NR PDSCH) results in a significant increase in the percentage of failed LTE scheduling requests.

[0020]

[0021] Table 2: Example 2

[0022] Therefore, existing systems may not be able to fully balance NR throughput improvement with the performance of high-priority LTE traffic. SUMMARY OF THE INVENTION

[0023] Adaptive LTE CFI Max determination in dynamic spectrum sharing can be beneficial, leading to NR throughput improvement without degrading the performance of high-priority LTE traffic bands in dynamic spectrum sharing.

[0024] Some embodiments of the present disclosure implement an adaptive LTE CFI Max determination algorithm and method, including at least three system / method block elements: a cost function, determination of LTE CFI Max parameter options, and an LTE CFI Max parameter option selection algorithm. The algorithm dynamically considers the performance of high-priority LTE scheduling requests and proactively seeks opportunities to improve NR throughput, for example, by setting the LTE CFI Max to 1.

[0025] In some embodiments, the overall system architecture is based on an existing DSS system architecture, where, based on the LTE CFI Max value, an arbiter outputs and notifies an LTE scheduling module / unit (implemented, for example, in software and / or processing circuit hardware) and an NR scheduling unit (implemented, for example, in software and / or processing circuit hardware), and embodiments of the present disclosure include an adaptive LTE CFI Max determination method inside the arbiter, rather than the static determination used in some existing systems.

[0026] Embodiments of the present disclosure can adaptively determine the LTE CFI Max value, which improves NR throughput performance without sacrificing the performance of high-priority LTE scheduling requests. For example, some embodiments are able to adapt to time-varying traffic characteristics and thus perform better than some existing systems that utilize a static LTE CFI Max method.

[0027] For example, an adaptive LTE CFI Max determination algorithm according to some embodiments of the present disclosure can improve NR throughput performance without degrading the performance of high-priority LTE scheduling requests, thus resulting in an improved performance trade-off between the two key performance metrics, as described in Example 3 in Table 3 below.

[0028]

[0029]

[0030] Table 3: Example 3 (Full-buffer traffic with 50% high-priority LTE traffic band)

[0031] Some embodiments advantageously provide methods, systems, and apparatuses for adaptive CFI determination in dynamic spectrum sharing.

[0032] For example, some embodiments provide an LTE CFI Max determination method to improve NR throughput performance without degrading the performance of high-priority LTE scheduling requests.

[0033] In some embodiments, the LTE CFI Max determination method includes 1) cost evaluation, 2) LTE CFI Max parameter option configuration, and 3) an LTE CFI Max parameter selection algorithm.

[0034] In some embodiments, the cost function for evaluating the performance of high-priority LTE traffic may be the exponentially weighted average of the number of failed LTE scheduling requests.

[0035] In some embodiments, the weighting factor used in the cost evaluation may be updated based on time-varying traffic characteristics.

[0036] The LTE CFI Max selection algorithm for selecting a set of LTE CFI Max values may be based on user-defined thresholds, the improvement rate of the cost, etc.

[0037] According to a first aspect of the present disclosure, a network node configured for dynamic spectrum sharing of a first RAT and a second RAT is provided. The network node is configured to determine a first number of failed scheduling requests associated with the first RAT, determine, based on the first number of failed scheduling requests, a resource configuration for the first RAT and the second RAT for a first time period, and optionally, schedule at least one transmission with at least one wireless device for the first time period based on the resource configuration.

[0038] According to one or more embodiments of this aspect, determining the resource configuration for the first RAT and the second RAT for the first time period is further based on the first RAT traffic demand and the second RAT traffic demand.

[0039] According to one or more embodiments of this aspect, determining the resource configurations for a first RAT and a second RAT for a first time period includes calculating a cost function, where the cost function is calculated based on at least one of the following: a first quantity of failed scheduling requests associated with the first RAT, at least one weighting factor associated with at least one of the failed scheduling requests corresponding to the first quantity of failed scheduling requests associated with the first RAT, and a previous calculated cost associated with a previous time period prior to the first time period. According to one or more embodiments of this aspect, the at least one weighting factor is determined based on at least one of the following: the amount of time elapsed since the at least one corresponding failed scheduling request occurred, traffic characteristics associated with at least one of the first RAT and the second RAT, the priority associated with the at least one corresponding failed scheduling request, the burstiness characteristics of the at least one corresponding failed scheduling request, and a stability value associated with the at least one corresponding failed scheduling request.

[0040] According to one or more embodiments of this aspect, a resource configuration is selected from a set of available resource configurations, and the set of available resource configurations is determined based on whether the output of the cost function is higher than a threshold. According to one or more embodiments of this aspect, the threshold is determined based on traffic characteristics associated with at least one of the first RAT and the second RAT. According to one or more embodiments of this aspect, the network node is further configured to update at least one weighting factor for calculating the cost function for a subsequent time period of the first time period. According to one or more embodiments of this aspect, the resource configuration corresponds to at least one of a control format indicator CFI Max configuration and a symbol configuration. According to one or more embodiments of this aspect, the network node is a distributed unit DU, which is configured to communicate with a radio unit, and the radio unit communicates with at least one wireless device. Scheduling at least one transmission for the first time period includes configuring the radio unit using the CFI Max configuration. According to one or more embodiments of this aspect, the first RAT is a legacy RAT and the second RAT is a non-legacy RAT.

[0041] According to another aspect of the present disclosure, a method implemented in a network node is provided. A first quantity of failed scheduling requests associated with a first RAT is determined. Based on the first quantity of the failed scheduling requests, resource configurations for the first RAT and the second RAT for a first time period are determined. Based on the resource configurations, at least one transmission for the first time period with at least one wireless device is scheduled.

[0042] According to one or more embodiments of this aspect, determining the resource configurations for the first RAT and the second RAT for the first time period is further based on first RAT traffic demands and second RAT traffic demands.

[0043] According to one or more embodiments of this aspect, determining the resource allocation for a first RAT and a second RAT for a first time period includes calculating a cost function, where the cost function is calculated based on at least one of the following: a first quantity of failed scheduling requests associated with the first RAT, at least one weighting factor associated with at least one of the failed scheduling requests corresponding to the first quantity of failed scheduling requests associated with the first RAT, and a previous calculated cost associated with a previous time period prior to the first time period. According to one or more embodiments of this aspect, the at least one weighting factor is determined based on at least one of the following: the amount of time elapsed since the at least one corresponding failed scheduling request occurred, traffic characteristics associated with at least one of the first RAT and the second RAT, the priority associated with the at least one corresponding failed scheduling request, the burstiness characteristics of the at least one corresponding failed scheduling request, and the stability value associated with the at least one corresponding failed scheduling request.

[0044] According to one or more embodiments of this aspect, a resource allocation is selected from a set of available resource allocations, and the set of available resource allocations is determined based on whether the output of the cost function is higher than a threshold. According to one or more embodiments of this aspect, the threshold is determined based on traffic characteristics associated with at least one of the first RAT and the second RAT. According to one or more embodiments of this aspect, the method further includes updating the at least one weighting factor for calculating the cost function for a subsequent time period of the first time period. According to one or more embodiments of this aspect, the resource allocation corresponds to at least one of a control format indicator CFI Max configuration and a symbol configuration. According to one or more embodiments of this aspect, the network node is a distributed unit DU, which is configured to communicate with a radio unit, and the radio unit communicates with at least one wireless device, and scheduling of at least one transmission for the first time period includes configuring the radio unit using the CFI Max configuration. According to one or more embodiments of this aspect, the first RAT is a legacy RAT, and the second RAT is a non-legacy RAT.

[0045] According to another aspect of the present disclosure, an orchestrator node configured for dynamic spectrum sharing of a first RAT and a second RAT is provided. The orchestrator node is configured to: determine a first quantity of failed scheduling requests associated with the first RAT; based on the first quantity of the failed scheduling requests, determine the resource allocation for the first RAT and the second RAT for a first time period; and cause the resource allocation to be transmitted to a network node for scheduling at least one transmission with at least one wireless device for the first time period based on the resource allocation.

[0046] According to one or more embodiments of this aspect, determining the resource configurations for the first RAT and the second RAT for a first time period is also based on the first RAT traffic demand and the second RAT traffic demand.

[0047] According to one or more embodiments of this aspect, determining the resource configurations for the first RAT and the second RAT for a first time period includes calculating a cost function, where the cost function is calculated based on at least one of the following: a first number of failed scheduling requests associated with the first RAT, at least one weighting factor associated with at least one of the failed scheduling requests corresponding to the first number of failed scheduling requests associated with the first RAT, and a previous calculated cost associated with a previous time period prior to the first time period. According to one or more embodiments of this aspect, the at least one weighting factor is determined based on at least one of the following: the amount of time elapsed since the at least one corresponding failed scheduling request occurred, traffic characteristics associated with at least one of the first RAT and the second RAT, the priority associated with the at least one corresponding failed scheduling request, the burstiness characteristic of the at least one corresponding failed scheduling request, and a stability value associated with the at least one corresponding failed scheduling request.

[0048] According to one or more embodiments of this aspect, a resource configuration is selected from a set of available resource configurations, and the set of available resource configurations is determined based on whether the output of the cost function is higher than a threshold. According to one or more embodiments of this aspect, the threshold is determined based on traffic characteristics associated with at least one of the first RAT and the second RAT. According to one or more embodiments of this aspect, the orchestrator node is further configured to update at least one weighting factor for calculating the cost function for a subsequent time period of the first time period. According to one or more embodiments of this aspect, the resource configuration corresponds to at least one of a control format indicator CFI Max configuration and a symbol configuration. According to one or more embodiments of this aspect, the network node is a distributed unit DU, which is configured to communicate with a radio unit, and the radio unit communicates with at least one wireless device, and scheduling of at least one transmission for the first time period includes configuring the radio unit using the CFI Max configuration. According to one or more embodiments of this aspect, the first RAT is a legacy RAT and the second RAT is a non-legacy RAT.

[0049] According to another aspect of the present disclosure, a method implemented in an orchestrator node is provided. The orchestrator node is configured for dynamic spectrum sharing of a first RAT and a second RAT. Determine a first quantity of failed scheduling requests associated with the first RAT. Based on the first quantity of the failed scheduling requests, determine a resource configuration for the first RAT and the second RAT for a first time period. Cause the resource configuration to be transmitted to a network node for scheduling at least one transmission with at least one wireless device for the first time period based on the resource configuration.

[0050] According to one or more embodiments of this aspect, determining the resource configuration for the first RAT and the second RAT for the first time period is further based on the first RAT traffic demand and the second RAT traffic demand.

[0051] According to one or more embodiments of this aspect, determining the resource configuration for the first RAT and the second RAT for the first time period includes calculating a cost function, where the cost function is calculated based on at least one of the following: the first quantity of failed scheduling requests associated with the first RAT, at least one weighting factor associated with at least one failed scheduling request corresponding to the first quantity of failed scheduling requests associated with the first RAT, and a previous calculated cost associated with a previous time period before the first time period. According to one or more embodiments of this aspect, the at least one weighting factor is determined based on at least one of the following: the amount of time elapsed since the at least one corresponding failed scheduling request occurred, traffic characteristics associated with at least one of the first RAT and the second RAT, the priority associated with the at least one corresponding failed scheduling request, the burstiness characteristics of the at least one corresponding failed scheduling request, and the stability value associated with the at least one corresponding failed scheduling request.

[0052] According to one or more embodiments of this aspect, a resource configuration is selected from a set of available resource configurations, and the set of available resource configurations is determined based on whether the output of a cost function is higher than a threshold. According to one or more embodiments of this aspect, the threshold is determined based on traffic characteristics associated with at least one of a first RAT and a second RAT. According to one or more embodiments of this aspect, the method further includes updating the at least one weighting factor for calculating the cost function for a subsequent time period of the first time period. According to one or more embodiments of this aspect, the resource configuration corresponds to at least one of a control format indicator CFI Max configuration and a symbol configuration. According to one or more embodiments of this aspect, the network node is a distributed unit DU, which is configured to communicate with a radio unit, the radio unit communicates with at least one wireless device, and scheduling at least one transmission for a first time period includes configuring the radio unit using the CFI Max configuration. According to one or more embodiments of this aspect, the first RAT is a legacy RAT, and the second RAT is a non-legacy RAT. BRIEF DESCRIPTION OF THE DRAWINGS

[0053] A more complete understanding of the present embodiments and their attendant advantages and features will be more readily understood by reference to the following detailed description when considered in conjunction with the accompanying drawings, in which:

[0054] Figure 1 is a schematic diagram showing an example network architecture of a communication system connected to a host computer via an intermediate network according to the principles in the present disclosure;

[0055] Figure 2 is a block diagram of a host computer communicating with a wireless device via a network node via at least a partial wireless connection according to some embodiments of the present disclosure;

[0056] Figure 3 is a flowchart showing an example method for executing a client application at a wireless device implemented in a communication system including a host computer, a network node, and a wireless device according to some embodiments of the present disclosure;

[0057] Figure 4 is a flowchart showing an example method for receiving user data at a wireless device implemented in a communication system including a host computer, a network node, and a wireless device according to some embodiments of the present disclosure;

[0058] Figure 5 is a flowchart showing an example method for receiving user data from a wireless device at a host computer implemented in a communication system including a host computer, a network node, and a wireless device according to some embodiments of the present disclosure;

[0059] Figure 6is a flowchart showing an example method for receiving user data at a host computer in a communication system including a host computer, a network node, and a wireless device according to some embodiments of the present disclosure;

[0060] Figure 7 is a flowchart of an example process in a network node for adaptive CFI determination in dynamic spectrum sharing according to some embodiments of the present disclosure;

[0061] Figure 8 is a flowchart of an example process in an orchestrator node for adaptive CFI determination in dynamic spectrum sharing according to some embodiments of the present disclosure;

[0062] Figure 9 is a block diagram and a timing diagram depicting an example adaptive CFI determination in dynamic spectrum sharing according to some embodiments of the present disclosure;

[0063] Figure 10 is a block diagram depicting an example arbiter algorithm according to some embodiments of the present disclosure;

[0064] Figure 11 is a timing diagram depicting the output of an example arbiter algorithm over time according to some embodiments of the present disclosure;

[0065] Figure 12 is another timing diagram depicting the output of another example arbiter algorithm over time according to some embodiments of the present disclosure;

[0066] Figure 13 is a flowchart depicting an example adaptive CFI determination in dynamic spectrum sharing according to some embodiments of the present disclosure;

[0067] Figure 14 is a schematic diagram depicting an example communication link between a DSS cell and a cloud-based computing module; and

[0068] Figure 15 is a schematic diagram depicting an example O-RAN architecture for adaptive CFI determination in dynamic spectrum sharing according to some embodiments of the present disclosure. DETAILED DESCRIPTION

[0069] Before describing the example embodiments in detail, it should be noted that the embodiments mainly lie in combinations of apparatus components and processing steps related to adaptive CFI determination in dynamic spectrum sharing.

[0070] Accordingly, the components are represented by conventional symbols in the drawings where appropriate, showing only those specific details relevant to understanding the embodiments so as not to obscure the present disclosure with details that are obvious to those of ordinary skill in the art having the benefit of the description herein. Throughout the specification, the same numerals represent the same elements.

[0071] As used herein, relational terms such as "first" and "second", "top" and "bottom", etc. are used solely to distinguish one entity or element from another entity or element, and do not necessarily require or imply any physical or logical relationship or order between such entities or elements. The terms used herein are for the purpose of describing particular embodiments only and are not intended to limit the concepts described herein. As used herein, the singular forms "a", "an" and "the" are also intended to include the plural forms unless the context clearly dictates otherwise. It will be further understood that the terms "comprises", "comprising", "includes" and / or "including" when used herein specify the presence of the stated features, integers, steps, operations, elements and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.

[0072] In the embodiments described herein, terms such as "communicating with" can be used to indicate electrical or data communication, which can be achieved, for example, by physical contact, induction, electromagnetic radiation, radio signals, infrared signals or optical signals. Those of ordinary skill in the art will understand that multiple components can interoperate and that modifications and variations are possible to achieve electrical and data communication.

[0073] In some embodiments described herein, the terms "coupled", "connected", etc. can be used herein to indicate a connection, although not necessarily direct, and can include wired and / or wireless connections.

[0074] The term "network node" as used herein can be any kind of network node included in a radio network, which radio network can also include any one of the following: base station (BS), radio base station, base transceiver station (BTS), base station controller (BSC), radio network controller (RNC), g-node B (gNB), evolved node B (eNB or eNodeB), node B, multi-standard radio (MSR) radio node such as MSR BS, multi-cell / multicast coordination entity (MCE), integrated access and backhaul (IAB) node, relay node, donor node controlling the relay, radio access point (AP), transmission point, transmission node, remote radio unit (RRU) remote radio head (RRH), core network node (e.g., mobility management entity (MME), self-organizing network (SON) node, coordination node, positioning node, MDT node, etc.), external node (e.g., third-party node, node external to the current network), node in a distributed antenna system (DAS), spectrum access system (SAS) node, element management system (EMS), etc. The term "radio node" as used herein can also be used to denote a wireless device (WD) such as a wireless device (WD) or a radio network node.

[0075] In some embodiments, the non - restrictive terms wireless device (WD) or user equipment (UE) may be used interchangeably. Here, a WD can be any type of wireless device capable of communicating with a network node or another WD via radio signals, such as a wireless device (WD). A WD can also be a radio communication device, a target device, a device - to - device (D2D) WD, a machine - type WD or a WD capable of machine - to - machine communication (M2M), a low - cost and / or low - complexity WD, a sensor equipped with a WD, a tablet, a mobile terminal, a smart phone, a laptop - embedded equipped (LEE), a laptop - mounted device (LME), a USB dongle, a customer - premise equipment (CPE), an Internet of Things (IoT) device or a narrow - band IoT (NB - IoT) device, etc.

[0076] Furthermore, in some embodiments, the general term "radio network node" is used. It can be any type of radio network node, which can include any one of a base station, a radio base station, a base transceiver station, a base station controller, a network controller, an RNC, an evolved Node B (eNB), a Node B, a gNB, a multi - cell / multicast coordination entity (MCE), an IAB node, a relay node, an access point, a radio access point, a remote radio unit (RRU), a remote radio head (RRH).

[0077] In some embodiments, the terms central (or centralized) unit (e.g., CU or gNB - CU) and distributed (or decentralized) unit (e.g., DU or gNB - DU) are used. A CU (e.g., gNB - CU) can refer to a logical node that hosts higher - layer protocols and performs various gNB functions such as controlling the DU. Each DU can be a logical node that hosts lower - layer protocols and, according to the functional split, can include various subsets of gNB functions. Thus, each of the CU and DU can include various circuits required to perform their respective functions, including processing circuits, transceiver circuits (e.g., for communication) and power circuits. Furthermore, the terms "central unit" and "centralized unit" may be used interchangeably herein, and so may the terms "distributed unit" and "decentralized unit". A network node can refer to one or more radio units, DUs, CUs, gNB - DUs and / or gNB - CUs, etc.

[0078] Note that although terms from a specific wireless system such as, for example, 3GPP LTE and / or New Radio (NR) may be used in this disclosure, this should not be construed as limiting the scope of the disclosure to only the foregoing systems. Other wireless systems, including but not limited to Wideband Code Division Multiple Access (WCDMA), Worldwide Interoperability for Microwave Access (WiMax), Ultra Mobile Broadband (UMB), and Global System for Mobile Communications (GSM), may also benefit from the ideas covered by this disclosure.

[0079] It should also be noted that the functions described herein as being performed by a wireless device or a network node may be distributed over multiple wireless devices and / or network nodes. In other words, it is contemplated that the functions of the network nodes and wireless devices described herein are not limited to being performed by a single physical device and, in fact, may be distributed among several physical devices.

[0080] Unless otherwise defined, all terms used herein (including technical and scientific terms) have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. It will be further understood that the terms used herein should be interpreted as having a meaning that is consistent with their meaning in the context of this specification and the relevant art, and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.

[0081] Some embodiments provide for adaptive CFI determination in dynamic spectrum sharing.

[0082] Now referring to the drawings, in which like elements are indicated by like reference numerals, in Figure 1FIG. 0 shows a schematic diagram of a communication system 10 according to an embodiment, for example, a 3GPP-type cellular network that can support standards such as LTE and / or NR (5G), which includes an access network 12 such as a radio access network and a core network 14. The access network 12 includes a plurality of network nodes 16a, 16b, 16c (collectively referred to as network nodes 16), such as NB, eNB, gNB, or other types of radio access points, and each network node defines a corresponding coverage area 18a, 18b, 18c (collectively referred to as coverage areas 18). Each network node 16a, 16b, 16c can be connected to the core network 14 through a wired or wireless connection 20. A first wireless device (WD) 22a located in the coverage area 18a is configured to be wirelessly connected to the corresponding network node 16a or to be paged by the corresponding network node 16a. A second WD 22b in the coverage area 18b can be wirelessly connected to the corresponding network node 16b. Although a plurality of WDs 22a, 22b (collectively referred to as wireless devices 22) are shown in this example, the disclosed embodiments are equally applicable to the case where there is a single WD in the coverage area or a single WD is connected to the corresponding network node 16. Note that although only two WDs 22 and three network nodes 16 are shown for convenience, the communication system can include more WDs 22 and network nodes 16.

[0083] Moreover, it is expected that the WD 22 can communicate simultaneously and / or be configured to communicate with more than one network node 16 and more than one type of network node 16, respectively. For example, the WD 22 can have a dual connection with a network node 16 that supports LTE and the same or different network nodes 16 that support NR. As an example, the WD 22 can communicate with an eNB for LTE / E-UTRAN and a gNB for NR / NG-RAN.

[0084] The communication system 10 itself can be connected to a host computer 24, which can be implemented in the hardware and / or software of a stand-alone server, a cloud-implemented server, a distributed server, or as a processing resource in a server farm. The host computer 24 can be under the ownership or control of a service provider or can be operated by or on behalf of a service provider. The connections 26, 28 between the communication system 10 and the host computer 24 can extend directly from the core network 14 to the host computer 24 or can extend via an optional intermediate network 30. The intermediate network 30 can be one or a combination of more than one of a public, private, or managed network. If any, the intermediate network 30 can be a backbone network or the Internet. In some embodiments, the intermediate network 30 can include two or more sub-networks (not shown).

[0085] Figure 1The communication system as a whole enables connectivity between one of the connected WDs 22a, 22b and the host computer 24. This connectivity can be described as an over-the-top (OTT) connection. The host computer 24 and the connected WDs 22a, 22b are configured to transmit data and / or signaling via the OTT connection, using the access network 12, the core network 14, any intermediate network 30, and possibly other infrastructure (not shown) as intermediaries. The OTT connection can be transparent in the sense that at least some of the participating communication devices through which the OTT connection passes are unaware of the routing of the uplink and downlink communications. For example, the network node 16 may not or need not be informed about the routing of incoming downlink communications having data originating from the host computer 24 that is to be forwarded (e.g., handed over) to the connected WD 22a. Similarly, the network node 16 need not know the future routing of the outgoing uplink communication from the WD 22a to the host computer 24.

[0086] Figure 1 The communication system further includes an orchestrator node 31 and / or communicates with an orchestrator node 31, which can be any cloud-based node, cloud-based computing module, virtual network node, cloud-based server, etc., which is any node / computer / server / module / unit / etc. It is configured to direct / configure / control / orchestrate / modify / monitor / etc. one or more features / settings / parameters / configurations / etc. of the wireless communication network 10. The orchestrator node 31 can be part of one or more elements of the wireless communication system 10 and / or can be connected to one or more elements of the wireless communication system 10 (e.g., the network node 16, the WD 22, the core network 14, etc.) via, for example, the intermediate network 30, the connection 26, and / or the connection 28.

[0087] The network node 16 is configured to include a network node arbiter unit 32, which is configured for adaptive CFI determination in dynamic spectrum sharing. The orchestrator node 31 is configured to include an orchestrator arbiter unit 34, which is configured for adaptive CFI determination in dynamic spectrum sharing.

[0088] According to an embodiment, reference will now be made to Figure 2Describe an example implementation of the WD 22, network node 16, host computer 24, and orchestrator node 31 discussed in the previous paragraphs. In the communication system 10, the host computer 24 includes hardware (HW) 38, which includes a communication interface 40 configured to establish and maintain a wired or wireless connection with interfaces of different communication devices of the communication system 10. The host computer 24 further includes processing circuitry 42, which may have storage and / or processing capabilities. The processing circuitry 42 may include a processor 44 and a memory 46. In particular, in addition to or instead of a processor such as a central processing unit and a memory, the processing circuitry 42 may include an integrated circuit for processing and / or control, for example, one or more processors and / or processor cores and / or an FPGA (field programmable gate array) and / or an ASIC (application specific integrated circuit) suitable for executing instructions. The processor 44 may be configured to access (e.g., write to and / or read from) the memory 46, which may include any kind of volatile and / or non-volatile memory, such as a cache memory and / or a buffer memory and / or a RAM (random access memory) and / or a ROM (read only memory) and / or an optical memory and / or an EPROM (erasable programmable read only memory).

[0089] The processing circuitry 42 may be configured to control any method and / or process described herein and / or cause such method and / or process to be executed, for example, by the host computer 24. The processor 44 corresponds to one or more processors 44 for performing the functions of the host computer 24 described herein. The host computer 24 includes a memory 46 configured to store data, programming software code, and / or other information described herein. In some embodiments, the software 48 and / or the host application 50 may include instructions that, when executed by the processor 44 and / or the processing circuitry 42, cause the processor 44 and / or the processing circuitry 42 to perform the processes described herein with respect to the host computer 24. The instructions may be software associated with the host computer 24.

[0090] The software 48 may be executed by the processing circuitry 42. The software 48 includes the host application 50. The host application 50 is operable to provide services to remote users, such as via an OTT connection 52 terminated at the WD 22 and the host computer 24. When providing services to remote users, the host application 50 may provide user data transmitted using the OTT connection 52. "User data" may be the data and information described herein for implementing the described functions. In one embodiment, the host computer 24 may be configured to provide control and functionality to a service provider and may be operated by or on behalf of the service provider. The processing circuitry 42 of the host computer 24 may enable the host computer 24 to observe, monitor, control the network node 16, the orchestrator node 31, and / or the wireless device 22, and send to and / or receive from them.

[0091] The communication system 10 also includes a network node 16 disposed in the communication system 10 and includes hardware 58 enabling it to communicate with the host computer 24 and the WD 22. The hardware 58 may include a communication interface 60 for establishing and maintaining a wired or wireless connection for interfaces with different communication devices of the communication system 10, and a radio interface 62 for establishing and maintaining a wireless connection 64 at least with the WD 22 located in the coverage area 18 served by the network node 16. The radio interface 62 may be formed as or may include, for example, one or more RF transmitters, one or more RF receivers, and / or one or more RF transceivers. The communication interface 60 may be configured to facilitate a connection 66 with the host computer 24 and / or the orchestrator node 31. The connection 66 may be direct, or it may be through the core network 14 of the communication system 10 and / or through one or more intermediate networks 30 external to the communication system 10.

[0092] In the illustrated embodiment, the hardware 58 of the network node 16 also includes a processing circuit 68. The processing circuit 68 may include a processor 70 and a memory 72. In particular, in addition to or instead of a processor such as a central processing unit and a memory, the processing circuit 68 may include an integrated circuit for processing and / or control, for example, one or more processors and / or processor cores and / or an FPGA (Field Programmable Gate Array) and / or an ASIC (Application Specific Integrated Circuit) suitable for executing instructions. The processor 70 may be configured to access (e.g., write to and / or read from) the memory 72, which may include any kind of volatile and / or non-volatile memory, such as a cache and / or buffer memory and / or RAM (Random Access Memory) and / or ROM (Read Only Memory) and / or optical memory and / or EPROM (Erasable Programmable Read Only Memory).

[0093] Accordingly, network node 16 also has software 74 stored internally, for example, in memory 72 or in an external memory (such as a database, a storage array, a network storage device, etc.) accessible by network node 16 via an external connection. The software 74 can be executed by processing circuitry 68. The processing circuitry 68 can be configured to control any one of the methods and / or processes described herein and / or cause such methods and / or processes to be executed, for example, by network node 16. The processor 70 corresponds to one or more processors 70 for performing the functions of network node 16 described herein. The memory 72 is configured to store data, programming software code, and / or other information described herein. In some embodiments, the software 74 can include instructions that, when executed by the processor 70 and / or the processing circuitry 68, cause the processor 70 and / or the processing circuitry 68 to execute the processes described herein with respect to network node 16. For example, the processing circuitry 68 of network node 16 can include a network node arbiter unit 32 configured for adaptive CFI determination in dynamic spectrum sharing.

[0094] The communication system 10 also includes an orchestrator node 31 (and / or communicates therewith), which includes hardware 75 enabling it to communicate with the host computer 24, the network node 16, and / or the WD 22. The hardware 75 can include a communication interface 76 for establishing and maintaining a wired or wireless connection to interfaces of different communication devices of the communication system 10. The communication interface 76 can be configured to facilitate the connection 66 to the host computer 24, the network node 16, and / or the WD 22. The connection 66 can be direct, or it can be through the core network 14 of the communication system 10 and / or through one or more intermediate networks 30 external to the communication system 10.

[0095] In the illustrated embodiment, the hardware 75 of the orchestrator node 31 also includes processing circuitry 77. The processing circuitry 77 can include a processor 78 and a memory 79. In particular, in addition to or instead of a processor such as a central processing unit and a memory, the processing circuitry 77 can include an integrated circuit for processing and / or control, for example, one or more processors and / or processor cores and / or an FPGA (field programmable gate array) and / or an ASIC (application specific integrated circuit) suitable for executing instructions. The processor 78 can be configured to access (such as write to and / or read from) the memory 79, which can include any kind of volatile and / or non-volatile memory, such as a cache and / or a buffer memory and / or a RAM (random access memory) and / or a ROM (read only memory) and / or an optical memory and / or an EPROM (erasable programmable read only memory).

[0096] Accordingly, the orchestrator node 31 also has software 80 stored internally, for example, in the memory 79, or in an external memory (such as a database, a storage array, a network storage device, etc.) that can be accessed by the orchestrator node 31 via an external connection. The software 80 can be executed by the processing circuitry 77. The processing circuitry 77 can be configured to control any of the methods and / or processes described herein, and / or to cause such methods and / or processes to be executed, for example, by the orchestrator node 31. The processor 78 corresponds to one or more processors 78 for performing the functions of the orchestrator node 31 described herein. The memory 79 is configured to store data, programming software code, and / or other information described herein. In some embodiments, the software 80 can include instructions that, when executed by the processor 78 and / or the processing circuitry 77, cause the processor 78 and / or the processing circuitry 77 to perform the processes described herein with respect to the orchestrator node 31. For example, the processing circuitry 77 of the orchestrator node 31 can include an orchestrator arbiter unit 34 configured for adaptive CFI determination in dynamic spectrum sharing.

[0097] The communication system 10 also includes the WD 22 already mentioned. The WD 22 can have hardware 81, which can include a radio interface 82 configured to establish and maintain a wireless connection 64 with a network node 16 serving the coverage area 18 in which the WD 22 is currently located. The radio interface 82 can be formed as or can include, for example, one or more RF transmitters, one or more RF receivers, and / or one or more RF transceivers.

[0098] The hardware 81 of the WD 22 also includes processing circuitry 84. The processing circuitry 84 can include a processor 86 and a memory 88. In particular, in addition to or instead of a processor, such as a central processing unit and a memory, the processing circuitry 84 can include an integrated circuit for processing and / or control, such as one or more processors and / or processor cores and / or an FPGA (field programmable gate array) and / or an ASIC (application specific integrated circuit) suitable for executing instructions. The processor 86 can be configured to access (e.g., write to and / or read from) the memory 88, which can include any kind of volatile and / or non-volatile memory, such as a cache and / or a buffer memory and / or a RAM (random access memory) and / or a ROM (read only memory) and / or an optical memory and / or an EPROM (erasable programmable read only memory).

[0099] Accordingly, WD 22 may also include software 90, which is stored in a memory 88 at, for example, WD 22, or in an external memory accessible by WD 22 (e.g., a database, a storage array, a network storage device, etc.). The software 90 may be executed by the processing circuitry 84. The software 90 may include a client application 92. With the support of the host computer 24, the client application 92 may provide services to human or non-human users via WD 22. In the host computer 24, the executing host application 50 may communicate with the executing client application 92 via an OTT connection 52 terminating at WD 22 and the host computer 24. When providing services to a user, the client application 92 may receive request data from the host application 50 and provide user data in response to the request data. The OTT connection 52 may transmit the request data and the user data. The client application 92 may interact with the user to generate the user data it provides.

[0100] The processing circuitry 84 may be configured to control any of the methods and / or processes described herein and / or cause such methods and / or processes to be executed, for example, by WD 22. The processor 86 corresponds to one or more processors 86 for performing the functions of WD 22 described herein. WD 22 includes a memory 88, which is configured to store data, programming software code, and / or other information described herein. In some embodiments, the software 90 and / or the client application 92 may include instructions that, when executed by the processor 86 and / or the processing circuitry 84, cause the processor 86 and / or the processing circuitry 84 to perform the processes described herein with respect to WD 22.

[0101] In some embodiments, the internal workings of the network node 16, WD 22, and the host computer 24 may be as Figure 2 shown, and independently, the surrounding network topology may be Figure 1 of a network topology.

[0102] In Figure 2 , the OTT connection 52 has been abstractly drawn to illustrate the communication between the host computer 24 and the wireless device 22 via the network node 16 without explicitly referring to any intermediate devices and the exact routing of the messages via these devices. The network infrastructure may determine the routing, which may be configured to be hidden from WD 22 or from the service provider operating the host computer 24, or both. When the OTT connection 52 is active, the network infrastructure may further make a decision by which it dynamically changes the routing (e.g., based on load balancing considerations or reconfiguration of the network).

[0103] The wireless connection 64 between the WD 22 and the network node 16 is in accordance with the teachings of the embodiments described throughout this disclosure. One or more of the various embodiments improve the performance of the OTT services provided to the WD 22 using the OTT connection 52, where the wireless connection 64 can form the last leg. More precisely, the teachings of some of these embodiments can improve data rate, latency, and / or power consumption, thereby providing benefits such as reduced user waiting time, relaxed file size limitations, better responsiveness, extended battery life, etc.

[0104] In some embodiments, a measurement process can be provided for the purpose of monitoring data rate, latency, and other factors improved by one or more embodiments. There can also be optional network functions for reconfiguring the OTT connection 52 between the host computer 24 and the WD 22 in response to changes in the measurement results. The measurement process and / or network functions for reconfiguring the OTT connection 52 can be implemented in the software 48 of the host computer 24 or in the software 90 of the WD 22 or both. In an embodiment, sensors (not shown) can be deployed in or associated with the communication devices through which the OTT connection 52 passes; the sensors can participate in the measurement process by providing values of the monitored quantities exemplified above or other physical quantities from which the software 48, 90 can calculate or estimate the monitored quantities. The reconfiguration of the OTT connection 52 can include message format, retransmission settings, preferred routing, etc.; the reconfiguration need not affect the network node 16, and it may be unknown or imperceptible to the network node 16. Some such procedures and functions can be known and practiced in the art. In certain embodiments, the measurement can involve proprietary WD signaling that facilitates the host computer 24's measurement of throughput, propagation time, latency, etc. In some embodiments, the measurement can be implemented by having the software 48, 90 send messages, particularly empty or "dummy" messages, using the OTT connection 52 while monitoring propagation time, errors, etc.

[0105] Thus, in some embodiments, the host computer 24 includes a processing circuit 42 configured to provide user data and a communication interface 40 configured to forward the user data to the cellular network for transmission to the WD 22. In some embodiments, the cellular network further includes a network node 16 having a radio interface 62. In some embodiments, the network node 16 is configured to and / or the processing circuit 68 of the network node 16 is configured to perform the functions and / or methods described herein for preparing / initiating / maintaining / supporting / ending a transmission to the WD 22, and / or preparing / terminating / maintaining / supporting / ending the reception of a transmission from the WD 22.

[0106] In some embodiments, the host computer 24 includes processing circuitry 42 and a communication interface 40 configured to receive user data sourced from a transmission from the WD 22 to the network node 16. In some embodiments, the WD 22 is configured to and / or includes a radio interface 82 and / or processing circuitry 84 configured to perform the functions and / or methods described herein for preparing / initiating / maintaining / supporting / ending a transmission to the network node 16, and / or preparing / terminating / maintaining / supporting / ending reception of a transmission from the network node 16.

[0107] Although Figure 1 and Figure 2 illustrates various “units” such as a network node arbiter unit 32 and an orchestrator arbiter unit 34 within respective processors, it is contemplated that these units may be implemented such that a portion of the unit is stored in a corresponding memory within the processing circuitry. In other words, the units may be implemented in hardware or in a combination of hardware and software within the processing circuitry. Additionally, the network node arbiter unit 32 and / or the orchestrator arbiter unit 34 may be distributed across multiple network nodes 16 and / or orchestrator nodes 31.

[0108] Figure 3 is a flowchart showing an example method implemented in a communication system such as, for example, Figure 1 and Figure 2 The communication system may include a host computer 24, a network node 16, and a WD 22, which may be those described with reference to Figure 2 In a first step of the method, the host computer 24 provides user data (block S100). In an optional sub-step of the first step, the host computer 24 provides user data by executing a host application such as host application 50 (block S102). In a second step, the host computer 24 initiates a transmission carrying the user data to the WD 22 (block S104). In an optional third step, in accordance with the teachings of embodiments described throughout this disclosure, the network node 16 sends the user data carried in the transmission initiated by the host computer 24 to the WD 22 (block S106). In an optional fourth step, the WD 22 executes a client application, such as, for example, client application 92 associated with the host application 50 executed by the host computer 24 (block S108).

[0109] Figure 4 is a flowchart showing an example method implemented in a communication system such as, for example, Figure 1 The communication system may include a host computer 24, a network node 16, and a WD 22, which may be those described with reference to Figure 1 and Figure 2Those described. In a first step of the method, the host computer 24 provides user data (block S110). In an optional sub-step (not shown), the host computer 24 provides user data by executing a host application, such as host application 50. In a second step, the host computer 24 initiates a transmission carrying the user data to the WD 22 (block S112). According to the teachings of the embodiments described throughout this disclosure, the transmission can be passed via the network node 16. In an optional third step, the WD 22 receives the user data carried in the transmission (block S114).

[0110] Figure 5 is a flowchart illustrating an example method implemented in a communication system such as, for example Figure 1 of a communication system. The communication system can include a host computer 24, a network node 16, and a WD 22, which can be those referred to Figure 1 and 2 described. In an optional first step of the method, the WD 22 receives input data provided by the host computer 24 (block S116). In an optional sub-step of the first step, the WD 22 executes a client application 92 that provides user data in response to the received input data provided by the host computer 24 (block S118). Additionally or alternatively, in an optional second step, the WD 22 provides user data (block S120). In an optional sub-step of the second step, the WD provides user data by executing a client application such as client application 92 (block S122). When providing the user data, the executed client application 92 can further consider user input received from the user. Regardless of the specific manner in which the user data is provided, the WD 22 can initiate a transmission of the user data to the host computer 24 in an optional third sub-step (block S124). In a fourth step of the method, according to the teachings of the embodiments described throughout this disclosure, the host computer 24 receives the user data transmitted from the WD 22 (block S126).

[0111] Figure 6 is a flowchart illustrating an example method implemented in a communication system such as, for example Figure 1 of a communication system. The communication system can include a host computer 24, a network node 16, and a WD 22, which can be those referenced Figure 1 and Figure 2 described. In an optional first step of the method, according to the teachings of the embodiments described throughout this disclosure, the network node 16 receives user data from the WD 22 (block S128). In an optional second step, the network node 16 initiates a transmission of the received user data to the host computer 24 (block S130). In a third step, the host computer 24 receives the user data carried in the transmission initiated by the network node 16 (block S132).

[0112] Figure 7 It is a flowchart of an example process in network node 16 for adaptive CFI determination in dynamic spectrum sharing. One or more of the boxes described herein may be performed by one or more elements of network node 16, such as by processing circuitry 68 (including network node arbiter unit 32), processor 70, radio interface 62, and / or communication interface 60. Network node 16 is configured to determine (block S134) a first quantity of failed scheduling requests associated with a first RAT, determine (block S136) a resource configuration for the first RAT and a second RAT for a first time period based on the first quantity of failed scheduling requests, and optionally, schedule (block S138) at least one transmission with at least one wireless device 22 for the first time period based on the resource configuration.

[0113] In some embodiments, determining the resource configuration for the first RAT and the second RAT for the first time period is also based on a first RAT traffic demand and a second RAT traffic demand. In some embodiments, determining the resource configuration for the first RAT and the second RAT for the first time period includes calculating a cost function, where the cost function is calculated based on at least one of the following: a first quantity of failed scheduling requests associated with the first RAT, at least one weighting factor associated with at least one failed scheduling request corresponding to the first quantity of failed scheduling requests associated with the first RAT, and a previous calculated cost associated with a previous time period prior to the first time period. In some embodiments, the at least one weighting factor is determined based on at least one of the following: an amount of time elapsed since the at least one corresponding failed scheduling request occurred, a traffic characteristic associated with at least one of the first RAT and the second RAT, a priority associated with the at least one corresponding failed scheduling request, a burstiness characteristic of the at least one corresponding failed scheduling request, and a stability value associated with the at least one corresponding failed scheduling request.

[0114] In some embodiments, the resource configuration is selected from a set of available resource configurations, and the set of available resource configurations is determined based on whether the output of the cost function is higher than a threshold. In some embodiments, the threshold is determined based on traffic characteristics associated with at least one of the first RAT and the second RAT. In some embodiments, network node 16 is further configured to update the at least one weighting factor for calculating the cost function for a subsequent time period of the first time period. In some embodiments, the resource configuration corresponds to at least one of a control format indicator CFIMax configuration and a symbol configuration. In some embodiments, network node 16 is a distributed unit DU, which is configured to communicate with a radio unit, and the radio unit communicates with at least one wireless device 22. The scheduling of at least one transmission for a first time period includes configuring the radio unit using the CFI Max configuration. In some embodiments, the first RAT is a legacy RAT, and the second RAT is a non-legacy RAT.

[0115] Figure 8 is a flowchart of an example process in an orchestrator node 31 (e.g., a cloud-based orchestrator node 31, a DU orchestrator node 31, etc.) for adaptive CFI determination in dynamic spectrum sharing according to some embodiments of the present disclosure. One or more of the blocks described herein may be performed by one or more elements of the orchestrator node 31, such as by one or more of a processing circuit 77 (including an orchestrator arbiter unit 34), a processor 78, and / or a communication interface 76. The orchestrator node 31 is configured to determine (block S140) a first number of failed scheduling requests associated with the first RAT, determine (block S142) a resource configuration for the first RAT and the second RAT for a first time period based on the first number of failed scheduling requests, and cause a transmission of the resource configuration to network node 16 (block S134) to schedule at least one transmission with at least one wireless device 22 for the first time period based on the resource configuration.

[0116] In some embodiments, determining the resource allocation for the first RAT and the second RAT for the first time period is further based on the first RAT traffic demand and the second RAT traffic demand. In some embodiments, determining the resource allocation for the first RAT and the second RAT for the first time period includes calculating a cost function, where the cost function is calculated based on at least one of the following: the first number of failed scheduling requests associated with the first RAT, at least one weighting factor associated with at least one of the failed scheduling requests corresponding to the first number of failed scheduling requests associated with the first RAT, and the previous calculation cost associated with the previous time period prior to the first time period. In some embodiments, the at least one weighting factor is determined based on at least one of the following: the amount of time elapsed since the at least one corresponding failed scheduling request occurred, the traffic characteristics associated with at least one of the first RAT and the second RAT, the priority associated with the at least one corresponding failed scheduling request, the burstiness characteristics of the at least one corresponding failed scheduling request, and the stability value associated with the at least one corresponding failed scheduling request.

[0117] In some embodiments, the resource allocation is selected from a set of available resource allocations, and the set of available resource allocations is determined based on whether the output of the cost function is higher than a threshold. In some embodiments, the threshold is determined based on the traffic characteristics associated with at least one of the first RAT and the second RAT. In some embodiments, the orchestrator node is further configured to update the at least one weighting factor for calculating the cost function for a subsequent time period of the first time period. In some embodiments, the resource allocation corresponds to at least one of a control format indicator CFI Max configuration and a symbol configuration. In some embodiments, network node 16 is a distributed unit DU, which is configured to communicate with a radio unit, and the radio unit communicates with at least one wireless device 22. Scheduling of at least one transmission for the first time period includes configuring the radio unit using the CFI Max configuration. In some embodiments, the first RAT is a legacy RAT, and the second RAT is a non-legacy RAT.

[0118] The general processing flow of the arrangements of the present disclosure has been described and examples of the hardware and software arrangements for implementing the processes and functions of the present disclosure have been provided. The following sections provide details and examples of the arrangements for adaptive CFI determination in dynamic spectrum sharing.

[0119] Figure 9is a timing diagram depicting an example adaptive CFI determination in dynamic spectrum sharing according to some embodiments of the present disclosure. During time slot n, an LTE scheduler 94 (e.g., implemented in software 74 and / or processing circuitry 68 of (one or more) network nodes 16 and / or in software 80 and / or processing circuitry 77 of an orchestrator node 31) and an NR scheduler 96 (e.g., implemented in software 74 and / or processing circuitry 68 of (one or more) network nodes 16 and / or in software 80 and / or processing circuitry 77 of an orchestrator node 31) communicate with a network node arbiter unit 32 (and / or an orchestrator arbiter unit 34, Figure 9 not shown in the figure). The LTE scheduler 94 transmits LTE traffic demands, failed scheduling requests, etc. to the network node arbiter unit 32 (and / or the orchestrator arbiter unit 34). The NR scheduler 96 sends NR traffic demands to the network node arbiter unit 32 (and / or the orchestrator arbiter unit 34). The network node arbiter unit 32 (and / or the orchestrator arbiter unit 34) determines an LTE FCI Max value and transmits it to the LTE scheduler 94 and / or the NR scheduler 96.

[0120] Figure 10 is a block diagram describing an example network node arbiter unit 32 (and / or an orchestrator arbiter unit 34) algorithm according to some embodiments of the present disclosure. In some embodiments, a cost function can evaluate the performance of high-priority LTE scheduling requests.

[0121] The cost function can be employed (e.g., by the network node arbiter unit 32 and / or the orchestrator arbiter unit 34) to assist in the determination of LTE CFI Max, which in turn determines the number of OFDM symbols used in the NR PDSCH.

[0122] For example, in some embodiments, if the calculated cost is less than a target threshold (i.e., the performance of high-priority LTE traffic is satisfactory), then LTE CFI Max = 1 is enabled, thereby increasing the NR throughput performance. If the calculated cost is equal to or higher than the target threshold (i.e., the performance of high-priority LTE traffic is worse than the target), then LTE CFI Max = 1 is disabled, and a traditional LTE CFI Max algorithm can be employed.

[0123] The cost function (e.g., calculated by the network node arbiter unit 32 and / or the orchestrator arbiter unit 34) can consider (but is not limited to) the following factors:

[0124] · Failed scheduling requests for high-priority LTE traffic: The more the number of failed scheduling requests for high-priority LTE traffic, the higher the cost.

[0125] · A weighting factor for the most recent failed scheduling requests for high-priority LTE traffic and the past failed scheduling requests for high-priority LTE traffic.

[0126] An example cost function (e.g., calculated by the network node arbiter unit 32 and / or the orchestrator arbiter unit 34) is the exponentially weighted moving average of the number of failed high-priority LTE scheduling requests, which can be shown as follows:

[0127] Cost(t + 1) = alpha * nrofFailedHighPrioLteSrs(t) + (1 - alpha) * Cost(t)

[0128] Where

[0129] - nrofFailedHighPrioLteSrs(t) is the number of failed high-priority LTE

[0130] scheduling requests at time t

[0131] - Cost(t) is the cost at time t

[0132] - alpha is the weighting factor indicating how important the most recent failed LTE scheduling requests are relative to the past failed LTE scheduling requests.

[0133] Secondly, the LTE CFI Max parameter option is considered / evaluated (e.g., by the network node arbiter unit 32 and / or the orchestrator arbiter unit 34). Let f denote the LTE CFI Max determination algorithm:

[0134] lteCfiMax = f(a, b)

[0135] Where a and b are input parameters that govern the value of LTE CFI Max calculated by the algorithm f.

[0136] In some embodiments, (a, b) = (2, 3), where the minimum value of LTE CFI Max is 2 and the maximum value of LTE CFI Max is 3.

[0137] In the adaptive algorithm according to some embodiments of the present disclosure, through comparison, there can be multiple LTE CFI Max parameter options for (a, b). For example, (a, b) = {(2, 3), (1, 2)}.

[0138] The LTE CFI Max parameter option can be determined / calculated / selected (e.g., by the network node arbiter unit 32 and / or the orchestrator arbiter unit 34) based on a selection mechanism (described below), and the parameter option can then be passed to the LTE CFI Max algorithm. The LTE CFI Max algorithm can then output an LTE CFI Max value defined by a and b, and the LTE CFI Max value can be transmitted (e.g., by the network node arbiter unit 32 and / or the orchestrator arbiter unit 34) to the LTE scheduler 94 and / or the NR scheduler 96.

[0139] In some embodiments, the network node arbiter unit 32 and / or the orchestrator arbiter unit 34 can utilize an LTE CFI Max parameter selection mechanism among different LTE CFI Max parameter options.

[0140] For example, (a,b) = {(2,3),(1,2)}, there are two parameter options.

[0141] One embodiment of parameter selection between (2,3) and (1,2) can be based on cost function evaluation relative to a user-defined threshold.

[0142] For example, if cost(t) < threshold, then change (a,b) to (1,2); otherwise, change (a,b) to (2,3), where the threshold is an adjustable user-defined input parameter.

[0143] Another embodiment of parameter selection between (2,3) and (1,2) can be based on both the cost function and the cost change trajectory over time.

[0144] For example, if cost(t) < threshold or if the improvement rate > 10%, then change (a,b) to (1,2); otherwise, change (a,b) to (2,3).

[0145] Figure 11 and Figure 12 are timing diagrams depicting the algorithm output of an example network node arbiter unit 32 (and / or orchestrator arbiter unit 34) over time according to some embodiments of the present disclosure.

[0146] In Figure 11 the depicted example, the algorithm (e.g., implemented by the network node arbiter unit 32 and / or the orchestrator arbiter unit 34) is defined according to the following formula:

[0147] Cost(t + 1) = alpha * nrofFailedHighPrioLteSrs(t) + (1 - alpha) * Cost(t)

[0148] If cost < threshold, (a, b) = (1, 2); otherwise, (a, b) = (2, 3)

[0149] Reference Figure 11 , when the cost is below the target threshold, the performance of high-priority LTE traffic is satisfactory, and thus the system (e.g., network node arbiter unit 32 and / or orchestrator arbiter unit 34) can allocate more symbols to the NR PDSCH to increase the NR throughput (e.g., without sacrificing the performance of high-priority LTE traffic). When the cost exceeds the target threshold, the performance of high-priority LTE traffic is unsatisfactory, and the system (e.g., network node arbiter unit 32 and / or orchestrator arbiter unit 34) can allocate more symbols to the LTE PDCCH, which is correspondingly dominated by a higher value of LTE CFI Max.

[0150] In Figure 12 the example shown, the algorithm (e.g., implemented by network node arbiter unit 32 and / or orchestrator arbiter unit 34) is defined according to the following formula:

[0151] Cost(t + 1) = alpha * nrofFailedHighPrioLteSrs(t) + (1 - alpha) * Cost(t)

[0152] If cost < threshold or improvement rate > 10%, (a, b) = (1, 2); otherwise, (a, b) = (2, 3)

[0153] Reference Figure 12 , in one example, when the cost is below the target threshold or the improvement rate exceeds 10%, it means that the performance of high-priority LTE traffic is satisfactory or will soon be satisfactory (e.g., predicted to be satisfactory based on the improvement rate), and the system (e.g., via network node arbiter unit 32 and / or orchestrator arbiter unit 34) can allocate more symbols to the NR PDSCH, thereby increasing the NR throughput.

[0154] In this example, when the cost exceeds the target threshold and the improvement rate is less than 10%, the system (e.g., via network node arbiter unit 32 and / or orchestrator arbiter unit 34) can allocate more symbols to the LTE PDCCH, which is dominated by a higher value of LTE CFIMax.

[0155] Figure 13It is a flowchart depicting an example adaptive CFI determination in dynamic spectrum sharing according to some embodiments of the present disclosure (e.g., implemented by network node arbiter unit 32 and / or orchestrator arbiter unit 34). In step 1, set a weighting factor for the cost function (e.g., by network node arbiter unit 32 and / or orchestrator arbiter unit 34). In step 2, configure the LTE CFI Max parameter option (e.g., by network node arbiter unit 32 and / or orchestrator arbiter unit 34). In step 3, obtain a failed scheduling request for LTE traffic (e.g., high-priority LTE traffic) (e.g., via LTE scheduler 94). In step 4, calculate the cost (e.g., as described in any of the above examples). In step 5, select the LTE CFI Max parameter option based on the cost and the parameter selection algorithm (e.g., by network node arbiter unit 32 and / or orchestrator arbiter unit 34). In step 6, the LTE CFI Max parameter option is passed to the LTE CFI Max determination algorithm (e.g., within network node arbiter unit 32 and / or orchestrator arbiter unit 34). In step 7, determine (e.g., by network node arbiter unit 32 and / or orchestrator arbiter unit 34) the LTE CFI Max value to be used in the next time slot (e.g., time slot n + 1) after arbitration and transmit it to LTE scheduler 94 and / or NR scheduler 96. In step 8, increment the time slot (e.g., by network node arbiter unit 32 and / or orchestrator arbiter unit 34). In step 9, the algorithm (e.g., implemented by network node arbiter unit 32 and / or orchestrator arbiter unit 34) determines whether to change the weighting factor (described in more detail below). If the result of step 9 is "yes", the process returns to step 1, and the process repeats for subsequent time slots (e.g., in network node arbiter unit 32 and / or orchestrator arbiter unit 34). If the result of step 9 is "no", the process advances to step 10, and the algorithm (e.g., implemented by network node arbiter unit 32 and / or orchestrator arbiter unit 34) determines whether to change the set of LTE CFI Max parameter options. If the result of step 10 is "yes", the process advances to step 2, and the process repeats from step 2 forward. If the result of step 10 is "no", the process advances to step 3, and the process repeats from step 3 forward.

[0156] In some embodiments, it is expected that the traffic characteristics in different wireless networks are different, and when performing one or more of the above-described calculations, such differences can be considered, for example, by network node arbiter unit 32 and / or orchestrator arbiter unit 34. For example: Figure 13 This difference can be considered, for example, by network node arbiter unit 32 and / or orchestrator arbiter unit 34 when performing one or more of the above-described calculations. For example:

[0157] · High-priority LTE traffic can be very bursty in Network A and quasi-static in Network B.

[0158] · Thus, the weighting factor for the most recent failed scheduling request can be set (e.g., by Network Node Arbiter Unit 32 and / or Orchestrator Arbiter Unit 34) to a larger value for bursty high-priority LTE traffic, while a smaller value should be used (e.g., by Network Node Arbiter Unit 32 and / or Orchestrator Arbiter Unit 34) for high-priority LTE traffic that is relatively stable.

[0159] The (one or more) thresholds used (e.g., by Network Node Arbiter Unit 32 and / or Orchestrator Arbiter Unit 34) can also be a function of the traffic characteristics observed in the field in the LTE CFI Max parameter option selection algorithm, in some embodiments. For example, historical traffic characteristics can be used (e.g., by Network Node Arbiter Unit 32 and / or Orchestrator Arbiter Unit 34) to modify one or more of the calculations described, e.g., Figure 13 described above.

[0160] In some embodiments, only high-priority LTE traffic is considered. In other words, information about non-high-priority LTE traffic, such as failed requests associated with non-high-priority LTE traffic, is not considered in the LTE CFI Max determination calculation (e.g., by Network Node Arbiter Unit 32 and / or Orchestrator Arbiter Unit 34). In other embodiments, all (or a certain subset) of the LTE traffic is considered (e.g., by Network Node Arbiter Unit 32 and / or Orchestrator Arbiter Unit 34), such that higher-priority LTE traffic (and associated failed requests) can be weighted more heavily than lower-priority LTE traffic. The priority level associated with the (failed) LTE traffic request can be indicated (e.g., by LTE Scheduler 94), and / or can be determined (e.g., by Network Node Arbiter Unit 32 and / or Orchestrator Arbiter Unit 34), e.g., based on one or more characteristics of the LTE traffic (e.g., quality of service (QoS) requirements associated with the traffic, emergency vs. non-emergency communication associated with the traffic, etc.).

[0161] Parameter scanning and / or optimization can be utilized (e.g., by Network Node Arbiter Unit 32 and / or Orchestrator Arbiter Unit 34) to further improve the performance trade-off between NR throughput performance and high-priority LTE traffic performance.

[0162] In some embodiments, a cloud-based implementation can be used, such as Figure 14Depicted in the architecture shown, where DSS cell 18 (e.g., served by network node 16) communicates with the orchestrator node 31 via connection 66, which can be, for example, a "fast" connection such as a high-speed wired connection, and the orchestrator node 31 can be cloud-based (e.g., a cloud-based server). The orchestrator node 31 includes a processor 78, which includes an orchestrator arbiter unit 34 that implements the adaptive LTE CFI Max determination algorithm as described herein.

[0163] In some embodiments, radio resource arbitration in dynamic spectrum sharing can be performed on a per-slot basis in a baseband unit (e.g., the processing circuitry 68 of (one or more) network nodes 16), and / or can be performed according to other time scales. Due to the strict latency requirements in some systems, performing resource arbitration outside of the baseband unit (e.g., in a cloud-based server such as the orchestrator node 31) can pose challenges.

[0164] In some embodiments of the present disclosure, implementing the adaptive LTE CFI Max determination algorithm inside the network node arbiter unit 32 and / or the orchestrator arbiter unit 34 may require a slight increase in the computational complexity of resource arbitration, but such (one or more) algorithms may not require a computational complexity that becomes a bottleneck in a cloud-based implementation.

[0165] The DSS cell 18 (and / or network node 16) can send the following information to an interested orchestrator node 31 (e.g., residing in the cloud):

[0166] a) Traffic demand; and / or

[0167] b) A failed scheduling request for LTE traffic (e.g., high-priority LTE traffic).

[0168] After receiving the required input, the orchestrator node 31 (e.g., the orchestrator arbiter unit 34 and / or the processing circuitry 77) can:

[0169] a) Calculate a cost function as described herein;

[0170] b) Configure a set of LTE CFI Max parameter options as described herein;

[0171] c) Select an LTE CFI Max parameter option as described herein;

[0172] d) Execute the LTE CFI Max determination algorithm; and / or

[0173] e) Send the LTE CFI Max value back to the DSS cell 18 / network node 16.

[0174] Figure 15Depicts an example O-RAN implementation according to some embodiments of the present disclosure, which compares traditional radio resource arbitration with adaptive radio resource arbitration according to embodiments of the present disclosure.

[0175] In some Open Radio Access Network (O-RAN) architectures, the network node arbiter unit 32 (and / or the orchestrator arbiter unit 34) for DSS typically resides in the distributed unit (DU) / network node 16 / orchestrator node 31 / etc. because this pertains to MAC layer resource allocation.

[0176] In embodiments of the present disclosure, the network node arbiter unit 32 and / or the orchestrator arbiter unit 34 can be incorporated in the DU within the network node 16 (and / or in a cloud-based server, e.g., the orchestrator node 31, not shown in Figure 15 ), as part of the O-RAN implementation, and in some embodiments, this can be accomplished without changing any existing radio units, central units, platforms, applications, etc.

[0177] As will be understood by those skilled in the art, the concepts described herein can be embodied as a method, a data processing system, a computer program product, and / or a computer storage medium storing executable computer programs. Thus, the concepts described herein can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects, all of which are generally referred to herein as "circuitry" or "modules" herein. Any process, step, action, and / or functionality described herein can be performed by and / or associated with a corresponding module, which can be implemented in software and / or firmware and / or hardware. Additionally, the present disclosure can take the form of a computer program product on a tangible computer-usable storage medium having computer program code embodied in the medium that is executable by a computer. Any suitable tangible computer-readable medium can be utilized, including a hard disk, a CD-ROM, an electronic storage device, an optical storage device, or a magnetic storage device.

[0178] Some embodiments are described herein with reference to flowcharts and / or block diagrams of methods, systems, and computer program products. It should be understood that each block of the flowcharts and / or block diagrams, and combinations of blocks in the flowcharts and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer (thereby creating a special-purpose computer), a special-purpose computer, or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device create means for implementing the functions / actions specified in one or more of the blocks of the flowchart and / or block Figure 1 diagram.

[0179] These computer program instructions can also be stored in a computer-readable memory or storage medium, which can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction means for implementing the functions / acts specified in the flowchart and / or block(s). Figure 1 or more of the functions / acts specified in the block(s).

[0180] The computer program instructions can also be loaded onto a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, such that the instructions executed on the computer or other programmable device provide steps for implementing the functions / acts specified in the flowchart and / or block(s). For example, depending on the functions / acts involved, two consecutive blocks shown in succession may actually be executed substantially concurrently, or the blocks may sometimes be executed in reverse order. Although some of the figures include arrows on communication paths to show the primary direction of communication, it should be understood that communication can occur in the direction opposite to that depicted by the arrows. Figure 1 or more of the functions / acts specified in the block(s). For example, depending on the functions / acts involved, two consecutive blocks shown in succession may actually be executed substantially concurrently, or the blocks may sometimes be executed in reverse order. Although some of the figures include arrows on communication paths to show the primary direction of communication, it should be understood that communication can occur in the direction opposite to that depicted by the arrows.

[0181] The computer program code for performing the operations of the concepts described herein can be written in an object-oriented programming language such as Python, or C++. However, the computer program code for performing the operations of the present disclosure can also be written in a conventional procedural programming language, such as the "C" programming language. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on the remote computer. In the latter case, the remote computer can be connected to the user's computer through a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0182] Numerous different embodiments are disclosed herein in connection with the above description and the drawings. It should be understood that literally describing and illustrating every combination and subcombination of these embodiments would be overly repetitive and confusing. Accordingly, all embodiments can be combined in any manner and / or combination, and this specification, including the drawings, should be construed as constituting a complete written description of all combinations and subcombinations of the embodiments described herein and the manner and process of making and using them, and should support claims to any such combination or subcombination.

[0183] Abbreviations used in the foregoing description include:

[0184] DSS Dynamic Spectrum Sharing

[0185] CFI Control Format Indicator

[0186] OFDM Orthogonal Frequency Division Multiplexing

[0187] PDCCH Physical Downlink Control Channel

[0188] PDSCH Physical Downlink Shared Channel

[0189] Those skilled in the art will understand that the embodiments described herein are not limited to what is specifically shown and described above. Further, unless stated to the contrary above, it should be noted that all the drawings are not drawn to scale. Various modifications and variations are possible in light of the above teachings without departing from the scope of the appended claims.

Claims

1. A network node (16) configured for dynamic spectrum sharing of a first radio access technology (RAT) and a second RAT, the network node (16) comprising processing circuitry (68) configured to: Determine a first quantity of failed scheduling requests associated with the first RAT; Based on the first quantity of failed scheduling requests, determine a resource configuration for the first RAT and the second RAT for a first time period; and Optionally, based on the resource configuration, schedule at least one transmission with at least one wireless device (22) for the first time period.

2. The network node (16) according to claim 1, Wherein, The determination of the resource configuration for the first RAT and the second RAT for the first time period is further based on a first RAT traffic demand and a second RAT traffic demand.

3. The network node (16) according to claim 2, Wherein, The determination of the resource configuration for the first RAT and the second RAT for the first time period includes calculating a cost function, the cost function being calculated based on at least one of the following: The first quantity of failed scheduling requests associated with the first RAT; At least one weighting factor associated with at least one failed scheduling request corresponding to at least one of the first quantity of failed scheduling requests associated with the first RAT; And A previous calculated cost associated with a previous time period prior to the first time period.

4. The network node (16) according to claim 3, Wherein, The at least one weighting factor is determined based on at least one of the following: The amount of time elapsed since the at least one corresponding failed scheduling request occurred; Traffic characteristics associated with at least one of the first RAT and the second RAT; The priority associated with the at least one corresponding failed scheduling request; The burstiness characteristic of the at least one corresponding failed scheduling request; And A stability value associated with the at least one corresponding failed scheduling request.

5. The network node (16) according to claims 3 and 4, Wherein, The resource configuration is selected from a set of available resource configurations; and The set of available resource configurations is determined based on whether the output of the cost function is higher than a threshold.

6. The network node (16) according to claim 5, Wherein, The threshold is determined based on traffic characteristics associated with at least one of the first RAT and the second RAT.

7. The network node (16) according to any one of claims 3-6, Wherein, The processing circuitry (68) is further configured to update the at least one weighting factor for calculating the cost function for a subsequent time period of the first time period.

8. The network node (16) according to any one of claims 3-7, Wherein, The resource configuration corresponds to at least one of the following: A control format indicator CFIMax configuration; and A symbol configuration.

9. The network node (16) according to claim 8, Wherein, The network node (16) is a distributed unit DU, which is configured to communicate with a radio unit that communicates with the at least one wireless device (22), and the scheduling of the at least one transmission for the first time period includes configuring the radio unit using the CFI Max configuration.

10. The network node (16) according to any one of claims 1-9, wherein, the first RAT is a legacy RAT and the second RAT is a non-legacy RAT.

11. A method implemented in a network node (16), the method comprises: determining (S134) a first number of failed scheduling requests associated with a first radio access technology (RAT); determining (S136) a resource configuration for the first RAT and the second RAT for a first time period based on the first number of failed scheduling requests; and optionally (S138), scheduling at least one transmission with the at least one wireless device (22) for the first time period based on the resource configuration.

12. The method according to claim 11, wherein, the determining of the resource configuration for the first RAT and the second RAT for the first time period is further based on a first RAT traffic demand and a second RAT traffic demand.

13. The method according to claim 12, wherein, the determining of the resource configuration for the first RAT and the second RAT for the first time period includes calculating a cost function, which is calculated based on at least one of the following: the first number of failed scheduling requests associated with the first RAT; at least one weighting factor associated with at least one of the failed scheduling requests corresponding to the first number of failed scheduling requests associated with the first RAT; and a previous calculated cost associated with a previous time period prior to the first time period.

14. The method according to claim 13, wherein, the at least one weighting factor is determined based on at least one of the following: the amount of time elapsed since the at least one corresponding failed scheduling request occurred; traffic characteristics associated with at least one of the first RAT and the second RAT; the priority associated with the at least one corresponding failed scheduling request; the burstiness characteristic of the at least one corresponding failed scheduling request; and the stability value associated with the at least one corresponding failed scheduling request.

15. The method according to claims 13 and 14, wherein, the resource configuration is selected from a set of available resource configurations; and the set of available resource configurations is determined based on whether the output of the cost function is higher than a threshold.

16. The method according to claim 5, wherein, the threshold is determined based on traffic characteristics associated with at least one of the first RAT and the second RAT.

17. The method according to any one of claims 13-16, further comprising updating the at least one weighting factor for calculating the cost function for a subsequent time period of the first time period.

18. The method according to any one of claims 13 - 17, wherein, the resource allocation corresponds to at least one of the following: Control Format Indicator CFI Max configuration; and Symbol configuration.

19. The method according to claim 18, wherein, the network node (16) is a Distributed Unit DU, which is configured to communicate with a radio unit, the radio unit communicates with the at least one wireless device (22), and the scheduling of the at least one transmission for the first time period includes configuring the radio unit using the CFI Max configuration.

20. The method according to any one of claims 11 - 19, wherein, the first RAT is a legacy RAT and the second RAT is a non - legacy RAT.

21. An orchestrator node (31), configured for dynamic spectrum sharing of a first Radio Access Technology (RAT) and a second RAT, the orchestrator node (31) includes a processing circuit (77), which is configured to: determine a first number of failed scheduling requests associated with the first RAT; based on the first number of failed scheduling requests, determine a resource allocation for the first RAT and the second RAT for a first time period; and cause a transmission of the resource allocation to the network node (16) to schedule at least one transmission with at least one wireless device (22) for the first time period based on the resource allocation.

22. The orchestrator node (31) according to claim 21, wherein, the determination of the resource allocation for the first RAT and the second RAT for the first time period is further based on a first RAT traffic demand and a second RAT traffic demand.

23. The orchestrator node (31) according to claim 22, wherein, the determination of the resource allocation for the first RAT and the second RAT for the first time period includes calculating a cost function, and the cost function is calculated based on at least one of the following: the first number of failed scheduling requests associated with the first RAT; at least one weighting factor associated with at least one failed scheduling request corresponding to at least one of the first number of failed scheduling requests associated with the first RAT; and a previous calculated cost associated with a previous time period before the first time period.

24. The orchestrator node (31) according to claim 23, wherein, the at least one weighting factor is determined based on at least one of the following: the amount of time elapsed since the at least one corresponding failed scheduling request occurred; traffic characteristics associated with at least one of the first RAT and the second RAT; the priority associated with the at least one corresponding failed scheduling request; the burstiness characteristic of the at least one corresponding failed scheduling request; and a stability value associated with the at least one corresponding failed scheduling request.

25. The orchestrator node (31) according to claims 23 and 24, wherein, the resource allocation is selected from a set of available resource allocations; and The set of available resource configurations is determined based on whether the output of the cost function is higher than a threshold value.

26. The orchestrator node (31) according to claim 25, wherein, the threshold value is determined based on traffic characteristics associated with at least one of the first RAT and the second RAT.

27. The orchestrator node (31) according to any one of claims 23-26, wherein, the processing circuit (77) is further configured to update the at least one weighting factor for calculating the cost function for a subsequent time period of the first time period.

28. The orchestrator node (31) according to any one of claims 23-27, wherein, the resource configuration corresponds to at least one of the following: Control Format Indicator CFIMax configuration; and Symbol configuration.

29. The orchestrator node (31) according to claim 28, wherein, the network node (16) is a Distributed Unit DU, which is configured to communicate with a radio unit, and the radio unit communicates with the at least one wireless device (22). Scheduling of the at least one transmission for the first time period includes configuring the radio unit using the CFI Max configuration.

30. The orchestrator node (31) according to any one of claims 21-29, wherein, the first RAT is a legacy RAT and the second RAT is a non-legacy RAT.

31. A method implemented in an orchestrator node (31), the orchestrator node being configured for dynamic spectrum sharing of a first Radio Access Technology (RAT) and a second RAT, the method comprises: determining (S140) a first number of failed scheduling requests associated with the first RAT; based on the first number of failed scheduling requests, determining (S142) resource configurations for the first RAT and the second RAT for a first time period; and causing (S144) transmission of the resource configurations to a network node (16) to schedule at least one transmission with at least one wireless device (22) for the first time period based on the resource configurations.

32. The method according to claim 31, wherein, the determining of the resource configurations for the first RAT and the second RAT for the first time period is further based on first RAT traffic demand and second RAT traffic demand.

33. The method according to claim 32, wherein, the determining of the resource configurations for the first RAT and the second RAT for the first time period includes calculating a cost function, the cost function being calculated based on at least one of the following: the first number of failed scheduling requests associated with the first RAT; at least one weighting factor associated with at least one failed scheduling request corresponding to the first number of failed scheduling requests associated with the first RAT; and a previous calculated cost associated with a previous time period before the first time period.

34. The method according to claim 33, wherein, the at least one weighting factor is determined based on at least one of the following: The amount of time elapsed since the at least one corresponding failed scheduling request occurred; Traffic characteristics associated with at least one of the first RAT and the second RAT; The priority associated with the at least one corresponding failed scheduling request; The burstiness characteristics of the at least one corresponding failed scheduling request; and The stability value associated with the at least one corresponding failed scheduling request.

35. The method according to claims 33 and 34, wherein, The resource configuration is selected from a set of available resource configurations; and The set of available resource configurations is determined based on whether the output of the cost function is higher than a threshold.

36. The method according to claim 35, wherein, The threshold is determined based on traffic characteristics associated with at least one of the first RAT and the second RAT.

37. The method according to any one of claims 33-36, further comprising updating the at least one weighting factor for calculating the cost function for a subsequent time period of the first time period.

38. The method according to any one of claims 33-37, wherein, The resource configuration corresponds to at least one of the following: Control Format Indicator CFI Max configuration; and Symbol configuration.

39. The method according to claim 38, wherein, The network node (16) is a Distributed Unit DU, which is configured to communicate with a radio unit, and the radio unit communicates with the at least one wireless device (22), and the scheduling of the at least one transmission for the first time period includes configuring the radio unit using the CFI Max configuration.

40. The method according to any one of claims 31-39, wherein, The first RAT is a legacy RAT and the second RAT is a non-legacy RAT.

Images