A method and system for resource allocation between network slices based on resource punishment

Abstract

This invention discloses a method and system for resource allocation between network slices based on resource penalties, relating to the field of slice resource allocation technology. The method includes: receiving slice data of a network slice, wherein the slice data includes the total number of allocated physical resource blocks in the network slice and the service data corresponding to the network slice; calculating the throughput of the service based on the service signal-to-noise ratio and the number of occupied physical resource blocks; calculating the service performance index based on the service throughput and average latency; calculating a resource weighting amount based on the service congestion rate and a pre-determined physical resource block occupancy rate; calculating a comprehensive index based on the service performance index and the resource weighting amount; adjusting the resource allocation priority based on the comprehensive index and a preset starvation algorithm; and updating the total number of physical resource blocks in the slice based on the adjusted resource allocation priority to achieve resource allocation of the network slice.

Description

Technical Field

[0001] This invention relates to the field of slice resource allocation technology, specifically a method and system for resource allocation between network slices based on resource penalties. Background Technology

[0002] To simultaneously meet the needs of users in various application scenarios, 5G has proposed network slicing technology. This technology virtualizes the traditional physical network into multiple on-demand customized network slices to serve different business scenarios. Ensuring the normal operation of each network slice requires reasonable resource allocation, which is crucial. To address this, existing technology proposes a scalable and adjustable resource allocation method for network slices, SA-NSRA (patent number 202510534933.7). This method selects high-quality and low-quality channel services and calculates their respective service performance coefficients differently. It also calculates the resource coefficient of a slice based on the amount of resources it occupies and the service quality coefficient based on the service congestion status. Finally, it obtains a comprehensive priority for evaluating the resource allocation of each slice. SA-NSRA can effectively reduce slice congestion rates, but it also has some problems: firstly, the evaluation of priority channel services is relatively simple, which may affect the accuracy of resource allocation; secondly, the coefficients have the same weight, failing to achieve differentiated adjustment. Summary of the Invention

[0003] To address the shortcomings mentioned in the background section, the present invention aims to provide a method and system for resource allocation between network slices based on resource penalties.

[0004] Firstly, the objective of this invention can be achieved through the following technical solution: a method for resource allocation between network slices based on resource penalties, the method comprising the following steps: The network slice data includes the total number of physical resource blocks allocated to the network slice and the service data corresponding to the network slice. The service data includes the service signal-to-noise ratio, the number of physical resource blocks occupied, the service congestion rate, the average throughput generated by the service in the first two time slots, the average latency, the ideal throughput and latency tolerance. The throughput of the service is calculated based on the service signal-to-noise ratio and the number of physical resource blocks occupied; the performance indicators of the service are calculated based on the service throughput and average latency; the resource weighting is calculated based on the service congestion rate and the pre-determined physical resource block occupancy rate; wherein, the physical resource block occupancy rate is calculated based on the number of physical resource blocks occupied and the total number of physical resource blocks allocated to the network slice. A comprehensive index is calculated based on the performance indicators of the business and the weighted amount of resources. The resource allocation priority is adjusted according to the comprehensive index and the preset starvation algorithm. The total number of physical resource blocks of the slice is updated according to the adjusted resource allocation priority to realize the resource allocation of network slices.

[0005] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the slice data of the network slice is as follows: Network slices Network slicing Total number of allocated physical resource blocks ;slice It already contains Business Corresponding to any business The signal-to-noise ratio of the service at the current moment Number of physical resource blocks occupied Business congestion rate Services within the first two time slots at the current moment Average throughput generated Average latency Ideal throughput Timely tolerance .

[0006] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the process of calculating the throughput measurement value of the service based on the service signal-to-noise ratio and the number of occupied physical resource blocks, as follows: For any slice All of its businesses The signal-to-noise ratio is converted to a decimal value. ,in, Represents a power function; Set subcarrier bandwidth One resource block occupies a number of subcarriers ; Calculate any business The bandwidth occupied Based on this, computing services throughput , .

[0007] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: calculating the service performance indicators based on the service throughput measurement value and average latency, wherein the service performance indicators include the service throughput indicator and the service latency indicator, the process of which is as follows: Calculate all slices All businesses in China Mathematical expectation of throughput ; Calculate any business throughput metrics ; Calculate all slices All businesses in China Mathematical expectation of average delay ; Calculate any business latency metrics .

[0008] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the process of calculating the resource weighting amount based on the service congestion rate and the pre-determined physical resource block occupancy rate, as follows: For any slice Calculate its congestion rate ; Set resource ownership weight ; Calculate any slice Physical resource block occupancy ; Calculate all slices Resource weighted amount .

[0009] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the process of calculating the comprehensive index based on the performance indicators of the business and the resource weighting, as follows: Calculate all slices All businesses in China business metrics Based on this, calculate any slice business metrics ; Calculate slices Comprehensive indicators Calculate slices Comprehensive correction index ,in, This represents an exponential function with the natural constant as its base.

[0010] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the process of adjusting the resource allocation priority based on comprehensive indicators and a preset starvation algorithm, and updating the total number of physical resource blocks of the slice according to the adjusted resource allocation priority, as follows: Set low weight for starvation Starvation and high weight ; Calculate all slices Allocation priority ; For those that meet the conditions And the slices for which resource allocation was not implemented in the previous round Adjust its priority For those that meet the conditions And the slices for which resource allocation was not implemented in the previous round Adjust its priority If the previous round of slicing If they did not go hungry, ; Will As the final priority for current resource allocation, the unallocated resources are allocated using a proportionally fair PF algorithm, and the total number of physical resource blocks for all slices is updated.

[0011] Secondly, in order to achieve the above objectives, this invention discloses a resource allocation system for network slices based on resource penalties, comprising: The data receiving module is used to receive the slice data of the network slice, wherein the slice data of the network slice includes the total number of physical resource blocks allocated to the network slice and the service data corresponding to the network slice; the service data includes the service signal-to-noise ratio, the number of physical resource blocks occupied, the service congestion rate, the average throughput generated by the service in the first two time slots, the average latency, the ideal throughput and latency tolerance. The data processing module is used to calculate the throughput of a service based on the service signal-to-noise ratio and the number of physical resource blocks occupied; to calculate the service performance indicators based on the service throughput and average latency; and to calculate the resource weighting based on the service congestion rate and the pre-determined physical resource block occupancy rate. The physical resource block occupancy rate is calculated based on the number of physical resource blocks occupied and the total number of physical resource blocks allocated to the network slice. The resource allocation module is used to calculate a comprehensive index based on the performance indicators of the service and the weighted amount of resources; adjust the resource allocation priority according to the comprehensive index and the preset starvation algorithm; and update the total number of physical resource blocks of the slice according to the adjusted resource allocation priority to realize the resource allocation of network slices.

[0012] In another aspect of the present invention, in order to achieve the above-mentioned objective, a terminal device is disclosed, including a memory, a processor, and a computer program stored in the memory and capable of running on the processor. The memory stores the computer program capable of running on the processor, and when the processor loads and executes the computer program, it employs a resource allocation method for network slices based on resource penalties as described above.

[0013] In another aspect of the present invention, in order to achieve the above objective, a computer-readable storage medium is disclosed, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is loaded and executed by a processor, a resource allocation method for network slices based on resource penalty as described above is employed.

[0014] The beneficial effects of this invention are: This invention can measure the throughput capacity of a service; calculate the throughput and latency metrics of any service and process them into service metrics; calculate resource weighting variables based on service congestion and resource occupancy status; apply punitive adjustments to service metrics using resource weighting variables and obtain preliminary resource allocation priorities; dynamically optimize service priorities based on the previous round of service starvation; allocate resources between slices based on the optimized priorities; ensure that services are always in a favorable slice environment, providing real-time assurance for improved customer experience; and achieve differentiated adjustments to improve the accuracy of resource allocation. Attached Figure Description

[0015] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort. Figure 1 This is a schematic diagram of the method flow of the present invention; Figure 2 This is a schematic diagram of the workflow of the present invention; Figure 3 This is a schematic diagram comparing the RB allocation of the random TTI of this invention with other algorithms; Figure 4 This is a schematic diagram comparing the average RB allocation of this invention with other algorithms; Figure 5 This is a schematic diagram of the system structure of the present invention. Detailed Implementation

[0016] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0017] Example 1: like Figure 1 As shown, a resource allocation method among network slices based on resource penalties includes the following steps: S101: Receive network slice data, wherein the network slice data includes the total number of physical resource blocks allocated to the network slice and the service data corresponding to the network slice; the service data includes service signal-to-noise ratio, number of physical resource blocks occupied, service congestion rate, average throughput generated by the service in the first two time slots, average latency, ideal throughput and latency tolerance. The slice data of the network slice is as follows: include Network slices Network slicing Total number of allocated physical resource blocks ;slice It already contains Business Corresponding to any business The signal-to-noise ratio of the service at the current moment Number of physical resource blocks occupied Business congestion rate Services within the first two time slots at the current moment Average delay generated ; S102: The throughput of the service is calculated based on the service signal-to-noise ratio and the number of physical resource blocks occupied; the performance indicators of the service are calculated based on the throughput and average latency; the resource weighting is calculated based on the service congestion rate and the pre-determined physical resource block occupancy rate; wherein, the physical resource block occupancy rate is calculated based on the number of physical resource blocks occupied and the total number of physical resource blocks allocated to the network slice. The process of calculating the throughput of a service based on the service signal-to-noise ratio and the number of physical resource blocks occupied is as follows: For any slice All of its businesses The signal-to-noise ratio is converted to a decimal value. ,in, Represents a power function; Set subcarrier bandwidth One resource block occupies a number of subcarriers ; Calculate any business The bandwidth occupied Based on this, computing services throughput , ; The service performance metrics are calculated based on the service throughput and average latency. These metrics include the service throughput and latency metrics, and the process is as follows: Calculate all slices All businesses in China Mathematical expectation of throughput ; Calculate any business throughput metrics ; Calculate all slices All businesses in China Mathematical expectation of average delay ; Calculate any business latency metrics ; The process of calculating the resource weighting based on the business congestion rate and the pre-determined physical resource block occupancy rate is as follows: For any slice Calculate its congestion rate ; Set resource ownership weight ; Calculate any slice Physical resource block occupancy ; Calculate all slices resource variables ; S103: Calculate a comprehensive index based on the performance indicators of the service and the weighted amount of resources; adjust the resource allocation priority according to the comprehensive index and the preset starvation algorithm; update the total number of physical resource blocks of the slice according to the adjusted resource allocation priority to realize the resource allocation of the network slice.

[0018] The process of calculating the comprehensive index based on business performance metrics and resource weighting is as follows: Calculate all slices All businesses in China business metrics Based on this, calculate any slice business metrics ; Calculate slices Comprehensive indicators Calculate slices Comprehensive correction index ,in, This represents an exponential function with the natural constant as its base.

[0019] The process of adjusting resource allocation priorities based on comprehensive indicators and a preset starvation algorithm, and then updating the total number of physical resource blocks in a slice based on the adjusted resource allocation priorities, is as follows: Set low weight for starvation Starvation and high weight ; Calculate all slices Allocation priority ; For those that meet the conditions And the slices for which resource allocation was not implemented in the previous round Adjust its priority For those that meet the conditions And the slices for which resource allocation was not implemented in the previous round Adjust its priority If the previous round of slicing If they did not go hungry, ; Will As the final priority for current resource allocation, the unallocated resources are allocated using a proportionally fair PF algorithm, and the total number of physical resource blocks for all slices is updated.

[0020] Below, m The present invention will be specifically described using examples, and the network slicing of 5G is shown in Tables 1-3: Table 1. Services stored in each 5G network slice 1 Table 2. Services Existing in Each 5G Network Slice 2 Table 3. Services Existing in Each 5G Network Slice 3 The basic data is shown in Table 4: Table 4 Basic Data This example describes a 5G network slicing access control method based on resource penalties, including the following steps: service throughput capacity calculation, service performance index evaluation, resource weighting statistics, comprehensive index synthesis, and resource allocation based on starvation adjustment. Step 1: Calculate business throughput capacity; Step 1-1: For any slice All of its businesses The signal-to-noise ratio is converted to a decimal value. ; Step 1-2: Calculate arbitrary business The bandwidth occupied Based on this, computing services throughput ; Step 2: Business performance indicator evaluation; Step 2-1: Calculate all slices All businesses in China Mathematical expectation of throughput ; Calculate any business throughput metrics ; Step 2-2: Calculate all slices All businesses in China Mathematical expectation of average delay ; Calculate any business latency metrics ; Step 3: Resource weighting statistics; Step 3-1: For any slice Calculate its congestion rate ; Step 3-2: Calculate any slice Physical resource block occupancy ; Calculate all slices resource variables ; Step 4: Synthesis of comprehensive indicators; Step 4-1: Calculate all slices All businesses in China business metrics Based on this, calculate any slice business metrics ; Step 4-2: Calculate slices Comprehensive indicators Calculate slices Comprehensive correction index ; Step 5: Resource allocation adjusted based on starvation; Step 5-1: Calculate all slices Allocation priority ; Step 5-2: For those that meet the conditions And the slices for which resource allocation was not implemented in the previous round Adjust its priority There is no condition that is met. And the slices for which resource allocation was not implemented in the previous round If the previous round of slicing If they did not go hungry, Adjusted priority of all premium videos ; Step 5-3: The system will As the final priority for current resource allocation, the unallocated resources are allocated using a proportionally fair PF algorithm, and the total number of physical resource blocks for all slices is updated. Simulation experiment: The RP-NSRA resource allocation method for 5G network slices based on resource penalty of the present invention was simulated on a MATLAB platform with the author's previous SA-NSRA algorithm based on scalable adjustment. The network and service configurations were performed according to the above table. The RB allocation in the random TTI and the average RB allocation are respectively shown in the appendix. Figures 3 to 4 As shown.

[0021] like Figure 3 As shown, in the RB allocation process during random TTI, the SA-NSRA algorithm based on scalable adjustment generally allocates fewer RB resources than the RP-NSRA algorithm in this paper. This is because SA-NSRA dynamically allocates resources by adjusting numerous factors such as signal-to-noise ratio, throughput, latency, resource utilization, and service congestion. Moreover, this adjustment is scalable; the number of factors considered can increase, but the factors are equally important, without any hierarchy. This can lead to situations in eMBB slicing scenarios where excessive resource utilization results in increased latency or exacerbated congestion, i.e., an imbalance between slices. RP-NSRA, on the other hand, can flexibly set the weights of resource utilization and service status, thus achieving a more reasonable resource allocation. Furthermore, the two differ in their starvation adjustment. The former simply increases the allocation priority of starved slices, while the latter further considers service status. When service deteriorates, a deeper adjustment is made to achieve a balance in the allocation between slices and services. In terms of results, the RP-NSRA algorithm tends to favor uRLLC or mMTC slices, and can acquire more RB resources even when the eMBB slice resource consumption is not too high.

[0022] like Figure 4 As shown, the RB allocation of the two schemes is not significantly different after averaging. Similarly, the SA-NSRA algorithm allocates more RBs to eMBB slices, while the RP-NSRA algorithm allocates more RBs to uRLLC or mMTC slices, taking into account eMBB slices. However, since the target factors considered by both algorithms basically cover all service indicators, such as throughput, latency, resource utilization, and service congestion, the number of RBs obtained by the slices is not significantly different, provided that the deviation of the set adjustment factors is not large.

[0023] Specifically, the present invention will be further illustrated below through embodiments: The difference between the two algorithms of this invention and the prior art is that the SA-NSRA algorithm focuses more on the adjustable and flexible nature of the algorithm parameters, and has a wider range of adaptability; the RP algorithm of this invention only compares resource consumption and business type, and the simulation gives the corresponding comparison results of the two.

[0024] Example 2: To achieve the above objectives, based on Example 1, this invention discloses a resource allocation system for network slices based on resource penalties, comprising: The data receiving module 11 is used to receive the slice data of the network slice, wherein the slice data of the network slice includes the total number of physical resource blocks allocated to the network slice and the service data corresponding to the network slice; the service data includes the service signal-to-noise ratio, the number of physical resource blocks occupied, the service congestion rate, the average throughput generated by the service in the first two time slots, the average latency, the ideal throughput and latency tolerance. The data processing module 12 is used to calculate the throughput of a service based on the service signal-to-noise ratio and the number of physical resource blocks occupied; to calculate the performance indicators of a service based on the throughput and average latency; and to calculate the resource weighting based on the service congestion rate and the pre-determined physical resource block occupancy rate. The physical resource block occupancy rate is calculated based on the number of physical resource blocks occupied and the total number of physical resource blocks allocated to the network slice. The resource allocation module 13 is used to calculate a comprehensive index based on the performance indicators of the service and the weighted amount of resources; adjust the resource allocation priority according to the comprehensive index and the preset starvation algorithm; and update the total number of physical resource blocks of the slice according to the adjusted resource allocation priority to realize the resource allocation of the network slice.

[0025] Based on the same inventive concept, this invention also provides a computer device, comprising: one or more processors, and a memory for storing one or more computer programs; the programs include program instructions, and the processor executes the program instructions stored in the memory. The processor may be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. It is the computing and control core of the terminal, used to implement one or more instructions, specifically for loading and executing one or more instructions stored in a computer storage medium to implement the above-described method.

[0026] It should be further explained that, based on the same inventive concept, the present invention also provides a computer storage medium storing a computer program, which, when executed by a processor, performs the above-described method. This storage medium can be any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In the present invention, the computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0027] In the description of this specification, references to terms such as "an embodiment," "example," "specific example," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of this disclosure. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples.

[0028] The foregoing has shown and described the basic principles, main features, and advantages of this disclosure. Those skilled in the art should understand that this disclosure is not limited to the above embodiments. The embodiments and descriptions in the specification are merely illustrative of the principles of this disclosure. Various changes and modifications can be made to this disclosure without departing from its spirit and scope, and all such changes and modifications fall within the scope of this disclosure as claimed.

Claims

1. A method for resource allocation among network slices based on resource penalties, characterized in that, The method includes the following steps: The network slice data includes the total number of physical resource blocks allocated to the network slice and the service data corresponding to the network slice. The service data includes the service signal-to-noise ratio, the number of physical resource blocks occupied, the service congestion rate, the average throughput generated by the service in the first two time slots, the average latency, the ideal throughput and latency tolerance. The throughput of the service is calculated based on the service signal-to-noise ratio and the number of physical resource blocks occupied; the performance indicators of the service are calculated based on the service throughput and average latency; the resource weighting is calculated based on the service congestion rate and the pre-determined physical resource block occupancy rate; wherein, the physical resource block occupancy rate is calculated based on the number of physical resource blocks occupied and the total number of physical resource blocks allocated to the network slice. A comprehensive index is calculated based on the performance indicators of the business and the weighted amount of resources. The resource allocation priority is adjusted according to the comprehensive index and the preset starvation algorithm. The total number of physical resource blocks of the slice is updated according to the adjusted resource allocation priority to realize the resource allocation of network slices.

2. The resource allocation method among network slices based on resource penalty according to claim 1, characterized in that, The slice data of the network slice is as follows: Network slices Network slicing Total number of allocated physical resource blocks ; slice It already contains Business Corresponding to any business The signal-to-noise ratio of the service at the current moment Number of physical resource blocks occupied Business congestion rate ; Services in the first two time slots at the current moment Average throughput generated Average latency Ideal throughput Timely tolerance .

3. The resource allocation method among network slices based on resource penalty according to claim 1, characterized in that, The process of calculating the throughput value of the service based on the service signal-to-noise ratio and the number of physical resource blocks occupied is as follows: For any slice All of its businesses The signal-to-noise ratio is converted to a decimal value. ,in, Represents a power function; Set subcarrier bandwidth One resource block occupies a number of subcarriers ; Calculate any business The bandwidth occupied Based on this, computing services throughput , .

4. The resource allocation method among network slices based on resource penalty according to claim 1, characterized in that, The performance metrics of the service are calculated based on the throughput and average latency, and these performance metrics include throughput and latency metrics. The process is as follows: Calculate all slices All businesses in China Mathematical expectation of throughput ; Calculate any business throughput metrics ; Calculate all slices All businesses in China Mathematical expectation of average delay ; Calculate any business latency metrics .

5. The resource allocation method among network slices based on resource penalty according to claim 1, characterized in that, The process of calculating the resource weighting based on the service congestion rate and the pre-determined physical resource block occupancy rate is as follows: For any slice Calculate its congestion rate ; Set resource ownership weight ; Calculate any slice Physical resource block occupancy ; Calculate all slices Resource weighted amount .

6. The resource allocation method among network slices based on resource penalty according to claim 1, characterized in that, The process of calculating the comprehensive index based on business performance indicators and resource weighting is as follows: Calculate all slices All businesses in China business metrics Based on this, calculate any slice business metrics ; Calculate slices Comprehensive indicators Calculate slices Comprehensive correction index ,in, This represents an exponential function with the natural constant as its base.

7. A method for resource allocation between network slices based on resource penalties according to claim 1, characterized in that, The process of adjusting resource allocation priority based on comprehensive indicators and a preset starvation algorithm, and updating the total number of physical resource blocks in the slice based on the adjusted resource allocation priority, is as follows: Set low weight for starvation Starvation and high weight ; Calculate all slices Allocation priority ; For those that meet the conditions And the slices for which resource allocation was not implemented in the previous round Adjust its priority For those that meet the conditions And the slices for which resource allocation was not implemented in the previous round Adjust its priority If the previous round of slicing If they did not go hungry, ; Will As the final priority for current resource allocation, the unallocated resources are allocated using a proportionally fair PF algorithm, and the total number of physical resource blocks for all slices is updated.

8. A resource allocation system for network slices based on resource penalties, employing the resource allocation method for network slices based on resource penalties as described in any one of claims 1 to 7, characterized in that, include: The data receiving module is used to receive the slice data of the network slice, wherein the slice data of the network slice includes the total number of physical resource blocks allocated to the network slice and the service data corresponding to the network slice; the service data includes the service signal-to-noise ratio, the number of physical resource blocks occupied, the service congestion rate, the average throughput generated by the service in the first two time slots, the average latency, the ideal throughput and latency tolerance. The data processing module is used to calculate the throughput of a service based on the service signal-to-noise ratio and the number of physical resource blocks occupied; to calculate the service performance indicators based on the service throughput and average latency; and to calculate the resource weighting based on the service congestion rate and the pre-determined physical resource block occupancy rate. The physical resource block occupancy rate is calculated based on the number of physical resource blocks occupied and the total number of physical resource blocks allocated to the network slice. The resource allocation module is used to calculate a comprehensive index based on the performance indicators of the service and the weighted amount of resources; adjust the resource allocation priority according to the comprehensive index and the preset starvation algorithm; and update the total number of physical resource blocks of the slice according to the adjusted resource allocation priority to realize the resource allocation of network slices.

9. A terminal device, comprising a memory, a processor, and a computer program stored in the memory and capable of running on the processor, characterized in that, The memory stores a computer program that can run on the processor. When the processor loads and executes the computer program, it employs a resource allocation method for network slices based on resource penalties, as described in any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is loaded and executed by the processor, it employs a resource allocation method for network slices based on resource penalties, as described in any one of claims 1 to 7.

Images