WO2022100676A1 - 用于无线通信的系统、方法和存储介质 - Google Patents

用于无线通信的系统、方法和存储介质 Download PDF

Info

Publication number
WO2022100676A1
WO2022100676A1 PCT/CN2021/130198 CN2021130198W WO2022100676A1 WO 2022100676 A1 WO2022100676 A1 WO 2022100676A1 CN 2021130198 W CN2021130198 W CN 2021130198W WO 2022100676 A1 WO2022100676 A1 WO 2022100676A1
Authority
WO
WIPO (PCT)
Prior art keywords
ran
slice
spectrum resources
spectrum
slices
Prior art date
Application number
PCT/CN2021/130198
Other languages
English (en)
French (fr)
Inventor
赵友平
林梦婷
田中
孙晨
Original Assignee
索尼集团公司
赵友平
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 索尼集团公司, 赵友平 filed Critical 索尼集团公司
Priority to CN202180074943.7A priority Critical patent/CN116602052A/zh
Priority to US18/033,566 priority patent/US20230397238A1/en
Publication of WO2022100676A1 publication Critical patent/WO2022100676A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/309—Measuring or estimating channel quality parameters
    • H04B17/345—Interference values
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/563—Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices

Definitions

  • the present disclosure relates generally to wireless communication systems, and in particular to techniques related to network slicing in wireless communication systems.
  • Network slices may generally include core network slices, radio access network (RAN) slices, and transport network slices.
  • RAN radio access network
  • 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.
  • 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.
  • 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
  • FIG. 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;
  • 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
  • FIG. 12 is a block diagram of an example structure as a computer/computer system that may be employed in embodiments of the present disclosure
  • the system for wireless communication includes at least devices on the core network side (such as various virtualized or non-virtualized network element devices responsible for corresponding functions).
  • 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.
  • NFV Network Function Virtualization
  • SDN Software Defined Network
  • the network element devices in the core network may implement corresponding functions. software module.
  • a “base station” includes at least a wireless communication station that facilitates communication as part of a wireless communication system or radio system.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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).
  • uRLLC Ultra-Reliable Low-Latency Communication
  • eMBB Enhanced Mobile Broadband
  • general data services e.g. email
  • mMTC Massive Machine Type Communication
  • 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.
  • the RAN slice 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.
  • the system 20 for wireless communication 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 .
  • 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.
  • 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).
  • first management device may correspond to functional entities specified in the corresponding 3GPP standards.
  • 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)
  • the third management device may correspond to a communication service management function (Communicaiton Service Management Function, CSMF).
  • these management devices may also correspond to other appropriate functional entities as appropriate, as long as the corresponding functions described below can be implemented.
  • system for wireless communication 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.
  • a system for wireless communication according to the present disclosure may include more or fewer devices.
  • 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.
  • 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.
  • the use of overlapping spectrum resources does not necessarily lead to interference between RAN slices.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 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.
  • System 20 may include one or more on-chip managers.
  • the on-chip manager can centrally collect scene information of each RAN slice in the wireless network.
  • each on-chip manager can manage a corresponding RAN slice and collect scene information of the RAN slice.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the scenario information may also include information directly indicating the spectrum resource requirements of the RAN slice.
  • 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 .
  • 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.
  • 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).
  • 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).
  • 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.
  • 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.
  • 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.
  • 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.
  • 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).
  • Inter-slice sharing factor is introduced to indicate the degree to which a RAN slice can share spectrum resources with other RAN slices.
  • 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.
  • 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.
  • 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.
  • 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:
  • the inter-slice sharing factor ⁇ ij can be determined as the first sharing factor shared factor with second the minimum value between
  • Table 1 shows the inter-slice sharing factor table for a network comprising 3 RAN slices.
  • 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.
  • ⁇ 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.
  • 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.
  • spectrum resources may be arranged among RAN slices initially, that is, when each RAN slice has not been allocated any spectrum resources.
  • 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.
  • 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).
  • 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).
  • the output can be at least a matrix H 1 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
  • ⁇ 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
  • 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).
  • a channel is used as an example to represent the spectrum resource, and the amount of the RAN spectrum resource
  • 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).
  • 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.
  • the proportion of channels that can be shared by slice 1 and slice 2 is 0.5
  • the proportion of spectrum resources that can be shared by slice 2 and slice 1 is 0.
  • the number of channels shared between slice 1 and slice 2 is 0.
  • 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.
  • 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.
  • AI artificial intelligence
  • Equation (1) can be solved using any suitable AI algorithm to determine the arrangement scheme of spectrum resources among multiple RAN slices.
  • DQN deep Q-network
  • 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 1 .
  • the state of the DQN algorithm can be designed as: [ ⁇ , N], where,
  • ⁇ [ ⁇ 1 , ⁇ 2 ,..., ⁇ S ],
  • N [N 1 ,N 2 ,...,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
  • Fig. 4 presents an exemplary operation process of the DQN algorithm.
  • the agent running the DQN algorithm determines which RAN slice is allocated spectrum resources for in the current state.
  • 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.
  • the agent 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 ⁇ .
  • the agent 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.
  • the agent 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.
  • a certain cutoff condition eg, a certain degree of convergence
  • 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.
  • 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.
  • networks eg, network traffic
  • 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".
  • the maximum slice capacity can reflect the maximum number of users that the RAN can serve.
  • 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.
  • 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.
  • the maximum slice capacity of the RAN slice s can be determined by the following formula (2)
  • 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 maximum intra-chip sharing ratio ⁇ s can be determined by the following operations:
  • 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 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
  • 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.
  • 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.
  • 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 ⁇ 1 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).
  • 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 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 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.
  • 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.
  • the first characteristic of the spectrum resource is not limited to the above type of spectrum.
  • 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.
  • 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.
  • spectral resources eg, how many channels
  • types eg, unallocated, allocated but not used, and Spectrum resources that are allocated for use but can be shared
  • 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.
  • the slice maximum capacity of each RAN slice may be determined by the first management means 204 in the system 20 of FIG. 2 .
  • 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.
  • 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.
  • 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.
  • 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.
  • 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 .
  • an allocation or reallocation scheme of spectrum resources within a RAN slice may be determined by an intra-slice manager.
  • 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.
  • 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 .
  • spectrum resources may be allocated within the RAN initially, that is, when each base station has not been allocated any spectrum resources.
  • 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.
  • H 2 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.
  • AI artificial intelligence
  • 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.
  • 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.
  • ants will be randomly placed on each node, and the ants need to traverse all nodes.
  • each ant walks, it releases "pheromone" on the path, and subsequent ants will choose the path according to the pheromone concentration on the path.
  • 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.
  • 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):
  • the ACO algorithm will converge such that The allocation scheme of the largest spectrum resource within the RAN slice.
  • the reallocation scheme of spectrum resources within a RAN slice 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.
  • the above formula (4) can be modified into the following formula (6) to achieve this purpose.
  • 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 ⁇ 2 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.
  • 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 are 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 NSSMF acts as the first management device 204 in FIG. 2
  • the NSMF acts as the second management device 206
  • the CSMF acts as the third management device 208 in FIG. 2
  • the intra-slice manager is responsible for collecting scene information and determining the allocation/reallocation scheme of spectrum resources within RAN slices
  • 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 function AMF Communication service management function CSMF Network slice management function NSMF Network slice selection function NSSF Network slice subnet management function NSSMF Network repository function NRF Network slice quota NSQ Operation administration and maintenance OAM Policy control function PCF Unified data management UDM Unified data repository UDR User Equipment User Equipment UE
  • 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.
  • 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.
  • the 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.
  • 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.
  • 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.
  • the NSSMF may send the further processed scene information to the NSSMF.
  • 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).
  • 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.
  • 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.
  • entity that records network slice load changes eg, UDR/UDM in this example
  • 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).
  • 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.
  • 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.
  • the UE may send the request to register to the corresponding RAN slice managed by the intra-slice manager in step 15 .
  • the UE's registration request may trigger the reallocation of spectrum resources among the base stations in the slice at step 16 .
  • the PCF and UDR/UDM can update and reallocate the quota of this slice.
  • 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.
  • 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.
  • 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.
  • 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.
  • the on-chip manager may determine an allocation scheme of spectrum resources among the base stations in the RAN.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • the NSSF which is the entity that records the network slice load change
  • 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 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 on-chip manager may determine an allocation scheme of spectrum resources among the base stations in the RAN.
  • 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.
  • the registration request of the UE can trigger the spectrum resource at step 17 between the base stations in the slice. redistribution.
  • 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.
  • FIGS. 6-8 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.
  • 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.
  • a new scene information collection/processing process may be involved.
  • 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.
  • the specific content of the information sent in each step may be slightly different according to the specific situation.
  • 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.
  • 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.
  • 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.
  • 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.
  • the sharing factor the degree accepted by each RAN slice
  • the complexity of spectrum resource rearrangement between spectrums is advantageously reduced.
  • the solution of the present disclosure can also support a spectrum resource allocation scenario across operators.
  • 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.
  • Table 3 shows the parameter table set for the simulation, where the channel is taken as the spectrum resource.
  • the channel requirement of the base station represents the number of frequency spectrums required by each base station.
  • 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.
  • 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 .
  • 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 .
  • 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 .
  • slice 1 slice 2 slice 3 Number of base stations 20 20 20 Base station channel requirements 3 3 Base Station Average Spectrum Satisfaction 90% 100% 100%
  • 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 .
  • 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.
  • FIG. 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.
  • computer/computer system 1200 may be used as a whole to implement system 20 shown in FIG. 2 .
  • 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.
  • multiple devices included in the system 20 shown in FIG. 2 may be implemented by separate computer/computer systems 1200 .
  • 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 .
  • 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 .
  • ROM read only memory
  • RAM random access memory
  • 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.
  • a program constituting the software is installed from a network such as the Internet or a storage medium such as the removable medium 1211 .
  • 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.
  • 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.
  • 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.
  • machine-executable instructions in a machine-readable storage medium or program product may be configured to perform operations corresponding 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.
  • 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.
  • 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.
  • the present disclosure can also have the following configurations:
  • a system for wireless communication comprising:
  • 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 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 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.
  • determining the sharing factor between slices comprises:
  • 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 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:
  • the number of spectrums allocated to existing RAN slices that are reallocated to other RAN slices is as small as possible.
  • 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
  • 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 scene information also indicates the RAN intra-chip interference relationship
  • 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 first management apparatus 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 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 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 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 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 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 comprising
  • 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 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 number of spectrums allocated to existing RAN slices that are reallocated to other RAN slices is as small as possible.
  • 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 spectrum resources are rearranged by the first management device.
  • the at least one intra-slice manager determines, 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 one of (14)-(19).

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

提供了用于无线通信的系统、方法和存储介质。一种用于无线通信的系统，包括：一个或多个片内管理器，一个或多个片内管理器中的至少一个被配置为收集无线网络中的多个无线接入网RAN片中的相应RAN片的场景信息，其中，场景信息用于确定至少以下信息：RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求；第一管理装置，被配置为至少基于场景信息确定频谱资源在多个RAN片间的编排或重编排方案，其中频谱资源在多个RAN片间的编排或重编排方案包括要为多个RAN片中的至少一个RAN片分配的频谱资源的第一特性以及数量。

Description

用于无线通信的系统、方法和存储介质
本申请要求申请号为202011271371.5、申请日为2020年11月13日、题为“用于无线通信的系统、方法和存储介质”的中国申请的优先权，该中国申请的公开内容通过引用整体并入于此。
技术领域
本公开一般地涉及无线通信系统，并且具体地涉及与无线通信系统中的网络切片相关的技术。
背景技术
在无线通信系统中，随着无线通信要应用于的场景日趋复杂化，为了使运营商能够为用户提供定制的逻辑网络以满足多样化的服务需求，考虑根据与不同应用场景对应的不同的服务特点与需求来将网络划分为多个虚拟的网络片。这种将网络划分为多个虚拟的网络片的技术例如在5G/B5G中称为网络切片(Network Slicing)。网络切片一般可以包括核心网切片、无线接入网(radio access network，RAN)切片以及传输网切片。
网络切片使得能够将一个物理网络切割成多个虚拟的端到端的网络，每个虚拟网络之间，包括网络内的设备、接入、传输和核心网，是逻辑独立的，任何一个虚拟网络发生故障都不会影响到其它虚拟网络。每个虚拟网络具备不同的功能特点，面向不同的需求和服务。
需要一种使得能够有效进行网络切片的技术。
发明内容
本公开提出了一种与网络切片相关的方案，具体地，本公开提供了一种用于无线通信系统的系统、方法和计算机可读介质。
本公开的一个方面涉及一种用于无线通信的系统，包括：一个或多个片内管理器，所述一个或多个片内管理器中的至少一个被配置为收集无线网络中的多个无线接入网RAN片中的相应RAN片的场景信息，其中，所述场景信息用于确定至少以下信息： RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求；第一管理装置，被配置为至少基于所述场景信息确定频谱资源在所述多个RAN片间的编排或重编排方案，其中频谱资源在所述多个RAN片间的编排或重编排方案包括要为所述多个RAN片中的至少一个RAN片分配的频谱资源的第一特性以及数量。
本公开的另一个方面涉及一种用于无线通信的系统的方法，所述系统包括一个或多个片内管理器和第一管理装置，所述方法包括由所述一个或多个片内管理器中的至少一个片内管理器收集无线网络中的多个无线接入网RAN片中的相应RAN片的场景信息，其中，所述场景信息用于确定至少以下信息：RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求；由第一管理装置，至少基于RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求确定频谱资源在所述多个RAN片间的编排或重编排方案，其中频谱资源在所述多个RAN片间的编排或重编排方案包括要为所述多个RAN片中的至少一个RAN片分配的频谱资源的第一特性以及数量。
本公开的另一个方面涉及一种存储有可执行指令的非暂时性计算机可读存储介质，所述可执行指令当被执行时实现如上述方面所述的方法。
附图说明
当结合附图考虑实施例的以下具体描述时，可以获得对本公开内容更好的理解。在各附图中使用了相同或相似的附图标记来表示相同或者相似的部件。各附图连同下面的具体描述一起包含在本说明书中并形成说明书的一部分，用来例示说明本公开的实施例和解释本公开的原理和优点。其中：
图1示意性地示出了本公开的方案可以应用于的无线通信系统的场景；
图2示意性地示出了根据本公开的实施例的用于无线通信的系统配置的示意图；
图3示意性地示出了根据本公开的实施例的用于无线通信的系统的方法的第一概念性操作流程；
图4示意性地示出了用于确定频谱资源在多个RAN片间的编排或重编排示方案的示例性算法的流程图；
图5示意性地示出了根据本公开的实施例的用于无线通信的系统的方法的第二概念性操作流程；
图6示意性地示出了根据本公开的实施例的第一示例性信息交互；
图7示意性地示出了根据本公开的实施例的第二示例性信息交互；
图8示意性地示出了据本公开的实施例的第三示例性信息交互；
图9示例性地示出了对本公开的方案进行的仿真的基站位置场景图；
图10示意性地示出了RAN片的平均频谱满意度在应用根据本公开的方法的情况下与未应用根据本公开的方法的情况下的对比图；
图11示意性地示出了基站的平均频谱满意度在应用根据本公开的方法的情况下与未应用根据本公开的方法的情况下的对比图；
图12为作为本公开的实施例中可采用的计算机/计算机系统的示例结构的框图；
虽然在本公开内容中所描述的实施例可能易于有各种修改和另选形式，但是其具体实施例在附图中作为例子示出并且在本文中被详细描述。但是，应当理解，附图以及对其的详细描述不是要将实施例限定到所公开的特定形式，而是相反，目的是要涵盖属于权利要求的精神和范围内的所有修改、等同和另选方案。
具体实施方式
以下描述根据本公开的设备和方法等各方面的代表性应用。这些例子的描述仅是为了增加上下文并帮助理解所描述的实施例。因此，对本领域技术人员而言明晰的是，以下所描述的实施例可以在没有具体细节当中的一些或全部的情况下被实施。在其他情况下，众所周知的过程步骤没有详细描述，以避免不必要地模糊所描述的实施例。其他应用也是可能的，本公开的方案并不限制于这些示例。
典型地，根据本公开的用于无线通信的系统至少包括核心网侧的设备(诸如负责相应功能的各种虚拟化或非虚拟化的网元设备之类)。
在本公开中，“核心网设备”例如是对多个网元设备的统称，并且可以由单个网元设备实现单个功能、由单个网元设备实现多个功能或者由多个网元设备实现单个功能。作为例子，可以将网络功能虚拟化(Network Function Virtualization，NFV)或软件定义网络(Software Defined Network，SDN)应用于核心网，在这种情况下，核心网中的网元设备可以是实现相应功能的软件模块。
此外，根据本公开的用于无线通信的系统还可以包括接入网侧的设备(诸如，基站和终端设备之类)。在本公开中，“基站”至少包括作为无线通信系统或无线电系统的一部分以便于通信的无线通信站。作为例子，基站例如可以是4G通信标准的eNB、5G通信标准的gNB、远程无线电头端、无线接入点、无人机控制塔台或者执行类似功能的通信装置。在本公开中，“终端设备”或“用户设备(UE)”至少包括作为无线通信系统或 无线电系统的一部分以便于通信的终端设备。作为例子，终端设备例如可以是移动电话、膝上型电脑、平板电脑、车载通信设备等之类的终端设备或其元件。
如背景技术中介绍的，在无线通信系统中，考虑根据与不同应用场景对应的不同的服务特点与需求来将网络划分为多个虚拟的网络片，并且网络切片一般可以包括核心网切片、RAN切片以及传输网切片。在本公开中，主要讨论与RAN切片相关的内容。在下文中，除非特别指出，术语“切片”或“片”一般表示RAN片。
一般地，可以按照用户对服务的不同需求，将通信服务划分为：高可靠低时延通信(Ultra-Reliable Low-Latency Communication,uRLLC)、增强移动宽带(Enhanced Mobile Broadband,eMBB)、一般数据服务(例如，电子邮件)和大规模机器类通信(Massive Machine Type Communication,mMTC)等类型。
图1示出了在城市中的无线通信系统场景。如图1所示，在无线通信系统初始化时，为该场景中所涉及的uRLLC租户、eMBB租户以及一般租户分别划分相应的RAN片。每个RAN片一般分配有相应的频谱资源。
传统地，为每个RAN片分配专用的频谱资源以保障RAN片之间的频谱隔离性，从而避免由于频谱资源重叠而导致RAN片之间产生干扰。但是，这种RAN片之间频谱资源相互隔离的方案导致了频谱利用率的降低。在频谱资源愈发紧张的背景(例如，特别是5G和B5G)下，这种低频谱利用率的方案往往导致难以满足RAN片对于频谱资源的需求，例如，导致分配给RAN片的频谱资源不足以应对RAN片的负载。因此，需要一种能够在避免RAN片之间的干扰(即，保持RAN片间隔离性能)的同时提高频谱利用率的方案。
另一方面，当网络动态变化时，例如如图1所示，产生诸如体育赛事之类的突发事件时，可以动态地增加、删除或修改RAN片。对RAN片的增加、删除或修改往往需要对RAN片的频谱资源进行重新配置，从而导致较高复杂度且时间/经济成本较高的操作。因此，需要一种在支持对RAN片的灵活调整的情况下，尽可能降低频谱资源重配置复杂度的方案。
图2示意性地示出了根据本公开的实施例的用于无线通信的系统配置的示意图。
如图2所示，根据本公开的用于无线通信的系统20可以至少包括一个或多个片内管理器202-1至202-n(下文中可以统一标记为202)和第一管理装置204。此外，系统20还可以可选地包括虚线绘出的第二管理装置206、第三管理装置208以及未示出的其他适当的装置。在本文中，术语“片内管理器”、“第一管理装置”、“第二管理装置”以及“第三管理装置”均可以对应于上文说明的核心网中的网元设备(软件化/虚拟化的设备/模块、分布式的设备/模块或者实体硬件设备)。应指出，以下虽然主要基于包含“片 内管理器”、“第一管理装置”、“第二管理装置”以及“第三管理装置”的通信系统对本公开的实施例进行了描述，但是这些描述可以相应地扩展到包含任何其它类型的网元设备的通信系统的情况。特别地，对于5G/B5G，“第一管理装置”、“第二管理装置”以及“第三管理装置”可以对应于相应的3GPP标准中规定的功能实体。例如，“第一管理装置”可以对应于网络片子网管理功能(Network Slice Subnet Management Function，NSSMF)，“第二管理装置”可以对应于网络片管理功能(Network Slice Management Function，NSMF)，并且“第三管理装置”可以对应于通信服务管理功能(Communicaiton Service Management Function，CSMF)。当然，这些管理装置也可以视情况对应于其他适当的功能实体，只要能够实现下文所述的相应功能即可。
此外，在本文中以片内管理器、第一管理装置、以及可选地第二管理装置和第三管理装置为例描述根据本公开的实施例的用于无线通信的系统。但是，根据本公开的用于无线通信的系统可以包括更多或更少的装置。
下面，将参考图3详细描述根据本公开的系统20中各个装置的具体操作。
图3示意性地示出了根据本公开的实施例的用于无线通信的系统的方法的第一概念性操作流程30。例如，可以由根据本公开的用于无线通信的系统20中的各个装置执行第一概念性操作流程30的相应操作。
如上文所述，需要一种能够在避免RAN片之间的干扰(即，保持RAN片间隔离性能)的同时提高频谱利用率的方案。实际上，使用重叠的频谱资源并不必然导致RAN片之间的干扰。例如，在两个RAN片之间可能仅有部分基站之间存在干扰。因此，通过合理地设置RAN片之间频谱资源的重叠程度(换句话说，频谱资源可以在RAN片之间被共享的共享程度)，就可以在避免RAN片之间的干扰的同时提高频谱利用率。图3中所示的方法给出了通过考虑RAN片之间频谱资源的重叠程度来对频谱资源在RAN片间进行编排或重编排的示例方案。
该第一概念性操作流程30在S302处开始。
在S304，可以由图2所示的一个或多个片内管理器202中的至少一个收集无线网络中的多个RAN片中的相应RAN片的场景信息，这种场景信息可以用于确定至少以下信息：RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求。有利地，基于场景信息确定的RAN片间干扰关系可以用于确定无线网络中的任一RAN片的频谱资源能够与其他RAN片的频谱资源重叠的程度。换句话说，RAN片间干扰关系可以用于确定无线网络中的任一RAN片能够与其他RAN片共享频谱资源的程度(例如，共享/重叠信道的数量)。
在S306，可以由图2所示的第一管理装置204基于所述场景信息确定频谱资源在多个RAN片间的编排或重排方案。例如，第一管理装置204可以直接或间接地基于根据场景信息确定的RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求来确定频谱资源在多个RAN片间的编排或重编排方案。根据本公开，可以视情况由系统20中的装置202-208中的任意一个或多个来根据场景信息确定RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求。下文将对此进行详细说明。
根据本公开，频谱资源在多个RAN片间的编排或重编排方案包括要为多个RAN片中的至少一个RAN片分配的频谱资源的第一特性以及数量。例如，频谱资源的第一特性可以至少指示包括以下项的频谱资源类型：未分配给RAN片的频谱资源、已分配给RAN片但尚未被该RAN片使用的频谱资源和能够与已分配给RAN片的频谱资源重叠的频谱资源。
该第一概念性操作流程30在S308处结束。
上面已经结合图2、图3简单介绍了根据本公开的用于无线通信的方案。下面，将详细说明图3中的各个操作。
根据本公开，场景信息可以至少指示以下项中的一个或多个：基站位置、基站发射功率、基站的频谱资源需求和通信服务需求，其中，基站的频谱资源需求可以是直接指示基站所需要的频谱资源量(诸如为了服务其用户而需要的信道数量之类)的信息，或者也可以是指示基站容量、个数等的信息；通信服务需求可以是指示RAN片所针对的通信服务类型(诸如uRLLC、eMBB和mMTC之类)的信息，或者，通信服务需求也可以是指示诸如时延、可靠性、QoS、速率之类的通信要求的信息。
可以由如图2所示的系统20中的片内管理器来接收这种场景信息。根据本公开的系统20可以包括一个或多个片内管理器。在系统20仅包括一个片内管理器的情况下，该片内管理器可以集中收集无线网络中的各个RAN片的场景信息。在系统20包括多个片内管理器的情况下，各个片内管理器可以分别管理相应的一个RAN片，并收集该RAN片的场景信息。此外，在系统20包括多个片内管理器的情况下，这多个片内管理器中的至少一个片内管理器可以集中管理无线网络中的部分RAN片，并收集对应于该部分RAN的场景信息。
根据本公开，可以对场景信息进行处理来确定RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求，以便进而确定频谱资源在多个RAN片间的编排或重编排方案。
可以根据场景信息中包含的基站位置和基站发射功率来确定RAN片间干扰关系。例 如，RAN片间干扰关系可以由片间干扰重叠矩阵来表示，该片间干扰重叠矩阵中的每一项例如可以表示片i中与片j之间存在干扰的基站数占片i的基站总数的比例，即，
Figure PCTCN2021130198-appb-000001
例如，如果在片i的基站a处检测到的来自片j的基站b的信号的功率大于预定阈值，则可以判定片i的基站a与片j的基站b之间存在干扰。要说明的是，为了更准确地确定基站之间是否存在干扰，除了考虑基站位置和基站发射功率之外，还可以进一步考虑基站所使用的频谱、带宽等其他参数。
可以根据场景信息中包含的通信服务需求来确定RAN片优先级。例如，可以基于通信服务类型来确定RAN片优先级，例如，uRLLC之类的对通信质量要求较高的通信服务类型可以被分配较高的RAN片优先级。再例如，可以基于指示诸如时延、可靠性、QoS、速率之类的通信要求的信息来确定RAN片优先级，例如，对时延、可靠性、QoS或速率具有较高要求的RAN片可以被分配较高的优先级。此外，场景信息还可以包含直接指示RAN片的优先级的信息。
可以根据场景信息中包含的基站的频谱资源需求来确定RAN片频谱资源需求。例如，可以根据RAN片内的基站所需的频谱资源的量(例如，信道的数量，或者指示基站容量)以及基站的个数来确定该RAN片所需要的频谱资源的量。此外，场景信息还可以包含直接指示RAN片频谱资源需求的信息。
根据本公开，可以由如图2所示的系统20中的装置202-208中的任意合适的装置来对场景信息进行处理以确定RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求。
例如，系统20中的装置202-208中的任意合适的装置可以对场景信息进行一定程度的处理，以提取RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求中的一个或多个，或者提取用于提取RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求中的一个或多个的中间信息，并将处理所得的结果信息连同为了获得RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求而所需的原始场景信息发送给其他装置以进行进一步的处理。例如，片内管理器可以将原始的或经其处理的场景信息发送给第三管理装置(例如，3GPP标准中规定的CSMF)。第三管理装置可以对接收到的信息进行进一步处理，并将处理后的信息发送给第二管理装置(例如，3GPP标准中规定的NSMF)。类似地，第二管理装置可以对接收到的信息进行进一步处理，并将处理后的信息发送给第一管理装置(例如，3GPP标准中规定的NSSMF)。
在本公开中，由系统20中的哪个装置对场景信息进行什么样的处理并没有特别的限制，只要第一管理装置最终可以获得RAN片间干扰关系、RAN片优先级以及RAN片频谱资 源需求即可。例如，在系统20中仅存在一个片内管理器的情况下，甚至可以直接由该片内管理器对收集到的各个片的场景信息处理来获得RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求，并将所获得的信息经由或不经由第三管理装置/第二管理装置的转发而发送给第一管理装置。再例如，系统20中的一个或多个片内管理器也可以不对场景信息进行任何处理，而是由第三管理装置、第二管理装置和第一管理装置中的一个或多个对场景信息进行处理来获得RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求。
已经对场景信息以及针对场景信息的处理进行了详细说明，下面详细说明如何确定频谱资源在多个RAN片间的编排或重编排方案。
在本公开中，考虑在允许的情况下(例如，不导致RAN片间干扰的情况下)，使得能够在RAN片之间共享频谱资源，即可以在多个RAN片之间有重叠地分配频谱资源，从而在有限的频谱资源下尽可能地提高频谱利用率，进而尽可能地满足各个RAN片对于频谱资源的需求(例如，满足各个RAN片所要求的信道数量)。
实际上，一般不可以无限制地在RAN片间共享频谱资源，因为过多的频谱资源重叠可能导致RAN片间干扰和/或可能导致无法满足RAN片的安全性要求。因此，需要考虑RAN片允许的与其他RAN片共享频谱资源的程度。在本公开中，引入参数“片间共享因子”来指示RAN片能够与其他RAN片共享频谱资源的程度。例如，片间共享因子可以表示RAN片能够与其他RAN片共享的信道数占片该RAN所拥有的信道总数的比重。通过对片间共享因子的值进行设置，可以控制RAN片间的频谱隔离程度。片间共享因子的值越小，RAN片能够与其他RAN片共享频谱资源的程度越低。
根据本公开，可以由系统20中的装置202-208中的任一适当装置来基于场景信息确定片间共享因子。特别地，可以由第二管理装置206(例如，3GPP标准中规定的NSMF)来确定片间共享因子，并将所确定的片间共享因子发送给第一管理装置204(例如，3GPP标准中规定的NSSMF)以供第一管理装置204确定频谱资源在多个RAN片间的编排或重编排方案。
可以基于由场景信息指示的通信服务需求确定所述多个RAN片中的至少一个RAN片的第一共享因子；基于从场景信息确定的RAN片间干扰关系来确定多个RAN片中的任意两个RAN片之间的第二共享因子；并且对于多个RAN片中的任意两个RAN片，基于第一共享因子和第二共享因子之间的最小值来确定该两个RAN片之间的片间共享因子。
具体地，第一共享因子可以表示RAN片基于其针对的服务类型而要求的频谱资源共享程度。对于安全性/通信质量要求较高的服务，可以设置较小的第一共享因子。例如， 针对uRLLC的RAN片可要求较高的安全性，因此可以对该RAN片设置较小的第一共享因子。第一共享因子例如可以表示RAN片主观上要求的频谱资源共享程度。第一共享因子的取值区间可以在0至1之间。
第二共享因子可以取决于RAN片的基站之间客观存在的干扰。第二共享因子例如可以表示客观上频谱资源能够被共享的程度。第二共享因子可根据上文说明的片间干扰重叠矩阵来确定。具体地，片i与片j之间的第二共享因子
Figure PCTCN2021130198-appb-000002
可以被确定为：
Figure PCTCN2021130198-appb-000003
Figure PCTCN2021130198-appb-000004
对于片i与片j，片间共享因子α ij可以被确定为第一共享因子
Figure PCTCN2021130198-appb-000005
与第二共享因子
Figure PCTCN2021130198-appb-000006
之间的最小值，即
Figure PCTCN2021130198-appb-000007
对于存在多个RAN片的网络，可以存在表示片间共享因子的表。表1示出了对于包括3个RAN片的网络的片间共享因子表。
  片1 片2 片3
片1 1 0.5 0.2
片2 0 1 0
片3 0.5 0.3 1
表1
如表1所示，片1能够与片2共享的频谱比例为0.5，即片1分到的频谱资源中有50％的频谱资源可以与片2共享，而片2可以与片1共享的频谱资源比例为0。换句话说，α ij与α ji可以是不同的值，在确定频谱资源在多个RAN片间的编排或重编排方案时，如下文说明的，将同时考虑α ij与α ji这两个值以满足片i与片j这二者对于频谱资源共享程度的要求。
根据本公开，在综合考虑片间共享因子、RAN片优先级、RAN片频谱资源需求以及网络可用的频谱资源总数的情况下，确定频谱资源在多个RAN片之间的编排或重编排方案。下面，首先说明确定频谱资源在多个RAN片之间的编排方案的具体操作，例如，可以在初始时，即各个RAN片尚未被分配任何频谱资源时对频谱资源在RAN片间进行编排。
由哪个装置来确定编排方案并不构成对本公开的限制，可以视情况由任何恰当的装置(图2中示出或未示出的)来确定频谱资源的编排方案。为了简明起见，在本文中作为统一的示例，由图2的系统20中所示的第一管理装置204(例如，3GPP中规定的NSSMF)来确定频谱资源在多个RAN片之间的编排方案。
频谱资源在多个RAN片之间的编排方案的确定可以被看作如下优化问题：如何在满足各个RAN对频谱资源共享程度的要求的条件下，尽可能地满足各个RAN片的频谱资源需求，并且使得优先级较高的RAN片的频谱资源需求被更高程度地满足并且使得允许更高频谱 资源共享程度的RAN片的频谱资源需求被更高程度地满足(换句话说，与允许较低频谱资源共享程度的RAN片相比，在其他条件(例如，优先级)相同的情况下，为允许较高频谱资源共享程度的RAN片分配更多的频谱资源，以使得能够更多地满足其频谱资源需求，因为这样可以提供更多的可以被共享的频谱资源，从而提高频谱资源利用率)。
对于确定频谱资源在多个RAN片之间的编排方案的第一管理装置204而言，上述优化问题的输入X 1可以被表示为X 1＝[α,P,N′,N RB]，而输出可以至少是表示频谱资源在各个RAN片间的分配方案的矩阵H 1，(例如，该矩阵可以指示每个RAN片分别被分配多少频谱资源(比如，多少个信道))其中α为表示片间共享因子的矩阵(例如，与片间共享因子表的各项对应的矩阵)，P为表示RAN片优先级的矩阵，N′为表示RAN片频谱资源需求的矩阵(例如，表示各个RAN片所需要的信道数量)，N RB表示网络可用的频谱资源总数(例如，网络中可用的信道总数)。为了方便说明，在下文中以信道为例来代表频谱资源，并且RAN频谱资源量可以表示为信道数量。
具体地，可以将上述优化问题表示为下式(1)：
Figure PCTCN2021130198-appb-000008
s.t.N s≤N′ s
N s,j≤min{α sjN s,α jsN j}
其中，p s代表片s的优先级；N s代表片s所分到的信道数；N′ s为片s所需要的信道数；N s,j代表片s与片j之间共享的信道数；α sj代表片s与片j的片间共享因子(即代表片s能与片j之间共享的信道占比)。
特别地，根据上式可以理解，N s,j是在同时考虑了片s与片j之间各自对信道共享程度的要求的情况下获得的值。例如，参考表1中的共享因子取值，片1能够与片2共享的信道比例为0.5，而片2可以与片1共享的频谱资源比例为0，因此在片1与片2之间无论N 1与N 2的取值如何，片1与片2之间共享的信道数都为0。
此外，根据上式可以理解，为了使
Figure PCTCN2021130198-appb-000009
的值最大从而得到最大化的
Figure PCTCN2021130198-appb-000010
Figure PCTCN2021130198-appb-000011
由于α sj与α js是根据场景信息确定的片间共享因子，因此，应当使具有较大片间共享因子的RAN片的频谱资源需求被更高程度地满足(例如，尽可能地使分给该RAN片的信道数量等于该RAN片要求的信道数量)，从而使N s,j的值尽可能得大。换句话说，分给具有较大片间共享因子的RAN片的信道数量越多，基于片间共享因子确定的能够被共享的信道数量就越多，进而可以为整个网络带来更多可分配的信道，从而一方面更高程度地满足各个RAN片的信道数量要求，另一方面提高了频谱资源利用率。
可以借助人工智能(AI)算法来对式(1)进行求解。可以采用任何适用的AI算法来对式(1)进行求解以确定频谱资源在多个RAN片之间的编排方案。在本文中，以深度Q网络(deep Q-network，DQN)算法为例进行介绍。应理解的是，DQN算法仅仅是一个示例，并不构成对本公开方案的限制。
DQN作为一种强化学习算法，其基本原理是利用反复迭代过程来训练神经网络，最终使得算法收敛。利用DQN求解上文式(1)中说明的优化问题的过程可以被简单概括为：在算法的每次迭代中，根据网络的当前状态作出一个动作，并计算该动作所带来的奖励值；利用奖励值来训练神经网络，某个动作带来的奖励值越大，则在下一次运行整个算法时，在类似状态下将以更高概率作出与该动作类似的动作；经过数轮迭代训练，算法收敛到使
Figure PCTCN2021130198-appb-000012
最大的频谱资源编排方案H 1。这里，DQN算法的状态可以被设计为：[μ,N]，其中，
μ＝[μ 1,μ 2,…,μ S],
Figure PCTCN2021130198-appb-000013
N＝[N 1,N 2,…,N S]；
DQN算法每次迭代要作出的动作可以被表示为在当前状态下决定为哪一个RAN片分配频谱资源；此外，DQN算法的奖励值可以被设计为
Figure PCTCN2021130198-appb-000014
具体地，图4给出了DQN算法的示例性运行过程。
在每次迭代开始时，运行DQN算法的智能体确定在当前状态下为哪一个RAN片分配频谱资源。这里，可以根据ε贪心策略来选择动作。也就是说，智能体基于概率ε来选择动作，具体地，以ε的概率随机选择一个RAN片来分配频谱资源，并且以1-ε的概率基于训练的数据来选取最优动作。要说明的是，随着迭代次数的增加，ε可以越来越小，从而更趋向于基于训练的数据来选取最优动作。
在确定要对其分配频谱资源的RAN片(以下称为当前RAN片)后，智能体需要查询当前状态下的可用频谱资源，例如，包括尚未被分配的剩余频谱资源以及已被分配但是可与当前RAN片共享的频谱资源。可共享的频谱资源由状态[μ,N]以及共享因子α确定。为当前RAN片分配频谱后，智能体将更新状态并计算奖励值，并将相关数据(例如，当前状态、本次采取的动作、该动作带来的奖励值、以及作出该动作后的状态(即下一状态)等)存入经验池中以供训练并更新神经网络。在更新状态后，智能体进行下一次迭代，即确定要对其分配频谱资源的RAN片，并进行相应的后续操作。当所有RAN片都进行了分配后，就完成了算法的一次执行。在达到一定的截止条件(例如，一定程度的收敛)或执行次数后， 该算法终止。
上文已经说明了确定频谱资源在多个RAN片之间的编排方案的具体操作。要指出的是，虽然上文以初始情况为例对频谱资源的编排方案进行了说明，但是上述操作并不限于初始情况，在对频谱资源进行重编排时，也可以首先按照上述具体操作确定为每个RAN片分配多少频谱资源，然后(如下文将说明的)确定为每个RAN分配哪种类型的频谱资源。
有利地，由于本公开的方案考虑按照各个RAN片所接受的程度(即，共享因子)来使多个RAN片之间的频谱资源部分重叠，因此提高了各个RAN片的频谱满意度，并且提高了频谱利用率。
如上文所说明的，当网络动态变化时，可能需要动态地增加、删除或修改RAN片。也就是说，可能会涉及对频谱资源在多个RAN片之间的重编排。在频谱资源的重编排中，除了如上文说明的考虑为RAN片分配部分重叠的频谱资源以提高频谱利用率和频谱满意度之外，特别地，本公开的方案还关注在对频谱资源进行重编排时如何降低频谱资源的重配置复杂度。下面，将对此进行详细描述。
根据本公开，可以考虑从两个方面降低频谱资源的重配置复杂度。
第一方面，实际上，网络(例如，网络流量)总是在动态变化中的。如果网络流量一出现变化就进行频谱资源编排方案在RAN片之间的更新，那么将导致过于频繁的重配置操作，从而增加了在信令、操作等方面的频谱资源重配置复杂度，进而导致时间与经济等成本上的浪费。因此，本公开考虑通过对触发频谱资源的重编排的定时进行限制来降低频谱资源的重配置复杂度。本公开通过引入“片最大容量”这一参数来对频谱资源在多个RAN片之间的触发进行限制。
具体而言，片最大容量可以反映该RAN能够服务的最大用户数量。当网络中某个RAN片的负载超过该RAN片的片最大容量时，分配给该RAN片的频谱资源可能不足以应对当前该RAN片内的用户数量，因此，可以触发对频谱资源在RAN片间的重编排。换句话说，响应于RNA片的负载超过该RAN片的片最大容量，对频谱资源进行重编排。
可以至少基于RAN片内干扰关系以及要为多个RAN片中的至少一个RAN片分配的频谱资源的数量来确定所述多个RAN片中的所述至少一个RAN片的片最大容量。具体地，可以如下式(2)来确定RAN片s的片最大容量
Figure PCTCN2021130198-appb-000015
Figure PCTCN2021130198-appb-000016
其中，N s表示片s所分到的频谱资源量(例如，信道数)，
Figure PCTCN2021130198-appb-000017
为片s中基站的平均频谱资源需求(例如，平均信道需求)，
Figure PCTCN2021130198-appb-000018
是片s内单个基站能够服务的平均用户数，η s是根据片s内 的干扰关系，并且更具体地，根据片s内的基站干扰重叠矩阵I所确定出的片内最大共享比例(即，频谱资源在片s内的各个基站之间的最大共享比例)。
RAN片内干扰关系可以基于场景信息来确定。更具体地，可以根据场景信息指示的基站位置与发射功率等信息来计算RAN片内的基站间的干扰关系矩阵，即基站干扰重叠矩阵I，其中，如果根据基站位置与发射功率等信息判定基站i与基站j之间存在干扰，则基站干扰重叠矩阵I中的项I ij＝1，否则I ij＝0。
进一步地，可以通过以下操作来确定片内最大共享比例η s：
-将干扰重叠矩阵I进行二进制取反；
-找出对该矩阵I二进制取反后的矩阵中的彼此之间没有相同元素的全连通集以及相互独立的节点F 1,F 2,…,F Z；
-组合这些全连通集以及相互独立的节点以形成集合
Figure PCTCN2021130198-appb-000019
即
Figure PCTCN2021130198-appb-000020
Figure PCTCN2021130198-appb-000021
-将基站总数B与上述全连通集连同独立节点的总数Z之比确定为最大共享比例η s，即，
Figure PCTCN2021130198-appb-000022
根据本公开，可以在每次确定频谱资源的编排/重编排方案时确定各RAN片的片最大容量。例如，无论是对于频谱资源的首次编排还是任何一次重编排，都确定各RAN片的片最大容量。再例如，在对于频谱资源的重编排并未导致为某一个或多个RAN片分配的频谱资源的量的情况下，可以不重新确定该一个或多个RAN片的片最大容量。并且，确定片最大容量的实体(例如图2的系统20中的第一管理装置204，但是，片最大容量也可以由其他恰当的实体来确定)可以向片内管理器202以及无线网络中的记录网络片负载变化的实体发送所确定的至少一个RAN片的片最大容量。记录网络片负载变化的实体可以在检测到某个RAN片的负载超出该片对应的片最大容量时，向对频谱资源进行编排/重编排的实体(例如，第一管理装置204)进行通知，以触发对频谱资源在RAN片间的重编排。根据本公开，如下文参考图6-图8详细说明的，记录网络片负载变化的实体包括实现以下功能的实体中的一个或多个：统一数据仓库UDR/统一数据管理UDM、操作维护管理OAM、网络切片配额NSQ或网络切片选择功能NSSF。
下面说明降低频谱资源的重配置复杂度的第二方面。将已经分配给某个RAN片的频谱资源重新分配给另一个RAN片的过程带来了信令、操作等方面的复杂度。因此，除了减少对频谱重编排的不必要的触发之外，本公开进一步考虑在触发了对频谱的重编排之后，使得已分配给已有RAN片的频谱资源被重新分配给其他RAN片的数量尽可能地少。换句话说， 本公开考虑尽可能地减少如下频谱资源的量：已分配给某个RAN片的需要重新分配给其他RAN片的频谱资源。
具体而言，可以在确定频谱资源在多个RAN片间的重编排方案时考虑降低已经分配给某个RAN片的需要重新分配给另一个RAN片的频谱资源的数量。在确定频谱资源在多个RAN片间的重编排方案时，可以将上述式(1)修改为下式(3)来达到此目的。
Figure PCTCN2021130198-appb-000023
s.t.N s≤N′ s
N s,j≤min{α sjN s,α jsN j}
其中，项
Figure PCTCN2021130198-appb-000024
可以表示已分配给已有RAN片的频谱资源被重新分配给其他RAN片的数量与总频谱资源的比重程度，其中，γ 1代表重配置权重，其取值可以在0至1之间；
Figure PCTCN2021130198-appb-000025
代表已分配给已有RAN片的频谱资源n(例如，信道n)被重新分配给其他RAN片的次数；N RB表示总的频谱资源量(例如总的信道数量)。
具体地，可以在按照上文参考式(1)说明的操作确定使得
Figure PCTCN2021130198-appb-000026
尽可能大的频谱资源编排方案的同时，通过确定要为各个RAN片分配的频谱资源的第一特性来使
Figure PCTCN2021130198-appb-000027
尽可能地小，从而使整个式(3)尽可能得大。频谱资源的第一特性例如可以至少指示包括以下项的频谱资源类型：未分配给RAN片的频谱资源、已分配给RAN片但尚未被该RAN片使用的频谱资源和能够与已分配给RAN片的频谱资源重叠的频谱资源。确定频谱资源的第一特性的总的原则可以是尽可能按照如下顺序分配频谱资源：未分配给RAN片的频谱资源、已分配给RAN片但尚未被该RAN片使用的频谱资源和能够与已分配给RAN片的频谱资源重叠的频谱资源。这样，可以尽可能少地使用已分配给RAN片的频谱资源，从而尽可能少地引入频谱资源在RAN片之间的重新调整，进而降低频谱资源的重配置复杂度，并且在频谱资源的重编排时很大程度上降低对已分配了频谱资源的RAN片的影响。
这里，在考虑降低频谱资源的重配置复杂度的情况下，以未分配给RAN片的频谱资源、已分配给RAN片但尚未被该RAN片使用的频谱资源和能够与已分配给RAN片的频谱资源重叠的频谱资源这三种频谱资源类型为例说明了频谱资源的第一特性。但是，应理解的是，频谱资源的第一特性并不限于频谱的上述类型。例如，在确定频谱资源在RAN片间的编排或重编排方案时，还可以根据RAN片的通信服务需求等来确定为各个RAN片分配什么样的频谱资源。这种情况下，第一特性还可以包括频谱资源所对应的频段等其他特性，从而为各个RAN片进行针对性的频谱资源分配。
图5示意性地示出了根据本公开的实施例的用于无线通信的系统的方法的第二概 念性操作流程50，该操作流程例如适用于对频谱资源进行重编排的情况。与图3类似，可以由根据本公开的用于无线通信的系统20中的各个装置执行第二概念性操作流程50的相应操作。
该第二概念性操作流程50的S502至S506的操作与参考图3说明的第一概念性操作流程30的S302至S306的操作类似。
区别在于，在S506，由于是对频谱资源进行重编排，因此，如上文详细说明的那样，在使得已分配给已有RAN片的频谱被重新分配给其他RAN片的数量尽可能地少的情况下来对频谱资源进行重编排。例如，可以根据式(3)来确定要为每个RAN片分配多少频谱资源(例如，多少个信道)，以及要将哪种类型(例如，未分配的、已分配的但未被使用的和已分配使用但可以被共享的)的频谱资源分配给RAN片。
在S508，如上文说明的，至少基于RAN片内干扰关系以及为RAN片分配的频谱资源的数量来确定RAN片的片最大容量。例如，可以由图2的系统20中的第一管理装置204来确定各RAN片的片最大容量。此外，第一管理装置204还可以将所确定的片最大容量发送给无线网络中的记录网络片负载变化的实体，以便后续触发频谱资源的重编排，并且第一管理装置204还可以将所确定的片最大容量发送给片内管理器以供片内管理器确定RAN片内频谱资源在各基站之间的分配/重分配方案。虽然此处在适用于对频谱资源进行重编排的情况下了该步骤S508，但是，可以理解的是，上述参考图3说明的第一概念性操作流程30也可以包括与第二概念性操作流程50的S508类似的确定并发送片最大容量的操作。
在S510，在无线网络中的记录网络片负载变化的实体检测到某个RAN片的负载超过了该RAN片的片最大容量，或者无线网络中由于突发通信等原因产生了新的RAN片，那么触发对频谱资源的重编排。在这种情况下，可以视情况重新收集场景信息并确定频谱资源的重编排方案，或者在场景信息足够的情况下直接确定频谱资源的重编排方案。如果如S510的“否”分支那样，未检测到任何RAN片的负载超过了该RAN片的片最大容量，或者未产生新的RAN片，那么不触发频谱资源的重编排。
上面，已经详细说明了根据本公开确定频谱资源在多个RAN片间的编排或重编排方案的操作。根据本公开，由于考虑使用可以在RAN片间共享的频谱资源，因此，可以提高频谱利用率以及RAN片的频谱资源满意度。此外，由于对触发频谱资源在RAN片间重编排的定时进行了限制并且限制了需要在RAN片间进行调整的已分配频谱资源的量，因此，可以尽可能降低频谱资源在RAN片间的重配置复杂度。
实际上，除了需要为各个RAN片分配相应的频谱资源，还需要对RAN片内的至少一 个基站(例如，每个基站)分配相应的频谱资源。下面，将对此进行详细说明。
根据本公开，可以由图2所示的系统20中的任意适用的装置来确定频谱资源在RAN片内的分配或重分配方案。特别地，可以由片内管理器来确定频谱资源在RAN片内的分配或重分配方案。
在确定频谱资源在RAN片内的分配/重分配方案的实体(例如，图2中的片内管理器)与确定频谱资源在RAN片间的编排/重编排方案的实体(例如，图2中的第一管理装置)并非同一实体的情况下，上述两个实体之间可以进行信息交互，以传递确定频谱资源的片内分配/重分配方案所需的信息，比如频谱资源的第一特性和/或分配给该片的频谱资源的数量等。例如，由图2中的第一管理装置204确定了频谱资源在RAN片内的分配/重分配方案之后，第一管理装置204可以将指示分配给各个RAN片的各频谱资源的第一特性的信息和/或分配给各个RAN片的数量的信息发送给相应的一个或多个片内管理器，以供片内管理器确定频谱资源在由其管理的片内的分配/重分配方案。
根据本公开，可以至少基于要为多个RAN片中的相应RAN片分配的频谱资源的第一特性和/或数量来确定频谱资源在所述相应RAN片内的分配或重分配方案，其中，频谱资源在一个RAN片内的分配或重分配方案包括要为该RAN片中的至少一个基站分配的频谱资源的第二特性以及数量。频谱资源的第二特性可以至少指示包括以下项的频谱资源类型：未分配给基站的频谱资源、已分配给基站但尚未被该基站使用的频谱资源和能够与已分配给基站的重叠的频谱资源。
下面，首先说明在确定频谱资源在RAN片内的分配方案的具体操作，例如，可以在初始时，即各基站尚未被分配任何频谱资源时对频谱资源在RAN内进行分配。
具体而言，频谱资源在RAN片内的分配方案的确定可以被看作如下优化问题：如何尽可能地满足RAN片内各基站的频谱资源需求。可以从两个方面来考虑基站对频谱的满意度。一方面，基站所分配的频谱资源的数量越多，则满意度越高，换句话说，借助所分配的频谱资源，基站能服务的用户数量越多，则满意度越高。另一方面，基站利用所分配的频谱资源为用户带来的QoS越高或者产生的经济效益越高，则满意度越高。对于后者，例如，不同第一特性的频谱资源可能为基站带来不同程度的频谱满意度。
更具体地，上述优化问题可以被表示为下式(4)
Figure PCTCN2021130198-appb-000028
s.t.
Figure PCTCN2021130198-appb-000029
Figure PCTCN2021130198-appb-000030
Figure PCTCN2021130198-appb-000031
其中，H 2为表示频谱资源在片s的各基站间的分配方案的矩阵(例如，该矩阵可以指示每个基站分别被分配多少频谱资源(比如，多少个信道))，
Figure PCTCN2021130198-appb-000032
代表片s的基站b所分到的频谱资源数量(例如，信道数)；N′ b代表基站b所需要的频谱资源数量；u b代表基站b分得频谱资源后带来的效益值(例如，可以反映上文说明的QoS或经济效益之类)；N s代表为片s分配的总频谱资源数量；
Figure PCTCN2021130198-appb-000033
表示片s的负载(例如，用户个数)；
Figure PCTCN2021130198-appb-000034
代表片s的片最大容量。
可以借助人工智能(AI)算法来对式(4)进行求解。可以采用任何适用的AI算法来对式(4)进行求解以确定频谱资源在一个RAN片内的多个基站之间的编排方案。在本文中，以蚁群(ant colony optimization，ACO)算法为例进行介绍。应理解的是，ACO算法仅仅是一个示例，并不构成对本公开方案的限制。
ACO是一种群智能算法，其原理是模拟蚂蚁寻找食物的方法进行最优化问题的求解。传统的蚁群算法常用于寻找最短路径问题。在算法的初始阶段，蚂蚁将被随机地放置于各个节点上，蚂蚁都需要遍历所有节点。每只蚂蚁行走时都会在路径上释放“信息素”，而后续的蚂蚁将会根据路径上信息素浓度进行路径选择。最终几乎所有蚂蚁都会选择信息素浓度最高(即信息素最大)的路径。
在本公开中，利用ACO算法求解上文式(4)中说明的优化问题的基本思想可以被简单概括为：将RAN片内的要被分配频谱资源的基站作为蚂蚁需要遍历的节点，每只蚂蚁都需要遍历所有节点。每只蚂蚁每走到一个节点就为该节点所代表的基站尽可能地分配当前可用的频谱资源(例如，未被分配或使用的频谱资源，或已分配给与该基站不存在干扰的基站的频谱资源)。此外，可以将
Figure PCTCN2021130198-appb-000035
用作ACO算法的信息素。这样，当所有蚂蚁都遍历了所有节点时，可以得到使
Figure PCTCN2021130198-appb-000036
最大的片内频谱分配方案。
具体地，在一只蚂蚁遍历完所有节点后，ACO算法将计算本次遍历节点所走的路径k的信息素增量ΔP k、对其基于片内的基站总数B取均值，即
Figure PCTCN2021130198-appb-000037
并将该均值作为该路径k上每个节点间的信息素增量。路径k上的节点i与j之间的累计信息素
Figure PCTCN2021130198-appb-000038
可以按照下式(5)进行计算：
Figure PCTCN2021130198-appb-000039
其中，式中
Figure PCTCN2021130198-appb-000040
为第k-1条路径(例如，由上一只蚂蚁走过的路径)后节点i至节点j之间的累计信息素。节点之间的累计信息素将影响后续的蚂蚁对路径的选择。最终，ACO算法将收敛到使得
Figure PCTCN2021130198-appb-000041
最大的频谱资源在RAN片内的分配方案。
上文已经说明了确定频谱资源在RAN片内的分配方案的具体操作。要指出的是，虽然上文以初始情况为例对频谱资源的分配方案进行了说明，但是上述操作并不限于初始情况，在对频谱资源进行片内的重分配时，也可以首先按照上述具体操作确定为各个基站分配多少频谱资源，然后(如下文将说明的)确定为各个基站分配哪种类型的频谱资源。
类似于上文参考片间频谱重编排时说明的，在进行片内的频谱资源的重分配时，也考虑降低频谱资源的重配置复杂度。类似于片间频谱重编排，也可以考虑通过使得已分配给已有基站的频谱资源被重新分配给其他基站的数量尽可能地少，来降低片内的频谱资源重配置复杂度。换句话说，本公开考虑尽可能地减少如下频谱资源的量：已分配给某个基站的需要重新分配给其他基站的频谱资源。
具体而言，可以在确定频谱资源在RAN片内的重分配方案时考虑降低已经分配给某个基站的需要重新分配给另一个基站的频谱资源的数量。在确定频谱资源在RAN片内的重分配方案时，可以将上述式(4)修改为下式(6)来达到此目的。
Figure PCTCN2021130198-appb-000042
其中，项
Figure PCTCN2021130198-appb-000043
可以表示已分配给基站的频谱资源被重新分配给其他基站的数量与分配给该片s的总频谱资源的比重程度，其中，γ 2代表片内重配置权重，其取值可以在0至1之间；
Figure PCTCN2021130198-appb-000044
代表已分配给基站的频谱资源n(例如，信道n)被重新分配给其他基站的次数；N s表示分配给片s的频谱资源的总量。
例如，可以在按照上文参考式(4)说明的操作确定使得
Figure PCTCN2021130198-appb-000045
尽可能大的频谱资源分配方案的同时，通过确定要为各个基站分配的频谱资源的第二特性来使
Figure PCTCN2021130198-appb-000046
尽可能地小，从而使整个式(6)尽可能得大。频谱资源的第二特性可以至少指示包括以下项的频谱资源类型：未分配给基站的频谱资源、已分配给基站但尚未被该基站使用的频谱资源和能够与已分配给基站的重叠的频谱资源。确定频谱资源的第二特性的总的原则可以是尽可能按照如下顺序分配频谱资源：未分配给基站的频谱资源、已分配给基站但尚未被该基站使用的频谱资源和能够与已分配给基站的频谱资源重叠的频谱资源。这样，可以尽可能少地使用已分配给基站的频谱资源，从而尽可能少地引入频谱资源在基站之间的重新调整，进而降低频谱资源的重配置复杂度，并且在频谱资源的重分配时很大程度上降低对已分配了频谱资源的基站的影响。
上文已经对根据本公开的用于无线通信的系统以及由该系统进行的方法进行了详细说明。
下面结合图6-图8，说明在本公开的一个具体实施例下的三个信息流示例。在该实施例中，由NSSMF充当图2中的第一管理装置204、NSMF充当第二管理装置206、并且由CSMF充当图2中的第三管理装置208。此外，在该实施例中，由片内管理器负责收集场景信息并确定频谱资源在RAN片内的分配/重分配方案，由NSSMF负责确定频谱资源在RAN片间的编排/重编排方案以及片最大容量，由NSMF确定RNA片间干扰关系(例如片间共享因子)并且由CSMF对场景信息进行一定程度的处理，以方便后续实体的进一步处理。
表2说明了图6-图8中的信息流交互中涉及的实体。
接入和移动管理功能Access and mobility management function AMF
通信服务管理功能Communication service management function CSMF
网络切片管理功能Network slice management function NSMF
网络切片选择功能Network slice selection function NSSF
网络切片子网管理功能Network slice subnet management function NSSMF
网络仓库功能Network repository function NRF
网络切片配额Network slice quota NSQ
操作管理和维护Operation administration and maintenance OAM
策略控制功能Policy control function PCF
统一数据管理Unified data management UDM
统一数据仓库Unified data repository UDR
用户设备User Equipment UE
表2
首先，参考图6说明该具体实施例下的第一信息流示例。
如图6所示，在步骤1处，片内管理器收集其负责的RAN片的场景信息，并将收集到的场景信息发送到CSMF。例如，片内管理器可以将诸如基站位置、基站发射功率、基站的频谱资源需求和通信服务需求之类的场景信息发送到CSMF。
CSMF在步骤2处对接收到的场景信息进行处理。例如，CSMF可以如上文所述基于场景信息中包含的通信服务需求来确定RAN片优先级。再例如，CSMF可以如上文所述基于场景信息中包含的基站的频谱资源需求来确定RAN片频谱资源需求。可选地，CSMF还可以对场景信息进行一些中介处理，以方便其他实体的后续操作。
CSMF可以在步骤3处，将经处理的场景信息发送给NSMF。这里，经处理的场景信息包括对原始场景信息进行处理后结果所得的信息以及其他实体进行后续操作所需的(例如， 为了获得RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求而所需的)原始场景信息。
在步骤4处，NSMF可以对从CSMF接收到的信息进行进一步的处理。例如，NSMF可以基于基站位置以及发射功率等信息来确定RAN片间干扰关系，并且进一步确定片间共享因子。
在步骤5处，NSMF可以将经进一步处理的场景信息发送给NSSMF。这里，经进一步处理的场景信息包括对从CSMF接收的信息进行处理后结果所得的信息以及其他实体进行后续操作可能所需的原始场景信息/从CSMF接收的信息(例如，可以是NSSMF确定片内干扰关系以确定片最大容量所需的信息，诸如原始的基站位置/发射功率或者(例如，可以由CSMF确定的)基站干扰关系矩阵之类)。
在步骤6处，NSSMF基于接收到的信息来确定RAN片间的频谱资源编排/重编排方案，并进一步确定所涉及的各RAN片的片最大容量。
在步骤7处，NSSMF可以将片最大容量发送给记录网络片负载变化的实体(例如，本示例中是UDR/UDM)，以方便由该实体在检测到RAN片的负载超过片最大容量时触发对频谱资源在RAN片间的重编排。
在步骤8处，NSSMF可以将RAN片间的频谱资源编排/重编排方案以及片最大容量发送给用于确定片内频谱资源分配/重分配方案的实体(例如，本实施例中是片内管理器)。
在步骤9处，片内管理器可以确定频谱资源在RAN内各基站间的分配方案。
步骤10-步骤14涉及UE、AMF、PCF、UDR/UDM和OAM这几个实体之间的信息交互。这些信息交互旨在根据网络片(例如，本公开中主要讨论的RAN片)的最大用户数量配额来判定基于当前分配给各个RAN片的频谱资源，是否能够接收UE注册到某个网络片(例如，本公开中关注的RAN片)的请求。这些步骤例如已经在3GPP TR 23.700-40v0.3.0的solution#1中进行了规定，这里不再详细描述。要指出的是，在本公开方案的背景下，“用户数量配额”可以对应于本公开中的“容量”。因此，在步骤10处涉及的最大用户数量总配额可以对应于所涉及的所有片的片最大容量总和，并且在步骤11处涉及的最大用户数量本地配额可以对应于用户要注册的当前片的片最大容量。
在步骤10-14中由PCF和AMF判定可以接受UE注册到相应RAN片的请求的情况下，UE可以在步骤15向片内管理器发送注册到其管理的相应RAN片的请求。
在一些情况下，例如，要服务该UE的基站的频谱资源不充足的情况下，UE的注册请求可以触发步骤16处的频谱资源在片内的基站间的重分配。此外，在步骤17处，由于有 新的UE注册到了某一网络片，因此PCF和UDR/UDM可以对该片的配额进行更新和重分配。
在步骤10-14中由PCF和AMF判定UE请求注册的RAN片的频谱资源不足以应对想要加入的该新的UE的情况下(例如，该UE的加入将导致该RAN片的负载超过其片最大容量)，PCF可以通知NSSMF进行频谱资源在RAN片间的重编排(步骤18)。并且在步骤19处，PCF和UDR/UDM可以基于频谱资源重编排后确定的新的片内最大容量来对本地配额进行更新。
下面，参考图7说明根据本公开的上述具体实施例下的第二信息流示例。
图7示出的第二信息流示例的步骤1至步骤6与参考图6说明的第一信息流示例相似，这里不再重复说明。
在步骤7处，区别于第一信息流示例，NSSMF将片最大容量发送给作为记录网络片负载变化的实体的NSQ，以方便由NSQ在检测到RAN片的负载超过片最大容量时触发对频谱资源在RAN片间的重编排。
在步骤8处，类似于第一信息流示例，NSSMF可以将RAN片间的频谱资源编排/重编排方案以及片最大容量发送给作为用于确定片内频谱资源分配/重分配方案的实体的片内管理器。
在步骤9处，片内管理器可以确定频谱资源在RAN内各基站间的分配方案。
步骤10-步骤18涉及UE、AMF、NSQ、NRF和UDM/UDR这几个实体之间的信息交互。这些信息交互旨在根据网络片(例如，本公开中主要讨论的RAN片)的最大用户数量配额(换句话说，片最大容量)来判定基于当前分配给各个RAN片的频谱资源，是否能够接收UE注册到某个网络片(例如，本公开中关注的RAN片)的请求。这些步骤例如已经在3GPP TR 23.700-40v0.3.0的solution#2中进行了规定，这里不再详细描述。
在步骤19a，在UE可以注册到相应RAN片的情况下，如果要服务该UE的基站的频谱资源不充足，那么UE的注册请求可以触发步骤20a处的频谱资源在片内的基站间的重分配。
在步骤18b处，由于UE请求注册的RAN片的频谱资源不足以应对想要加入的该新的UE，UE的注册请求被拒绝的情况下，在步骤19b处，NSQ可以请求NSSMF进行频谱资源在RAN片间的重编排(步骤20b)。并且在步骤21处，NSSMF可以将频谱资源重编排后确定的新的片内最大容量发送给NSQ。
下面，参考图8说明根据本公开的上述具体实施例下的第三信息流示例。
图8示出的第三信息流示例的步骤1至步骤6与参考图6说明的第一信息流示例相似，这里不再重复说明，
在步骤7处，区别于第一信息流示例和第二信息流示例，NSSMF将片最大容量发送 给作为记录网络片负载变化的实体的NSSF，以方便由NSSF在检测到RAN片的负载超过片最大容量时触发对频谱资源在RAN片间的重编排。
在步骤8处，类似于第一和第二信息流示例，NSSMF可以将RAN片间的频谱资源编排/重编排方案以及片最大容量发送给作为用于确定片内频谱资源分配/重分配方案的实体的片内管理器。
在步骤9处，片内管理器可以确定频谱资源在RAN内各基站间的分配方案。
步骤10-步骤15涉及UE、AMF和NSSF这几个实体之间的信息交互。这些信息交互旨在根据网络片(例如，本公开中主要讨论的RAN片)的最大用户数量配额(换句话说，片最大容量)来判定基于当前分配给各个RAN片的频谱资源，是否能够接收UE注册到某个网络片(例如，本公开中关注的RAN片)的请求。这些步骤例如已经在3GPP TR 23.700-40v0.3.0的solution#3中进行了规定，这里不再详细描述。
在步骤16处，在UE可以注册到相应RAN片的情况下，如果要服务该UE的基站的频谱资源不充足，那么UE的注册请求可以触发步骤17处的频谱资源在片内的基站间的重分配。
在步骤18处，在NSSF已经统计到用户数量达到片最大容量的情况下，在步骤18处，NSSF可以请求NSSMF进行频谱资源在RAN片间的重编排。并且在步骤20处，NSSMF可以将频谱资源重编排后确定的新的片内最大容量发送给NSSF。
已经参考图6-图8简单说明的根据本公开的一个具体实施例下的三个信息流示例。要说明的是，图6-图8的信息流仅仅是示意性的。图6-图8中信息发送的顺序可以根据情况进一步调整，并且还可以包括一些其他未示出的信息流。例如，向记录网络片负载变化的实体发送片最大容量的步骤7可以与向片内管理器发送片间频谱编排方案和片最大容量的步骤8并行地，或颠倒顺序地执行。再例如，在进行片间频谱资源重编排或进行片内频谱资源重配置的情况下，可能涉及新的场景信息收集/处理过程。也就是说，在图6的步骤18或步骤16之前或者图7的步骤20b或20a之前或者图8的步骤19或步骤17之前，还可以额外包括与步骤1至6中的一个或多个步骤类似的步骤。此外，各个步骤中发送的信息的具体内容可以随着具体情况而略有不同。例如，对场景信息进行处理所涉及的各个具体操作可以视情况由片内管理器、CSMF、NSMF以及NSSMF中的相应的一个或多个实体来进行，因此，在步骤1至6中传送的信息可以根据每个实体所进行的具体操作而变化。例如，可以由NSMF代替CSMF来确定RAN片频谱资源需求，在这种情况下，CSMF可以仅仅简单地向NSMF转发确定RAN片频谱资源需求所需的原始场景信息。进一步地，发送给记录网络片负载变化的实体的信息还可以包括除了片最大容量之外的其他参数。
以上已经参考附图对本公开的方案进行了详细的说明。在本公开的方案中，有利地，按照各个RAN片所接受的程度(即，共享因子)来使多个RAN片之间的频谱资源部分重叠，提高了各个RAN片的频谱满意度，并且提高了频谱利用率。另一方面，在本公开的方案中，通过对触发频谱资源的重编排的定时进行限制，有利地降低了频谱资源在频谱间重编排的复杂度。此外，在本公开的方案中，通过使得已分配给已有RAN片的频谱资源被重新分配给其他RAN片的数量尽可能地少，并且通过使得已分配给基站的频谱资源被重新分配给基站的数量尽可能地，进一步降低了频谱资源在频谱资源在频谱间重编排以及在片内重配置的复杂度。
此外，本公开的方案还可以支持跨运营商的频谱资源分配场景。在该场景下，不同的RAN片可以由不同的运营商来运营。本公开的方案可以使得能够实现跨运营商的频谱资源共享以及灵活的频谱资源分配。
以下借助仿真结果本公开的方案的效果进行说明。
表3示出了为仿真设置的参数表，其中，以信道作为频谱资源。
Figure PCTCN2021130198-appb-000047
表3
其中，基站信道需求表示每个基站需要的频谱个数，在这个仿真实例中，每个片的每个基站的信道需求是相同的。
图9示例性地示出了表示该仿真的基站位置场景图。
在图9所示的场景下，利用表3所示的参数确定的片间共享因子如表4所示。
  片1 片2 片3
片1 1 0 0.35
片2 0 1 0
片3 0.5 0 1
表4
表5示出了在图9所示的场景下利用表3所示的参数对信道在片1-片3之间的编排方案进行确定的仿真结果。
  片1 片2 片3
分得信道数 9 12 12
片频谱满意度 100％ 100％ 80％
表5
图10示出了利用本公开的方案与利用在不考虑片间频谱资源共享的情况下为各个片分配独立的频谱资源的方案在各个片的频谱资源(即，信道)满意度方面的对比图。如图10所示，在总频谱资源有限(例如，总信道数少于40个)的情况下，相比于在各个片间分配独立频谱资源的方案，本公开的方案能够更多程度地满足各个片对频谱资源的需求，从而有效地提升了各个片的频谱资源满意度。
表6示出了在图9所示的场景下利用表3所示的参数对各个片内的频谱分配方案进行确定的仿真结果。
  片1 片2 片3
基站数 20 20 20
基站信道需求 3 3 3
基站平均频谱满意度 90％ 100％ 100％
表6
图11示出了利用本公开的方案与利用在不考虑片间频谱资源共享的情况下为各个片分配独立的频谱资源的方案在各个片的频谱资源(即，信道)满意度方面的对比图。如 图11所示，在总频谱资源有限(例如，总信道数少于40个)的情况下，相比于在各个片间分配独立频谱资源的方案，由于本公开的方案能够为各个片提供更多的频谱资源，因此也能够更多程度地满足各个片内各个基站对频谱资源的需求，从而有效地提升了各基站的频谱资源满意度。
已经通过各个实施例对本公开的方案进行了描述。应指出，上述实施例仅仅是示例性的。本公开的方案还可以按照其他方式来实现，并且仍具有上述实施例所获得的有利效果。
另外，应当理解，上述系列处理、系统以及系统中的装置也可以通过软件和/或固件实现。在通过软件和/或固件实现的情况下，从存储介质或网络向具有专用硬件结构的计算机，例如图12所示的通用计算机/计算机系统1200安装构成该软件的程序，该计算机在安装有各种程序时，能够执行各种功能等等。图12是作为本公开的实施例中可采用的计算机/计算机系统的示例结构的框图。虽然示出为单个结构框图，但是计算机/计算机系统1200的功能可以被实现为分布式系统。例如，可以在使用一个处理器执行一些处理的同时，使用其他远程处理器执行其他处理。计算机/计算机系统1200的其他元件也可以类似地分布。此外，本文公开的功能可以在可以通过网络耦合在一起的单独的服务器或设备上实现。此外，可以不包括系统1200的一个或多个部件。
在一些实施例中，计算机/计算机系统1200可以作为整体用于实现图2所示的系统20。在这种情况下，特别地，系统20中包括的各个装置可以由系统1200中的各个部件相互协作地实现为实现相应功能的模块。在一些实施例中，包括在图2所示的系统20中的多个装置可以由分开的计算机/计算机系统1200来实现。在一些实施例中，包括在图2所示的系统20中的多个装置中的一部分可以由分开的计算机/计算机系统1200来实现，并且另一部分可以由一个计算机/计算机系统1200作为整体来实现。
在图12中，中央处理单元(CPU)1201根据只读存储器(ROM)1202中存储的程序或从存储部分1208加载到随机存取存储器(RAM)1203的程序执行各种处理。在RAM 1203中，也根据需要存储当CPU 1201执行各种处理等时所需的数据。
CPU 1201、ROM1202和RAM 1203经由总线1204彼此连接。输入/输出接口1205也连接到总线1204。
下述部件连接到输入/输出接口1205：输入部分1206，包括键盘、鼠标等；输出部分1207，包括显示器，比如阴极射线管(CRT)、液晶显示器(LCD)等，和扬声器等；存储部分1208，包括硬盘等；和通信部分1209，包括网络接口卡比如LAN卡、调制解调 器等。通信部分1209经由网络比如因特网执行通信处理。
根据需要，驱动器1210也连接到输入/输出接口1205。可拆卸介质1211比如磁盘、光盘、磁光盘、半导体存储器等等根据需要被安装在驱动器1210上，使得从中读出的计算机程序根据需要被安装到存储部分1208中。
在通过软件实现上述系列处理的情况下，从网络比如因特网或存储介质比如可拆卸介质1211安装构成软件的程序。
本领域技术人员应当理解，这种存储介质不局限于图12所示的其中存储有程序、与设备相分离地分发以向用户提供程序的可拆卸介质1211。可拆卸介质1211的例子包含磁盘(包含软盘(注册商标))、光盘(包含光盘只读存储器(CD-ROM)和数字通用盘(DVD))、磁光盘(包含迷你盘(MD)(注册商标))和半导体存储器。或者，存储介质可以是ROM 1202、存储部分1208中包含的硬盘等等，其中存有程序，并且与包含它们的设备一起被分发给用户。
以上参照附图描述了本公开的示例性实施例，但是本公开当然不限于以上示例。本领域技术人员可在所附权利要求的范围内得到各种变更和修改，并且应理解这些变更和修改自然将落入本公开的技术范围内。
应当理解，根据本公开实施例的机器可读存储介质或程序产品中的机器可执行指令可以被配置为执行与上述系统和方法实施例相应的操作。当参考上述系统和方法实施例时，机器可读存储介质或程序产品的实施例对于本领域技术人员而言是明晰的，因此不再重复描述。用于承载或包括上述机器可执行指令的机器可读存储介质和程序产品也落在本公开的范围内。这样的存储介质可以包括但不限于软盘、光盘、磁光盘、存储卡、存储棒等等。
还应当理解，本公开的实施例还可采用硬件电路的形式。硬件电路可以包括组合式逻辑电路、时钟存储设备(诸如软盘、触发器、锁存器等)、有限状态机、诸如静态随机存取存储器或嵌入式动态随机存取存储器的存储器、定制设计电路、可编程逻辑阵列等的任意组合。
在该说明书中，流程图中所描述的步骤不仅包括以所述顺序按时间序列执行的处理，而且包括并行地或单独地而不是必须按时间序列执行的处理。此外，甚至在按时间序列处理的步骤中，无需说，也可以适当地改变该顺序。
虽然已经详细说明了本公开及其优点，但是应当理解在不脱离由所附的权利要求所限定的本公开的精神和范围的情况下可以进行各种改变、替代和变换。而且，本公开实 施例的术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者设备不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者设备所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括所述要素的过程、方法、物品或者设备中还存在另外的相同要素。
此外，本公开还可以具有如下配置：
(1)一种用于无线通信的系统，包括：
一个或多个片内管理器，所述一个或多个片内管理器中的至少一个被配置为收集无线网络中的多个无线接入网RAN片中的相应RAN片的场景信息，其中，所述场景信息用于确定至少以下信息：RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求；
第一管理装置，被配置为至少基于所述场景信息确定频谱资源在所述多个RAN片间的编排或重编排方案，其中频谱资源在所述多个RAN片间的编排或重编排方案包括要为所述多个RAN片中的至少一个RAN片分配的频谱资源的第一特性以及数量。
(2)如(1)所述的系统，其中
所述场景信息至少指示以下项中的一个或多个：基站位置、基站发射功率、基站的频谱资源需求和通信服务需求。
(3)如(1)或(2)所述的系统，其中
所述系统还包括第二管理装置，被配置为基于所述场景信息确定表示RAN片能够与其他RAN片共享频谱资源的程度的片间共享因子，并将所确定的片间共享因子发送给第一管理装置以供第一管理装置确定频谱资源在所述多个RAN片间的编排或重编排方案。
(4)如(3)所述的系统，其中确定片间共享因子包括：
基于由所述场景信息指示的通信服务需求确定所述多个RAN片中的至少一个RAN片的第一共享因子，
基于RAN片间干扰关系确定所述多个RAN片中的任意两个RAN片之间的第二共享因子；和
对于所述多个RAN片中的任意两个RAN片，基于第一共享因子和第二共享因子之间的最小值来确定该两个RAN片之间的片间共享因子。
(5)如(1)或(2)所述的系统，其中
第一管理装置确定频谱资源在所述多个RAN片之间的编排或重编排方案，使得满足以下项中的一个或多个：
在对频谱资源进行编排中，使得允许更高频谱资源共享程度的RAN片的频谱资源需求被更高程度地满足；和
在对频谱资源进行重编排中，使得已分配给已有RAN片的频谱被重新分配给其他RAN片的数量尽可能地少。
(6)如(1)或(2)所述的系统，其中
频谱资源的第一特性至少指示包括以下项的频谱资源类型：未分配给RAN片的频谱资源、已分配给RAN片但尚未被该RAN片使用的频谱资源和能够与已分配给RAN片的频谱资源重叠的频谱资源，并且
第一管理装置在确定频谱资源在所述多个RAN片之间的重编排方案中，按照如下顺序分配频谱资源：未分配给RAN片的频谱资源、已分配给RAN片但尚未被该RAN片使用的频谱资源和能够与已分配给RAN片的频谱资源重叠的频谱资源。
(7)如(1)或(2)所述的系统，其中
所述场景信息还指示RAN片内干扰关系，并且
第一管理装置至少基于RAN片内干扰关系以及要为所述多个RAN片中的至少一个RAN片分配的频谱资源的数量来确定所述多个RAN片中的至少一个RAN片的片最大容量。
(8)如(7)所述的系统，其中
响应于RAN片的负载超过所确定的该RAN片的片最大容量，或者响应于所述无线网络中产生新的RAN片，第一管理装置对频谱资源进行重编排。
(9)如(7)所述的系统，其中
第一管理装置向所述至少一个片内管理器以及所述无线网络中的记录网络片负载变化的实体发送所确定的至少一个RAN片的片最大容量。
(10)如(9)所述的系统，其中
记录网络片负载变化的实体包括实现以下功能的实体中的一个或多个：统一数据仓库UDR/统一数据管理UDM、操作管理和维护OAM、网络切片配额NSQ或网络切片选择功能NSSF。
(11)如(1)或(2)所述的系统，其中
所述至少一个片内管理器进一步被配置为至少基于要为所述多个RAN片中的相应RAN片分配的频谱资源的第一特性和/或数量来确定频谱资源在所述相应RAN片内的分配或重分配方案，其中频谱资源在一个RAN片内的分配或重分配方案包括要为该RAN片中的至少一个基站分配的频谱资源的第二特性以及数量。
(12)如(11)所述的系统，其中
所述至少一个片内管理器确定频谱资源在RAN片内的重分配方案，使得已分配给任意基站的频谱被重新分配给其他基站的次数尽可能地少，和/或
频谱资源的第二特性至少指示包括以下项的频谱资源类型：未分配给基站的频谱资源、已分配给基站但尚未被该基站使用的频谱资源和能够与已分配给基站的频谱资源重叠的频谱资源，并且所述至少一个片内管理器在确定频谱资源在RAN片内的重分配方案时，按照如下顺序分配频谱资源：未分配给基站的频谱资源、已分配给基站但尚未被该基站使用的频谱资源和能够与已分配给基站的频谱资源重叠的频谱资源。
(13)如(3)所述的系统，其中
所述系统还包括第三管理装置，被配置为从所述至少一个片内管理器接收所述场景信息，并将原始接收的场景信息或经处理的场景信息发送给第二管理装置。
(14)一种用于无线通信的系统的方法，所述系统包括一个或多个片内管理器和第一管理装置，所述方法包括
由所述一个或多个片内管理器中的至少一个片内管理器收集无线网络中的多个无线接入网RAN片中的相应RAN片的场景信息，其中，所述场景信息用于确定至少以下信息：RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求；
由第一管理装置，至少基于RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求确定频谱资源在所述多个RAN片间的编排或重编排方案，其中频谱资源在所述多个RAN片间的编排或重编排方案包括要为所述多个RAN片中的至少一个RAN片分配的频谱资源的第一特性以及数量。
(15)如(14)所述的方法，所述系统进一步包括第二管理装置，
所述方法进一步包括由第二管理装置基于所述场景信息确定表示RAN片能够与其他RAN片共享频谱资源的程度的片间共享因子，并将所确定的片间共享因子发送给第一管理装置以供第一管理装置确定频谱资源在所述多个RAN片间的编排或重编排方案。
(16)如(15)所述的方法，其中由第一管理装置确定频谱资源在所述多个RAN片之间的编排或重编排方案，使得满足以下项中的一个或多个：
在对频谱资源进行编排中，使得允许更高频谱资源共享程度的RAN片的频谱资源需求被更高程度地满足；和
在对频谱资源进行重编排中，使得已分配给已有RAN片的频谱被重新分配给其他RAN片的数量尽可能地少。
(17)如(14)或(15)所述的方法，其中所述场景信息还用于确定RAN片内干扰关 系，并且所述方法进一步包括由第一管理装置进行以下操作：
至少基于RAN片内干扰关系以及要为所述多个RAN片中的至少一个RAN片分配的频谱资源的数量来确定所述多个RAN片中的至少一个RAN片的片最大容量，和
向所述至少一个片内管理器以及所述无线网络中的记录网络片负载变化的实体发送所确定的至少一个RAN片的片最大容量。
(18)如(17)所述的方法，其中
响应于RAN片的负载超过所确定的该RAN片的片最大容量，或者响应于所述无线网络中产生新的RAN片，由第一管理装置对频谱资源进行重编排。
(19)如(14)或(15)所述的方法，其中所述方法进一步包括：
由所述至少一个片内管理器至少基于要为所述多个RAN片中的相应RAN片分配的频谱资源的第一特性和/或数量来确定频谱资源在所述相应RAN片内的分配或重分配方案，其中频谱资源在一个RAN片内的分配或重分配方案包括要为该RAN片中的至少一个基站分配的频谱资源的第二特性以及数量。
(20)一种存储有可执行指令的非暂时性计算机可读存储介质，所述可执行指令当被执行时实现如(14)-(19)中任一项所述的方法。

Claims (20)

  1. 一种用于无线通信的系统，包括：
    一个或多个片内管理器，所述一个或多个片内管理器中的至少一个被配置为收集无线网络中的多个无线接入网RAN片中的相应RAN片的场景信息，其中，所述场景信息用于确定至少以下信息：RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求；
    第一管理装置，被配置为至少基于所述场景信息确定频谱资源在所述多个RAN片间的编排或重编排方案，其中频谱资源在所述多个RAN片间的编排或重编排方案包括要为所述多个RAN片中的至少一个RAN片分配的频谱资源的第一特性以及数量。
  2. 如权利要求1所述的系统，其中
    所述场景信息至少指示以下项中的一个或多个：基站位置、基站发射功率、基站的频谱资源需求和通信服务需求。
  3. 如权利要求1或2所述的系统，其中
    所述系统还包括第二管理装置，被配置为基于所述场景信息确定表示RAN片能够与其他RAN片共享频谱资源的程度的片间共享因子，并将所确定的片间共享因子发送给第一管理装置以供第一管理装置确定频谱资源在所述多个RAN片间的编排或重编排方案。
  4. 如权利要求3所述的系统，其中确定片间共享因子包括：
    基于由所述场景信息指示的通信服务需求确定所述多个RAN片中的至少一个RAN片的第一共享因子，
    基于RAN片间干扰关系确定所述多个RAN片中的任意两个RAN片之间的第二共享因子；和
    对于所述多个RAN片中的任意两个RAN片，基于第一共享因子和第二共享因子之间的最小值来确定该两个RAN片之间的片间共享因子。
  5. 如权利要求1或2所述的系统，其中
    第一管理装置确定频谱资源在所述多个RAN片之间的编排或重编排方案，使得满足以下项中的一个或多个：
    在对频谱资源进行编排中，使得允许更高频谱资源共享程度的RAN片的频谱资源需求被更高程度地满足；和
    在对频谱资源进行重编排中，使得已分配给已有RAN片的频谱被重新分配给其他RAN片的数量尽可能地少。
  6. 如权利要求1或2所述的系统，其中
    频谱资源的第一特性至少指示包括以下项的频谱资源类型：未分配给RAN片的频谱资源、已分配给RAN片但尚未被该RAN片使用的频谱资源和能够与已分配给RAN片的频谱资源重叠的频谱资源，并且
    第一管理装置在确定频谱资源在所述多个RAN片之间的重编排方案中，按照如下顺序分配频谱资源：未分配给RAN片的频谱资源、已分配给RAN片但尚未被该RAN片使用的频谱资源和能够与已分配给RAN片的频谱资源重叠的频谱资源。
  7. 如权利要求1或2所述的系统，其中
    所述场景信息还指示RAN片内干扰关系，并且
    第一管理装置至少基于RAN片内干扰关系以及要为所述多个RAN片中的至少一个RAN片分配的频谱资源的数量来确定所述多个RAN片中的至少一个RAN片的片最大容量。
  8. 如权利要求7所述的系统，其中
    响应于RAN片的负载超过所确定的该RAN片的片最大容量，或者响应于所述无线网络中产生新的RAN片，第一管理装置对频谱资源进行重编排。
  9. 如权利要求7所述的系统，其中
    第一管理装置向所述至少一个片内管理器以及所述无线网络中的记录网络片负载变化的实体发送所确定的至少一个RAN片的片最大容量。
  10. 如权利要求9所述的系统，其中
    记录网络片负载变化的实体包括实现以下功能的实体中的一个或多个：统一数据仓库UDR/统一数据管理UDM、操作管理和维护OAM、网络切片配额NSQ或网络切片选择功能NSSF。
  11. 如权利要求1或2所述的系统，其中
    所述至少一个片内管理器进一步被配置为至少基于要为所述多个RAN片中的相应RAN片分配的频谱资源的第一特性和/或数量来确定频谱资源在所述相应RAN片内的分配或重分配方案，其中频谱资源在一个RAN片内的分配或重分配方案包括要为该RAN片中的至少一个基站分配的频谱资源的第二特性以及数量。
  12. 如权利要求11所述的系统，其中
    所述至少一个片内管理器确定频谱资源在RAN片内的重分配方案，使得已分配给任意基站的频谱被重新分配给其他基站的次数尽可能地少，和/或
    频谱资源的第二特性至少指示包括以下项的频谱资源类型：未分配给基站的频谱资源、已分配给基站但尚未被该基站使用的频谱资源和能够与已分配给基站的频谱资源重叠的频谱资源，并且所述至少一个片内管理器在确定频谱资源在RAN片内的重分配方案时，按照如下顺序分配频谱资源：未分配给基站的频谱资源、已分配给基站但尚未被该基站使用的频谱资源和能够与已分配给基站的频谱资源重叠的频谱资源。
  13. 如权利要求3所述的系统，其中
    所述系统还包括第三管理装置，被配置为从所述至少一个片内管理器接收所述场景信息，并将原始接收的场景信息或经处理的场景信息发送给第二管理装置。
  14. 一种用于无线通信的系统的方法，所述系统包括一个或多个片内管理器和第一管理装置，所述方法包括
    由所述一个或多个片内管理器中的至少一个片内管理器收集无线网络中的多个无线接入网RAN片中的相应RAN片的场景信息，其中，所述场景信息用于确定至少以下信息：RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求；
    由第一管理装置，至少基于RAN片间干扰关系、RAN片优先级以及RAN片频谱资源需求确定频谱资源在所述多个RAN片间的编排或重编排方案，其中频谱资源在所述 多个RAN片间的编排或重编排方案包括要为所述多个RAN片中的至少一个RAN片分配的频谱资源的第一特性以及数量。
  15. 如权利要求14所述的方法，所述系统进一步包括第二管理装置，
    所述方法进一步包括由第二管理装置基于所述场景信息确定表示RAN片能够与其他RAN片共享频谱资源的程度的片间共享因子，并将所确定的片间共享因子发送给第一管理装置以供第一管理装置确定频谱资源在所述多个RAN片间的编排或重编排方案。
  16. 如权利要求15所述的方法，其中由第一管理装置确定频谱资源在所述多个RAN片之间的编排或重编排方案，使得满足以下项中的一个或多个：
    在对频谱资源进行编排中，使得允许更高频谱资源共享程度的RAN片的频谱资源需求被更高程度地满足；和
    在对频谱资源进行重编排中，使得已分配给已有RAN片的频谱被重新分配给其他RAN片的数量尽可能地少。
  17. 如权利要求14或15所述的方法，其中所述场景信息还用于确定RAN片内干扰关系，并且所述方法进一步包括由第一管理装置进行以下操作：
    至少基于RAN片内干扰关系以及要为所述多个RAN片中的至少一个RAN片分配的频谱资源的数量来确定所述多个RAN片中的至少一个RAN片的片最大容量，和
    向所述至少一个片内管理器以及所述无线网络中的记录网络片负载变化的实体发送所确定的至少一个RAN片的片最大容量。
  18. 如权利要求17所述的方法，其中
    响应于RAN片的负载超过所确定的该RAN片的片最大容量，或者响应于所述无线网络中产生新的RAN片，由第一管理装置对频谱资源进行重编排。
  19. 如权利要求14或15所述的方法，其中所述方法进一步包括：
    由所述至少一个片内管理器至少基于要为所述多个RAN片中的相应RAN片分配的频谱资源的第一特性和/或数量来确定频谱资源在所述相应RAN片内的分配或重分配方案，其中频谱资源在一个RAN片内的分配或重分配方案包括要为该RAN片中的至少 一个基站分配的频谱资源的第二特性以及数量。
  20. 一种存储有可执行指令的非暂时性计算机可读存储介质，所述可执行指令当被执行时实现如权利要求14-19中任一项所述的方法。
PCT/CN2021/130198 2020-11-13 2021-11-12 用于无线通信的系统、方法和存储介质 WO2022100676A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202180074943.7A CN116602052A (zh) 2020-11-13 2021-11-12 用于无线通信的系统、方法和存储介质
US18/033,566 US20230397238A1 (en) 2020-11-13 2021-11-12 System and method for wireless communication and storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011271371.5A CN114501637A (zh) 2020-11-13 2020-11-13 用于无线通信的系统、方法和存储介质
CN202011271371.5 2020-11-13

Publications (1)

Publication Number Publication Date
WO2022100676A1 true WO2022100676A1 (zh) 2022-05-19

Family

ID=81490686

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/130198 WO2022100676A1 (zh) 2020-11-13 2021-11-12 用于无线通信的系统、方法和存储介质

Country Status (3)

Country Link
US (1) US20230397238A1 (zh)
CN (2) CN114501637A (zh)
WO (1) WO2022100676A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115499882A (zh) * 2022-11-16 2022-12-20 之江实验室 边缘节点频谱与计算资源联合分配方法、装置和存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108322937A (zh) * 2017-01-18 2018-07-24 上海诺基亚贝尔股份有限公司 无线接入网中用于网络切片的资源分配方法和编排器
US20200015154A1 (en) * 2017-03-17 2020-01-09 Huawei Technologies Co., Ltd. Techniques for radio access network (ran) configuration in slice-based networks
US20200137678A1 (en) * 2017-03-21 2020-04-30 Ntt Docomo, Inc. Slice management device and slice management method
US20200170052A1 (en) * 2018-11-27 2020-05-28 Verizon Patent And Licensing Inc. Systems and methods for ran slicing in a wireless access network
CN111434141A (zh) * 2017-10-24 2020-07-17 诺基亚通信公司 云无线电接入网中的资源管理
US20200351756A1 (en) * 2019-05-01 2020-11-05 Verizon Patent And Licensing Inc. Method and system for application-based access control using network slicing

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108322937A (zh) * 2017-01-18 2018-07-24 上海诺基亚贝尔股份有限公司 无线接入网中用于网络切片的资源分配方法和编排器
US20200015154A1 (en) * 2017-03-17 2020-01-09 Huawei Technologies Co., Ltd. Techniques for radio access network (ran) configuration in slice-based networks
US20200137678A1 (en) * 2017-03-21 2020-04-30 Ntt Docomo, Inc. Slice management device and slice management method
CN111434141A (zh) * 2017-10-24 2020-07-17 诺基亚通信公司 云无线电接入网中的资源管理
US20200170052A1 (en) * 2018-11-27 2020-05-28 Verizon Patent And Licensing Inc. Systems and methods for ran slicing in a wireless access network
US20200351756A1 (en) * 2019-05-01 2020-11-05 Verizon Patent And Licensing Inc. Method and system for application-based access control using network slicing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
CMCC: "Discussion on support of RAN slicing", 3GPP DRAFT; R2-2007421, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG2, no. electronic; 20200817 - 20200828, 7 August 2020 (2020-08-07), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France , XP051912168 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115499882A (zh) * 2022-11-16 2022-12-20 之江实验室 边缘节点频谱与计算资源联合分配方法、装置和存储介质

Also Published As

Publication number Publication date
CN114501637A (zh) 2022-05-13
CN116602052A (zh) 2023-08-15
US20230397238A1 (en) 2023-12-07

Similar Documents

Publication Publication Date Title
WO2020001171A1 (zh) 一种网络切片的资源分配方法及装置
CN105407486B (zh) 一种网络扩容的方法及装置
WO2021218274A1 (zh) 一种通信方法、装置及系统
WO2017080517A1 (en) Systems and methods for network slice management
CA3112926A1 (en) Slice information processing method and apparatus
US20170126583A1 (en) Method and electronic device for bandwidth allocation based on online media services
US9215619B2 (en) Method and system for application-aware load balancing
US12099884B2 (en) Scheduling method for selecting optimal cluster within cluster of distributed collaboration type
US20210036920A1 (en) Configuring network slices
US11088924B2 (en) Network management method, device, and system
US11929938B2 (en) Evaluating overall network resource congestion before scaling a network slice
JPWO2018034321A1 (ja) スライス管理システムおよびスライス管理方法
WO2017075967A1 (zh) 在线媒体服务的带宽分配方法及系统
EP3857970A1 (en) Network slice management
CN103414657A (zh) 一种跨数据中心的资源调度方法、超级调度中心和系统
US12035331B2 (en) LTE resource allocation controller
WO2022100676A1 (zh) 用于无线通信的系统、方法和存储介质
WO2020177255A1 (zh) 无线接入网的资源分配方法及装置
WO2021159314A1 (zh) 一种业务处理方法、装置以及系统
US20240031427A1 (en) Cloud-network integration oriented multi-access edge computing architecture
Pratap et al. Bandwidth-constrained task throughput maximization in IoT-enabled 5G networks
US10764904B2 (en) Channel allocation
WO2020249080A1 (zh) 一种虚拟网络功能vnf部署方法及装置
WO2023045931A1 (zh) 一种网络性能异常分析方法、装置及可读存储介质
Liu et al. A network slicing strategy for telemedicine based on classification

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21891196

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 202180074943.7

Country of ref document: CN

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21891196

Country of ref document: EP

Kind code of ref document: A1