Converging resource shares for multi vendor multi rat spectrum sharing

Abstract

In accordance with example embodiments of the invention there is at least a method or an apparatus to perform communicating or creating in a communication network information comprising an intended resource usage table indication, identifying specific resources needed and a current number of tokens; communicating or creating an intended resource usage table identifying specific resources provided over a period of time for an allocation period in a communication network; communicating a resource allocation for application by the initiating distributed unit, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from allocating distributed unit; and applying the resource allocation.

Description

CONVERGING RESOURCE SHARES FOR MULTI VENDOR MULTI RATSPECTRUM SHARINGTECHNICAL FIELD:

[0001] The teachings in accordance with the exemplary embodiments of this invention relate generally to fairly distributing resources between radio technology cells such as 5G and 6G MRSS cells and, more specifically, relate to fairly distributing resources between radio technology cells such as 5G and 6G MRSS cells ensuring that the high-priority requests from each cell are addressed before attending to lower- priority traffic from these cells.BACKGROUND:

[0002] This section is intended to provide a background or context to the invention that is recited in the claims. The description herein may include concepts that could be pursued, but are not necessarily ones that have been previously conceived or pursued. Therefore, unless otherwise indicated herein, what is described in this section is not prior art to the description and claims in this application and is not admitted to be prior art by inclusion in this section.

[0003] Certain abbreviations that may be found in the description and / or in the Figures are herewith defined as follows:DSS Dynamic Spectrum SharingDU Distributed UnitEMBB Enhanced Mobile BroadbandEN-DC E-UTRA NR Dual connectivityMRSS Multi RAT Spectrum SharingNR New RadioPDCCH Physical Downlink Control ChannelPRB Physical Resource BlocksPUCCH Physical Uplink Control ChannelRAT Radio Access TechnologyRBG Resource Block GroupRE Resource ElementRRC Radio Resource ControlUE User Equipment

[0004] 3 GPP Release 15 at the time of this application did not specify a specific framework for DSS nodes to coordinate their scheduling however, a framework was defined for ENDC in another standard. The ENDC solution is based on:• each DU defining a set of protected resources and communicating this to the other DU; and• exchanging the intended resource usage in the procedure E-UTRA - NR Cell Resource Coordination.

[0005] It is noted that no dedicated resource management entity has been defined by 3GPP for DSS. Further, 3GPP did not define an algorithm how to allocate resources.

[0006] Example embodiments of this invention propose improved operations for at least the procedures noted above such as for resource scheduling coordination.SUMMARY:

[0007] This section contains examples of possible implementations and is not meant to be limiting.

[0008] In another example aspect of the invention, there is an apparatus, such as a network side apparatus, comprising: at least one processor; and at least one non- transitory memory storing instructions, that when executed by the at least one processor, cause the apparatus at least to: create an intended resource usage tableidentifying specific resources needed over a period of time for an allocation period in a communication network; communicate with an allocating distributed unit of a communication network information comprising the intended resource usage table identifying the specific resources needed and a current number of tokens; receive from the allocating distributed unit a resource allocation, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from initiating distributed unit; and apply the resource allocation.

[0009] In still another example aspect of the invention, there is a method, comprising: creating an intended resource usage table identifying specific resources needed over a period of time for an allocation period in a communication network; communicating with an allocating distributed unit of a communication network information comprising the intended resource usage table identifying the specific resources needed and a current number of tokens; receiving from the allocating distributed unit a resource allocation, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from initiating distributed unit; and applying the resource allocation.

[0010] A further example embodiment is an apparatus and a method comprising the apparatus and the method of the previous paragraphs, wherein the specific resources comprise resources with different priorities, wherein the resource allocation comprises allocated protected resources, wherein there is coordinating an aperiodic request trigger of a resource update procedure, wherein the aperiodic request trigger of the resource update procedure is triggered when there is a change in a traffic load over a time less than a predetermined time, wherein there is, based on the trigger, communicating with the allocating distributed unit a resource coordination request and the current number of tokens as part of the resource coordination request, wherein the allocation period is one of established via O&M configuration, wherein a number of tokens for an allocation period can be established via O&M , and wherein the O&M configuration is on the specific tokens and parameters related to token usage, wherein there is maintaining a token bucket; increasing the token bucket by a percentage of the number of tokens for the allocation period; requesting no more resources in the intended resource table usage as available in the token bucket, secure higher-priority allocation of resources of the specific resources needed comprising utilizing larger specific tokenscompared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one; reducing the token bucket according to the received resource allocation, wherein requested and allocated resources are utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one, allocated but non-requested resources are not utilizing tokens, wherein more than two priority levels corresponding to a different number of tokens can be used, wherein there is adding spare tokens from previous allocations to currently allocated tokens, wherein the spare tokens are based on a combined intended resource usage being more than 100% of available resources, wherein there is establishing a policy for a maximum number of tokens that can be used over the allocation period; and establishing a period of time after which unused tokens are to be discarded, wherein the intended resource usage table is corresponding to at least one of a frequency of the allocation period or a period of time of the allocation period, wherein the communication network comprises a multi-rat spectrum sharing cell, wherein a resource corresponds to a resource element or area of resource elements in the time and frequency domain; or a RRC connected UE, wherein two or more priorities are used and wherein higher priority corresponds to higher counting of tokens, wherein a share of tokens of the initiating distributed unit is 50% or other value, wherein the share of tokens of the initiating distributed unit is not configured via OAM, but is adapting over time to the NR / 6G market occupancy, wherein there is alternating roles of the initiating distributed unit and allocating distributed unit based on a resulting token bucket size after resource allocation, wherein a distributed unit with a larger bucket size will be a next initiating distributed unit, and wherein in case of a tie roles, a next allocation period is alternated compared to the current one, wherein there is communicating with a mediator entity of the communication network, to obtain a conflict resolution, wherein there is performing iteratively a procedure to rank resources of the resource allocation in descending order, wherein there is determining an investment in terms of tokens per resource; wherein there is communicating the resource request and investment to the initiating distributed unit; wherein there is determining resolve conflicts by comparing the investment per resource and allocating the resource to a distributed unit with higher investment, wherein failed investments can be used in a next iteration, and wherein the procedure is iterated until all resourcesare allocated, wherein there is, after a final iteration the allocations are exchanged between distributed units for cross validation.

[0011] A non-transitory computer-readable medium storing program code, the program code executed by at least one processor to perform at least the method as described in the paragraphs above.

[0012] In yet another example aspect of the invention, there is an apparatus comprising: means for creating an intended resource usage table identifying specific resources needed over a period of time for an allocation period in a communication network; means for communicating with an allocating distributed unit of a communication network information comprising the intended resource usage table identifying the specific resources needed and a current number of tokens; receiving from the allocating distributed unit a resource allocation, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from initiating distributed unit; and means for applying the resource allocation.

[0013] In accordance with the example embodiments as described in the paragraph above, at least the means for creating, communicating, receiving, and applying comprises a network interface, and computer program code stored on a computer-readable medium and executed by at least one processor.

[0014] In another example aspect of the invention, there is an apparatus, such as a network side apparatus, comprising: at least one processor; and at least one non- transitory memory storing instructions, that when executed by the at least one processor, cause the apparatus at least to: communicate with an initiating distributed unit of a communication network information comprising an intended resource usage table indication, identifying specific resources needed and a cun-ent number of tokens; create an intended resource usage table identifying specific resources provided over a period of time for an allocation period in a communication network; send towards the initiating distributed unit a resource allocation for application by the initiating distributed unit, wherein the resource allocation is using an allocating distributed unitintended resource usage table based on the intended resource usage table from allocating distributed unit and apply the resource allocation.

[0015] In still another example aspect of the invention, there is a method, comprising: communicating with an initiating distributed unit of a communication network information comprising an intended resource usage table indication, identifying specific resources needed and a current number of tokens; creating an intended resource usage table identifying specific resources provided over a period of time for an allocation period in a communication network; sending towards the initiating distributed unit a resource allocation for application by the initiating distributed unit, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from allocating distributed unit and apply the resource allocation.

[0016] A further example embodiment is an apparatus and a method comprising the apparatus and the method of the previous paragraphs, wherein there is resolving a conflict by targeting a resource share corresponding to current token ratio between the initiating distributed unit and the allocating distributed unit, wherein the conflict is based on a conflicting time of the intended resource usage of the initiating distributed unit with the allocating distributed unit, wherein the resolving comprises adding a resource allocation step using the token ratio to support fairness of resource allocations, wherein the token ratio is based on an available token count, wherein the resolving comprises all resources are re-allocated without conflicts, wherein fewer resources than requested are allocated, and wherein a number of tokens is reduced according to its resource allocation, wherein allocated resources that have not been requested are not counted as tokens, and protected resources are counted as one token, wherein there is, based on the conflict not being resolved at the time, determining a resolution to a conflict in the specific resources considering the priorities of the requested resources; and based on the determining, target a resource share corresponding to the token ratio of allocated resources to resolve the conflict, wherein the resource allocation using the allocating distributed unit intended resource usage table is increasing a cost of tokens by for resources on otherwise unused slots, wherein the resource allocation comprises allocated protected resources, wherein there is one of processing an aperiodic request by calculating a new allocation or rejecting theaperiodic request by waiting until an end of a current allocation period, wherein there is maintaining a token bucket, wherein there is increasing the token bucket by a percentage of the number of tokens for the allocation period; requesting no more resources in the intended resource table usage as available in the token bucket, secure higher-priority allocation of resources of the specific resources needed comprising utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one; wherein there is reducing the token bucket according to the received resource allocation, wherein requested and allocated resources are utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one, allocated but non-requested resources are not utilizing tokens, wherein more than two priority levels corresponding to a different number of tokens can be used, wherein resources with same priorities and requested by the allocating distributed unit are allocated such the ratio of allocated resources corresponds to a ratio of tokens of both the allocating distributed unit and the allocating initiating distributed unit, wherein there is exchanging with the initiating distributed unit already allocated resources that are shared, wherein the already allocated resources comprise protected resources allocated to a respective radio access technology, wherein already allocated resources including the protected resources are used to determine the token ratio, wherein there is adding spare tokens from previous allocations to currently allocated tokens, wherein the spare tokens are based on a combined intended resource usage being more than 100% of available resources, wherein there is establishing a policy for a maximum number of tokens that can be used over the allocation period; and establishing a period of time after which unused tokens are to be discarded, wherein the allocating distributed unit comprises a distributed unit that is paired with a distributed unit of the network node, wherein the intended resource usage table is corresponding to at least one of a frequency of the allocation period or a period of time of the allocation period, wherein the communication network comprises a multi-rat spectrum sharing cell, wherein the allocating distributed unit is embodied in a mediator entity of the communication network, wherein there is alternating roles of the initiating distributed unit and allocating distributed unit based on a resulting token bucket size after resource allocation, wherein a distributed unit with a larger bucket size will be a next initiatingdistributed unit, and wherein in case of a tie roles, a next allocation period is alternated compared to the current one, wherein there is communicating with a mediator entity of the communication network, to obtain a conflict resolution, wherein there is performing iteratively a procedure to rank resources of the resource allocation in descending order; wherein there is determining an investment in terms of tokens per resource, wherein there is communicating the resource request and investment to the initiating distributed unit, wherein there is resolving conflicts by comparing the investment per resource and allocating the resource to a distributed unit with higher investment, wherein failed investments can be used in a next iteration, wherein the procedure is iterated until all resources are allocated, wherein there is, after a final iteration the allocations are exchanged between distributed units for cross validation.

[0017] In yet another example aspect of the invention, there is an apparatus comprising: means for communicating with an initiating distributed unit of a communication network information comprising an intended resource usage table indication, identifying specific resources needed and a current number of tokens; means for creating an intended resource usage table identifying specific resources provided over a period of time for an allocation period in a. communication network; and means for sending towards the initiating distributed unit a resource allocation for application by the initiating distributed unit, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from allocating distributed unit; and means for applying the resource allocation

[0018] In accordance with the example embodiments as described in the paragraph above, at least the means for communicating, sending, and applying comprises a network interface, and computer program code stored on a computer- readable medium and executed by at least one processor.

[0019] A communication system comprising allocating and initiating distributed unit apparatuses comprising the network side apparatus performing operations as described above.BRIEF DESCRIPTION OF THE DRAWINGS:

[0020] The above and other aspects, features, and benefits of various embodiments of the present disclosure will become more fully apparent from the following detailed description with reference to the accompanying drawings, in which like reference signs are used to designate like or equivalent elements. The drawings are illustrated for facilitating better understanding of the embodiments of the disclosure and are not necessarily drawn to scale, in which:

[0021] FIG. 1 shows a NR DU and a 6G DU communicating directly with each other;

[0022] FIG. 2 shows a resource scheduling coordination in accordance with example embodiments of the invention;

[0023] FIG. 3 shows a resource allocation table where an intended resource usage by both technologies is indicated as (1) indicating a low priority, or (2) indicating a high priority resource;

[0024] FIG. 4 shows a resource allocation table where after allocating resources requested by one DU and considering priorities, there are the following allocations;

[0025] FIG. 5 shows a resource allocation table where remaining tokens are 50- 30=20 for DU1 and 110-90=20 for DU, and not yet allocated resources are allocated with a 1:1 ratio;

[0026] FIG. 6 shows a high level block diagram of various devices used in carrying out various aspects of the invention; and

[0027] FIG. 7A and FIG. 7B each show a method in accordance with example embodiments of the invention which may be performed by an apparatus.DETAILED DESCRIPTION:

[0028] In example embodiments of this invention there is proposed at least a method and apparatus for fairly distributing resources between radio technology cell such as 5G and 6G MRSS cells ensuring that the high-priority requests from each cell are addressed before attending to lower-priority traffic from these cells.

[0029] The fair distribution of resources between 5G and 6G MRSS cells, with the aim of maximizing the likelihood of allocating higher-priority resources to the corresponding DU, has not been defined as of now.

[0030] As similarly stated above, 3 GPP Release 15 did not specify a specific framework for DSS nodes to coordinate their scheduling however, a framework was defined for ENDC in TS36.423.

[0031] The ENDC solution is based on:• each DU defining a set of protected resources and communicating this to the other DU; and• exchanging the intended resource usage in the procedure E-UTRA - NR Cell Resource Coordination.

[0032] No dedicated resource management entity has been defined by 3 GPP for DSS.

[0033] 3GPP did not define an algorithm how to allocate resources: 36.423, clause 8.7.15.1:During the procedure, the eNB and en-gNB shall exchange their intended resource allocations for data traffic, and, if possible, converge to a shared resource.

[0034] This application provides in accordance with example embodiments of the invention an implemented DSS using a dedicated resource management entity.

[0035] For MRSS, the expectation is that a day 1 6G MRSS cell may need to support additional services in addition to eMBB, such as Voice calls. The support of high priority traffic in the 6G MRSS cell requires a different approach on coordination of resources for MRSS Cells.

[0036] Without defining intended resource usage and without defining how to resolve contending requests for the same resource there is no guarantee that both DUs converge on a fair resource share or even at all. E.g., one DU might always request more resources than it needs, or it might never release resources if both DUs contend for all resources. Note that the fair sharing of resources here does not necessarily mean a 50-50% split of resources between the 5G and 6G MRSS cells, but an optimal split of resources in a manner where the highest priority requests of each MRSS cell can be served in an appropriate manner prior to serving other lower priority traffic of the MRSS cells.

[0037] Resources are of different relevance for a DU, e.g., for configured grants it is important that a DU can use the resources corresponding to the configured grants across the whole allocation period.

[0038] The proposal presents an algorithm for the DUs:• to converge on a non-conflicting resource allocation,• the allocation being fair to both DUs, i.e., on long term an agreed share of resources is achieved, while still the resource usage is stilly dynamic on short term,• allowing the DUs to indicate priority of resources and increases the probability that a DU gets these higher priority resources allocated.

[0039] Each DU of an MRSS deployment is allocated a number of tokens and parameters associated with the token usage for an established allocation period:• The tokens correspond to the number of resources a DU can request over a period of time. The number of tokens per allocation period can vary based on e.g. the available shared resources per allocation period;• The parameters may correspond to number of tokens required for different scenarios;• Token validity: Timer which establishes the validity period for a token which may be larger than the allocation period.

[0040] A DU determines to transmit a resource coordination request to its paired DU (other DU of the MRSS cell) using its tokens to indicate a priority request for a set of resources. The DU determination to employ its tokens could be based on:• Traffic load in the period: for example, in low traffic periods, tokens could be not used as the resources are not needed;• Energy saving state: If the RU is in an energy saving state which is required to be exited, the use of tokens could be mandated;Priority of allocation: If a high priority allocation is required such as C-plane transmissions e.g., or tied to a high priority service like a voice call;• Number of tokens available and number of tokens required for the request. For example, a higher priority allocation of certain resources could require two tokens per resource instead of one.

[0041] A DU receiving a resource coordination request, based on its planned scheduling determines whether to override a resource request based on its token usage and transmits the planned resource sharing to the paired DU.Each DU reduces its token count based on employed tokens for the allocation period.

[0042] For each allocation period there is a number of tokens corresponding to the number of resources in the allocation period. For each allocation period, a DU may request resources according to its available tokens. In a period with low traffic load, it may save tokens for limited later use. In case of conflicting resources one DU resolves the conflicts targeting a resource share corresponding to current token ratio of the DUs. The number of tokens of each DU is then reduced according to the allocated resources. Higher priority resources are more costly in these token calculations. This scheme gives an incentive to the DUs to use its tokens economically and not greedily requesting as many resources as possible.

[0043] The solution extends the 3GPP DSS solution, of• exchanging a table of intended resource usage with one dimension corresponding to the frequency domain and the other dimension corresponding to the time domain across the allocation period;• defining a set of protected resources per RAT, which are always allocated to the respective RAT.

[0044] FIG. 6 shows a high level block diagram of various devices used in carrying out various aspects of the invention. Before describing the example embodiments as disclosed herein in detail, reference is made to FIG. 6 for illustrating a simplified block diagram of various electronic devices that are suitable for use in practicing the example embodiments of this invention.

[0045] FIG. 6 shows a block diagram of one possible and non-limiting exemplary system in which the example embodiments may be practiced. In FIG. 6, a user equipment (UE) 10 is in wireless communication with a wireless network 1 or network, 1 as in FIG. 6. The wireless network 1 or network 1 as in FIG. 6 can comprise a communication network such as a mobile network e.g., the mobile network 1 or first mobile network as disclosed herein. Any reference herein to a wireless network 1 as in FIG. 6 can be seen as a reference to any wireless network as disclosed herein. Further, the wireless network 1 as in FIG. 6 can also comprises hardwired features as may berequired by a communication network. A UE is a wireless, typically mobile device that can access a wireless network. The UE, for example, may be a mobile phone (or called a "cellular" phone) and / or a computer with a mobile terminal function. For example, the UE or mobile terminal may also be a portable, pocket, handheld, computer- embedded or vehicle-mounted mobile device and performs a language signaling and / or data exchange with the RAN.

[0046] The UE 10 includes one or more processors DP 10A, one or more memories MEM 10B, and one or more transceivers TRANS 10D interconnected through one or more buses. Each of the one or more transceivers TRANS 10D includes a receiver and a transmitter. The one or more buses may be address, data, or control buses, and may include any interconnection mechanism, such as a series of lines on a motherboard or integrated circuit, fiber optics or other optical communication equipment, and the like. The one or more transceivers TRANS 10D which can be optionally connected to one or more antennas for communication to NN 12 and NN 13, respectively. The one or more memories MEM 10B include computer program code PROG 10C. The UE 10 communicates with NN 12 and / or NN 13 via a wireless link 11 or 16.

[0047] The NN 12 (NR / 5G / 6G Node B, an evolved NB, or LTE device) is a network node such as a master or secondary node base station (e.g., for NR or LTE long term evolution) that communicates with devices such as NN 13 and UE 10 of FIG. 6. The NN 12 provides access to wireless devices such as the UE 10 to the wireless network 1. The NN 12 includes one or more processors DP 12A, one or more memories MEM 12B, and one or more transceivers TRANS 12D interconnected through one or more buses. In accordance with the example embodiments these TRANS 12D can include X2 and / or Xn interfaces for use to perform the example embodiments. Each of the one or more transceivers TRANS 12D includes a receiver and a transmitter. The one or more transceivers TRANS 12D can be optionally connected to one or more antennas for communication over at least link 11 with the UE 10. The one or more memories MEM 12B and the computer program code PROG 12C are configured to cause, with the one or more processors DP 12A, the NN 12 to perform one or more of the operations as described herein. The NN 12 may communicate with another gNB oreNB, or a device such as the NN 13 such as via link 16 or link 18. Further, the link 11, link 16 and / or any other link may be wired or wireless or both and may implement, e.g., an X2 or Xn interface. Further the link 11 and / or link 16 and / or link 18 may be through other network devices such as, but not limited to an NCE / MME / SGW / UDM / PCF / AMF / SMF / LMF 14 device as in FIG. 6. The NN 12 may perform functionalities of an MME (Mobility Management Entity) or SGW (Serving Gateway), such as a User Plane Functionality, and / or an Access Management functionality for LTE and similar functionality for 5G or 6G.

[0048] The NN 13 can be for WiFi or Bluetooth or other wireless device associated with a mobility function device such as an AMF or SMF, further the NN 13 may comprise a NR / 5G / 6G Node B or possibly an evolved NB a base station such as a master or secondary node base station (e.g., for NR or LTE long term evolution) that communicates with devices such as the NN 12 and / or UE 10 and / or the wireless network 1. The NN 13 includes one or more processors DP 13 A, one or more memories MEM 13B, one or more network interfaces, and one or more transceivers TRANS 13D interconnected through one or more buses. In accordance with the example embodiments these network interfaces of NN 13 can include X2 and / or Xn interfaces for use to perform the example embodiments. Each of the one or more transceivers TRANS 13D includes a receiver and a transmitter that can optionally be connected to one or more antennas. The one or more memories MEM 13B include computer program code PROG 13C. For instance, the one or more memories MEM 13B and the computer program code PROG 13C are configured to cause, with the one or more processors DP 13 A, the NN 13 to perform one or more of the operations as described herein. The NN 13 may communicate with another mobility function device and / or eNB such as the NN 12 and the UE 10 or any other device using, e.g., link 11 or link 16 or link 18 or another link. The link 16 or link 18 as shown in FIG. 6 can be used for communication with the NN12. These links maybe wired or wireless or both and may implement, e.g., an X2 or Xn interface. Further, as stated above the link 11 and / or link 16 and / or link 18 may be through other network devices such as, but not limited to an NCE / MME / SGW device such as the NCE / MME / SGW / UDM / PCF / AMF / SMF / LMF

[0049] The one or more buses of the device of FIG. 6 may be address, data, or control buses, and may include any interconnection mechanism, such as a series of lines on a motherboard or integrated circuit, fiber optics or other optical communication equipment, wireless channels, and the like. For example, the one or more transceivers TRANS 12D, TRANS 13D and / or TRANS 10D may be implemented as a remote radio head (RRH), with the other elements of the NN 12 being physically in a different location from the RRH, and these devices can include one or more buses that could be implemented in part as fiber optic cable to connect the other elements of the NN 12 to a RRH.

[0050] It is noted that although FIG. 6 shows a network nodes such as NN 12 and NN 13, any of these nodes may can incorporate or be incorporated into an eNodeB or eNB or gNB such as for LTE and NR, and would still be configurable to perform example embodiments.

[0051] Also it is noted that description herein indicates that “cells” perform functions, but it should be clear that the gNB that forms the cell and / or a user equipment and / or mobility management function device that will perform the functions. In addition, the cell makes up part of a gNB, and there can be multiple cells per gNB.

[0052] The wireless network 1 or any network it can represent may or may not include a NCE / MME / SGW / UDM / PCF / AMF / SMF / LMF 14 that may include (NCE) network control element functionality, MME (Mobility Management Entity) / SGW (Serving Gateway) functionality, and / or serving gateway (SGW), and / or MME (Mobility Management Entity) and / or SGW (Serving Gateway) functionality, and / or user data management functionality (UDM), and / or PCF (Policy Control) functionality, and / or Access and Mobility Management Function (AMF) functionality, and / or Session Management (SMF) functionality, and / or Location Management Function (LMF), and / or Authentication Server (AUSF) functionality and which provides connectivity with a further network, such as a telephone network and / or a data communications network (e.g., the Internet), and which is configured to perform any 5G, 6G, and / or NR operations in addition to or instead of other standard operations at the time of this application. The NCE / MME / SGW / UDM / PCF / AMF / SMF / LMF 14 is configurable toperform operations in accordance with example embodiments in any of an LTE, NR, 5G, 6G, and / or any standards based communication technologies being performed or discussed at the time of this application. In addition, it is noted that the operations in accordance with example embodiments, as performed by the NN 12 and / or NN 13, may also be performed at the NCE / MME / SGW / UDM / PCF / AMF / SMF / LMF 14.

[0053] The NCE / MME / SGW / UDM / PCF / AMF / SMF / LMF 14 includes one or more processors DP 14 A, one or more memories MEM 14B, and one or more network interfaces (N / W I / F(s)), interconnected through one or more buses coupled with the link 13 and / or link 16 and / or link 18. In accordance with the example embodiments these network interfaces can include X2 and / or Xn interfaces for use to perform the example embodiments. The one or more memories MEM 14B include computer program code PROG 14C. The one or more memories MEM14B and the computer program code PROG 14C are configured to, with the one or more processors DP 14A, cause the NCE / MME / SGW / UDM / PCF / AMF / SMF / LMF 14 to perform one or more operations which may be needed to support the operations in accordance with the example embodiments.

[0054] It is noted that that the NN 12 and / or NN 13 and / or UE 10 can be configured (e.g. based on standards implementations etc.) to perform functionality of a Location Management Function (LMF). The LMF functionality may be embodied in any of these network devices or other devices associated with these devices. In addition, an LMF such as the LMF of the MME / SGW / UDM / PCF / AMF / SMF / LMF 14 of FIG. 6, as at least described below, can be co-located with UE 10 such as to be separate from the NN 12 and / or NN 13 of FIG. 6 for performing operations in accordance with example embodiments as disclosed herein.

[0055] The wireless Network 1 may implement network virtualization, which is the process of combining hardware and software network resources and network functionality into a single, software-based administrative entity, a virtual network. Network virtualization involves platform virtualization, often combined with resource virtualization. Network virtualization is categorized as either external, combining many networks, or parts of networks, into a virtual unit, or internal, providing network-likefunctionality to software containers on a single system. Note that the virtualized entities that result from the network virtualization are still implemented, at some level, using hardware such as processors DP10, DP12A, DP13A, and / or DP14A and memories MEM 10B, MEM 12B, MEM 13B, and / or MEM 14B, and also such virtualized entities create technical effects.

[0056] The computer readable memories MEM 12B, MEM 13B, and MEM 14B may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as semiconductor based memory devices, flash memory, magnetic memory devices and systems, optical memory devices and systems, fixed memory and removable memory. The computer readable memories MEM 12B, MEM 13B, and MEM 14B may be means for performing storage functions. The processors DP10, DP12A, DP13A, and DP14A may be of any type suitable to the local technical environment, and may include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs) and processors based on a multi-core processor architecture, as non-limiting examples. The processors DP 10, DP12A, DP 13 A, and DP14A may be means for performing functions, such as controlling the UE 10, NN 12, NN 13, and other functions as described herein.

[0057] In general, various embodiments of any of these devices can include, but are not limited to, cellular telephones such as smart phones, tablets, personal digital assistants (PDAs) having wireless communication capabilities, portable computers having wireless communication capabilities, image capture devices such as digital cameras having wireless communication capabilities, gaming devices having wireless communication capabilities, music storage and playback appliances having wireless communication capabilities, Internet appliances permitting wireless Internet access and browsing, tablets with wireless communication capabilities, as well as portable units or terminals that incorporate combinations of such functions.

[0058] Further, the various embodiments of any of these devices can be used with a UE vehicle, a High Altitude Platform Station, or any other such type nodeassociated with a terrestrial network or any drone type radio or a radio in aircraft or other airborne vehicle or a vessel that travels on water such as a boat.

[0059] Some novel enhancements in accordance with example embodiments of the invention include:• Allowing to indicate resource priorities with associated higher cost;• Adding a resource allocation step, using the token ratio. This ensures long term fairness of the allocations;• Using a token-based approach to resolve contention among resource requests;• Exchanging the result of the resource allocation and requesting the DUs to follow this resource allocation;• Checking conformance to the solution as allocations and a number of tokens are exchanged.

[0060] The overall setup is depicted below. An NR DU and a 6G DU communicating directly with each other.

[0061] FIG. 1 shows a NR DU and a 6G DU communicating directly with each other.

[0062] For each allocation period there is a number of tokens corresponding to the number of resources in the allocation period. The number of tokens per allocation procedure can be established via O&M or could be provided from one DU to another, e.g., DU1 receives an O&M configuration on the number of tokens and parameters related to token usage and determines informs DU2 of these. Each DU maintains a set of tokens. For the sake of simplicity, in the following explanation, one resource corresponds to one resource element (RE). The proposal is cell specific, i.e., tokens and allocations are processed per pair of NR and 6G cells.

[0063] Protected resources are exchanged in a separate step, they are not negotiated but always allocated to the corresponding RAT.

[0064] Essential technical features in accordance with example embodiments of the invention can include:1. Allocating several tokens and parameters, associated with the token usage, corresponding to the number of resources in the allocation period;2. DU1 creates a table with intended resource usage using its tokens and transmits it with a resource coordination request to DU2;3. DU2 based on its planned scheduling determines whether to override a resource request based on its token usage and transmits the planned resource sharing in resource coordination response to the DU1 ;4. Each DU reduces its token count based on employed tokens for the allocation period.

[0065] When there is a conflict of resources, DU2 can resolve the conflicts by targeting a resource share corresponding to the current token ratio of the DUs. Reserving higher-priority resources involves utilizing a larger number of tokens compared to lower-priority resources, thereby enhancing the likelihood of securing higher-priority resources for the respective DU.

[0066] Some example embodiments of the invention can also include the number of tokens per allocation procedure and can be established via O&M or could be provided from one DU to another. Example embodiments of the invention can include:5. DU1 and DU2 share 50% each of the total number of tokens allocated;6. If the DUs request the same resource and the priorities differ, then the resource is given to the DU indicating higher priority;7. Resources with the same priorities and requested by both DUs are allocated to each DU such that the ratio of allocated resources corresponds to the ratio of tokens of both DUs;8. Already allocated resources, including protected resources, are considered when calculating the ratios;9. The parameters may correspond to the number of tokens required for different scenarios;10. High priority resources are counted as two tokens;11. The spare tokens from previous allocations are added to the currently allocated tokens;12. A policy may be established for the maximum number of tokens a specific DU can use over an allocation period and a period of time after which unused tokens are to be discarded.

[0067] FIG. 2 shows a resource scheduling coordination in accordance with example embodiments of the invention;

[0068] As shown in step 210 of FIG. 2 the DU1 is updating it’s tokens, in this case an increase. As shown in step 220 of FIG. 2 the DU 1 send to the DU2 a resource coordination request. As shown in step 230 of FIG. 2 the DU2 is also updating its tokens, in this case an increase. As shown in step 240 of FIG.2 the DU 2 is performing resource allocation. As shown in step 250 of FIG. 2 the DU2 is again updating its tokens, in this case a decrease. As shown in step 260 of FIG. 2 the DU 2 send to the DU 1 a resource coordination response. As shown in step 270 of FIG. 2 the DU 1 is again updating its tokens, in this case a decrease. As shown in step 280 of FIG. 2 the DU1 isapplying a resource allocation. Then as shown in step 290 of FIG. 2 the DU2 is applying a resource allocation.

[0069] A procedure in accordance with example embodiments of the invention starts by one of the DUs - DU1 - adding 50% of the tokens for the whole allocation period to its set.

[0070] Then DU 1 creates the table with intended resource usage, using at most resources corresponding to its number of tokens. DU1 may indicate specific resources as high priority, these are counted as two tokens.

[0071] DU1 sends the table to DU2 (resource coordination request). As part of the request message, DU 1 sends its current number of tokens to DU2.

[0072] DU2 updates its set of tokens as well by 50% of the tokens for the allocation period and DU2 creates a similar table of intended resource usage. Note, DU2 has an advantage, because it does not have to commit to using tokens until it needs to. To compensate for this advantage, DU2 may be restricted to use less than 50%, e.g., 45% or 40% of the tokens for the allocation period or may be allocated less tokens per allocation period.

[0073] DU2 may consider the intended resource usage of DU1 in creating its intended resource usage, but it may also have intended resource usage which conflicts with DU1.

[0074] Note, as the DUs may have spare tokens from previous allocations, the combined intended resource usage may be more than 100% of available resources. A policy may also be established for the maximum number of tokens a specific DU can use over an allocation period and a period of time after which unused tokens are to be discarded. This policy can be established via O&M or could be instructed from one DU to another, e.g., DU1 sets the policy and informs DU2.

[0075] DU2 then performs the resource allocation step, according to the following rules:• Protected resources are allocated to the corresponding DU;• Resources requested by one DU only are allocated to this DU;• If the DUs request the same resource and the priorities differ, then the resource is given to the DU indicating higher priority;• Resources with same priorities and requested by both DUs are allocated to each DU such the ratio of allocated resources corresponds to the ratio of tokens of both DUs:• Already allocated resources including protected resources, are considered when calculating the ratios,• Note, resources should be allocated in a way meaningful to the RATs, considering the mapping of REs to PRBs and PRBs to RBGs, forming large blocks both in resource and time domains, etc. A pre-agreement on possible mappings of REs to PRBs and RBGs can be performed in an initial step;• Resources which have not been requested by any DU are allocated as well to the DUs, similarly to resources with same priority, i.e., all resources of the allocation period are actually allocated and may be used in case the traffic load increases throughout the period.

[0076] All resources are actually allocated, but without conflicts. Note, each DU may be allocated fewer resources than it requested. DU2 reduces its number of tokens according to its resource allocation. Again, high priority resources are counted as two tokens. Allocated resources that have not been requested are not counted. Protected resources are counted as one token.

[0077] DU2 sends the allocation to DU1 (resource coordination response), together with its number of tokens.

[0078] DU1 reduces its set of tokens according to the resulting allocation.

[0079] At the beginning of the next allocation period, the allocation is applied by both DUs.

[0080] The next allocation round is triggered by the DU having more tokens, which implies that the allocation is performed by the DU with fewer tokens. Again, it is beneficial for a DU to use its resources economically as otherwise the allocation changes to the other DU.

[0081] Some examples in accordance with example embodiments of the invention include:

[0082] Assume that DU1 has used all its tokens in previous allocation periods, DU2 still has 60 tokens and there are 100 resources in the allocation period. Each of DU1 and DU2 get 50 tokens, resulting in 50 and 110 tokens for DU1 and DU2 respectively.

[0083] FIG. 3 shows a resource allocation table where an intended resource usage by the technologies is indicated as (1) indicating a low priority, or (2) indicating a high priority resource.

[0084] DU2 intends to use as much as possible resources, i.e., resources corresponding to 110 tokens.

[0085] After allocating resources requested by one DU and considering priorities, there are the following allocations in accordance with example embodiments of the invention:

[0086] FIG. 4 shows a resource allocation table where after allocating resources requested by one DU. The allocations as shown in FIG. 4 are considering priorities.

[0087] The remaining tokens are 50-30=20 for DU1 and 110-90=20 for DU2. The not yet allocated resources are allocated with a 1 :1 ratio, e.g. resulting in the table as shown in FIG. 5.

[0088] FIG. 5 shows a resource allocation table where remaining tokens are 50- 30=20 for DU1 and 110-90=20 for DU, and not yet allocated resources are allocated with a 1:1 ratio;

[0089] As 15 resources cannot be shared 1:1, one resource was allocated arbitrarily to DU2. Note, other placements of these resources are possible.

[0090] The remaining tokens for the next allocation round are 50-37=13 for DU1 and 110-98=12 for DU2.

[0091] Without loss of generality, allocation periods may be in the order of a few 100ms. Tokens should not be accumulated indefinitely, such that the resources are shared over a limited period of time, e.g., 5 minutes. Fairness of resource usage is achieved then over such an allocation sharing interval. To do so, the number of tokens should be capped to 50% of resources of the allocation sharing interval.

[0092] The proposed solution is intended for multi-vendor MRSS between NR and 6G, but it might be used as well for single vendor MRSS to avoid a centralized entity. It may also be used for spectrum sharing among other RATs.

[0093] The proposed solution can be extended in various ways:• High priority resources can be counted as more or less tokens than exactly two tokens;Using more than two priority levels, with a corresponding increase of tokens per resource;• Instead of triggering the procedure periodically, one DU could trigger the procedure aperiodic or aperiodically in case there is a sudden increase in traffic load. In such case, this DU would also send a resource coordination request. The other DU may accept this aperiodic request by calculating a new allocation and passing it back, or it may reject this aperiodic request by waiting until the end of the current allocation period. There is no change of message content, but the timing may change;• Instead of assigning the tokens equally to each RAT , the tokens could be assigned unbalanced, e.g., 30% for 6G and 70% for NR. As both DUs belong to the same operator, the operator could thereby express a preference for one DU;• The token assignment may also be dynamic, e.g., based on NR-6G market occupancy;• The proposal can be applied to other types of resources as well, e.g., amount of RRC connected UEs;• Consider energy efficiency, by increasing the cost of tokens by e.g., 10% for resources on otherwise unused slots. E.g., if DU1 does not require any resource on a specific slot, DU2 would need 1.1 tokens for a resource on this slot;• Use an explicit mediator entity to which the DUs indicate their resource requests. The mediator entity performs the resource allocation according to the same rules and indicates it to the DUs. Maintaining the token sets could still be kept in the DUs or could be done in the mediator as well. In the first case the amount of tokens is indicated to the mediator together with the resource requests;The first mover disadvantage and the token-based change of roles to ensure one side is not always favored could be avoided if each resource allocation was doneblindly emulating a forward auction per allocation period. The procedure below uses additional messages:1. each RAT could unilaterally rank all the resources in descending order;2. Then each DU would decide to invest as many tokens as needed per RE based on some proprietary scheduling logic. E.g., a DU could spend it all on the top 10 RE to indicate very strong preference for those particular ones and maximize the odds of winning those RE;3. After both investments are in place, the DU reveal their allocations to each other. This insures both side have exactly the same info available;4. The priorities are then sorted out locally iteratively. The DU investing more tokens per RE gets it. The invested tokens of the loser go to a pool for redistribution across remaining REs based on the indicated ranking. The algorithm runs until a winner is defined for all resource elements (REs). The outcomes (which must match) are signaled for cross-validation thus terminating the auction for that round;5. More than two priority levels corresponding to a different number of tokens can be used.

[0094] FIG. 7A and FIG. 7B each show a method in accordance with example embodiments of the invention which may be performed by an apparatus.

[0095] FIG. 7A illustrates operations which may be performed by a device such as, but not limited to, a device such as a network device (e.g., the NN12 and / or NN 13 as in FIG. 6). As shown in step 710 of FIG. 7A there is creating an intended resource usage table identifying specific resources needed over a period of time for an allocation period in a communication network. As shown in step 720 of FIG. 7A there is communicating with an allocating distributed unit of a communication network information comprising the intended resource usage table identifying the specific resources needed and a current number of tokens. As shown in step 730 of FIG. 7Athere is receiving from the allocating distributed unit a resource allocation, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from initiating distributed unit. Then As shown in step 740 of FIG. 7A there is applying the resource allocation.

[0096] In accordance with the example embodiments as described in the paragraph above, wherein the specific resources comprise resources with different priorities.

[0097] In accordance with the example embodiments as described in the paragraphs above, wherein the resource allocation comprises allocated protected resources.

[0098] In accordance with the example embodiments as described in the paragraphs above, wherein there is coordinating an aperiodic request trigger of a resource update procedure, where the aperiodic request trigger of the resource update procedure is triggered when there is a change in a traffic load over a time less than a predetermined time.

[0099] In accordance with the example embodiments as described in the paragraphs above, wherein there is, based on the trigger, communicating with the allocating distributed unit a resource coordination request and the current number of tokens as part of the resource coordination request.

[0100] In accordance with the example embodiments as described in the paragraphs above, wherein the allocation period is one of established via O&M configuration, wherein a number of tokens for an allocation period can be established via O&M , and wherein the O&M configuration is on the specific tokens and parameters related to token usage.

[0101] In accordance with the example embodiments as described in the paragraphs above, wherein there is maintaining a token bucket; increasing the token bucket by a percentage of the number of tokens for the allocation period; requesting no more resources in the intended resource table usage as available in the token bucket, secure higher-priority allocation of resources of the specific resources neededcomprising utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one; reducing the token bucket according to the received resource allocation.

[0102] In accordance with the example embodiments as described in the paragraphs above, wherein requested and allocated resources are utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one, allocated but non-requested resources are not utilizing tokens.

[0103] In accordance with the example embodiments as described in the paragraphs above, wherein more than two priority levels corresponding to a different number of tokens can be used.

[0104] In accordance with the example embodiments as described in the paragraphs above, wherein there is adding spare tokens from previous allocations to currently allocated tokens.

[0105] In accordance with the example embodiments as described in the paragraphs above, wherein the spare tokens are based on a combined intended resource usage being more than 100% of available resources.

[0106] In accordance with the example embodiments as described in the paragraphs above, wherein there is establishing a policy for a maximum number of tokens that can be used over the allocation period; and establishing a period of time after which unused tokens are to be discarded.

[0107] In accordance with the example embodiments as described in the paragraphs above, wherein the intended resource usage table is corresponding to at least one of a frequency of the allocation period or a period of time of the allocation period.

[0108] In accordance with the example embodiments as described in the paragraphs above, wherein the communication network comprises a multi-rat spectrum sharing cell.

[0109] In accordance with the example embodiments as described in the paragraphs above, wherein a resource corresponds to a resource element or area of resource elements in the time and frequency domain, or a RRC connected UE.

[0110] In accordance with the example embodiments as described in the paragraphs above, wherein two or more priorities are used and wherein higher priority corresponds to higher counting of tokens.

[0111] In accordance with the example embodiments as described in the paragraphs above, where a share of tokens of the initiating distributed unit is 50% or other value.

[0112] In accordance with the example embodiments as described in the paragraphs above, where the share of tokens of the initiating distributed unit is not configured via 0AM, but is adapting over time to the NR / 6G market occupancy.

[0113] In accordance with the example embodiments as described in the paragraphs above, wherein there is alternating roles of the initiating distributed unit and allocating distributed unit based on a resulting token bucket size after resource allocation.

[0114] In accordance with the example embodiments as described in the paragraphs above, wherein a distributed unit with a larger bucket size will be a next initating distributed unit, and wherein in case of a tie roles, a next allocation period is alternated compared to the current one.

[0115] In accordance with the example embodiments as described in the paragraphs above, wherein there is communicating with a mediator entity of the communication network, to obtain a conflict resolution.

[0116] In accordance with the example embodiments as described in the paragraphs above, wherein there is performing iteratively a procedure to rank resources of the resource allocation in descending order; determining an investment in terms of tokens per resource; communicating the resource request and investment to the initiating distributed unit; resolving conflicts by comparing the investment per resource and allocating the resource to a distributed unit with higher investment;

[0117] In accordance with the example embodiments as described in the paragraphs above, wherein failed investments can be used in a next iteration, and wherein the procedure is iterated until all resources are allocated.

[0118] In accordance with the example embodiments as described in the paragraphs above, wherein there is, after a final iteration the allocations are exchanged between distributed units for cross validation.

[0119] A non-transitory computer-readable medium (MEM 12B and / or MEM 13B as in FIG. 6) storing program code (PROG 12C and / or PROG 13C as in FIG. 6), the program code executed by at least one processor (DP 12A and / or DP 13 A as in FIG. 6) to perform the operations as at least described in the paragraphs above.

[0120] In accordance with an example embodiment of the invention as described above there is an apparatus comprising: means for creating (TRANS 12D and / or TRANS 13D; MEM 12B and / or MEM 13B, PROG 12C and / or PROG 13C, and DP 12A and / or DP 13 A as in FIG. 6) an intended resource usage table identifying specific resources needed over a period of time for an allocation period in a communication network; means for communicating (TRANS 12D and / or TRANS 13D; MEM 12B and / or MEM 13B, PROG 12C and / or PROG 13C, and DP 12A and / or DP 13A as in FIG. 6) with an allocating distributed unit of a communication network information comprising the intended resource usage table identifying the specific resources needed and a current number of tokens; means for receiving (TRANS 12D and / or TRANS 13D; MEM 12B and / or MEM 13B, PROG 12C and / or PROG 13C, and DP 12A and / or DP 13A as in FIG. 6) from the allocating distributed unit a resource allocation, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from initiating distributed unit; and means for applying (TRANS 12D and / or TRANS 13D; MEM 12B and / or MEM 13B, PROG 12C and / or PROG 13C, and DP 12A and / or DP 13A as in FIG. 6) the resource allocation.

[0121] FIG. 7B illustrates operations which may be performed by a device such as, but not limited to, a device such as a network device (e.g., the NN12 and / or NN 13 as in FIG. 6). As shown in step 750 of FIG. 7B there is communicating with an initiatingdistributed unit of a communication network information comprising an intended resource usage table indication, identifying specific resources needed and a cunent number of tokens. As shown in step 760 of FIG. 7B there is creating an intended resource usage table identifying specific resources provided over a period of time for an allocation period in a communication network. As shown in step 770 of FIG. 7B there is sending towards the initiating distributed unit a resource allocation for application by the initiating distributed unit, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from allocating distributed unit. Then as shown in step 780 of FIG. 7B there is applying the resource allocation.

[0122] In accordance with the example embodiments as described in the paragraph above, wherein there is resolving a conflict by targeting a resource share corresponding to current token ratio between the initiating distributed unit and the allocating distributed unit.

[0123] In accordance with the example embodiments as described in the paragraph above, wherein the conflict is based on a conflicting time of the intended resource usage of the initiating distributed unit with the allocating distributed unit.

[0124] In accordance with the example embodiments as described in the paragraph above, wherein the resolving comprises adding a resource allocation step using the token ratio to support fairness of resource allocations.

[0125] In accordance with the example embodiments as described in the paragraph above, wherein the token ratio is based on an available token count.

[0126] In accordance with the example embodiments as described in the paragraph above, wherein the resolving comprises all resources are re-allocated without conflicts.

[0127] In accordance with the example embodiments as described in the paragraph above, wherein fewer resources than requested are allocated, and wherein a number of tokens is reduced according to its resource allocation.

[0128] In accordance with the example embodiments as described in the paragraph above, wherein allocated resources that have not been requested are not counted as tokens, and protected resources are counted as one token.

[0129] In accordance with the example embodiments as described in the paragraph above,, wherein there is, based on the conflict not being resolved at the time, determining a resolution to a conflict in the specific resources considering the priorities of the requested resources; and based on the determining, targeting a resource share corresponding to the token ratio of allocated resources to resolve the conflict.

[0130] In accordance with the example embodiments as described in the paragraph above, wherein the resource allocation using the allocating distributed unit intended resource usage table is increasing a cost of tokens by for resources on otherwise unused slots.

[0131] In accordance with the example embodiments as described in the paragraph above,, wherein the resource allocation comprises allocated protected resources.

[0132] In accordance with the example embodiments as described in the paragraph above, wherein there is one of process an aperiodic request by calculating a new allocation or reject the aperiodic request by waiting until an end of a current allocation period.

[0133] In accordance with the example embodiments as described in the paragraphs above, wherein there is maintaining a token bucket; increasing the token bucket by a percentage of the number of tokens for the allocation period; requesting no more resources in the intended resource table usage as available in the token bucket, secure higher-priority allocation of resources of the specific resources needed comprising utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one; reducing the token bucket according to the received resource allocation.

[0134] In accordance with the example embodiments as described in the paragraph above, wherein requested and allocated resources are utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one, allocated but non-requested resources are not utilizing tokens.

[0135] In accordance with the example embodiments as described in the paragraphs above, wherein more than two priority levels corresponding to a different number of tokens can be used.

[0136] In accordance with the example embodiments as described in the paragraphs above, wherein resources with same priorities and requested by the allocating distributed unit are allocated such the ratio of allocated resources corresponds to a ratio of tokens of both the allocating distributed unit and the allocating initiating distributed unit.

[0137] In accordance with the example embodiments as described in the paragraphs above, wherein there is exchanging with the initiating distributed unit already allocated resources that are shared, wherein the already allocated resources comprise protected resources allocated to a respective radio access technology, wherein already allocated resources including the protected resources are used to determine the token ratio.

[0138] In accordance with the example embodiments as described in the paragraphs above, wherein there is adding spare tokens from previous allocations to currently allocated tokens.

[0139] In accordance with the example embodiments as described in the paragraphs above, wherein the spare tokens are based on a combined intended resource usage being more than 100% of available resource.

[0140] In accordance with the example embodiments as described in the paragraphs above, wherein there is establishing a policy for a maximum number of tokens that can be used over the allocation period; and establishing a period of time after which unused tokens are to be discarded.

[0141] In accordance with the example embodiments as described in the paragraphs above, wherein the allocating distributed unit comprises a distributed unit that is paired with a distributed unit of the network node.

[0142] In accordance with the example embodiments as described in the paragraphs above, wherein the intended resource usage table is corresponding to at least one of a frequency of the allocation period or a period of time of the allocation period.

[0143] In accordance with the example embodiments as described in the paragraphs above, wherein the communication network comprises a multi-rat spectrum sharing cell.

[0144] In accordance with the example embodiments as described in the paragraphs above, wherein the allocating distributed unit is embodied in a mediator entity of the communication network.

[0145] In accordance with the example embodiments as described in the paragraphs above, wherein there is alternating roles of the initiating distributed unit and allocating distributed unit based on a resulting token bucket size after resource allocation.

[0146] In accordance with the example embodiments as described in the paragraphs above, wherein a distributed unit with a larger bucket size will be a next initiating distributed unit, and wherein in case of a tie roles, a next allocation period is alternated compared to the current one.

[0147] In accordance with the example embodiments as described in the paragraphs above, wherein there is communicating with a mediator entity of the communication network, to obtain a conflict resolution.

[0148] In accordance with the example embodiments as described in the paragraphs above, wherein there is performing iteratively a procedure to rank resources of the resource allocation in descending order; determining an investment in terms of tokens per resource; communicating the resource request and investment to the initiating distributed unit; resolving conflicts by comparing the investment per resourceand allocating the resource to a distributed unit with higher investment; wherein failed investments can be used in a next iteration, and wherein the procedure is iterated until all resources are allocated.

[0149] In accordance with the example embodiments as described in the paragraphs above, wherein there is, after a final iteration the allocations are exchanged between distributed units for cross validation.

[0150] In accordance with the example embodiments as described in the paragraphs above, wherein there is establishing a policy for a maximum number of tokens that can be used over the allocation period; and establishing a period of time after which unused tokens are to be discarded.

[0151] A non-transitory computer-readable medium (MEM 12B and / or MEM 13B as in FIG. 6) storing program code (PROG 12C and / or PROG 13C as in FIG. 6), the program code executed by at least one processor (DP 12A and / or DP 13 A as in FIG. 6) to perform the operations as at least described in the paragraphs above.

[0152] In accordance with an example embodiment of the invention as described above there is an apparatus comprising: means for communicating (TRANS 12D and / or TRANS 13D; MEM 12B and / or MEM 13B, PROG 12C and / or PROG 13C, and DP 12A and / or DP 13A as in FIG. 6) with an initiating distributed unit of a communication network information comprising an intended resource usage table indication, identifying specific resources needed and a current number of tokens; means for creating (TRANS 12D and / or TRANS 13D; MEM 12B and / or MEM 13B, PROG 12C and / or PROG 13C, and DP 12A and / or DP 13A as in FIG. 6) an intended resource usage table identifying specific resources provided over a period of time for an allocation period in a communication network; means for sending (TRANS 12D and / or TRANS 13D; MEM 12B and / or MEM 13B, PROG 12C and / or PROG 13C, and DP 12A and / or DP 13A as in FIG. 6) towards the initiating distributed unit a resource allocation for application by the initiating distributed unit, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from allocating distributed unit; and means for applying (TRANS 12D and / or TRANS 13D; MEM 12B and / or MEM 13B, PROG 12C and / or PROG 13C, and DP 12A and / or DP 13A as in FIG. 6) the resource allocation.

[0153] In the example aspect of the invention according to the paragraph above, wherein at least the means for communicating, creating, sending, and applying comprises a non-transitory computer readable medium [MEM 12B and / or MEM 13B as in FIG. 6] encoded with a computer program [PROG 12C and / or PROG 13C as in FIG. 6] executable by at least one processor [DP 12A and / or DP 13A as in FIG. 6].

[0154] Further, in accordance with example embodiments of the invention there is circuitry for performing operations in accordance with example embodiments of the invention as disclosed herein. This circuitry can include any type of circuitry including content coding circuitry, content decoding circuitry, processing circuitry, image generation circuitry, data analysis circuitry, etc.). Further, this circuitry can include discrete circuitry, application-specific integrated circuitry (ASIC), and / or field- programmable gate array circuitry (FPGA), etc. as well as a processor specifically configured by software to perform the respective function, or dual-core processors with software and corresponding digital signal processors, etc.). Additionally, there are provided necessary inputs to and outputs from the circuitry, the function performed by the circuitry and the interconnection (perhaps via the inputs and outputs) of the circuitry with other components that may include other circuitry in order to perform example embodiments of the invention as described herein.

[0155] In accordance with example embodiments of the invention as disclosed in this application this application, the “circuitry” provided can include at least one or more or all of the following:(a) hardware-only circuit implementations (such as implementations in only analog and / or digital circuitry);(b) combinations of hardware circuits and software, such as (as applicable):(i) a combination of analog and / or digital hardware circuit(s) with software / firmware; and(ii) any portions of hardware processor(s) with software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as a mobile phone or server, to perform various functions, such as functions or operations in accordance with example embodiments of the invention as disclosed herein); and(c) hardware circuit(s) and or processor(s), such as a microprocessor(s) or a portion of a microprocessor(s), that requires software (e.g., firmware) for operation, but the software may not be present when it is not needed for operation.”

[0156] In accordance with example embodiments of the invention, there is adequate circuitry for performing at least novel operations in accordance with example embodiments of the invention as disclosed in this application, this 'circuitry' as may be used herein refers to at least the following:(a) hardware-only circuit implementations (such as implementations in only analog and / or digital circuitiy); and(b) to combinations of circuits and software (and / or firmware), such as (as applicable): (i) to a combination of processor(s) or (ii) to portions of processor(s) / software (including digital signal processor(s)), software, and memory(ies) that work together to cause an apparatus, such as a mobile phone or server, to perform various functions); and(c) to circuits, such as a microprocessor(s) or a portion of a microprocessor(s), that require software or firmware for operation, even if the software or firmware is not physically present.

[0157] This definition of 'circuitry' applies to all uses of this term in this application, including in any claims. As a further example, as used in this application, the term "circuitry" would also cover an implementation of merely a processor (or multiple processors) or portion of a processor and its (or their) accompanying software and / or firmware. The term "circuitry" would also cover, for example and if applicableto the particular claim element, a baseband integrated circuit or applications processor integrated circuit for a mobile phone or a similar integrated circuit in a server, a cellular network device, or other network device.

[0158] In general, the various embodiments may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device, although the invention is not limited thereto. While various aspects of the invention may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.

[0159] Embodiments of the inventions may be practiced in various components such as integrated circuit modules. The design of integrated circuits is by and large a highly automated process. Complex and powerful software tools are available for converting a logic level design into a semiconductor circuit design ready to be etched and formed on a semiconductor substrate.

[0160] The word "exemplary" is used herein to mean "serving as an example, instance, or illustration." Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments. All of the embodiments described in this Detailed Description are exemplary embodiments provided to enable persons skilled in the art to make or use the invention and not to limit the scope of the invention which is defined by the claims.

[0161] The foregoing description has provided by way of exemplary and nonlimiting examples a full and informative description of the best method and apparatus presently contemplated by the inventors for carrying out the invention. However, various modifications and adaptations may become apparent to those skilled in therelevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings and the appended claims. However, all such and similar modifications of the teachings of example embodiments of this invention will still fall within the scope of this invention.

[0162] It should be noted that the terms "connected," "coupled," or any variant thereof, mean any connection or coupling, either direct or indirect, between two or more elements, and may encompass the presence of one or more intermediate elements between two elements that are "connected" or "coupled" together. The coupling or connection between the elements can be physical, logical, or a combination thereof. As employed herein two elements may be considered to be "connected" or "coupled" together by the use of one or more wires, cables and / or printed electrical connections, as well as by the use of electromagnetic energy, such as electromagnetic energy having wavelengths in the radio frequency region, the microwave region and the optical (both visible and invisible) region, as several non-limiting and non-exhaustive examples.

[0163] Furthermore, some of the features of the preferred embodiments of this invention could be used to advantage without the corresponding use of other features. As such, the foregoing description should be considered as merely illustrative of the principles of the invention, and not in limitation thereof.

Claims

CLAIMSWhat is claimed is:

1. An initiating distributed unit, comprising: at least one processor; and at least one non-transitory memory storing instructions, that when executed by the at least one processor, cause the initiating distributed unit at least to: create an intended resource usage table identifying specific resources needed over a period of time for an allocation period in a communication network; communicate with an allocating distributed unit of a communication network information comprising the intended resource usage table identifying the specific resources needed and a current number of tokens; receive from the allocating distributed unit a resource allocation, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from initiating distributed unit; and apply the resource allocation.

2. The initiating distributed unit of claim 1, wherein the specific resources comprise resources with different priorities.

3. The initiating distributed unit of claim 1 , wherein the resource allocation comprises allocated protected resources.

4. The initiating distributed unit of claim 1, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the initiating distributed unit to: coordinate an aperiodic request trigger of a resource update procedure, where the aperiodic request trigger of the resource update procedure is triggered when there is a change in a traffic load over a time less than a predetermined time.

5. The initiating distributed unit of claim 4, wherein the at least one non-transitory memory is storing instructions, that when executed by the at least one processor cause the initiating distributed unit to: based on the trigger, communicate with the allocating distributed unit a resource coordination request and the current number of tokens as part of the resource coordination request.

6. The initiating distributed unit of claim 1, wherein the allocation period is one of established via O&M configuration, wherein a number of tokens for an allocation period can be established via O&M , and wherein the O&M configuration is on the specific tokens and parameters related to token usage.

7. The initiating distributed unit of claim 6, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the initiating distributed unit to: maintain a token bucket; increase the token bucket by a percentage of the number of tokens for the allocation period; request no more resources in the intended resource table usage as available in the token bucket, secure higher-priority allocation of resources of the specific resources needed comprising utilizing larger specific tokens compared to lower- priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one; reduce the token bucket according to the received resource allocation, wherein requested and allocated resources are utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one, allocated but non-requested resources are not utilizing tokens, and wherein more than two priority levels corresponding to a different number of tokens can be used.

8. The initiating distributed unit of claim 1, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the initiating distributed unit to:add spare tokens from previous allocations to currently allocated tokens, wherein the spare tokens are based on a combined intended resource usage being more than 100% of available resources9. The initiating distributed unit of claim 1, wherein the at least one non transitory memory is storing instructions, that when executed by the at least one processor cause the initiating distributed unit to: establish a policy for a maximum number of tokens that can be used over the allocation period; and establish a period of time after which unused tokens are to be discarded.

10. The initiating distributed unit of claim 1, wherein the intended resource usage table is corresponding to at least one of a frequency of the allocation period or a period of time of the allocation period.

11. The initiating distributed unit of claim 1 , wherein the communication network comprises a multi-rat spectrum sharing cell.

12. The initiating distributed unit of claim 1, wherein a resource corresponds to a resource element or area of resource elements in the time and frequency domain; or a RRC connected UE.

13. The initiating distributed unit of claim 1 , wherein two or more priorities are used and wherein higher priority corresponds to higher counting of tokens.

14. The initiating distributed unit of claim 1, wherein a share of tokens of the initiating distributed unit is 50% or other value.

15. The initiating distributed unit of claim 14, wherein the share of tokens of the initiating distributed unit is not configured via 0AM, but is adapting over time to the NR / 6G market occupancy.

16. The initiating distributed unit of claim 1, wherein the at least one non-transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: alternate roles of the initiating distributed unit and allocating distributed unit based on a resulting token bucket size after resource allocation, wherein a distributed unit with a larger bucket size will be a next initiating distributed unit, and wherein in case of a tie roles, a next allocation period is alternated compared to the current one.

17. The initiating distributed unit of claim 1, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: communicate with a mediator entity of the communication network, to obtain a conflict resolution.

18. The initiating distributed unit of claim 1 , wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: iteratively a procedure to rank resources of the resource allocation in descending order; determine an investment in terms of tokens per resource; communicate the resource request and investment to the initiating distributed unit; resolve conflicts by comparing the investment per resource and allocating the resource to a distributed unit with higher investment; wherein failed investments can be used in a next iteration, and wherein the procedure is iterated until all resources are allocated.

19. The initiating distributed unit of claim 18, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: after a final iteration the allocations are exchanged between distributed units for cross validation.

20. A method, comprising: creating an intended resource usage table identifying specific resources needed over a period of time for an allocation period in a communication network; communicating with an allocating distributed unit of a communication network information comprising the intended resource usage table identifying the specific resources needed and a current number of tokens; receiving from the allocating distributed unit a resource allocation, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from initiating distributed unit; and applying the resource allocation.

21. An allocating distributed unit, comprising: at least one processor; and at least one non-transitoiy memory storing instructions, that when executed by the at least one processor, cause the allocating distributed unit at least to: communicate with an initiating distributed unit of a communication network information comprising an intended resource usage table indication, identifying specific resources needed and a current number of tokens; create an intended resource usage table identifying specific resources provided over a period of time for an allocation period in a communication network; send towards the initiating distributed unit a resource allocation for application by the initiating distributed unit, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from allocating distributed unit; and apply the resource allocation.

22. The allocating distributed unit of claim 21 , wherein the at least one non- transitory memoiy is storing instructions, that when executed by the at least one processor cause the apparatus to: resolve a conflict by targeting a resource share corresponding to current token ratio between the initiating distributed unit and the allocating distributed unit, wherein the conflict is based on a conflicting time of the intendedresource usage of the initiating distributed unit with the allocating distributed unit, and wherein the resolving comprises adding a resource allocation step using the token ratio to support fairness of resource allocations.

23. The allocating distributed unit of claim 22, wherein the token ratio is based on an available token count.

24. The allocating distributed unit of claim 22, wherein the resolving comprises all resources are re-allocated without conflicts.

25. The allocating distributed unit of claim 22, wherein fewer resources than requested are allocated, and wherein a number of tokens is reduced according to its resource allocation.

26. The allocating distributed unit of claim 22, wherein allocated resources that have not been requested are not counted as tokens, and protected resources are counted as one token.

27. The allocating distributed unit of claim 22, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: based on the conflict not being resolved at the time, determine a resolution to a conflict in the specific resources considering the priorities of the requested resources; and based on the determining, target a resource share corresponding to the token ratio of allocated resources to resolve the conflict.

28. The allocating distributed unit of claim 22, wherein the resource allocation using the allocating distributed unit intended resource usage table is increasing a cost of tokens by for resources on otherwise unused slots.

29. The allocating distributed unit of claim 21, wherein the resource allocationcomprises allocated protected resources.

30. The allocating distributed unit of claim 29, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: one of process an aperiodic request by calculating a new allocation or reject the aperiodic request by waiting until an end of a current allocation period.

31. The allocating distributed unit of claim 21 , wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: maintain a token bucket; increase the token bucket by a percentage of the number of tokens for the allocation period; request no more resources in the intended resource table usage as available in the token bucket, secure higher-priority allocation of resources of the specific resources needed comprising utilizing larger specific tokens compared to lower- priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one; reduce the token bucket according to the received resource allocation, wherein requested and allocated resources are utilizing larger specific tokens compared to lower-priority resources, higher-priority allocation of resources requires an available token count of two or more tokens per resource instead of one, allocated but non-requested resources are not utilizing tokens, and wherein more than two priority levels corresponding to a different number of tokens can be used.

32. The allocating distributed unit of claim 21, wherein resources with same priorities and requested by the allocating distributed unit are allocated such the ratio of allocated resources corresponds to a ratio of tokens of both the allocating distributed unit and the allocating initiating distributed unit.

33. The allocating distributed unit of claim 21 , wherein the at least one nontransitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: exchange with the initiating distributed unit already allocated resources that are shared, wherein the already allocated resources comprise protected resources allocated to a respective radio access technology, wherein already allocated resources including the protected resources are used to determine the token ratio.

34. The allocating distributed unit of claim 21 , wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: add spare tokens from previous allocations to currently allocated tokens, wherein the spare tokens are based on a combined intended resource usage being more than 100% of available resources35. The allocating distributed unit of claim 21, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: establish a policy for a maximum number of tokens that can be used over the allocation period; and establish a period of time after which unused tokens are to be discarded.

36. The allocating distributed unit of claim 21, wherein the allocating distributed unit comprises a distributed unit that is paired with a distributed unit of the network node.

37. The allocating distributed unit of claim 21, wherein the intended resource usage table is corresponding to at least one of a frequency of the allocation period or a period of time of the allocation period.

38. The allocating distributed unit of claim 21 , wherein the communication network comprises a multi-rat spectrum sharing cell.

39. The allocating distributed unit of claim 21, wherein the allocating distributedunit is embodied in a mediator entity of the communication network.

40. The allocating distributed unit of claim 21, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: alternate roles of the initiating distributed unit and allocating distributed unit based on a resulting token bucket size after resource allocation, wherein a distributed unit with a larger bucket size will be a next initiating distributed unit, and wherein in case of a tie roles, a next allocation period is alternated compared to the current one.

41. The allocating distributed unit of claim 21, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: communicate with a mediator entity of the communication network, to obtain a conflict resolution.

42. The allocating distributed unit of claim 21, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to: iteratively a procedure to rank resources of the resource allocation in descending order; determine an investment in terms of tokens per resource; communicate the resource request and investment to the initiating distributed unit; resolve conflicts by comparing the investment per resource and allocating the resource to a distributed unit with higher investment; wherein failed investments can be used in a next iteration, and wherein the procedure is iterated until all resources are allocated.

43. The allocating distributed unit of claim 42, wherein the at least one non- transitory memory is storing instructions, that when executed by the at least one processor cause the allocating distributed unit to:after a final iteration the allocations are exchanged between distributed units for cross validation.

44. A method, comprising: communicating with an initiating distributed unit of a communication network information comprising an intended resource usage table indication, identifying specific resources needed and a current number of tokens; creating an intended resource usage table identifying specific resources provided over a period of time for an allocation period in a communication network; sending towards the initiating distributed unit a resource allocation for application by the initiating distributed unit, wherein the resource allocation is using an allocating distributed unit intended resource usage table based on the intended resource usage table from allocating distributed unit; and applying the resource allocation.

Images