WO2022100676A1

WO2022100676A1 - System and method for wireless communication, and storage medium

Info

Publication number: WO2022100676A1
Application number: PCT/CN2021/130198
Authority: WO
Inventors: 赵友平; 林梦婷; 田中; 孙晨
Original assignee: 索尼集团公司; 赵友平
Priority date: 2020-11-13
Filing date: 2021-11-12
Publication date: 2022-05-19
Also published as: US20230397238A1; CN116602052A; CN114501637A

Abstract

Provided are a system and a method for wireless communication, and a storage medium. A system for wireless communication, comprising: one or more intra-slice processors, at least one of the one or more intra-slice processors being configured to collect scenario information of a corresponding radio access network (RAN) slice among a plurality of RAN slices in a wireless network, wherein the scenario information is used for determining at least the following information: an interference relationship between RAN slices, an RAN slice priority, and RAN slice frequency spectrum resource requirements; and a first management device, configured to determine, on the basis of at least the scenario information, a scheme for arranging or re-arranging frequency spectrum resources between the plurality of RAN slices, wherein the scheme for arranging or re-arranging frequency spectrum resources between the plurality of RAN slices comprises a first characteristic and the quantity of frequency spectrum resources to be allocated to at least one RAN slice among the plurality of RAN slices.

Description

System, method and storage medium for wireless communication

This application claims the priority of the Chinese application with application number 202011271371.5 and filing date on November 13, 2020, entitled "System, Method and Storage Medium for Wireless Communication", the disclosure of which is incorporated by reference in its entirety. Enter here.

technical field

The present disclosure relates generally to wireless communication systems, and in particular to techniques related to network slicing in wireless communication systems.

Background technique

In the wireless communication system, as the scenarios in which wireless communication is to be applied become increasingly complex, in order to enable operators to provide users with customized logical networks to meet diverse service requirements, consider different services corresponding to different application scenarios. Features and requirements to divide the network into multiple virtual network slices. This technology of dividing the network into multiple virtual network slices is called Network Slicing in 5G/B5G, for example. Network slices may generally include core network slices, radio access network (RAN) slices, and transport network slices.

Network slicing enables a physical network to be cut into multiple virtual end-to-end networks. Each virtual network, including the devices, access, transmission, and core network within the network, is logically independent. Any virtual network occurs. Failures will not affect other virtual networks. Each virtual network has different functional characteristics and faces different needs and services.

There is a need for a technique that enables efficient network slicing.

SUMMARY OF THE INVENTION

The present disclosure proposes a solution related to network slicing, and in particular, the present disclosure provides a system, method, and computer-readable medium for a wireless communication system.

One aspect of the present disclosure relates to a system for wireless communication, comprising: one or more on-chip managers, at least one of the one or more on-chip managers is configured to collect a plurality of Scenario information of a corresponding RAN slice in the RAN slice of the radio access network, wherein the scenario information is used to determine at least the following information: the interference relationship between RAN slices, the priority of the RAN slice, and the spectrum resource requirement of the RAN slice; the first management device, is configured to determine an arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices based on at least the scenario information, wherein the arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices includes The first characteristic and quantity of spectrum resources allocated by at least one of the RAN slices.

Another aspect of the present disclosure relates to a method of a system for wireless communication, the system including one or more on-chip managers and a first management device, the method comprising being managed by the one or more on-chip managers At least one intra-slice manager in the radio network collects scene information of a corresponding RAN slice in a plurality of radio access network RAN slices in the wireless network, wherein the scene information is used to determine at least the following information: RAN inter-slice interference relationship, RAN slice priority and RAN slice spectrum resource requirement; the first management device determines the arrangement or rearrangement of spectrum resources among the multiple RAN slices based on at least the interference relationship between RAN slices, the RAN slice priority, and the RAN slice spectrum resource requirement. An arrangement scheme, wherein the arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices includes a first characteristic and quantity of spectrum resources to be allocated for at least one RAN slice of the plurality of RAN slices.

Another aspect of the present disclosure relates to a non-transitory computer-readable storage medium storing executable instructions that, when executed, implement the method as described in the above aspects.

Description of drawings

A better understanding of the present disclosure can be obtained when the following detailed description of the embodiments is considered in conjunction with the accompanying drawings. The same or similar reference numbers are used throughout the various drawings to refer to the same or similar parts. The accompanying drawings, which are incorporated in and constitute a part of this specification together with the following detailed description, serve to illustrate embodiments of the disclosure and to explain the principles and advantages of the disclosure. in:

FIG. 1 schematically shows a scenario of a wireless communication system to which the solution of the present disclosure can be applied;

FIG. 2 schematically shows a schematic diagram of a system configuration for wireless communication according to an embodiment of the present disclosure;

3 schematically illustrates a first conceptual operational flow of a method for a system for wireless communication according to an embodiment of the present disclosure;

FIG. 4 schematically shows a flowchart of an exemplary algorithm for determining an arrangement or rearrangement scheme of spectral resources among multiple RAN slices;

5 schematically illustrates a second conceptual operational flow of the method of the system for wireless communication according to an embodiment of the present disclosure;

FIG. 6 schematically illustrates a first exemplary information interaction according to an embodiment of the present disclosure;

FIG. 7 schematically illustrates a second exemplary information interaction according to an embodiment of the present disclosure;

FIG. 8 schematically illustrates a third exemplary information interaction according to an embodiment of the present disclosure;

FIG. 9 exemplarily shows a simulated base station location scenario diagram for the solution of the present disclosure;

Figure 10 schematically shows a graph of the average spectral satisfaction of a RAN slice with and without the method according to the present disclosure applied;

FIG. 11 schematically shows a comparison diagram of the average spectrum satisfaction level of a base station with and without applying the method according to the present disclosure;

12 is a block diagram of an example structure as a computer/computer system that may be employed in embodiments of the present disclosure;

While the embodiments described in this disclosure may be susceptible to various modifications and alternative forms, specific embodiments thereof are illustrated by way of example in the accompanying drawings and are herein described in detail. It should be understood, however, that the drawings and detailed description thereof are not intended to limit the embodiments to the particular form disclosed, but on the contrary, the intention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the claims Program.

Detailed ways

Representative applications of various aspects of the apparatus and method according to the present disclosure are described below. These examples are described only to add context and aid in understanding the described embodiments. Accordingly, it will be apparent to those skilled in the art that the embodiments described below may be practiced without some or all of the specific details. In other instances, well-known process steps have not been described in detail to avoid unnecessarily obscuring the described embodiments. Other applications are possible, and the aspects of the present disclosure are not limited to these examples.

Typically, the system for wireless communication according to the present disclosure includes at least devices on the core network side (such as various virtualized or non-virtualized network element devices responsible for corresponding functions).

In the present disclosure, "core network device" is, for example, a general term for multiple network element devices, and a single network element device may implement a single function, a single network element device may implement multiple functions, or multiple network element devices may implement a single function. Features. As an example, Network Function Virtualization (NFV) or Software Defined Network (SDN) may be applied to the core network. In this case, the network element devices in the core network may implement corresponding functions. software module.

In addition, the system for wireless communication according to the present disclosure may further include devices on the access network side (such as base stations and terminal devices). In this disclosure, a "base station" includes at least a wireless communication station that facilitates communication as part of a wireless communication system or radio system. As an example, the base station may be, for example, an eNB of a 4G communication standard, a gNB of a 5G communication standard, a remote radio head, a wireless access point, a drone control tower, or a communication device that performs similar functions. In this disclosure, "terminal equipment" or "user equipment (UE)" includes at least terminal equipment that is part of a wireless communication system or radio system to facilitate communication. As an example, the terminal device may be, for example, a terminal device such as a mobile phone, a laptop computer, a tablet computer, an in-vehicle communication device or the like or elements thereof.

As described in the background art, in a wireless communication system, it is considered to divide the network into multiple virtual network slices according to different service characteristics and requirements corresponding to different application scenarios, and network slices generally include core network slices, RAN slices, and RAN slices. Slicing and transport network slicing. In this disclosure, the content related to RAN slicing is mainly discussed. In the following, the term "slice" or "slice" generally refers to a RAN slice unless otherwise indicated.

Generally, communication services can be divided into: Ultra-Reliable Low-Latency Communication (uRLLC), Enhanced Mobile Broadband (eMBB), and general data services according to the different needs of users for services. (e.g. email) and Massive Machine Type Communication (mMTC).

Figure 1 shows a wireless communication system scenario in a city. As shown in FIG. 1 , when the wireless communication system is initialized, corresponding RAN slices are respectively divided for the uRLLC tenants, eMBB tenants and general tenants involved in the scenario. Each RAN slice is generally allocated with corresponding spectrum resources.

Traditionally, dedicated spectrum resources are allocated to each RAN slice to ensure spectrum isolation between RAN slices, thereby avoiding interference between RAN slices due to overlapping spectrum resources. However, this scheme of isolating spectrum resources between RAN slices leads to a decrease in spectrum utilization. In the context of increasingly tight spectrum resources (eg, 5G and B5G in particular), this low spectrum utilization scheme often makes it difficult to meet the spectrum resource requirements of RAN slices, for example, resulting in insufficient spectrum resources allocated to RAN slices to cope with the load of the RAN slice. Therefore, there is a need for a scheme that can improve spectrum utilization while avoiding interference between RAN slices (ie, maintaining isolation performance between RAN slices).

On the other hand, when the network changes dynamically, for example, as shown in FIG. 1, when an emergency such as a sports event occurs, the RAN slice can be dynamically added, deleted or modified. Adding, deleting, or modifying RAN slices often requires reconfiguration of the spectrum resources of the RAN slice, resulting in operations with higher complexity and higher time/economic costs. Therefore, there is a need for a solution that reduces the complexity of spectrum resource reconfiguration as much as possible while supporting flexible adjustment of RAN slices.

FIG. 2 schematically shows a schematic diagram of a system configuration for wireless communication according to an embodiment of the present disclosure.

As shown in FIG. 2 , the system 20 for wireless communication according to the present disclosure may at least include one or more on-chip managers 202 - 1 to 202 - n (hereinafter may be collectively marked as 202 ) and a first management device 204 . In addition, the system 20 may optionally include a second management device 206, a third management device 208 depicted in phantom, and other suitable devices not shown. In this document, the terms "on-chip manager", "first management device", "second management device" and "third management device" may all correspond to the network element equipment (software-based) in the core network described above. /virtualized devices/modules, distributed devices/modules, or physical hardware devices). It should be noted that although the embodiments of the present disclosure are mainly described below based on a communication system including an "on-chip manager", a "first management device", a "second management device", and a "third management device", these descriptions It can be extended accordingly to the case of communication systems containing any other type of network element equipment. In particular, for 5G/B5G, "first management device", "second management device" and "third management device" may correspond to functional entities specified in the corresponding 3GPP standards. For example, the "first management device" may correspond to a Network Slice Subnet Management Function (NSSMF), the "second management device" may correspond to a Network Slice Management Function (NSMF), and " The third management device" may correspond to a communication service management function (Communicaiton Service Management Function, CSMF). Of course, these management devices may also correspond to other appropriate functional entities as appropriate, as long as the corresponding functions described below can be implemented.

In addition, the system for wireless communication according to the embodiment of the present disclosure is described herein by taking an on-chip manager, a first management device, and optionally a second management device and a third management device as examples. However, a system for wireless communication according to the present disclosure may include more or fewer devices.

Hereinafter, specific operations of each device in the system 20 according to the present disclosure will be described in detail with reference to FIG. 3 .

FIG. 3 schematically illustrates a first conceptual operational flow 30 of a method of a system for wireless communication according to an embodiment of the present disclosure. For example, corresponding operations of the first conceptual operational flow 30 may be performed by various apparatuses in the system 20 for wireless communication according to the present disclosure.

As mentioned above, there is a need for a solution that can improve spectrum utilization while avoiding interference between RAN slices (ie, maintaining isolation performance between RAN slices). In fact, the use of overlapping spectrum resources does not necessarily lead to interference between RAN slices. For example, there may only be interference between some base stations between two RAN slices. Therefore, by properly setting the degree of overlap of spectrum resources between RAN slices (in other words, the degree of sharing that spectrum resources can be shared among RAN slices), it is possible to improve spectrum utilization while avoiding interference between RAN slices Rate. The method shown in FIG. 3 presents an example scheme for scheduling or rearranging spectrum resources among RAN slices by considering the degree of overlap of spectrum resources between RAN slices.

The first conceptual operational flow 30 begins at S302.

At S304, scene information of a corresponding RAN slice of the plurality of RAN slices in the wireless network may be collected by at least one of the one or more intra-slice managers 202 shown in FIG. 2, and such scene information may be used to determine at least one The following information: RAN inter-slice interference relationship, RAN slice priority, and RAN slice spectrum resource requirements. Advantageously, the RAN inter-slice interference relationship determined based on the scenario information can be used to determine the extent to which the spectral resources of any RAN slice in the wireless network can overlap with the spectral resources of other RAN slices. In other words, the inter-RAN slice interference relationship may be used to determine the extent to which any RAN slice in the wireless network can share spectral resources (eg, the number of shared/overlapping channels) with other RAN slices.

At S306, the first management device 204 shown in FIG. 2 may determine a scheme for scheduling or rearranging spectrum resources among multiple RAN slices based on the scenario information. For example, the first management device 204 may directly or indirectly determine the arrangement or rearrangement scheme of spectrum resources among multiple RAN slices based on the interference relationship between RAN slices, the priority of RAN slices, and the spectrum resource requirements of RAN slices determined according to the scenario information . According to the present disclosure, any one or more of the apparatuses 202-208 in the system 20 may optionally determine the RAN inter-slice interference relationship, the RAN slice priority, and the RAN slice spectrum resource requirement according to the scenario information. This will be explained in detail below.

According to the present disclosure, the arrangement or rearrangement scheme of spectrum resources among multiple RAN slices includes a first characteristic and quantity of spectrum resources to be allocated for at least one of the multiple RAN slices. For example, the first characteristic of the spectrum resource may indicate at least a spectrum resource type including: spectrum resources not allocated to a RAN slice, spectrum resources allocated to a RAN slice but not yet used by the RAN slice, and spectrum resources that can be compared with those allocated to a RAN slice Spectrum resources where the spectrum resources of the slice overlap.

The first conceptual operational flow 30 ends at S308.

The solution for wireless communication according to the present disclosure has been briefly introduced above with reference to FIG. 2 and FIG. 3 . Hereinafter, each operation in FIG. 3 will be described in detail.

According to the present disclosure, the scene information may at least indicate one or more of the following items: base station location, base station transmit power, spectrum resource requirements of the base station, and communication service requirements, wherein the spectrum resource requirements of the base station may be required to directly indicate the base station Information on the amount of spectrum resources (such as the number of channels needed to serve its users), or information indicating the capacity, number, etc. of base stations; communication service requirements uRLLC, eMBB, and mMTC, etc.), or the communication service requirement may also be information indicating communication requirements such as delay, reliability, QoS, rate, and the like.

Such scene information may be received by an on-chip manager in system 20 as shown in FIG. 2 . System 20 according to the present disclosure may include one or more on-chip managers. In the case where the system 20 includes only one on-chip manager, the on-chip manager can centrally collect scene information of each RAN slice in the wireless network. When the system 20 includes multiple on-chip managers, each on-chip manager can manage a corresponding RAN slice and collect scene information of the RAN slice. In addition, in the case where the system 20 includes multiple on-chip managers, at least one on-chip manager among the multiple on-chip managers can centrally manage a part of the RAN slice in the wireless network, and collect data corresponding to the part of the RAN. scene information.

According to the present disclosure, scenario information can be processed to determine RAN inter-slice interference relationship, RAN slice priority, and RAN slice spectrum resource requirements, so as to determine the arrangement or rearrangement scheme of spectrum resources among multiple RAN slices.

The RAN inter-slice interference relationship may be determined according to the base station location and base station transmit power contained in the scenario information. For example, the RAN inter-slice interference relationship can be represented by an inter-slice interference overlap matrix, and each item in the inter-slice interference overlap matrix can, for example, represent the number of base stations in slice i that interfere with slice j accounts for the total number of base stations in slice i ratio, that is,

For example, if the power of the signal from base station b of slice j detected at base station a of slice i is greater than a predetermined threshold, it can be determined that there is interference between base station a of slice i and base station b of slice j. It should be noted that, in order to more accurately determine whether there is interference between base stations, in addition to the base station location and base station transmit power, other parameters such as frequency spectrum and bandwidth used by the base station may be further considered.

The RAN slice priority may be determined according to the communication service requirements contained in the scenario information. For example, the RAN slice priority may be determined based on the communication service type, for example, a communication service type such as uRLLC that requires higher communication quality may be assigned a higher RAN slice priority. As another example, RAN slice priorities may be determined based on information indicating communication requirements such as latency, reliability, QoS, rate, etc. For example, RAN slices with higher requirements for latency, reliability, QoS, or rate may is assigned a higher priority. In addition, the scene information may also contain information directly indicating the priority of the RAN slice.

The spectrum resource requirement of the RAN slice may be determined according to the spectrum resource requirement of the base station included in the scenario information. For example, the amount of spectrum resources required by the base station in the RAN slice can be determined according to the amount of spectrum resources (eg, the number of channels, or indicating base station capacity) and the number of base stations. In addition, the scenario information may also include information directly indicating the spectrum resource requirements of the RAN slice.

In accordance with the present disclosure, the scenario information may be processed by any suitable of the apparatuses 202-208 in the system 20 as shown in FIG. 2 to determine the RAN inter-slice interference relationship, the RAN slice priority, and the RAN slice spectrum resource requirements .

For example, any suitable of the apparatuses 202-208 in the system 20 may perform some processing of the scene information to extract one or more of RAN inter-slice interference relationship, RAN slice priority, and RAN slice spectral resource requirements , or extract intermediate information for extracting one or more of the RAN inter-slice interference relationship, the RAN slice priority, and the RAN slice spectrum resource requirements, and combine the result information obtained by processing together with the RAN slice interference relation, RAN slice The priority and original scene information required by the RAN slice spectrum resource requirements are sent to other devices for further processing. For example, the on-chip manager may send the raw or processed scene information to a third management device (eg, CSMF as specified in the 3GPP standard). The third management apparatus may further process the received information, and send the processed information to the second management apparatus (eg, NSMF specified in the 3GPP standard). Similarly, the second management apparatus may further process the received information and send the processed information to the first management apparatus (eg, NSSMF as specified in the 3GPP standard).

In the present disclosure, which device in the system 20 processes the scene information is not particularly limited, as long as the first management device can finally obtain the RAN inter-slice interference relationship, the RAN slice priority, and the RAN slice spectrum resource requirement That's it. For example, when there is only one intra-slice manager in the system 20, the intra-slice manager can even directly process the collected scene information of each slice to obtain the RAN inter-slice interference relationship, the RAN slice priority, and the RAN slice. Slice spectrum resource requirements, and send the obtained information to the first management device with or without forwarding by the third management device/second management device. For another example, one or more on-chip managers in the system 20 may not perform any processing on the scene information, but the scene information is processed by one or more of the third management device, the second management device, and the first management device. Processing is performed to obtain the RAN inter-slice interference relationship, the RAN slice priority, and the RAN slice spectrum resource requirement.

The scenario information and the processing for the scenario information have been described in detail, and how to determine the arrangement or rearrangement scheme of spectrum resources among multiple RAN slices is described in detail below.

In the present disclosure, it is considered to enable sharing of spectrum resources between RAN slices, ie spectrum can be allocated with overlap among multiple RAN slices, where permitted (eg, without causing inter-RAN slice interference). resources, so as to improve the spectrum utilization rate as much as possible under the limited spectrum resources, and then meet the spectrum resource requirements of each RAN slice as much as possible (for example, satisfy the number of channels required by each RAN slice).

In fact, it is generally not possible to share spectrum resources between RAN slices indefinitely, because excessive overlapping of spectrum resources may lead to interference between RAN slices and/or may result in failure to meet the security requirements of RAN slices. Therefore, the extent to which the RAN slice allows to share spectrum resources with other RAN slices needs to be considered. In this disclosure, a parameter "Inter-slice sharing factor" is introduced to indicate the degree to which a RAN slice can share spectrum resources with other RAN slices. For example, the inter-slice sharing factor may represent the proportion of the number of channels that a RAN slice can share with other RAN slices to the total number of channels owned by the RAN slice. By setting the value of the sharing factor between slices, the degree of spectral isolation between RAN slices can be controlled. The smaller the value of the inter-slice sharing factor, the lower the degree to which a RAN slice can share spectrum resources with other RAN slices.

According to the present disclosure, the inter-slice sharing factor may be determined by any suitable one of the apparatuses 202-208 in the system 20 based on the scene information. In particular, the inter-slice sharing factor may be determined by the second management device 206 (eg, NSMF specified in the 3GPP standard) and sent to the first management device 204 (eg, specified in the 3GPP standard) NSSMF) for the first management device 204 to determine the arrangement or rearrangement scheme of spectrum resources among multiple RAN slices.

The first sharing factor of at least one RAN slice of the plurality of RAN slices may be determined based on the communication service demand indicated by the scenario information; any two of the plurality of RAN slices may be determined based on the inter-RAN slice interference relationship determined from the scenario information. a second sharing factor between the plurality of RAN slices; and for any two RAN slices in the plurality of RAN slices, determining the sharing factor between the two RAN slices based on the minimum value between the first sharing factor and the second sharing factor Sharing factor between slices.

Specifically, the first sharing factor may represent the degree of spectrum resource sharing required by the RAN slice based on the type of service it targets. For services requiring higher security/communication quality, a smaller first sharing factor can be set. For example, a RAN slice for uRLLC may require higher security, so a smaller first sharing factor may be set for the RAN slice. The first sharing factor may represent, for example, the degree of spectral resource sharing subjectively required by the RAN slice. The value interval of the first sharing factor may be between 0 and 1.

The second sharing factor may depend on the interference objectively existing between the base stations of the RAN slice. The second sharing factor may represent, for example, the degree to which spectral resources can be shared objectively. The second sharing factor may be determined according to the inter-chip interference overlay matrix described above. Specifically, the second sharing factor between slice i and slice j

can be determined as:

For slice i and slice j, the inter-slice sharing factor α _ij can be determined as the first sharing factor

shared factor with second

the minimum value between

For networks where there are multiple RAN slices, there may be a table representing the sharing factor between slices. Table 1 shows the inter-slice sharing factor table for a network comprising 3 RAN slices.

	片1slice 1	片2 slice 2	片3slice 3
片1 slice 1	11	0.50.5	0.20.2
片2 slice 2	00	11	00
片3slice 3	0.50.5	0.30.3	11

Table 1

As shown in Table 1, the proportion of spectrum that can be shared by slice 1 and slice 2 is 0.5, that is, 50% of the spectrum resources allocated to slice 1 can be shared with slice 2, and the spectrum that slice 2 can share with slice 1 The resource ratio is 0. In other words, α _ij and α _ji may be different values, and when determining the arrangement or rearrangement scheme of spectrum resources among multiple RAN slices, as explained below, the two values of α _ij and α _ji will be considered at the same time In order to meet the requirements for the degree of spectrum resource sharing between slice i and slice j.

According to the present disclosure, an arrangement or rearrangement scheme of spectrum resources among multiple RAN slices is determined under the condition of comprehensive consideration of the inter-slice sharing factor, RAN slice priority, RAN slice spectrum resource requirements and the total number of spectrum resources available to the network. In the following, the specific operation of determining the arrangement scheme of spectrum resources among multiple RAN slices is first described. For example, spectrum resources may be arranged among RAN slices initially, that is, when each RAN slice has not been allocated any spectrum resources.

Which device determines the arrangement scheme does not constitute a limitation of the present disclosure, and any appropriate device (shown or not shown in FIG. 2 ) may determine the arrangement scheme of the spectral resources as appropriate. For the sake of brevity, as a unified example herein, the arrangement scheme of spectrum resources among multiple RAN slices is determined by the first management device 204 (eg, NSSMF specified in 3GPP) shown in the system 20 of FIG. 2 .

The determination of the arrangement scheme of spectrum resources among multiple RAN slices can be regarded as the following optimization problem: how to meet the spectrum resource requirements of each RAN slice as much as possible under the condition that the requirements of each RAN for spectrum resource sharing are met, And make the spectrum resource requirements of RAN slices with higher priority be satisfied to a higher degree and make the spectrum resource requirements of RAN slices that allow a higher degree of spectrum resource sharing to be satisfied to a higher degree (in other words, the same as allowing a lower degree of spectrum resource sharing). Compared with RAN slices with a higher degree of spectrum resource sharing, under the same other conditions (eg, priority), more spectrum resources are allocated to RAN slices that allow a higher degree of spectrum resource sharing, so that more spectrum resources can be satisfied. Spectrum resource requirements, because this can provide more spectrum resources that can be shared, thereby improving spectrum resource utilization).

For the first management device 204 that determines the arrangement scheme of spectrum resources among multiple RAN slices, the input X ₁ of the above optimization problem can be expressed as X ₁ =[α,P,N′,N _RB ], and The output can be at least a matrix H ₁ representing the allocation scheme of spectral resources among the various RAN slices, (eg, the matrix can indicate how many spectral resources (eg, how many channels) are allocated to each RAN slice), where α is the representative slice A matrix of inter-slice sharing factors (e.g., a matrix corresponding to an item of an inter-slice sharing factor table), P is a matrix representing RAN slice priorities, and N' is a matrix representing RAN slice spectrum resource requirements (e.g., representing each RAN slice required number of channels), N _RB represents the total number of spectrum resources available to the network (eg, the total number of channels available in the network). For the convenience of description, hereinafter, a channel is used as an example to represent the spectrum resource, and the amount of the RAN spectrum resource can be expressed as the number of channels.

Specifically, the above optimization problem can be expressed as the following formula (1):

stN _s ≤N′ _s

N _s,j ≤min{α _sj N _s ,α _js N _j }

Among them, p _s represents the priority of the slice s; N _s represents the number of channels allocated to the slice s; N' _s represents the number of channels required by the slice s; N _s,j represents the channels shared between the slice s and the slice j number; α _sj represents the inter-slice sharing factor between slice s and slice j (ie, represents the channel ratio that slice s can share with slice j).

In particular, it can be understood from the above formula that N _s,j is a value obtained under the condition that the respective requirements on the channel sharing degree between slice s and slice j are taken into consideration. For example, referring to the value of the sharing factor in Table 1, the proportion of channels that can be shared by slice 1 and slice 2 is 0.5, while the proportion of spectrum resources that can be shared by slice 2 and slice 1 is 0. No matter what the values of N ₁ and N ₂ are, the number of channels shared between slice 1 and slice 2 is 0.

In addition, it can be understood from the above formula that in order to make

the value of maximizing the

Since α _sj and α _js are inter-slice sharing factors determined according to the scene information, the spectrum resource requirements of the RAN slice with a larger The number of channels of a RAN slice is equal to the number of channels required by the RAN slice), so that the value of N _s,j is as large as possible. In other words, the greater the number of channels allocated to a RAN slice with a larger inter-slice sharing factor, the greater the number of channels that can be shared based on the inter-slice sharing factor, which in turn can bring more allocable to the entire network. Therefore, on the one hand, the requirements of the number of channels of each RAN slice are met to a higher degree, and on the other hand, the utilization rate of spectrum resources is improved.

Equation (1) can be solved by means of an artificial intelligence (AI) algorithm. Equation (1) can be solved using any suitable AI algorithm to determine the arrangement scheme of spectrum resources among multiple RAN slices. In this paper, we introduce the deep Q-network (DQN) algorithm as an example. It should be understood that the DQN algorithm is only an example, and does not constitute a limitation to the solution of the present disclosure.

As a reinforcement learning algorithm, the basic principle of DQN is to use repeated iterative process to train the neural network, and finally make the algorithm converge. The process of using DQN to solve the optimization problem described in equation (1) above can be simply summarized as: in each iteration of the algorithm, an action is made according to the current state of the network, and the reward value brought by the action is calculated; Use the reward value to train the neural network. The larger the reward value brought by an action, the next time the entire algorithm is run, the action similar to the action will be performed with a higher probability in a similar state; after several rounds of iterative training, The algorithm converges to make

The largest spectrum resource scheduling scheme H ₁ . Here, the state of the DQN algorithm can be designed as: [μ, N], where,

μ=[μ ₁ , μ ₂ ,...,μ _S ],

N=[N ₁ ,N ₂ ,...,N _S ];

The action to be taken in each iteration of the DQN algorithm can be expressed as deciding which RAN slice to allocate spectrum resources to in the current state; in addition, the reward value of the DQN algorithm can be designed as

Specifically, Fig. 4 presents an exemplary operation process of the DQN algorithm.

At the beginning of each iteration, the agent running the DQN algorithm determines which RAN slice is allocated spectrum resources for in the current state. Here, actions can be chosen according to the ε-greedy policy. That is, the agent selects actions based on the probability ε, specifically, randomly selects a RAN slice with the probability of ε to allocate spectrum resources, and selects the optimal action based on the training data with the probability of 1-ε. It should be noted that, as the number of iterations increases, ε can become smaller and smaller, which tends to select the optimal action based on the training data.

After determining the RAN slice to which spectrum resources are to be allocated (hereinafter referred to as the current RAN slice), the agent needs to query the available spectrum resources in the current state, for example, including the remaining spectrum resources that have not been allocated and those that have been allocated but can be used with Spectrum resources shared by the current RAN slice. The shareable spectral resources are determined by the state [μ, N] and the sharing factor α. After allocating the spectrum for the current RAN slice, the agent will update the state and calculate the reward value, and combine the relevant data (for example, the current state, the action taken this time, the reward value brought by the action, and the state after the action is taken ( i.e. the next state), etc.) are stored in the experience pool for training and updating the neural network. After updating the state, the agent performs the next iteration, that is, determines the RAN slice to which spectrum resources are to be allocated, and performs corresponding subsequent operations. When all RAN slices are allocated, one execution of the algorithm is completed. The algorithm terminates after a certain cutoff condition (eg, a certain degree of convergence) or number of executions is reached.

The specific operation of determining the arrangement scheme of spectrum resources among multiple RAN slices has been described above. It should be pointed out that although the initial situation is used as an example to describe the arrangement scheme of spectrum resources, the above operations are not limited to the initial situation. When rearranging the spectrum resources, it can also be determined according to the above specific operations as How many spectrum resources are allocated to each RAN slice, and then (as will be explained below) it is determined which type of spectrum resources are allocated for each RAN.

Advantageously, since the scheme of the present disclosure considers partial overlapping of spectral resources among multiple RAN slices according to the degree accepted by each RAN slice (ie, sharing factor), the spectral satisfaction of each RAN slice is improved, and the spectrum utilization.

As explained above, when the network changes dynamically, it may be necessary to dynamically add, delete or modify RAN slices. That is, rearranging of spectrum resources among multiple RAN slices may be involved. In the rearrangement of spectrum resources, in addition to the consideration of allocating partially overlapping spectrum resources to RAN slices to improve spectrum utilization and spectrum satisfaction as explained above, in particular, the solution of the present disclosure also focuses on rearranging spectrum resources. How to reduce the reconfiguration complexity of spectrum resources during scheduling. Hereinafter, this will be described in detail.

According to the present disclosure, it can be considered to reduce the reconfiguration complexity of spectrum resources from two aspects.

First, in practice, networks (eg, network traffic) are always changing dynamically. If the spectrum resource scheduling scheme is updated between RAN slices as soon as the network traffic changes, it will lead to too frequent reconfiguration operations, which will increase the complexity of spectrum resource reconfiguration in signaling, operation, etc., which will lead to A waste of time and economical costs. Therefore, the present disclosure considers reducing the reconfiguration complexity of the spectrum resources by limiting the timing of triggering the rearrangement of the spectrum resources. The present disclosure limits the triggering of spectrum resources among multiple RAN slices by introducing the parameter "Maximum Slice Capacity".

Specifically, the maximum slice capacity can reflect the maximum number of users that the RAN can serve. When the load of a RAN slice in the network exceeds the maximum slice capacity of the RAN slice, the spectrum resources allocated to the RAN slice may not be enough to cope with the current number of users in the RAN slice. rearrangement between. In other words, in response to the load of the RNA slice exceeding the slice maximum capacity of the RAN slice, the spectral resources are rearranged.

The slice maximum capacity of the at least one RAN slice of the plurality of RAN slices may be determined based at least on the RAN intra slice interference relationship and the amount of spectrum resources to be allocated for the at least one RAN slice of the plurality of RAN slices. Specifically, the maximum slice capacity of the RAN slice s can be determined by the following formula (2)

Among them, N _s represents the amount of spectrum resources (for example, the number of channels) allocated to the slice s,

is the average spectral resource requirement (e.g., average channel requirement) of the base stations in slice s,

is the average number of users that can be served by a single base station in slice _s , n is the maximum sharing ratio within a slice determined according to the interference relationship in slice s, and more specifically, according to the base station interference overlap matrix I in slice s (i.e. , the maximum sharing ratio of spectrum resources among the base stations in the slice s).

The RAN intra-chip interference relationship may be determined based on scene information. More specifically, the interference relationship matrix between the base stations in the RAN slice can be calculated according to the information such as the base station location and transmit power indicated by the scene information, that is, the base station interference overlap matrix I. If there is interference between i and base station j, then the item I _ij =1 in the base station interference overlap matrix I, otherwise I _ij =0.

Further, the maximum intra-chip sharing ratio η _s can be determined by the following operations:

- Binary inversion of the interference overlap matrix I;

_-find out the fully connected sets and independent nodes F ₁ , F ₂ , .

- Combine these fully connected sets and mutually independent nodes to form sets

which is

- determine the ratio of the total number of base stations B to the above-mentioned fully connected set together with the total number Z of independent nodes as the maximum sharing ratio η _s , i.e.,

According to the present disclosure, the maximum slice capacity of each RAN slice can be determined each time an arrangement/rearrangement scheme of spectrum resources is determined. For example, the maximum slice capacity of each RAN slice is determined whether it is the first arrangement of spectrum resources or any re-arrangement. For another example, in the case where the rearrangement of spectrum resources does not result in the amount of spectrum resources allocated for one or more RAN slices, the slice maximum capacity of the one or more RAN slices may not be re-determined. Also, the entity that determines the maximum capacity of the slice (eg, the first management device 204 in the system 20 of FIG. 2, but the maximum capacity of the slice may also be determined by other appropriate entities) may report to the on-chip manager 202 and other entities in the wireless network. The entity recording the network slice load changes transmits the determined slice maximum capacity of the at least one RAN slice. The entity that records the load change of the network slice may notify the entity (for example, the first management device 204 ) that arranges/rearranges the spectrum resources when the load of a certain RAN slice exceeds the maximum capacity of the slice corresponding to the slice, To trigger the rearrangement of spectrum resources between RAN slices. According to the present disclosure, as described in detail below with reference to FIGS. 6-8 , the entity that records network slice load changes includes one or more of the entities that implement the following functions: Unified Data Warehouse UDR/Unified Data Management UDM, Operation Maintenance Management OAM , network slice quota NSQ or network slice selection function NSSF.

The second aspect of reducing the complexity of reconfiguration of spectrum resources will be described below. The process of reallocating spectrum resources that have been allocated to a certain RAN slice to another RAN slice brings complexity in signaling and operation. Therefore, in addition to reducing unnecessary triggering of spectrum rearrangement, the present disclosure further considers the number of spectrum resources allocated to existing RAN slices that are reallocated to other RAN slices after spectrum rearrangement is triggered as little as possible. In other words, the present disclosure considers reducing as much as possible the amount of spectrum resources that have been allocated to a certain RAN slice and need to be reallocated to other RAN slices.

Specifically, when determining a scheme for rearranging spectrum resources among multiple RAN slices, it may be considered to reduce the number of spectrum resources that have been allocated to a certain RAN slice and need to be reallocated to another RAN slice. When determining the rearrangement scheme of spectrum resources among multiple RAN slices, the above formula (1) can be modified into the following formula (3) to achieve this purpose.

stN _s ≤N′ _s

N _s,j ≤min{α _sj N _s ,α _js N _j }

Among them, the item

It can represent the proportion of the number of spectrum resources allocated to existing RAN slices that are reallocated to other RAN slices and the total spectrum resources, where γ ₁ represents the reconfiguration weight, and its value can be between 0 and 1;

Represents the number of times that the spectrum resource n (eg, channel n) allocated to an existing RAN slice is reallocated to other RAN slices; N _RB represents the total amount of spectrum resources (eg, the total number of channels).

Specifically, it can be determined according to the operation described above with reference to formula (1) such that

At the same time as possible the largest possible spectrum resource scheduling scheme, by determining the first characteristics of the spectrum resources to be allocated for each RAN slice

be as small as possible, so that the entire formula (3) is as large as possible. The first characteristic of the spectrum resource may, for example, indicate at least a spectrum resource type including the following: spectrum resources not allocated to a RAN slice, spectrum resources allocated to a RAN slice but not yet used by the RAN slice, and spectrum resources that can be compared with those allocated to a RAN slice. The spectrum resources of the overlapped spectrum resources. The general principle for determining the first characteristic of spectrum resources may be to allocate spectrum resources in the following order as much as possible: spectrum resources not allocated to RAN slices, spectrum resources allocated to RAN slices but not yet used by the RAN slices, and spectrum resources that can be used with existing RAN slices. Spectrum resources in which the spectrum resources allocated to the RAN slice overlap. In this way, the spectrum resources allocated to the RAN slices can be used as little as possible, so that the readjustment of spectrum resources between RAN slices can be introduced as little as possible, thereby reducing the reconfiguration complexity of spectrum resources, and in the reconfiguration of spectrum resources. The impact on the RAN slices to which spectrum resources have been allocated is greatly reduced during scheduling.

Here, considering reducing the reconfiguration complexity of spectrum resources, the spectrum resources not allocated to the RAN slice, the spectrum resources allocated to the RAN slice but not yet used by the RAN slice, and the The three spectrum resource types of spectrum resources with overlapping spectrum resources are taken as examples to illustrate the first characteristic of spectrum resources. However, it should be understood that the first characteristic of the spectrum resource is not limited to the above type of spectrum. For example, when determining the arrangement or rearrangement scheme of spectrum resources among RAN slices, what kind of spectrum resources are allocated to each RAN slice may also be determined according to the communication service requirements of the RAN slices. In this case, the first characteristic may further include other characteristics such as a frequency band corresponding to the spectrum resource, so as to perform targeted spectrum resource allocation for each RAN slice.

FIG. 5 schematically shows a second conceptual operational flow 50 of a method for a system for wireless communication according to an embodiment of the present disclosure, which operational flow is, for example, applicable to the case of rearranging spectrum resources. Similar to FIG. 3 , corresponding operations of the second conceptual operational flow 50 may be performed by various apparatuses in the system 20 for wireless communication according to the present disclosure.

The operations of S502 to S506 of the second conceptual operational flow 50 are similar to the operations of S302 to S306 of the first conceptual operational flow 30 explained with reference to FIG. 3 .

The difference is that in S506, since the spectrum resources are rearranged, as described in detail above, in the case where the frequency spectrum that has been allocated to the existing RAN slice is reallocated to other RAN slices as little as possible down to rearrange the spectrum resources. For example, how many spectral resources (eg, how many channels) are to be allocated for each RAN slice, and which types (eg, unallocated, allocated but not used, and Spectrum resources that are allocated for use but can be shared) are allocated to RAN slices.

At S508, as explained above, the slice maximum capacity of the RAN slice is determined based on at least the RAN intra slice interference relationship and the number of spectrum resources allocated for the RAN slice. For example, the slice maximum capacity of each RAN slice may be determined by the first management means 204 in the system 20 of FIG. 2 . In addition, the first management device 204 may also send the determined maximum slice capacity to an entity in the wireless network that records network slice load changes, so as to subsequently trigger the rearrangement of spectrum resources, and the first management device 204 may also send the determined maximum capacity The maximum capacity of the slice is sent to the intra-chip manager for the intra-chip manager to determine the allocation/reallocation scheme of the RAN intra-chip spectrum resources among the base stations. Although this step S508 is applicable to the rearrangement of spectrum resources, it can be understood that the first conceptual operation flow 30 described above with reference to FIG. 3 may also include the second conceptual operation flow S508 of 50 is a similar operation of determining and sending the maximum capacity of the slice.

At S510, the entity in the wireless network that records the load change of the network slice detects that the load of a certain RAN slice exceeds the maximum slice capacity of the RAN slice, or a new RAN slice is generated in the wireless network due to burst communication, etc., Then the rearrangement of spectrum resources is triggered. In this case, the scene information can be re-collected according to the situation and the rearrangement scheme of the spectrum resources can be determined, or the rearrangement scheme of the spectrum resources can be directly determined when the scene information is sufficient. If it is not detected that the load of any RAN slice exceeds the maximum slice capacity of the RAN slice, or a new RAN slice is not generated, as in the "No" branch of S510, the rearrangement of spectrum resources is not triggered.

Above, the operation of determining the arrangement or rearrangement scheme of spectrum resources among a plurality of RAN slices according to the present disclosure has been described in detail. According to the present disclosure, since the use of spectrum resources that can be shared among RAN slices is considered, spectrum utilization rate and spectrum resource satisfaction of RAN slices can be improved. In addition, since the timing of triggering the re-arrangement of spectrum resources between RAN slices is limited and the amount of allocated spectrum resources that need to be adjusted between RAN slices is limited, the reassignment of spectrum resources between RAN slices can be reduced as much as possible. Configuration complexity.

In fact, in addition to the need to allocate corresponding spectrum resources for each RAN slice, it is also necessary to allocate corresponding spectrum resources to at least one base station (for example, each base station) within the RAN slice. Hereinafter, this will be described in detail.

According to the present disclosure, the allocation or reallocation scheme of spectrum resources within a RAN slice can be determined by any suitable apparatus in the system 20 shown in FIG. 2 . In particular, an allocation or reallocation scheme of spectrum resources within a RAN slice may be determined by an intra-slice manager.

between an entity that determines an allocation/re-allocation scheme of spectrum resources within a RAN slice (eg, the intra-slice manager in FIG. 2 ) and an entity that determines an arrangement/rearrangement scheme of spectrum resources between RAN slices (eg, FIG. 2 ) In the case where the first management device of the /or the number of spectrum resources allocated to the slice, etc. For example, after the first management device 204 in FIG. 2 determines the allocation/reallocation scheme of the spectrum resources within the RAN slice, the first management device 204 may assign a value indicating the first characteristic of each spectrum resource allocated to each RAN slice The information and/or the information on the number allocated to each RAN slice is sent to the corresponding one or more intra-slice managers for the intra-slice manager to determine an allocation/reallocation scheme of spectrum resources within the slices managed by it.

According to the present disclosure, an allocation or reallocation scheme of spectral resources within a corresponding RAN slice of a plurality of RAN slices may be determined based on at least a first characteristic and/or amount of spectral resources to be allocated for the corresponding RAN slice, wherein: The allocation or reallocation scheme of spectrum resources within one RAN slice includes a second characteristic and quantity of spectrum resources to be allocated for at least one base station in the RAN slice. The second characteristic of the spectrum resource may indicate at least a spectrum resource type including: spectrum resources not allocated to the base station, spectrum resources allocated to the base station but not yet used by the base station, and spectrum resources that can overlap with the spectrum resources allocated to the base station .

In the following, the specific operation of determining the allocation scheme of spectrum resources within the RAN slice will be described first. For example, spectrum resources may be allocated within the RAN initially, that is, when each base station has not been allocated any spectrum resources.

Specifically, the determination of the allocation scheme of spectrum resources within the RAN slice can be regarded as the following optimization problem: how to satisfy the spectrum resource requirements of each base station within the RAN slice as much as possible. The satisfaction of the base station with the spectrum can be considered from two aspects. On the one hand, the greater the number of spectrum resources allocated by the base station, the higher the satisfaction. In other words, with the help of the allocated spectrum resources, the more users the base station can serve, the higher the satisfaction. On the other hand, the higher the QoS or the higher the economic benefit that the base station brings to the user by utilizing the allocated spectrum resources, the higher the satisfaction. For the latter, for example, spectrum resources with different first characteristics may bring different degrees of spectrum satisfaction to the base station.

More specifically, the above optimization problem can be expressed as the following equation (4)

st

Among them, H ₂ is a matrix representing the allocation scheme of spectrum resources among the base stations of the slice s (for example, the matrix can indicate how many spectrum resources (for example, how many channels) are allocated to each base station respectively),

represents the number of spectrum resources allocated by base station b of slice s (for example, the number of channels); N' _b represents the number of spectrum resources required by base station b; _ub represents the benefit value brought by base station b after allocating spectrum resources (for example, , which can reflect the QoS or economic benefits described above); N _s represents the total number of spectrum resources allocated for slice s;

Indicates the load of slice s (for example, the number of users);

Represents the slice maximum capacity of slice s.

Equation (4) can be solved by means of an artificial intelligence (AI) algorithm. Equation (4) can be solved using any suitable AI algorithm to determine the scheduling scheme of spectrum resources among multiple base stations within a RAN slice. In this article, the ant colony optimization (ACO) algorithm is used as an example to introduce. It should be understood that the ACO algorithm is only an example, and does not constitute a limitation to the solution of the present disclosure.

ACO is a swarm intelligence algorithm whose principle is to solve the optimization problem by simulating the method of ants looking for food. The traditional ant colony algorithm is often used to find the shortest path problem. In the initial stage of the algorithm, ants will be randomly placed on each node, and the ants need to traverse all nodes. When each ant walks, it releases "pheromone" on the path, and subsequent ants will choose the path according to the pheromone concentration on the path. Eventually, almost all ants will choose the path with the highest pheromone concentration (ie, the largest pheromone).

In the present disclosure, the basic idea of using the ACO algorithm to solve the optimization problem described in Equation (4) above can be simply summarized as: take the base station in the RAN slice to be allocated spectrum resources as the node that the ants need to traverse, and each Ants need to traverse all nodes. Every time each ant walks to a node, it allocates the currently available spectrum resources as much as possible to the base station represented by the node (for example, the spectrum resources that are not allocated or used, or the spectrum resources that have been allocated to the base station that does not interfere with the base station). spectrum resources). Furthermore, it is possible to

Used as a pheromone for the ACO algorithm. In this way, when all ants have traversed all nodes, we can get the

Largest on-chip spectrum allocation scheme.

Specifically, after an ant has traversed all nodes, the ACO algorithm will calculate the pheromone increment ΔP ^k of the path k traversed by the node this time, and take the average value of the total number B of base stations based on it, that is,

And take the mean value as the pheromone increment between each node on the path k. Cumulative pheromone between nodes i and j on path k

It can be calculated according to the following formula (5):

Among them, in the formula

is the accumulated pheromone between node i and node j after the k-1th path (for example, the path traversed by the previous ant). The accumulated pheromone between nodes will affect the path selection of subsequent ants. Eventually, the ACO algorithm will converge such that

The allocation scheme of the largest spectrum resource within the RAN slice.

The specific operation of determining the allocation scheme of spectrum resources within a RAN slice has been described above. It should be pointed out that although the initial situation is used as an example to describe the allocation scheme of spectrum resources, the above operations are not limited to the initial situation. Operations determine how many spectral resources are allocated to each base station, and then (as will be explained below) determine what type of spectral resources are allocated to each base station.

Similar to what has been described above with reference to the inter-slice spectrum rearrangement, when reassigning spectrum resources within a slice, it is also considered to reduce the reconfiguration complexity of spectrum resources. Similar to the inter-slice spectrum rearrangement, it can also be considered to reduce the spectrum resource reconfiguration complexity within a slice by making the number of spectrum resources allocated to an existing base station to be reallocated to other base stations as small as possible. In other words, the present disclosure considers reducing as much as possible the amount of spectrum resources that have been allocated to a certain base station and need to be reallocated to other base stations.

Specifically, when determining the reallocation scheme of spectrum resources within a RAN slice, it may be considered to reduce the number of spectrum resources that have been allocated to a certain base station and need to be reallocated to another base station. When determining the reallocation scheme of spectrum resources within the RAN slice, the above formula (4) can be modified into the following formula (6) to achieve this purpose.

Among them, the item

It can represent the proportion of the number of spectrum resources allocated to the base station that are reallocated to other base stations and the total spectrum resources allocated to the slice s, where γ ₂ represents the intra-slice reconfiguration weight, which can range from 0 to 1 between;

represents the number of times that the spectral resource n (eg, channel n) allocated to the base station has been reallocated to other base stations; _Ns represents the total amount of spectral resources allocated to the slice s.

For example, it can be determined in accordance with the operation described above with reference to equation (4) such that

At the same time as the largest possible spectrum resource allocation scheme, by determining the second characteristic of the spectrum resources to be allocated for each base station, the

be as small as possible, so that the entire equation (6) is as large as possible. The second characteristic of the spectrum resource may indicate at least a spectrum resource type including: spectrum resources not allocated to the base station, spectrum resources allocated to the base station but not yet used by the base station, and spectrum resources that can overlap with the spectrum resources allocated to the base station . The general principle for determining the second characteristic of the spectral resources may be to allocate the spectral resources in the following order as much as possible: the spectral resources that are not allocated to the base station, the spectral resources that have been allocated to the base station but not yet used by the base station, and the spectral resources that can be compared with those allocated to the base station. The spectrum resources of the overlapped spectrum resources. In this way, the spectrum resources allocated to the base stations can be used as little as possible, so that the readjustment of the spectrum resources between the base stations is introduced as little as possible, thereby reducing the complexity of the spectrum resource reconfiguration, and when the spectrum resources are reallocated The impact on the base stations that have allocated spectrum resources is greatly reduced.

The system for wireless communication and the method performed by the system according to the present disclosure have been described in detail above.

Three examples of information flows under a specific embodiment of the present disclosure will be described below with reference to FIGS. 6-8 . In this embodiment, the NSSMF acts as the first management device 204 in FIG. 2 , the NSMF acts as the second management device 206 , and the CSMF acts as the third management device 208 in FIG. 2 . In addition, in this embodiment, the intra-slice manager is responsible for collecting scene information and determining the allocation/reallocation scheme of spectrum resources within RAN slices, and the NSSMF is responsible for determining the arrangement/rearrangement scheme and slice-to-slice arrangement/rearrangement of spectrum resources between RAN slices. The maximum capacity, the RNA inter-slice interference relationship (eg inter-slice sharing factor) is determined by NSMF and the scene information is processed to a certain extent by CSMF to facilitate further processing by subsequent entities.

Table 2 illustrates the entities involved in the information flow interactions in Figures 6-8.

接入和移动管理功能Access and mobility management functionAccess and mobility management function	AMFAMF
通信服务管理功能Communication service management functionCommunication service management function	CSMFCSMF
网络切片管理功能Network slice management functionNetwork slice management function	NSMFNSMF
网络切片选择功能Network slice selection functionNetwork slice selection function	NSSFNSSF
网络切片子网管理功能Network slice subnet management functionNetwork slice subnet management function	NSSMFNSSMF
网络仓库功能Network repository functionNetwork repository function	NRFNRF
网络切片配额Network slice quotaNetwork slice quota	NSQNSQ
操作管理和维护Operation administration and maintenanceOperation administration and maintenance	OAMOAM
策略控制功能Policy control functionPolicy control function	PCFPCF
统一数据管理Unified data managementUnified data management	UDMUDM
统一数据仓库Unified data repositoryUnified data repository	UDRUDR
用户设备User EquipmentUser Equipment User Equipment	UEUE

Table 2

First, an example of a first information flow in this specific embodiment is described with reference to FIG. 6 .

As shown in FIG. 6, at step 1, the intra-slice manager collects the scene information of the RAN slice it is responsible for, and sends the collected scene information to the CSMF. For example, the on-chip manager may send scene information such as base station location, base station transmit power, base station's spectral resource requirements and communication service requirements to the CSMF.

CSMF processes the received scene information at step 2. For example, the CSMF may determine the RAN slice priority based on the communication service requirements contained in the scenario information as described above. For another example, the CSMF may determine the spectrum resource requirement of the RAN slice based on the spectrum resource requirement of the base station included in the scenario information as described above. Optionally, CSMF may also perform some intermediary processing on the scene information to facilitate subsequent operations by other entities.

The CSMF may, at step 3, send the processed scene information to the NSMF. Here, the processed scene information includes information obtained as a result of processing the original scene information and required by other entities for subsequent operations (eg, for obtaining RAN inter-slice interference relationship, RAN slice priority, and RAN slice spectrum resource requirements). required) raw scene information.

At step 4, the NSMF may perform further processing on the information received from the CSMF. For example, the NSMF may determine the RAN inter-slice interference relationship based on information such as base station location and transmit power, and further determine the inter-slice sharing factor.

At step 5, the NSSMF may send the further processed scene information to the NSSMF. Here, the further processed scene information includes the information obtained as a result of processing the information received from the CSMF and the original scene information/information received from the CSMF that may be required for subsequent operations by other entities (for example, the NSSMF can determine the intra-chip information) Interference Relationship Information needed to determine the maximum capacity of the slice, such as raw base station location/transmit power or (eg, as can be determined by CSMF) a base station interference relationship matrix or the like).

At step 6, the NSSMF determines a spectrum resource scheduling/rearrangement scheme between RAN slices based on the received information, and further determines the slice maximum capacity of each RAN slice involved.

At step 7, the NSSMF may send the slice maximum capacity to the entity that records network slice load changes (eg, UDR/UDM in this example), to facilitate triggering by the entity when it detects that the RAN slice load exceeds the slice maximum capacity Rearrangement of spectrum resources between RAN slices.

At step 8, the NSSMF may send the spectral resource scheduling/rearrangement scheme between RAN slices and the maximum capacity of the slice to the entity used to determine the intra-chip spectral resource allocation/re-allocation scheme (eg, in this embodiment, the intra-chip management device).

At step 9, the on-chip manager may determine an allocation scheme of spectrum resources among the base stations in the RAN.

Steps 10 to 14 involve information exchange among the entities of UE, AMF, PCF, UDR/UDM and OAM. The purpose of these information exchanges is to determine whether a UE can be registered to a certain network slice (e.g., based on the spectrum resources currently allocated to each RAN slice) according to the quota of the maximum number of users of the network slice (e.g., the RAN slice mainly discussed in this disclosure). , the RAN slice of interest in this disclosure). These steps have been specified in solution#1 of 3GPP TR 23.700-40v0.3.0, for example, and will not be described in detail here. It should be noted that, in the context of the solution of the present disclosure, the "quota of the number of users" may correspond to the "capacity" in the present disclosure. Therefore, the total quota of the maximum number of users involved at step 10 may correspond to the sum of the maximum capacities of all slices involved, and the local quota of the maximum number of users involved at step 11 may correspond to the slice of the current slice that the user is to register Maximum capacity.

In the case that the PCF and AMF determine in steps 10-14 that the request of the UE to register with the corresponding RAN slice can be accepted, the UE may send the request to register to the corresponding RAN slice managed by the intra-slice manager in step 15 .

In some cases, for example, when the spectrum resources of the base station to serve the UE are insufficient, the UE's registration request may trigger the reallocation of spectrum resources among the base stations in the slice at step 16 . In addition, at step 17, since a new UE is registered to a certain network slice, the PCF and UDR/UDM can update and reallocate the quota of this slice.

In steps 10-14, the PCF and AMF determine that the spectrum resources of the RAN slice that the UE requests to register are insufficient to cope with the new UE that wants to join (for example, the joining of the UE will cause the load of the RAN slice to exceed its Slice maximum capacity), PCF can notify NSSMF to perform rearrangement of spectrum resources among RAN slices (step 18). And at step 19, the PCF and the UDR/UDM may update the local quota based on the new intra-chip maximum capacity determined after the spectrum resource rearrangement.

Next, an example of a second information flow according to the above-mentioned specific embodiment of the present disclosure will be described with reference to FIG. 7 .

Steps 1 to 6 of the second information flow example shown in FIG. 7 are similar to the first information flow example described with reference to FIG. 6 , and the description is not repeated here.

At step 7, different from the first information flow example, the NSSMF sends the slice maximum capacity to the NSQ, which is the entity that records network slice load changes, to facilitate triggering of the spectrum by the NSQ when it detects that the load of the RAN slice exceeds the slice maximum capacity. Rearrangement of resources between RAN slices.

At step 8, similar to the first information flow example, the NSSMF may send the spectral resource scheduling/rearrangement scheme between RAN slices and the slice maximum capacity to the slice as the entity used to determine the intra-slice spectral resource allocation/reallocation scheme internal manager.

Steps 10 to 18 involve information exchange among the entities of UE, AMF, NSQ, NRF and UDM/UDR. These information exchanges are intended to determine whether the spectrum resources currently allocated to each RAN slice can be received based on the maximum number of users quota (in other words, the slice maximum capacity) of the network slice (eg, the RAN slice mainly discussed in this disclosure). A request for the UE to register with a certain network slice (eg, the RAN slice of interest in this disclosure). These steps have been specified in solution#2 of 3GPP TR 23.700-40v0.3.0, for example, and will not be described in detail here.

In step 19a, in the case that the UE can register to the corresponding RAN slice, if the spectrum resources of the base station to serve the UE are insufficient, the registration request of the UE can trigger the re-use of the spectrum resources at step 20a between the base stations in the slice distribute.

At step 18b, in the case where the UE's registration request is rejected because the spectrum resources of the RAN slice that the UE requests to register are insufficient to cope with the new UE that wants to join, at step 19b, the NSQ can request the NSSMF to perform spectrum resource registration Rearrangement between RAN slices (step 20b). And at step 21, the NSSMF may send the new maximum capacity within the chip determined after the spectrum resource rearrangement to the NSQ.

Next, an example of a third information flow according to the above-mentioned specific embodiment of the present disclosure will be described with reference to FIG. 8 .

Steps 1 to 6 of the third information flow example shown in FIG. 8 are similar to the first information flow example described with reference to FIG. 6 , and the description will not be repeated here.

At step 7, different from the first information flow example and the second information flow example, the NSSMF sends the slice maximum capacity to the NSSF, which is the entity that records the network slice load change, to facilitate the detection by the NSSF that the load of the RAN slice exceeds the slice At the maximum capacity, the rearrangement of spectrum resources between RAN slices is triggered.

At step 8, similar to the first and second information flow examples, the NSSMF may send the spectrum resource scheduling/re-arrangement scheme between RAN slices and the maximum capacity of the slice to the RAN for determining the intra-slice spectrum resource allocation/re-allocation scheme The entity's on-chip manager.

Steps 10 to 15 involve information exchange among the UE, AMF and NSSF entities. These information exchanges are intended to determine whether the spectrum resources currently allocated to each RAN slice can be received based on the maximum number of users quota (in other words, the slice maximum capacity) of the network slice (eg, the RAN slice mainly discussed in this disclosure). A request for the UE to register with a certain network slice (eg, the RAN slice of interest in this disclosure). These steps have been specified in solution#3 of 3GPP TR 23.700-40v0.3.0, for example, and will not be described in detail here.

At step 16, in the case that the UE can register to the corresponding RAN slice, if the spectrum resource of the base station to serve the UE is insufficient, the registration request of the UE can trigger the spectrum resource at step 17 between the base stations in the slice. redistribution.

At step 18, when the NSSF has counted that the number of users reaches the maximum capacity of the slice, at step 18, the NSSF may request the NSSMF to perform rearrangement of spectrum resources among RAN slices. And at step 20, the NSSMF may send the new intra-chip maximum capacity determined after the spectrum resource rearrangement to the NSSSF.

Three information flow examples according to a specific embodiment of the present disclosure have been briefly explained with reference to FIGS. 6-8 . It should be noted that the information flows of Figs. 6-8 are only schematic. The order in which the information is sent in FIGS. 6-8 can be further adjusted according to the situation, and some other unshown information flows can also be included. For example, the step 7 of sending the slice maximum capacity to the entity recording network slice load changes may be performed in parallel with the step 8 of sending the inter-slice spectrum arrangement and the slice maximum capacity to the intra-chip manager, or in reverse order. For another example, in the case of performing inter-chip spectrum resource re-arrangement or performing intra-chip spectrum resource reconfiguration, a new scene information collection/processing process may be involved. That is to say, before step 18 or step 16 in FIG. 6 or before step 20b or 20a in FIG. 7 or before step 19 or step 17 in FIG. 8 , one or more steps from steps 1 to 6 may be additionally included similar steps. In addition, the specific content of the information sent in each step may be slightly different according to the specific situation. For example, each specific operation involved in processing the scene information can be carried out by the corresponding one or more entities in the on-chip manager, CSMF, NSMF, and NSSMF as appropriate. Therefore, the information transmitted in steps 1 to 6 Can vary based on the specific operations each entity is doing. For example, the RAN slice spectrum resource requirement may be determined by the NSMF instead of the CSMF, in which case the CSMF may simply forward to the NSMF the original scenario information required to determine the RAN slice spectrum resource requirement. Further, the information sent to the entity recording network slice load changes may also include other parameters than the maximum slice capacity.

The solutions of the present disclosure have been described above in detail with reference to the accompanying drawings. In the solution of the present disclosure, advantageously, the spectral resources between multiple RAN slices are partially overlapped according to the degree accepted by each RAN slice (ie, the sharing factor), which improves the spectrum satisfaction of each RAN slice, and improves the spectrum utilization. On the other hand, in the solution of the present disclosure, by restricting the timing for triggering the rearrangement of spectrum resources, the complexity of spectrum resource rearrangement between spectrums is advantageously reduced. In addition, in the solution of the present disclosure, by making the number of spectrum resources allocated to existing RAN slices reallocated to other RAN slices as small as possible, and by making the frequency spectrum resources allocated to the base station be reallocated to the base station The number of spectrum resources is as much as possible, which further reduces the complexity of spectrum resource rearrangement between spectrum resources and intra-chip reconfiguration.

In addition, the solution of the present disclosure can also support a spectrum resource allocation scenario across operators. In this scenario, different RAN slices can be operated by different operators. The solutions of the present disclosure can enable spectrum resource sharing across operators and flexible spectrum resource allocation.

The effect of the solution of the present disclosure will be described below with the help of simulation results.

Table 3 shows the parameter table set for the simulation, where the channel is taken as the spectrum resource.

table 3

Among them, the channel requirement of the base station represents the number of frequency spectrums required by each base station. In this simulation example, the channel requirement of each base station in each slice is the same.

Figure 9 exemplarily shows a base station location scenario diagram representing the simulation.

In the scenario shown in FIG. 9 , the inter-slice sharing factors determined by the parameters shown in Table 3 are shown in Table 4.

	片1slice 1	片2 slice 2	片3slice 3
片1 slice 1	11	00	0.350.35
片2 slice 2	00	11	00
片3slice 3	0.50.5	00	11

Table 4

Table 5 shows the simulation results of determining the channel arrangement scheme between slice 1 and slice 3 by using the parameters shown in Table 3 under the scenario shown in FIG. 9 .

	片1slice 1	片2 slice 2	片3slice 3
分得信道数number of allocated channels	99	1212	1212
片频谱满意度 Chip Spectrum Satisfaction	100％100%	100％100%	80％80%

table 5

FIG. 10 shows a graph comparing the spectral resource (ie, channel) satisfaction of each slice using the scheme of the present disclosure and using the scheme of allocating independent spectral resources to each slice without considering inter-slice spectral resource sharing . As shown in FIG. 10 , when the total spectrum resources are limited (for example, the total number of channels is less than 40), compared with the solution of allocating independent spectrum resources among each slice, the solution of the present disclosure can satisfy the requirements to a greater extent. The demand for spectrum resources of each slice can effectively improve the satisfaction of spectrum resources of each slice.

Table 6 shows the simulation results of determining the spectrum allocation scheme within each chip by using the parameters shown in Table 3 under the scenario shown in FIG. 9 .

	片1slice 1	片2 slice 2	片3slice 3
基站数Number of base stations	2020	2020	2020
基站信道需求Base station channel requirements	33	33	33
基站平均频谱满意度Base Station Average Spectrum Satisfaction	90％90%	100％100%	100％100%

Table 6

FIG. 11 shows a graph comparing the spectral resource (ie, channel) satisfaction of each slice using the scheme of the present disclosure and using the scheme of allocating independent spectral resources to each slice without considering inter-slice spectral resource sharing . As shown in FIG. 11 , when the total spectrum resources are limited (for example, the total number of channels is less than 40), compared with the scheme of allocating independent spectrum resources among each slice, the scheme of the present disclosure can provide each slice with With more spectrum resources, it can also meet the demand for spectrum resources of each base station in each chip to a greater extent, thereby effectively improving the spectrum resource satisfaction of each base station.

Aspects of the present disclosure have been described through various embodiments. It should be noted that the above-described embodiments are merely exemplary. The solutions of the present disclosure can also be implemented in other ways, and still have the advantageous effects obtained by the above-mentioned embodiments.

In addition, it should be understood that the above-mentioned series of processes, systems, and devices in the systems can also be implemented by software and/or firmware. When implemented by software and/or firmware, a program constituting the software is installed from a storage medium or a network to a computer having a dedicated hardware configuration, such as a general-purpose computer/computer system 1200 shown in FIG. Various functions and the like can be executed when such a program is used. 12 is a block diagram of an example structure as a computer/computer system that may be employed in embodiments of the present disclosure. Although shown as a single block diagram, the functionality of computer/computer system 1200 may be implemented as a distributed system. For example, one processor may be used to perform some processing while other remote processors are used to perform other processing. Other elements of computer/computer system 1200 may be similarly distributed. Furthermore, the functions disclosed herein may be implemented on separate servers or devices that may be coupled together through a network. Additionally, one or more components of system 1200 may not be included.

In some embodiments, computer/computer system 1200 may be used as a whole to implement system 20 shown in FIG. 2 . In this case, in particular, each device included in the system 20 may be implemented as a module for realizing a corresponding function by each component in the system 1200 in cooperation with each other. In some embodiments, multiple devices included in the system 20 shown in FIG. 2 may be implemented by separate computer/computer systems 1200 . In some embodiments, some of the multiple devices included in the system 20 shown in FIG. 2 may be implemented by separate computer/computer systems 1200, and other parts may be implemented by one computer/computer system 1200 as a whole .

In FIG. 12 , a central processing unit (CPU) 1201 executes various processes according to a program stored in a read only memory (ROM) 1202 or a program loaded from a storage section 1208 to a random access memory (RAM) 1203 . In the RAM 1203, data required when the CPU 1201 executes various processes and the like is also stored as needed.

The CPU 1201, ROM 1202, and RAM 1203 are connected to each other via a bus 1204. Input/output interface 1205 is also connected to bus 1204 .

The following components are connected to the input/output interface 1205: an input section 1206, including a keyboard, a mouse, etc.; an output section 1207, including a display, such as a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 1208 , including a hard disk, etc.; and a communication section 1209, including a network interface card such as a LAN card, a modem, and the like. The communication section 1209 performs communication processing via a network such as the Internet.

A driver 1210 is also connected to the input/output interface 1205 as required. A removable medium 1211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc. is mounted on the drive 1210 as needed, so that a computer program read therefrom is installed into the storage section 1208 as needed.

In the case where the above-described series of processes are realized by software, a program constituting the software is installed from a network such as the Internet or a storage medium such as the removable medium 1211 .

It should be understood by those skilled in the art that such a storage medium is not limited to the removable medium 1211 shown in FIG. 12 in which the program is stored and distributed separately from the device to provide the program to the user. Examples of the removable medium 1211 include magnetic disks (including floppy disks (registered trademark)), optical disks (including compact disk read only memory (CD-ROM) and digital versatile disks (DVD)), magneto-optical disks (including minidiscs (MD) (registered trademark) )) and semiconductor memory. Alternatively, the storage medium may be the ROM 1202, a hard disk contained in the storage section 1208, or the like, in which programs are stored and distributed to users together with the devices containing them.

Exemplary embodiments of the present disclosure have been described above with reference to the accompanying drawings, but the present disclosure is not limited to the above examples, of course. Those skilled in the art may find various changes and modifications within the scope of the appended claims, and it should be understood that they will naturally come under the technical scope of the present disclosure.

It should be understood that machine-executable instructions in a machine-readable storage medium or program product according to embodiments of the present disclosure may be configured to perform operations corresponding to the above-described system and method embodiments. When referring to the above-described system and method embodiments, the embodiments of the machine-readable storage medium or program product will be apparent to those skilled in the art, and thus the description will not be repeated. Machine-readable storage media and program products for carrying or including the above-described machine-executable instructions are also within the scope of the present disclosure. Such storage media may include, but are not limited to, floppy disks, optical disks, magneto-optical disks, memory cards, memory sticks, and the like.

It should also be understood that embodiments of the present disclosure may also take the form of hardware circuits. Hardware circuits may include combinational logic circuits, clock storage devices (such as floppy disks, flip-flops, latches, etc.), finite state machines, memories such as static random access memory or embedded dynamic random access memory, custom designed circuits, Any combination of programmable logic arrays, etc.

In this specification, the steps described in the flowcharts include not only processing performed in time series in the stated order, but also processing performed in parallel or individually rather than necessarily in time series. Furthermore, even in the steps processed in time series, needless to say, the order can be appropriately changed.

Although the present disclosure and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the disclosure as defined by the appended claims. Furthermore, the terms "comprising", "comprising" or any other variation thereof in embodiments of the present disclosure are intended to encompass a non-exclusive inclusion such that a process, method, article or apparatus comprising a series of elements includes not only those elements, but also Include other elements not expressly listed, or which are inherent to such a process, method, article or apparatus. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in a process, method, article or apparatus that includes the element.

In addition, the present disclosure can also have the following configurations:

(1) A system for wireless communication, comprising:

one or more on-chip managers, at least one of the one or more on-chip managers is configured to collect scene information for a corresponding RAN slice of a plurality of radio access network RAN slices in the wireless network, wherein, The scenario information is used to determine at least the following information: RAN inter-slice interference relationship, RAN slice priority, and RAN slice spectrum resource requirements;

a first management device configured to determine an arrangement or rearrangement scheme of spectrum resources among the multiple RAN slices based on at least the scenario information, wherein the arrangement or rearrangement scheme of spectrum resources among the multiple RAN slices includes A first characteristic and quantity of spectrum resources to be allocated for at least one RAN slice of the plurality of RAN slices.

(2) The system of (1), wherein

The scenario information at least indicates one or more of the following items: base station location, base station transmit power, spectrum resource requirements and communication service requirements of the base station.

(3) The system of (1) or (2), wherein

The system further includes a second management device configured to determine, based on the scene information, an inter-slice sharing factor representing the degree to which the RAN slice can share spectrum resources with other RAN slices, and to send the determined inter-slice sharing factor to the first RAN slice. a management device for the first management device to determine an arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices.

(4) The system of (3), wherein determining the sharing factor between slices comprises:

determining a first sharing factor for at least one RAN slice of the plurality of RAN slices based on the communication service demand indicated by the scenario information,

determining a second sharing factor between any two RAN slices of the plurality of RAN slices based on an inter-RAN slice interference relationship; and

For any two RAN slices in the plurality of RAN slices, an inter-slice sharing factor between the two RAN slices is determined based on a minimum value between the first sharing factor and the second sharing factor.

(5) The system according to (1) or (2), wherein

The first management device determines an arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices such that one or more of the following items are satisfied:

In arranging spectrum resources such that spectrum resource requirements of RAN slices that allow a higher degree of spectrum resource sharing are satisfied to a higher degree; and

In the rearrangement of spectrum resources, the number of spectrums allocated to existing RAN slices that are reallocated to other RAN slices is as small as possible.

(6) The system of (1) or (2), wherein

The first characteristic of the spectrum resource indicates at least a spectrum resource type including: spectrum resources not allocated to a RAN slice, spectrum resources allocated to a RAN slice but not yet used by the RAN slice, and spectrum resources that can be compared with spectrum allocated to a RAN slice resources overlapping spectrum resources, and

In determining the rearrangement scheme of spectrum resources among the plurality of RAN slices, the first management device allocates spectrum resources in the following order: spectrum resources not allocated to RAN slices, spectrum resources allocated to RAN slices but not yet used by the RAN slices The spectrum resources used and the spectrum resources that can overlap with the spectrum resources already allocated to the RAN slice.

(7) The system according to (1) or (2), wherein

the scene information also indicates the RAN intra-chip interference relationship, and

The first management device determines a maximum slice capacity of at least one RAN slice of the plurality of RAN slices based on at least an intra-RAN interference relationship and the number of spectrum resources to be allocated for at least one RAN slice of the plurality of RAN slices .

(8) The system of (7), wherein

In response to the load of the RAN slice exceeding the determined maximum slice capacity of the RAN slice, or in response to generating a new RAN slice in the wireless network, the first management apparatus rearranges the spectrum resources.

(9) The system of (7), wherein

The first management apparatus sends the determined maximum slice capacity of the at least one RAN slice to the at least one on-chip manager and an entity in the wireless network that records network slice load changes.

(10) The system of (9), wherein

The entities recording network slice load changes include one or more of the entities implementing the following functions: Unified Data Warehouse UDR/Unified Data Management UDM, Operational Management and Maintenance OAM, Network Slice Quota NSQ or Network Slice Selection Function NSSF.

(11) The system of (1) or (2), wherein

The at least one intra-slice manager is further configured to determine that spectral resources are within the respective RAN slices based on at least a first characteristic and/or an amount of spectral resources to be allocated for the respective RAN slices of the plurality of RAN slices The allocation or reallocation scheme of the spectrum resource in one RAN slice includes the second characteristic and quantity of the spectrum resource to be allocated for at least one base station in the RAN slice.

(12) The system of (11), wherein

The at least one intra-slice manager determines a reallocation scheme of spectrum resources within a RAN slice such that the frequency spectrum already allocated to any base station is reallocated to other base stations as few times as possible, and/or

The second characteristic of the spectrum resource indicates at least a spectrum resource type including: spectrum resources not allocated to the base station, spectrum resources allocated to the base station but not yet used by the base station, and spectrum capable of overlapping with the spectrum resources allocated to the base station resources, and the at least one intra-slice manager allocates the spectrum resources in the following order when determining the reallocation scheme of the spectrum resources within the RAN slice: spectrum resources not allocated to the base station, spectrum resources allocated to the base station but not yet used by the base station and the spectrum resources that can overlap with the spectrum resources allocated to the base station.

(13) The system of (3), wherein

The system also includes a third management device configured to receive the scene information from the at least one on-chip manager, and send the originally received scene information or the processed scene information to the second management device.

(14) A method of a system for wireless communication, the system comprising one or more on-chip managers and a first management device, the method comprising

collecting, by at least one of the one or more on-chip managers, scenario information of a corresponding RAN slice of a plurality of radio access network RAN slices in the wireless network, wherein the scenario information is used to determine At least the following information: RAN inter-slice interference relationship, RAN slice priority, and RAN slice spectrum resource requirements;

The arrangement or rearrangement scheme of spectrum resources among the multiple RAN slices is determined by the first management device at least based on the interference relationship between RAN slices, the priority of the RAN slices, and the spectrum resource requirements of the RAN slices, wherein the spectrum resources are arranged in the multiple RAN slices. The arrangement or rearrangement scheme between RAN slices includes a first characteristic and a quantity of spectrum resources to be allocated for at least one RAN slice of the plurality of RAN slices.

(15) The method of (14), the system further comprising a second management device,

The method further includes determining, by the second management apparatus, an inter-slice sharing factor representing a degree to which the RAN slice can share spectrum resources with other RAN slices based on the scene information, and sending the determined inter-slice sharing factor to the first management apparatus for the first management apparatus to determine the arrangement or rearrangement scheme of spectrum resources among the multiple RAN slices.

(16) The method according to (15), wherein an arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices is determined by the first management device such that one or more of the following items are satisfied:

(17) The method according to (14) or (15), wherein the scene information is further used to determine the RAN intra-chip interference relationship, and the method further includes performing the following operations by the first management device:

determining a slice maximum capacity for at least one RAN slice of the plurality of RAN slices based at least on the RAN intra-slice interference relationship and the amount of spectral resources to be allocated for at least one of the plurality of RAN slices, and

The determined maximum slice capacity of the at least one RAN slice is sent to the at least one intra slice manager and an entity in the wireless network that records network slice load changes.

(18) The method of (17), wherein

In response to the load of the RAN slice exceeding the determined maximum slice capacity of the RAN slice, or in response to the generation of a new RAN slice in the wireless network, the spectrum resources are rearranged by the first management device.

(19) The method of (14) or (15), wherein the method further comprises:

determining, by the at least one intra-slice manager, an allocation of spectral resources within a corresponding RAN slice of the plurality of RAN slices based on at least a first characteristic and/or an amount of spectral resources to be allocated for the corresponding RAN slice of the plurality of RAN slices or A reallocation scheme, wherein the allocation or reallocation scheme of spectrum resources within one RAN slice includes a second characteristic and quantity of spectrum resources to be allocated for at least one base station in the RAN slice.

(20) A non-transitory computer-readable storage medium storing executable instructions that, when executed, implement the method of any one of (14)-(19).

Claims

A system for wireless communication, comprising:

one or more on-chip managers, at least one of the one or more on-chip managers is configured to collect scene information for a corresponding RAN slice of a plurality of radio access network RAN slices in the wireless network, wherein, The scenario information is used to determine at least the following information: RAN inter-slice interference relationship, RAN slice priority, and RAN slice spectrum resource requirements;

a first management device configured to determine an arrangement or rearrangement scheme of spectrum resources among the multiple RAN slices based on at least the scenario information, wherein the arrangement or rearrangement scheme of spectrum resources among the multiple RAN slices includes A first characteristic and quantity of spectrum resources to be allocated for at least one RAN slice of the plurality of RAN slices.
The system of claim 1, wherein

The scenario information at least indicates one or more of the following items: base station location, base station transmit power, spectrum resource requirements and communication service requirements of the base station.
The system of claim 1 or 2, wherein

The system further includes a second management device configured to determine, based on the scene information, an inter-slice sharing factor representing the degree to which the RAN slice can share spectrum resources with other RAN slices, and to send the determined inter-slice sharing factor to the first RAN slice. a management device for the first management device to determine an arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices.
The system of claim 3, wherein determining the inter-slice sharing factor comprises:

determining a first sharing factor for at least one RAN slice of the plurality of RAN slices based on the communication service demand indicated by the scenario information,

determining a second sharing factor between any two RAN slices of the plurality of RAN slices based on an inter-RAN slice interference relationship; and

For any two RAN slices in the plurality of RAN slices, an inter-slice sharing factor between the two RAN slices is determined based on a minimum value between the first sharing factor and the second sharing factor.
The system of claim 1 or 2, wherein

The first management device determines an arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices such that one or more of the following items are satisfied:

In arranging spectrum resources such that spectrum resource requirements of RAN slices that allow a higher degree of spectrum resource sharing are satisfied to a higher degree; and

In the rearrangement of spectrum resources, the number of spectrums allocated to existing RAN slices that are reallocated to other RAN slices is as small as possible.
The system of claim 1 or 2, wherein

The first characteristic of the spectrum resource indicates at least a spectrum resource type including: spectrum resources not allocated to a RAN slice, spectrum resources allocated to a RAN slice but not yet used by the RAN slice, and spectrum resources that can be compared with spectrum allocated to a RAN slice resources overlapping spectrum resources, and

In determining the rearrangement scheme of spectrum resources among the plurality of RAN slices, the first management device allocates spectrum resources in the following order: spectrum resources not allocated to RAN slices, spectrum resources allocated to RAN slices but not yet used by the RAN slices The spectrum resources used and the spectrum resources that can overlap with the spectrum resources already allocated to the RAN slice.
The system of claim 1 or 2, wherein

the scene information also indicates the RAN intra-chip interference relationship, and

The first management device determines a maximum slice capacity of at least one RAN slice of the plurality of RAN slices based on at least an intra-RAN interference relationship and the number of spectrum resources to be allocated for at least one RAN slice of the plurality of RAN slices .
The system of claim 7, wherein

In response to the load of the RAN slice exceeding the determined maximum slice capacity of the RAN slice, or in response to generating a new RAN slice in the wireless network, the first management apparatus rearranges the spectrum resources.
The system of claim 7, wherein

The first management apparatus sends the determined maximum slice capacity of the at least one RAN slice to the at least one on-chip manager and an entity in the wireless network that records network slice load changes.
The system of claim 9, wherein

The entities recording network slice load changes include one or more of the entities implementing the following functions: Unified Data Warehouse UDR/Unified Data Management UDM, Operational Management and Maintenance OAM, Network Slice Quota NSQ or Network Slice Selection Function NSSF.
The system of claim 1 or 2, wherein

The at least one intra-slice manager is further configured to determine that spectral resources are within the respective RAN slices based on at least a first characteristic and/or an amount of spectral resources to be allocated for the respective RAN slices of the plurality of RAN slices The allocation or reallocation scheme of the spectrum resource in one RAN slice includes the second characteristic and quantity of the spectrum resource to be allocated for at least one base station in the RAN slice.
The system of claim 11, wherein

The at least one intra-slice manager determines a reallocation scheme of spectrum resources within a RAN slice such that the frequency spectrum already allocated to any base station is reallocated to other base stations as few times as possible, and/or

The second characteristic of the spectrum resource indicates at least a spectrum resource type including: spectrum resources not allocated to the base station, spectrum resources allocated to the base station but not yet used by the base station, and spectrum capable of overlapping with the spectrum resources allocated to the base station resources, and the at least one intra-slice manager allocates the spectrum resources in the following order when determining the reallocation scheme of the spectrum resources within the RAN slice: spectrum resources not allocated to the base station, spectrum resources allocated to the base station but not yet used by the base station and the spectrum resources that can overlap with the spectrum resources allocated to the base station.
The system of claim 3, wherein

The system also includes a third management device configured to receive the scene information from the at least one on-chip manager, and send the originally received scene information or the processed scene information to the second management device.
A method of a system for wireless communication, the system comprising one or more on-chip managers and a first management device, the method comprising

collecting, by at least one of the one or more on-chip managers, scenario information of a corresponding RAN slice of a plurality of radio access network RAN slices in the wireless network, wherein the scenario information is used to determine At least the following information: RAN inter-slice interference relationship, RAN slice priority, and RAN slice spectrum resource requirements;

The arrangement or rearrangement scheme of spectrum resources among the multiple RAN slices is determined by the first management device at least based on the interference relationship between RAN slices, the priority of the RAN slices, and the spectrum resource requirements of the RAN slices, wherein the spectrum resources are arranged in the multiple RAN slices. The arrangement or rearrangement scheme between RAN slices includes a first characteristic and a quantity of spectrum resources to be allocated for at least one RAN slice of the plurality of RAN slices.
The method of claim 14, the system further comprising a second management device,

The method further includes determining, by the second management apparatus, an inter-slice sharing factor representing a degree to which the RAN slice can share spectrum resources with other RAN slices based on the scene information, and sending the determined inter-slice sharing factor to the first management apparatus for the first management apparatus to determine the arrangement or rearrangement scheme of spectrum resources among the multiple RAN slices.
The method of claim 15, wherein an arrangement or rearrangement scheme of spectrum resources among the plurality of RAN slices is determined by the first management device such that one or more of the following are satisfied:

In arranging spectrum resources such that spectrum resource requirements of RAN slices that allow a higher degree of spectrum resource sharing are satisfied to a higher degree; and

In the rearrangement of spectrum resources, the number of spectrums allocated to existing RAN slices that are reallocated to other RAN slices is as small as possible.
The method of claim 14 or 15, wherein the scene information is further used to determine a RAN intra-chip interference relationship, and the method further comprises, by the first management device:

determining a slice maximum capacity for at least one RAN slice of the plurality of RAN slices based on at least an intra-RAN interference relationship and an amount of spectral resources to be allocated for at least one RAN slice of the plurality of RAN slices, and

The determined maximum slice capacity of the at least one RAN slice is sent to the at least one intra slice manager and an entity in the wireless network that records network slice load changes.
The method of claim 17, wherein

In response to the load of the RAN slice exceeding the determined maximum slice capacity of the RAN slice, or in response to the generation of a new RAN slice in the wireless network, the spectrum resources are rearranged by the first management device.
The method of claim 14 or 15, wherein the method further comprises:

determining, by the at least one intra-slice manager, an allocation of spectral resources within a corresponding RAN slice of the plurality of RAN slices based on at least a first characteristic and/or an amount of spectral resources to be allocated for the corresponding RAN slice of the plurality of RAN slices or A reallocation scheme, wherein the allocation or reallocation scheme of spectrum resources within one RAN slice includes a second characteristic and quantity of spectrum resources to be allocated for at least one base station in the RAN slice.
A non-transitory computer-readable storage medium storing executable instructions that, when executed, implement the method of any of claims 14-19.