A method for 5G network inter-slice resource allocation

Abstract

The application provides a 5G network slice resource allocation method, which comprises the following steps: first, based on the number of occupied physical resource blocks and the bandwidth of a single resource block of a service, the bandwidth occupied by each service in each network slice is calculated; then, the theoretical capacity of each service is calculated according to the Shannon sampling theorem, and the actual capacity of the service at the current moment is calculated based on the service congestion rate; based on the number of idle resource blocks of each slice and the mathematical expectation value of the capacity of a single resource block, the idle bandwidth capacity of each slice is calculated; based on the service busy ratio and the idle bandwidth capacity of each slice, the controllable bandwidth capacity of each slice is calculated; finally, the controllable bandwidth capacity of each slice is normalized as a slice resource allocation priority index, and resource allocation is performed.

Description

Technical Field

[0001] This invention belongs to the field of 5G communication technology, and in particular relates to a method for resource allocation among 5G network slices. Background Technology

[0002] Network slicing, a key technology in 5G communication, can meet the service requirements of 5G networks, including high speed, large capacity, and ultra-low latency, and can provide differentiated and customized services to customers. This involves strategies for resource allocation among 5G network slices. By allocating different resources to different types of data streams, higher network efficiency can be achieved while meeting the needs of different services.

[0003] Existing invention patent CN119421176A discloses a network slice access control method based on mixed service types, relating to the field of network slicing technology. It aims to address the problem that existing network slice access control methods do not comprehensively consider slice network quality. The method includes: calculating a mixed service adjustment factor based on the average waiting delay of all slices; evaluating the remaining link capacity based on the slice's remaining bandwidth and signal-to-noise ratio; calculating service quality parameters for any slice based on a reference signal received power lower limit; calculating service delay parameters and service throughput parameters for any slice to determine a qualified set containing the slice; and selecting a slice as the target slice for access control based on the comprehensive evaluation value of the slices in the qualified set.

[0004] Existing resource allocation methods among network slices have several problems. First, the slice labeling type is fixed, making it impossible to account for mixed-type services. Second, signal quality level indicators are not refined according to specific service types and level values. Therefore, resource allocation requires evaluating the service type of each network slice, analyzing the service quality status, and dynamically controlling resource allocation among slices based on the controllable bandwidth capabilities of each slice by analyzing the service load ratio and idle bandwidth capacity of each slice. Summary of the Invention

[0005] Each network slice contains a suitable amount of services. Given the limited resources of 5G network slices, a differentiated strategy is needed to more intuitively allocate resources between slices. Therefore, it is necessary to evaluate the service types of slices, analyze the service quality status, calculate Shannon sampling based on the number of idle resources, and finally calculate the comprehensive allocation priority to implement dynamic allocation control of resources between slices. This ensures that the resource needs of different network slices are met to satisfy the performance requirements of different services.

[0006] To solve the above-mentioned technical problems, the technical solution provided by the present invention is: a method for resource allocation between 5G network slices, comprising the following steps:

[0007] S1. Based on the number of physical resource blocks occupied by the service and the bandwidth of a single resource block, calculate the bandwidth occupied by each service in each network slice.

[0008] S2. Calculate the theoretical capacity of each service based on Shannon's sampling theorem, and calculate the actual capacity of the service at the current moment based on the service congestion rate.

[0009] S3. Calculate the idle bandwidth capacity of each slice based on the expected value of the number of idle resource blocks and the single resource block capacity of each slice.

[0010] S4. Calculate the controllable bandwidth capacity of each slice based on the service busy ratio and idle bandwidth capacity of each slice.

[0011] S5. Normalize the controllable bandwidth capability of each slice and use it as a priority indicator for slice resource allocation to perform resource allocation.

[0012] Specifically, in S1, the signal-to-noise ratio of all services in each slice is first converted to a decimal value; then, based on the set subcarrier bandwidth and the number of subcarriers occupied by a resource block, the bandwidth of a single resource block is calculated, and the bandwidth occupied by each service is calculated by multiplying the bandwidth of the single resource block by the number of physical resource blocks occupied by each service.

[0013] Specifically, in S2, the actual capacity of a service at the current moment is calculated by multiplying the theoretical capacity of each service by 1 and subtracting the service congestion rate.

[0014] Specifically, the number of free resource blocks in each slice of S3 is obtained by subtracting the total number of physical resource blocks occupied by each service from the total number of physical resource blocks allocated to the network slice.

[0015] Specifically, in S3, the single resource block capacity of each service is first calculated based on the current actual capacity of each service and the number of resource blocks occupied by the service. Then, the average value of the single resource block capacity of all services on each slice is calculated as the mathematical expectation value of the single resource block capacity of that slice.

[0016] Specifically, the idle bandwidth capacity of each slice in S3 is calculated by multiplying the number of idle resource blocks in each slice at the current moment by the expected value of the single resource block capacity of that slice.

[0017] Specifically, in S4, for any slice, the slice's busy ratio is 1 minus the ratio of the number of idle resource blocks in that slice to the total number of physical resource blocks allocated to that slice.

[0018] Specifically, the controllable bandwidth capacity of each slice is obtained by multiplying the slice's busy ratio by the slice's idle bandwidth capacity calculated in S3.

[0019] Specifically, in S5, the controllable bandwidth capability of all slices is normalized to the interval [0,1] and used as a preliminary priority indicator for slice resource allocation.

[0020] Specifically, each time resources are allocated to a slice, the priority index of the slices that were not allocated resources in the previous round is dynamically adjusted. The priority index of these slices is multiplied by a preset adjustment coefficient in the range of (1,2], and the unallocated resources are allocated using a proportionally fair PF algorithm. The total number of physical resource blocks of all slices is then updated.

[0021] The beneficial effects of this invention are: it can calculate the service bandwidth based on the number of physical resource blocks occupied by the service; it can estimate the performance of all services based on the Shannon sampling theorem; it can calculate the single resource block capacity under differentiated environments and estimate the idle bandwidth capacity of the slice; it can calculate the controllable bandwidth of each slice; it can implement resource allocation between slices based on the calculated dynamic priority; and it can ensure that the service is always in a good slice environment, providing real-time assurance for improving customer experience. Attached Figure Description

[0022] Figure 1 A flowchart of the method provided for this invention.

[0023] Figure 2 This is a flowchart illustrating the specific application of Embodiment 2 of the present invention. Detailed Implementation

[0024] The present invention will now be described in detail with reference to the accompanying drawings and embodiments.

[0025] Example 1: A method for resource allocation between 5G network slices, such as Figure 1 As shown, it includes the following steps:

[0026] S1. Based on the number of physical resource blocks occupied by the service and the bandwidth of a single resource block, calculate the bandwidth occupied by each service in each network slice.

[0027] S2. Calculate the theoretical capacity of each service based on Shannon's sampling theorem, and calculate the actual capacity of the service at the current moment based on the service congestion rate.

[0028] S3. Calculate the idle bandwidth capacity of each slice based on the expected value of the number of idle resource blocks and the single resource block capacity of each slice.

[0029] S4. Calculate the controllable bandwidth capacity of each slice based on the service busy ratio and idle bandwidth capacity of each slice.

[0030] S5. Normalize the controllable bandwidth capability of each slice and use it as a priority indicator for slice resource allocation to perform resource allocation.

[0031] Specifically, in S1, the signal-to-noise ratio of all services in each slice is first converted to a decimal value; then, based on the set subcarrier bandwidth and the number of subcarriers occupied by a resource block (RB), the bandwidth occupied by each service is calculated by multiplying the bandwidth of the single resource block by the number of physical resource blocks occupied by each service.

[0032] Specifically, in S2, the actual capacity of a service at the current moment is calculated by multiplying the theoretical capacity of each service by 1 and subtracting the service congestion rate.

[0033] Specifically, the number of free resource blocks in each slice of S3 is obtained by subtracting the total number of physical resource blocks occupied by each service from the total number of physical resource blocks allocated to the network slice.

[0034] Specifically, in S3, the single resource block capacity of each service is first calculated based on the current actual capacity of each service and the number of resource blocks occupied by the service. Then, the average value of the single resource block capacity of all services on each slice is calculated as the mathematical expectation value of the single resource block capacity of that slice.

[0035] Specifically, the idle bandwidth capacity of each slice in S3 is calculated by multiplying the number of idle resource blocks in each slice at the current moment by the expected value of the single resource block capacity of that slice.

[0036] Specifically, in S4, for any slice, the slice's busy ratio is 1 minus the ratio of the number of idle resource blocks in that slice to the total number of physical resource blocks allocated to that slice.

[0037] Specifically, the controllable bandwidth capacity of each slice is obtained by multiplying the slice's busy ratio by the slice's idle bandwidth capacity calculated in S3.

[0038] Specifically, in S5, the controllable bandwidth capability of all slices is normalized to the interval [0,1] and used as a preliminary priority indicator for slice resource allocation.

[0039] Specifically, each time resources are allocated to a slice, the priority index of the slices that were not allocated resources in the previous round is dynamically adjusted. The priority index of these slices is multiplied by a preset adjustment coefficient in the range of (1,2], and the unallocated resources are allocated using a proportionally fair PF algorithm. The total number of physical resource blocks of all slices is then updated.

[0040] In the specific implementation process, for several network slices, i represents the network slice number, and j represents the service number within the network slice. First, obtain the basic information of each network slice, including the number of allocated resource blocks (total RBs) in each network slice, the number of resource blocks occupied by each service on the network slice, the signal-to-noise ratio of each service, the congestion rate of each service, the subcarrier bandwidth of the network slice, and the number of subcarriers occupied by a resource block.

[0041] After obtaining the basic information required for subsequent calculations, such as Figure 2 As shown, we first traverse all network slices starting from i=1. Within each network slice, we also traverse all services starting from j=1. For each service j, we first convert the signal-to-noise ratio (SNR) of service j to decimal. Then, based on the set subcarrier bandwidth and the number of subcarriers occupied by a resource block, we calculate the bandwidth of a single resource block. Next, we multiply the bandwidth of a single resource block by the number of physical resource blocks occupied by each service to calculate the bandwidth occupied by service j. Then, we calculate the theoretical capacity of service j based on the Shannon sampling theorem and the actual capacity of service j based on its congestion rate. Based on the above calculation results, we calculate the single RB capacity of service j based on its current actual capacity and the number of resource blocks it occupies. At this point, the data calculation for service j is complete, and j increments. Following these steps, we complete the calculation of all service-related data within a slice. After traversing all services within slice i, we calculate the expected value of the single RB capacity of slice i and the number of idle RBs in slice i, thereby calculating the remaining bandwidth capacity of slice i. Finally, we obtain the busy ratio and the actual remaining bandwidth of slice i. After completing the traversal and calculation of all business data within slice i and the calculation of slice i itself, i is incremented until all network slices have been traversed, and the relevant data of all network slices are obtained.

[0042] After traversing all network slices, `i` is reset to 1, the actual remaining bandwidth of slice `i` is normalized, and an initial priority index for slice `i` is set. Next, slice `i` is evaluated: if slice `i` was a starved slice in the previous resource allocation round, its priority index is adjusted according to a preset adjustment coefficient; if slice `i` was not a starved slice in the previous resource allocation round, its initial priority index is maintained. After evaluation, `i` is incremented until all network slices have been traversed. After traversal, dynamic resource allocation is performed using the PF algorithm based on the priority index of each slice.

[0043] Example 2: A method for resource allocation between 5G network slices, comprising the following steps:

[0044] S1. Based on the number of physical resource blocks occupied by the service and the bandwidth of a single resource block, calculate the bandwidth occupied by each service in each network slice.

[0045] S2. Calculate the theoretical capacity of each service based on Shannon's sampling theorem, and calculate the actual capacity of the service at the current moment based on the service congestion rate.

[0046] S3. Calculate the idle bandwidth capacity of each slice based on the expected value of the number of idle resource blocks and the single resource block capacity of each slice.

[0047] S4. Calculate the controllable bandwidth capacity of each slice based on the service busy ratio and idle bandwidth capacity of each slice.

[0048] S5. Normalize the controllable bandwidth capability of each slice and use it as a priority indicator for slice resource allocation to perform resource allocation.

[0049] Specifically, in S1, the signal-to-noise ratio of all services in each slice is first converted to a decimal value; then, based on the set subcarrier bandwidth and the number of subcarriers occupied by a resource block, the bandwidth of a single resource block is calculated, and the bandwidth occupied by each service is calculated by multiplying the bandwidth of the single resource block by the number of physical resource blocks occupied by each service.

[0050] Specifically, in S2, the actual capacity of a service at the current moment is calculated by multiplying the theoretical capacity of each service by 1 and subtracting the service congestion rate.

[0051] Specifically, the number of free resource blocks in each slice of S3 is obtained by subtracting the total number of physical resource blocks occupied by each service from the total number of physical resource blocks allocated to the network slice.

[0052] Specifically, in S3, the single resource block capacity of each service is first calculated based on the current actual capacity of each service and the number of resource blocks occupied by the service. Then, the average value of the single resource block capacity of all services on each slice is calculated as the mathematical expectation value of the single resource block capacity of that slice.

[0053] Specifically, the idle bandwidth capacity of each slice in S3 is calculated by multiplying the number of idle resource blocks in each slice at the current moment by the expected value of the single resource block capacity of that slice.

[0054] Specifically, in S4, for any slice, the slice's busy ratio is 1 minus the ratio of the number of idle resource blocks in that slice to the total number of physical resource blocks allocated to that slice.

[0055] Specifically, the controllable bandwidth capacity of each slice is obtained by multiplying the slice's busy ratio by the slice's idle bandwidth capacity calculated in S3.

[0056] Specifically, in S5, the controllable bandwidth capability of all slices is normalized to the interval [0,1] and used as a preliminary priority indicator for slice resource allocation.

[0057] Specifically, each time resources are allocated to a slice, the priority index of the slices that were not allocated resources in the previous round is dynamically adjusted. The priority index of these slices is multiplied by a preset adjustment coefficient in the range of (1,2], and the unallocated resources are allocated using a proportionally fair PF algorithm. The total number of physical resource blocks of all slices is then updated.

[0058] In the specific implementation process, for several network slices, i represents the network slice number, and j represents the service number within the network slice. First, obtain the basic information of each network slice, including the number of allocated resource blocks (total RBs) in each network slice, the number of resource blocks occupied by each service on the network slice, the signal-to-noise ratio of each service, the congestion rate of each service, the subcarrier bandwidth of the network slice, and the number of subcarriers occupied by a resource block.

[0059] After obtaining the basic information required for subsequent calculations, such as Figure 2 As shown, we first traverse all network slices starting from i=1. Within each network slice, we also traverse all services starting from j=1. For each service j, we first convert the signal-to-noise ratio (SNR) of service j to decimal. Then, based on the set subcarrier bandwidth and the number of subcarriers occupied by a resource block, we calculate the bandwidth of a single resource block. Next, we multiply the bandwidth of a single resource block by the number of physical resource blocks occupied by each service to calculate the bandwidth occupied by service j. Then, we calculate the theoretical capacity of service j based on the Shannon sampling theorem and the actual capacity of service j based on its congestion rate. Based on the above calculation results, we calculate the single RB capacity of service j based on its current actual capacity and the number of resource blocks it occupies. At this point, the data calculation for service j is complete, and j increments. Following these steps, we complete the calculation of all service-related data within a slice. After traversing all services within slice i, we calculate the expected value of the single RB capacity of slice i and the number of idle RBs in slice i, thereby calculating the remaining bandwidth capacity of slice i. Finally, we obtain the busy ratio and the actual remaining bandwidth of slice i. After completing the traversal and calculation of all business data within slice i and the calculation of slice i itself, i is incremented until all network slices have been traversed, and the relevant data of all network slices are obtained.

[0060] After traversing all network slices, `i` is reset to 1, the actual remaining bandwidth of slice `i` is normalized, and an initial priority index for slice `i` is set. Next, slice `i` is evaluated: if slice `i` was a starved slice in the previous resource allocation round, its priority index is adjusted according to a preset adjustment coefficient; if slice `i` was not a starved slice in the previous resource allocation round, its initial priority index is maintained. After evaluation, `i` is incremented until all network slices have been traversed. After traversal, dynamic resource allocation is performed using the PF algorithm based on the priority index of each slice.

[0061] In this embodiment, the resource allocation method between 5G network slices provided by the present invention is simulated in a simulated environment. Three network slices are constructed to simulate a conventional network environment, and the resource allocation between network slices is performed using the method provided by the present invention.

[0062] The specific process is as follows: Resources are allocated to three network slices. Network slice 1 has been allocated 40 resource blocks and contains four services: services 1-1 to 1-4. Service 1-1 occupies 8 resource blocks with a signal-to-noise ratio (SNR) of -2dB and a congestion rate of 0.5%; service 1-2 occupies 12 resource blocks with a SNR of 0dB and a congestion rate of 0.2%; service 1-3 occupies 4 resource blocks with a SNR of 3dB and a congestion rate of 0.8%; and service 1-4 occupies 6 resource blocks with a SNR of 1dB and a congestion rate of 0.3%.

[0063] Network slice 2 has been allocated 34 resource blocks, and there are two services on network slice 2: service 2-1 and service 2-2. Service 2-1 occupies 7 resource blocks, has a signal-to-noise ratio of -1dB, and a service congestion rate of 0.5%; service 2-2 occupies 12 resource blocks, has a signal-to-noise ratio of 4dB, and a service congestion rate of 1.1%.

[0064] Network slice 3 has been allocated 26 resource blocks, and there are 3 services on network slice 3, namely services 3-1 to 3-3. Among them, service 3-1 occupies 4 resource blocks, with a signal-to-noise ratio of 3dB and a service congestion rate of 0.5%; service 3-2 occupies 2 resource blocks, with a signal-to-noise ratio of 4dB and a service congestion rate of 0.4%; and service 3-3 occupies 8 resource blocks, with a signal-to-noise ratio of -2dB and a service congestion rate of 0.6%.

[0065] Network slices 1 to 3 operate at a frequency of 2.6 GHz, with a bandwidth of 100 MHz, a subcarrier bandwidth index of 1, a subcarrier bandwidth of 30 kHz, and each resource block occupies 12 subcarriers. The preset adjustment coefficient for resource allocation is 1.1. Before the resource allocation is implemented, the previous round of starved slices are network slice 1 and network slice 3.

[0066] In the specific application scenario described above, dynamic resource allocation is performed on the three network slices. First, the signal-to-noise ratio (SNR) of all network slices is converted to a decimal value, i.e.:

[0067] In network slice 1, the signal-to-noise ratios of services 1-1 to 1-4 are 0.63, 1, 2, and 1.26, respectively.

[0068] In network slice 2, the signal-to-noise ratios of services 2-1 to 2-2 are 0.79 and 2.51, respectively.

[0069] In network slice 3, the signal-to-noise ratios of services 3-1 to 3-3 are 2, 2.51, and 0.63, respectively.

[0070] Based on the known subcarrier bandwidth and the number of subcarriers occupied by a resource block, the bandwidth of a single resource block is calculated to be 0.35 (MHz). Then, by multiplying the bandwidth of the single resource block by the number of resource blocks occupied by the service, the bandwidth occupied by each service at the current moment is calculated, i.e.:

[0071] In network slice 1, the bandwidth occupied by services 1-1 to 1-4 at the current time is 2.88MHz, 4.32MHz, 1.44MHz, and 2.16MHz, respectively;

[0072] In network slice 2, the bandwidth occupied by services 2-1 to 2-2 at the current time is 2.52 MHz and 4.32 MHz, respectively;

[0073] In network slice 3, the bandwidth occupied by services 3-1 to 3-3 at the current time is 1.44 MHz, 0.72 MHz, and 2.88 MHz, respectively.

[0074] Based on Shannon's sampling theorem, the theoretical capacity of all services is calculated using the bandwidth currently occupied by each service and the decimal signal-to-noise ratio.

[0075] In network slice 1, the theoretical capacity of services 1-1 to 1-4 are 1.98Mbps, 4.22Mbps, 2.23Mbps, and 2.48Mbps, respectively.

[0076] In network slice 2, the theoretical capacity of services 2-1 to 2-2 are 2.08 Mbps and 7.65 Mbps, respectively.

[0077] In network slice 3, the theoretical capacity of services 3-1 to 3-3 are 2.23 Mbps, 1.27 Mbps, and 1.98 Mbps, respectively.

[0078] Based on the congestion status of the services, estimate the actual capacity of all services at the current moment, and then divide the actual capacity by the number of resource blocks occupied by the services to calculate the single resource block capacity occupied by any service:

[0079] In network slice 1, the single resource block capabilities of services 1-1 to 1-4 are 0.25Mbps, 0.35Mbps, 0.55Mbps, and 0.41Mbps, respectively.

[0080] In network slice 2, the single resource block capabilities of services 2-1 to 2-2 are 0.3 Mbps and 0.63 Mbps, respectively;

[0081] In network slice 3, the single resource block capabilities of services 3-1 to 3-3 are 0.55Mbps, 0.63Mbps, and 0.25Mbps, respectively.

[0082] By calculating the average capability of each resource block in each slice, the expected value of the capability of each resource block in each slice is obtained:

[0083] The expected value of the single resource block capability of network slice 1: 0.39 Mbps;

[0084] The expected value of the single resource block capability of network slice 2 is 0.46 Mbps;

[0085] The mathematical expectation of the single resource block capability of network slice 3 is 0.48 Mbps.

[0086] At this point, the number of idle resource blocks for the three slices are 10, 15, and 12, respectively. Based on this, the idle bandwidth capacity of each slice is calculated by multiplying the number of resource blocks by the expected value of the capacity of a single resource block.

[0087] Network slice 1's idle bandwidth capacity: 3.9Mbps;

[0088] Network slice 2's idle bandwidth capacity: 6.94Mbps;

[0089] Network slice 3 has a free bandwidth capacity of 5.74 Mbps.

[0090] For the three slices, the workload ratio of each slice is calculated by subtracting the ratio of the number of free resource blocks to the total number of allocated physical resource blocks from 1:

[0091] Network slice 1's service load ratio: 0.75;

[0092] Network slice 2's service load ratio: 0.56;

[0093] Network slice 3's service busy ratio: 0.54.

[0094] Then, calculate the controllable bandwidth capacity of each slice by multiplying the service load ratio of each slice by its respective idle bandwidth capacity:

[0095] Controllable bandwidth capability of network slice 1: 2.93;

[0096] Controllable bandwidth capability of network slice 2: 3.88;

[0097] Controllable bandwidth capability of network slice 3: 3.09.

[0098] Dynamic resource allocation is performed based on controllable bandwidth capacity: The preset adjustment coefficient for resource allocation is 1.1. The controllable bandwidth capacity of all slices is normalized to the interval [0,1] to obtain the slice resource allocation priority index.

[0099] The priority index for slice resource allocation in network slice 1 is 0.3;

[0100] The priority index for slice resource allocation in network slice 2 is 0.39;

[0101] The priority index for slice resource allocation in network slice 3 is 0.31.

[0102] Since network slices 1 and 3 were not allocated resources in the previous round, the slice resource allocation priority index is adjusted according to the adjustment factor. The result is obtained by multiplying their slice resource allocation priority index by the adjustment factor:

[0103] The adjusted priority index for slice resource allocation in network slice 1 is 0.33;

[0104] The adjusted priority index for slice resource allocation in Network Slice 2 is 0.39;

[0105] The adjusted priority index for slice resource allocation in Network Slice 3 is 0.34.

[0106] Finally, the adjusted slice resource allocation priority index is used as the final priority for the current resource allocation, and the proportionally fair PF algorithm is used to allocate the unallocated resources and update the total number of physical resource blocks for all slices.

[0107] Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art can still modify the technical solutions described in the foregoing embodiments or make equivalent substitutions for some of the technical features. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for resource allocation among 5G network slices, characterized in that, Includes the following steps: S1. Based on the number of physical resource blocks occupied by the service and the bandwidth of a single resource block, calculate the bandwidth occupied by each service in each network slice. S2. Calculate the theoretical capacity of each service based on Shannon's sampling theorem, and calculate the actual capacity of the service at the current moment based on the service congestion rate. S3. Based on the current actual capacity of each service and the number of resource blocks occupied by the service, calculate the single resource block capacity of each service, and then calculate the average value of the single resource block capacity of all services on each slice as the mathematical expectation value of the single resource block capacity of the slice; then, based on the number of idle resource blocks and the mathematical expectation value of the single resource block capacity of each slice, calculate the idle bandwidth capacity of each slice. S4. Calculate the controllable bandwidth capacity of each slice based on the service busy ratio and idle bandwidth capacity of each slice. S5. Normalize the controllable bandwidth capability of each slice and use it as a priority indicator for slice resource allocation to perform resource allocation.

2. The 5G network slice resource allocation method according to claim 1, characterized in that, In S1, the signal-to-noise ratio of all services in each slice is first converted to a decimal value; then, based on the set subcarrier bandwidth and the number of subcarriers occupied by a resource block, the bandwidth of a single resource block is calculated, and the bandwidth occupied by each service is calculated by multiplying the bandwidth of the single resource block by the number of physical resource blocks occupied by each service.

3. The 5G network slice resource allocation method according to claim 1, characterized in that, In S2, the actual capacity of a service at the current moment is calculated by multiplying the theoretical capacity of each service by 1 and subtracting the service congestion rate.

4. The 5G network slice resource allocation method according to claim 1, characterized in that, The number of free resource blocks in each slice in S3 is obtained by subtracting the total number of physical resource blocks occupied by each service from the total number of physical resource blocks allocated to the network slice.

5. The 5G network slice resource allocation method according to claim 1 or 4, characterized in that, The idle bandwidth capacity of each slice in S3 is calculated by multiplying the number of idle resource blocks in each slice at the current moment by the expected value of the single resource block capacity of that slice.

6. The method for resource allocation between 5G network slices according to claim 1, characterized in that, In S4, for any slice, the slice's busy ratio is 1 minus the ratio of the number of free resource blocks in the slice to the total number of physical resource blocks allocated to the slice.

7. The 5G network slice resource allocation method according to claim 1 or 6, characterized in that, The controllable bandwidth capacity of each slice is obtained by multiplying the slice's busy ratio by the slice's idle bandwidth capacity calculated in S3.

8. The 5G network slice resource allocation method according to claim 1, characterized in that, In S5, the controllable bandwidth capability of all slices is normalized to the interval [0,1] and used as a preliminary priority indicator for slice resource allocation.

9. The 5G network slice resource allocation method according to claim 8, characterized in that, Each time resources are allocated to a slice, the priority index of slices that were not allocated resources in the previous round is dynamically adjusted.

10. The 5G network slice resource allocation method according to claim 9, characterized in that, When dynamically adjusting the priority index of slices that did not receive resource allocation in the previous round, the priority index of these slices is multiplied by a preset adjustment coefficient in the range of (1,2], and the unallocated resources are allocated using a proportionally fair PF algorithm, and the total number of physical resource blocks of all slices is updated.

Images