A 5G network slice resource allocation method based on scalable regulation

Abstract

The present invention discloses a method for allocating resources between 5G network slices based on scalable adjustment, which solves the problems of complex resource allocation, low security and low management efficiency of existing slices. The method includes determining the slice's high-quality and non-high-quality channel services based on the signal-to-noise ratio; calculating the signal-to-noise ratio coefficient for the high-quality channel service based on the signal-to-noise ratio, and calculating the synthesis coefficient for the non-high-quality channel service based on the throughput and delay, and calculating the slice service performance coefficient; determining the slice's physical resource occupancy rate, and allocating the corresponding resource occupancy coefficient according to the size of the physical resource occupancy rate, which is the slice resource coefficient; calculating the slice service quality coefficient according to the congestion rate; determining the slice allocation priority according to the slice service performance coefficient, resource coefficient, and service quality coefficient, and allocating unallocated resources. The present invention evaluates the allocation priority from multiple aspects of service performance, resources, and quality, ensures that the service is in a slice environment with a good environment, and provides real-time protection for improving customer perception.

Description

Technical Field

[0001] The present invention relates to the field of 5G communication technology, and in particular to a method for allocating resources between 5G network slices based on scalable adjustment. Background Art

[0002] Network slicing involves dividing a physical resource into multiple logically independent slices. Each slice can be configured based on specific needs and performance requirements, providing personalized network services. Resource allocation strategies between network slices can be based on application requirements, network status, user experience, and historical data predictions. However, due to the complexity, security, and management efficiency of slice resource allocation, achieving a simple and efficient resource allocation method between slices remains an unresolved issue.

[0003] For example, the patent application number is 202411435611.9, and the patent name is "An invention application for a method for allocating resources between network slices based on idle coefficients." The idle coefficient of each slice is calculated by combining the number of idle resources and the total number of resources in each slice with the congestion status of each service within the slice. Combined with the load priority and signal priority, a comprehensive priority that can be used to evaluate the resource allocation of each slice is obtained. This patent can effectively reduce the congestion rate of slices, but it also has some problems: first, the slice marking type is fixed and mixed-type services cannot be accounted for; second, the signal quality level indicator is not refined according to the specific service type and level value, making the final comprehensive priority calculation not accurate enough, affecting resource allocation. Summary of the Invention

[0004] The present invention mainly solves the problems of complex slice resource allocation, low security and low management efficiency in existing slices, and provides a 5G network inter-slice resource allocation method based on scalable adjustment.

[0005] The present invention also solves the problem that the existing resource allocation method cannot account for mixed services, the signal quality level signal is not refined according to the specific service type and level value, and the priority calculation is not accurate enough, which affects resource allocation. It provides a resource allocation method between 5G network slices based on scalable adjustment.

[0006] The above technical problem of the present invention is mainly solved by the following technical solution: a 5G network inter-slice resource allocation method based on scalable adjustment, comprising the following steps:

[0007] Determine slice quality and non-quality channel services based on signal-to-noise ratio;

[0008] For high-quality channel services, the signal-to-noise ratio coefficient is calculated based on the signal-to-noise ratio. For non-high-quality channel services, the synthesis coefficient is calculated based on the throughput and delay. The slice service performance coefficient is calculated based on the signal-to-noise ratio coefficient and the synthesis coefficient.

[0009] Determine the physical resource occupancy of the slice, and allocate the corresponding resource occupancy coefficient according to the size of the physical resource occupancy, which is the slice resource coefficient;

[0010] Calculate the slice service quality coefficient based on the congestion rate;

[0011] Determine the slice allocation priority based on the slice service performance coefficient, resource coefficient, and service quality coefficient;

[0012] Allocate unassigned resources based on their allocation priorities.

[0013] This invention starts by screening high-quality channel services, calculating the signal-to-noise ratio coefficient, and simultaneously calculating the throughput coefficient and latency coefficient of non-high-quality channel services. Based on this, it measures the performance coefficient of all slices, calculates the resource coefficient of all slices based on the physical resource occupancy status, and calculates the service quality coefficient of all slices based on the service congestion status. It then synthesizes a scalable and adjustable comprehensive allocation priority, dynamically adjusts the slices that were not allocated in the previous round, and more intuitively implements resource allocation between slices through differentiated strategies. This invention ensures that services are always in a good slice environment, providing real-time protection for improving customer experience.

[0014] As an optimal solution, a signal-to-noise ratio threshold is set, and services with a signal-to-noise ratio greater than the signal-to-noise ratio threshold are considered high-quality channel services, and services with a signal-to-noise ratio not greater than the signal-to-noise ratio threshold are considered non-high-quality channel services.

[0015] This solution screens high-quality channel services and sets a signal-to-noise ratio threshold. Using the threshold as a boundary, slice services are divided into high-quality channel services and non-high-quality channel services based on the service signal-to-noise ratio. The signal-to-noise ratio threshold determines high-quality channel services and non-high-quality channel services based on the service signal-to-noise ratio.

[0016] As a preferred solution, the signal-to-noise ratio coefficient of each high-quality channel service is calculated according to the service signal-to-noise ratio, and the sum of all the signal-to-noise ratio coefficients is calculated as the slice signal-to-noise ratio coefficient.

[0017] In this solution, for each premium channel service, the SNR coefficient is calculated based on its SNR. Specifically, it is the reciprocal of the sum of the exponential function of the negative decimal SNR of the premium channel service and 1. The SNR coefficients of all premium channel services are added together, and the resulting sum is the SNR coefficient of the slice service. The decimal SNR is calculated by converting the SNR to decimal.

[0018] As a preferred solution, the throughput coefficient of each non-premium channel service is calculated based on the service throughput, the delay coefficient of each non-premium channel service is calculated based on the delay, the synthesis coefficient is calculated based on the throughput coefficient and the delay coefficient, and the sum of all synthesis coefficients is calculated as the slice synthesis coefficient.

[0019] For each non-premium channel service, this solution calculates a throughput coefficient based on throughput and a delay coefficient based on latency. The throughput is the average throughput, and the delay is the average delay. Specifically, the throughput coefficient is the ratio of throughput to ideal throughput, and the delay coefficient is an exponential function of the negative of the ratio of delay to delay tolerance. A composite coefficient is further calculated based on the throughput coefficient and delay coefficient. The composite coefficient for each non-premium channel service is the product of the throughput coefficient and the delay coefficient. The composite coefficients of all non-premium channel services are summed to obtain the composite coefficient for the slice service.

[0020] As a preferred solution, the service performance coefficient is calculated based on the signal-to-noise ratio coefficient and the synthesis coefficient, including:

[0021] The ratio of the sum of the slice service signal-to-noise ratio and the slice synthesis coefficient to the number of services in the slice.

[0022] For any slice, the service performance coefficient of the slice is calculated as the quotient of the slice service signal-to-noise ratio plus the slice synthesis coefficient and the number of slice services.

[0023] As a preferred solution, a physical resource occupancy rate threshold is set to divide the physical resource occupancy rate into several ranges;

[0024] Set the corresponding resource occupancy coefficient for each physical resource occupancy range;

[0025] Determine the range of the slice physical resource occupancy rate and obtain the corresponding resource occupancy coefficient as the slice resource coefficient.

[0026] Based on the physical resource occupancy threshold and set points, a range is created to define several physical resource occupancy ranges, and a corresponding resource occupancy coefficient is set for each physical resource occupancy range. The slice physical resource occupancy is the quotient of the sum of the number of physical resource blocks occupied by all services in the slice and the total number of physical resource blocks allocated to the slice, that is, the ratio of the total number of physical resource blocks occupied by services in the slice to the total number of physical resource blocks already allocated to the slice. The physical resource block occupancy range within which the slice physical resource occupancy falls is determined, and the resource occupancy coefficient corresponding to this range is used as the slice resource coefficient for that slice.

[0027] Set the physical resource occupancy rate threshold and a point. The physical resource occupancy rate range is preferably divided into four ranges. At the same time, set the resource occupancy high, medium, and low coefficients, as well as their specific values, and then combine them with 1 to pair them with each physical resource occupancy rate range.

[0028] As a preferred solution, a service congestion threshold is set to determine congested services and non-congested services based on the service congestion rate;

[0029] Determine the service quality coefficient for congested services based on the service congestion threshold and congestion rate, and set the service quality coefficient for non-congested services;

[0030] The slice service quality coefficient is determined based on the service quality coefficients of all services in the slice.

[0031] By setting a service congestion threshold, services with a service congestion rate no less than the service congestion threshold are considered congested services, while services with a service congestion rate less than the service congestion threshold are considered non-congested services. The service quality coefficient of congested services is the ratio of the service congestion threshold to the service congestion rate. The service quality coefficient of non-congested services is set, preferably to 1. The service quality coefficient is determined based on the service quality coefficients of all services in the slice.

[0032] As a preferred solution, the ratio of the sum of the service quality coefficients of all services in the slice to the number of services in the slice.

[0033] For any slice, the service quality coefficient of each service is added together and then divided by the number of all services in the slice to obtain the slice service quality coefficient.

[0034] As a preferred solution, the slice allocation priority is the product of the slice service performance coefficient, the slice resource coefficient and the slice service quality coefficient;

[0035] Set the adjustment coefficient to dynamically adjust the priority of the slices that did not implement resource allocation in the previous round to the final allocation priority. The final allocation priority is the product of the adjustment coefficient and the slice allocation priority.

[0036] The allocation priority of all slices is the product of the slice's service performance coefficient, resource coefficient, and service quality coefficient. This allocation priority is scalable, and appropriate adjustment coefficients can be added to make the priority calculation more reasonable. By setting an adjustment coefficient, the allocation priority of slices that did not receive resource allocation in the previous round is dynamically adjusted. The product of the adjustment coefficient and the allocation priority is used as the final allocation priority for the current resource allocation.

[0037] The adjustment coefficient range is set to (1, 2]. Increasing the adjustment coefficient dynamically adjusts the priority of the slices that were not allocated in the previous round.

[0038] As a preferred solution, the PF algorithm is used to allocate unallocated resources according to the allocation priority, and the total number of physical resource blocks of all slices is updated.

[0039] Therefore, the advantages of the present invention are: starting from screening high-quality channel services, calculating the signal-to-noise ratio coefficient, and simultaneously calculating the throughput coefficient and delay coefficient of non-high-quality channel services, then calculating the performance coefficient of all slices on this basis, calculating the resource coefficient of all slices based on the physical resource occupancy status, calculating the service quality coefficient of all slices based on the service congestion status, synthesizing a scalable and adjustable comprehensive allocation priority, dynamically adjusting the slices that were not allocated in the previous round, and more intuitively realizing resource allocation between slices through differentiated strategies. The present invention can ensure that the service is always in a slice environment with a good environment, providing real-time protection for improving customer perception. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 It is a flow chart of the present invention.

[0041] Figure 2 This is a comparison diagram of random TTI RB allocation between the algorithm of the present invention and other algorithms.

[0042] Figure 3 This is a comparison chart of average RB allocation between the algorithm of the present invention and other algorithms. DETAILED DESCRIPTION

[0043] The technical solution of the present invention will be further specifically described below through embodiments and in conjunction with the accompanying drawings.

[0044] Example 1:

[0045] This embodiment provides a 5G network slice resource allocation method based on scalable adjustment, such as Figure 1 As shown, the following steps are included:

[0046] S1. Determine slice quality and non-quality channel services based on the signal-to-noise ratio;

[0047] For high-quality channel services, the slice signal-to-noise ratio coefficient is calculated based on the signal-to-noise ratio. For non-high-quality channel services, the slice synthesis coefficient is calculated based on the throughput and delay. The slice service performance coefficient is calculated based on the service signal-to-noise ratio coefficient and the synthesis coefficient.

[0048] This step is used to determine the high-quality channel services and calculate the performance coefficient of the slice service based on the signal-to-noise ratio, throughput, and delay of the service.

[0049] S11. A signal-to-noise ratio threshold is set. Services with a signal-to-noise ratio greater than the threshold are classified as high-quality channel services, while services with a signal-to-noise ratio less than the threshold are classified as non-high-quality channel services. By setting the signal-to-noise ratio threshold, the threshold classifies the service signal-to-noise ratio into high-quality channel services and non-high-quality channel services. Specifically, the signal-to-noise ratio threshold is used as the boundary to classify slice services into high-quality channel services and non-high-quality channel services based on the service signal-to-noise ratio.

[0050] S12. For high-quality channel services, convert the signal-to-noise ratios of all services into decimal signal-to-noise ratios, calculate the service signal-to-noise ratio coefficient based on the decimal signal-to-noise ratios, and calculate the sum of the signal-to-noise ratio coefficients of all high-quality channel services as the service signal-to-noise ratio coefficient.

[0051] Specifically, the SNR coefficient is the reciprocal of the sum of the exponential function of the negative decimal SNR of the premium channel service and 1. The decimal SNR is converted to 10 and calculated as the power of the ratio of the service SNR to 10, expressed as power(10, SNR / 10).

[0052] S13. For non-premium channel services, calculate the throughput coefficient of each non-premium channel service based on the service throughput, calculate the delay coefficient of each non-premium channel service based on the delay, calculate the synthesis coefficient based on the throughput coefficient and the delay coefficient, and calculate the sum of all synthesis coefficients as the slice synthesis coefficient.

[0053] Specifically, the throughput coefficient is the ratio of the service throughput to the ideal throughput, which is the average throughput. The delay coefficient is the exponential function of the negative of the ratio of the delay to the delay tolerance, which is the average delay.

[0054] The synthesis coefficient of each non-premium channel service is the product of the throughput coefficient and the delay coefficient. All synthesis coefficients are added together, and the total value obtained is the slice service synthesis coefficient.

[0055] S14. For any slice, calculate the slice service performance coefficient based on the slice signal-to-noise ratio coefficient and the synthesis coefficient. Specifically, the ratio of the sum of the slice service signal-to-noise ratio and the slice synthesis coefficient to the number of services in the slice.

[0056] S2. Determine the physical resource occupancy of the slice, and allocate a corresponding resource occupancy coefficient according to the size of the physical resource occupancy, which is the slice resource coefficient.

[0057] S21. Determine the physical resource occupancy rate of the slice, which is specifically the quotient of the total number of physical resource blocks occupied by all services in the slice and the total number of physical resource blocks allocated to the slice, that is, the ratio of the total number of physical resource blocks occupied by services in the slice to the total number of physical resource blocks already allocated to the slice.

[0058] S22. Set a physical resource occupancy rate threshold and divide the physical resource occupancy rate into several ranges.

[0059] The physical resource occupancy rate range is divided by setting the physical resource occupancy rate threshold and the points. The physical resource occupancy rate range is preferably divided into four ranges.

[0060] S23. Set a corresponding resource occupancy coefficient for each physical resource occupancy range. Set a high resource occupancy coefficient, a medium resource occupancy coefficient, a low resource occupancy coefficient, and a coefficient 1 for each physical resource occupancy range, and pair each coefficient with each physical resource occupancy range.

[0061] S23. Determine the range to which the slice physical resource occupancy rate belongs, and obtain the corresponding resource occupancy coefficient as the slice resource coefficient.

[0062] For each slice, determine in which physical resource occupancy range the slice physical resource rate falls, obtain the physical resource occupancy range where the slice physical resource rate falls, and use the resource occupancy coefficient corresponding to the range as the slice resource coefficient.

[0063] S3. Calculate the slice service quality coefficient based on the congestion rate.

[0064] S31. Set a service congestion threshold and determine congested services and non-congested services based on the service congestion rate.

[0065] Specifically, a service congestion threshold is set, and a service whose service congestion rate is not less than the service congestion threshold is considered a congested service, and a service whose service congestion rate is less than the service congestion threshold is considered a non-congested service.

[0066] S32. Determine the service quality coefficient of the congested service based on the service congestion threshold and the congestion rate, and set the service quality coefficient of the non-congested service.

[0067] The service quality coefficient of the congested service is the ratio of the service congestion threshold to the service congestion rate. The service quality coefficient of the non-congested service is set to 1, preferably set to 1.

[0068] S33. Determine the slice service quality coefficient based on the service quality coefficients of all services in the slice.

[0069] Specifically, the service quality coefficients of all services of the slice are added together, and the ratio of the added value to the number of slice services is used as the slice service quality coefficient.

[0070] S4. Determine the slice allocation priority based on the slice service performance coefficient, resource coefficient, and service quality coefficient.

[0071] The slice allocation priority is the product of the slice service performance coefficient, the slice resource coefficient and the slice service quality coefficient;

[0072] Set the adjustment coefficient to dynamically adjust the priority of the slices that did not implement resource allocation in the previous round to the final allocation priority. The final allocation priority is the product of the adjustment coefficient and the slice allocation priority.

[0073] The allocation priority is scalable. By adding the corresponding adjustment coefficient, the priority calculation is made more reasonable. The adjustment coefficient is set in the range (1, 2]. For slices that were not allocated in the previous round, the product of the adjustment coefficient and the allocation priority is used as the final slice allocation priority.

[0074] S5. Allocate unallocated resources according to allocation priorities.

[0075] According to the allocation priority, the PF algorithm is used to allocate the unallocated resources and update the total number of physical resource blocks of all slices.

[0076] This invention starts by screening high-quality channel services, calculating the signal-to-noise ratio coefficient, and simultaneously calculating the throughput coefficient and latency coefficient of non-high-quality channel services. Based on this, it measures the performance coefficient of all slices, calculates the resource coefficient of all slices based on the physical resource occupancy status, and calculates the service quality coefficient of all slices based on the service congestion status. It then synthesizes a scalable and adjustable comprehensive allocation priority, dynamically adjusts the slices that were not allocated in the previous round, and more intuitively implements resource allocation between slices through differentiated strategies. This invention ensures that services are always in a good slice environment, providing real-time protection for improving customer experience.

[0077] Example 2:

[0078] This embodiment provides a method for allocating resources between 5G network slices based on scalable adjustment, and the method is explained with reference to a specific formula.

[0079] It includes m network slice sets SEC={Sec1, Sec2,…Sec m}, corresponding to any network slice Sec i , i∈[1,m].

[0080] Network Slicing Security i The total number of allocated physical resource blocks NRB i , slice Sec i There are already ni business SRVs stored in i ={Srv i1 , Srv i2 ,…Srv ini}, corresponding to any business Srv ij , j∈[1, ni], the current service signal-to-noise ratio Snr ij (dB), number of occupied physical resource blocks Prb ij , business congestion rate Coj ij The service Srv in the two time slots at the current moment ij The average throughput Thr ij (Mbps), average delay Dly ij(ms), ideal throughput Ttr ij (Mbps) and delay tolerance Dty ij (ms).

[0081] The method comprises the following steps:

[0082] S1. Determine the slice quality and non-quality channel services based on the signal-to-noise ratio.

[0083] For high-quality channel services, the signal-to-noise ratio coefficient is calculated based on the signal-to-noise ratio. For non-high-quality channel services, the synthesis coefficient is calculated based on the throughput and delay. The slice service performance coefficient is calculated based on the signal-to-noise ratio coefficient and the synthesis coefficient.

[0084] This step is used to determine the high-quality channel services and calculate the performance coefficient of the slice service based on the signal-to-noise ratio, throughput, and delay of the service.

[0085] S11. Set the signal-to-noise ratio threshold SNR th (dB), get Snr ij >SNR th All Business Srv ij For high-quality channel services, include them in the high-quality channel service set Sot i , i ∈ [1, m], get Snr ij ≤SNR th The service is a non-high-quality channel service and is included in the non-high-quality channel service set Sot i '.

[0086] S12. For high-quality channel service set Sot i , all services Srv in i ∈ [1, m] ij , convert the signal-to-noise ratio of all services into a decimal signal-to-noise ratio Sdr ij , Sdr ij =power(10, Snr ij / 10).

[0087] According to the decimal signal-to-noise ratio Sdr ij Calculate the service signal-to-noise ratio coefficient Cof_snr ij , Cof_snr ij =1 / (1+exp((-1)* Sdr ij )), where exp() represents the exponential function with natural generation as the base.

[0088] Calculate the signal-to-noise ratio coefficient Cof_snr of all high-quality channel services ij The sum of the slice signal-to-noise ratio coefficient COF_snr i , COF_snr i =∑ NCof_snr ij , N is Sdr ij ∈Sot i .

[0089] S13. For non-premium channel services Sot i ', calculate the throughput coefficient Cof_thr of each non-high-quality channel service based on the service throughput ij =Thr ij / Ttr ij , calculate the delay coefficient Cof_dly of each non-quality channel service based on the delay ij =exp((-1)*Dly ij / Dty ij ).

[0090] According to the throughput coefficient Cof_thr ij and delay coefficient Cof_dly ij Calculate the synthesis coefficient Cof_ctd ij ,

[0091] Cof_ctd ij =Cof_thr ij *Cof_dly ij .

[0092] Calculate the sum of all synthesis coefficients as the slice synthesis coefficient COF_ctd i .

[0093] COF_ctd i =∑ M Cof_ctd ij ,M is Sdr ij ∈Sot i '.

[0094] S14. For any slice Sec i , i∈[1,m], based on the slice signal-to-noise ratio coefficient COF_snr i and synthesis coefficient COF_ctd i Calculate the slice service performance coefficient COF_spf i ,

[0095] The slice service performance coefficient is the ratio of the sum of the slice service signal-to-noise ratio and the slice synthesis coefficient to the number of slice services.

[0096] COF_spf i =(COF_snr i +COF_ctd i ) / n i .

[0097] S2. Determine the physical resource occupancy of the slice, and allocate a corresponding resource occupancy coefficient according to the size of the physical resource occupancy, which is the slice resource coefficient.

[0098] S21. Determine the physical resource occupancy of the slice.

[0099] Calculate any slice Sec i , i∈[1,m] is the total number of physical resources occupied by Pod i =∑ j=1 ni Prb ij , slice physical resource occupancy Roc i =Pod i / NRB i .

[0100] S22. Set physical resource occupancy threshold ROC th ∈(0.5,1), divide the physical resource occupancy rate into several ranges. According to the physical resource occupancy rate threshold ROC th The points 0.5 and 1 are preferably divided into four ranges, namely (-∞, 0.5), [0.5, ROC th ]、(ROC th , ROC th +(1-ROC th ) / 2]、(ROC th +(1-ROC th ) / twenty one).

[0101] S23. Set the corresponding resource occupancy coefficient for each physical resource occupancy range, namely the resource occupancy high coefficient cof min ∈(0,0.5], resource occupancy coefficient cof med ∈(0.5,1], resource occupancy low coefficient cof max ∈(1,1.5), and the coefficient 1, respectively, pairs each coefficient with each physical resource occupancy range.

[0102] S23. Determine the range to which the slice physical resource occupancy rate belongs, and obtain the corresponding resource occupancy coefficient as the slice resource coefficient.

[0103] When Roc i When <0.5, calculate the slice resource coefficient COF_src i =cof max ;

[0104] When 0.5≤Roc i ≤ROC th When calculating the slice resource coefficient COF_src i =1;

[0105] When ROC is met th <Roc i ≤ROC th +(1-ROC th ) / 2, calculate the slice resource coefficient COF_src i =cof med ;

[0106] When ROC is met th +(1-ROC th ) / 2<Roc i When <1, calculate the slice resource coefficient COF_src i =cof min .

[0107] S3. Calculate the slice service quality coefficient based on the congestion rate.

[0108] S31. Set the service congestion threshold Coj th , based on the service congestion rate, determine the congested service and non-congested service. Specifically, obtain the service congestion rate Coj ij ≥Coj th The business is congested and is included in the congestion set Sct i ,i∈[1,m]. Get the service congestion rate Coj ij <Coj th The services are non-congested services and are included in the non-congested set Sct i '.

[0109] S32. Determine the service quality coefficient of the congested service based on the service congestion threshold and congestion rate.

[0110] Cof_sql ij =Coj th / Coj ij ;

[0111] Set the service quality coefficient Cof_sql for non-congested services ij =1.

[0112] S33. Determine the slice service quality coefficient based on the service quality coefficients of all services in the slice.

[0113] The service quality coefficients of all services in the slice are added together, and the ratio of the added value to the number of services in the slice is used as the slice service quality coefficient. The slice service quality coefficient is expressed as follows:

[0114] COF_sql i =∑ j=1 ni Cof_sql ij / ni.

[0115] S4. Determine the slice allocation priority based on the slice service performance coefficient, resource coefficient, and service quality coefficient.

[0116] Specifically, the slice allocation priority is the product of the slice service performance coefficient, the slice resource coefficient, and the slice service quality coefficient, which is expressed as follows:

[0117] Pri i = COF_spf i *COF_src i * COF_ sql i .

[0118] Set the adjustment coefficient σ∈(1,2], and the current final slice allocation priority of the slices that did not implement resource allocation in the previous round is:

[0119] Pri i '=σ* Pri i .

[0120] S5. Allocate unallocated resources according to allocation priorities.

[0121] According to the final slice allocation priority, the PF algorithm is used to allocate the unallocated resources and update the total number of physical resource blocks of all slices.

[0122] The present invention is described in detail below using a practical example. Assuming m=3, the conditions of each 5G network slice are shown in Table 1-3:

[0123] Table 1 Services available in each 5G network slice 1

[0124]

[0125] Table 2 Services available in each 5G network slice 2

[0126]

[0127] Table 3 Services available in each 5G network slice 3

[0128]

[0129] The basic data are shown in Table 4:

[0130] Table 4 Basic data

[0131]

[0132] This embodiment provides a 5G network inter-slice resource allocation method based on scalable adjustment, including the following steps:

[0133] S1. Determine the slice quality and non-quality channel services based on the signal-to-noise ratio.

[0134] S11. Set the signal-to-noise ratio threshold SNR th (dB), get Snr ij >SNR th All Business Srv ij For high-quality channel services, include them in the high-quality channel service set Sot i , i ∈ [1, m],

[0135] Sot i ={{Srv(1,3), Srv(1,4)}, {Srv(2,2)},{Srv(3,1), Srv(3,2)}}.

[0136] Get Get Snr ij ≤SNR th The service is a non-high-quality channel service and is included in the non-high-quality channel service set Sot i ',

[0137] Sot i '={{Srv(1,1), Srv(1,2)}, {Srv(2,1)},{Srv(3,3)}}.

[0138] S12. For high-quality channel service set Sot i , all services Srv in i ∈ [1, m] ij , convert the signal-to-noise ratio of all services into a decimal signal-to-noise ratio Sdr ij ,

[0139] Sdr ij =power(10, Snr ij / 10)

[0140] ={{0.63,1,2,1.26},{0.79,2.51},{2,2051,0.63}}.

[0141] Calculate the signal-to-noise ratio

[0142] Cof_snr ij =1 / (1+exp((-1)* Sdr ij ))

[0143] = {{0.88,0.78},{0.92},{0.88,0.92}}.

[0144] Calculate the sum of the signal-to-noise ratio coefficients of all high-quality channel services as the slice signal-to-noise ratio coefficient

[0145] COF_snr i =∑ N Cof_snr ij ={1.66,0.92,1.81}, N is Sdr ij ∈Sot i .

[0146] S13. For non-premium channel services Sot i ', calculate the throughput coefficient of each non-premium channel service based on the service throughput

[0147] Cof_thr ij =Thr ij / Ttr ij ={{0.9,0.8},{0.3},{0.25}},

[0148] Calculate the delay coefficient of each non-premium channel service based on the delay

[0149] Cof_dly ij =exp((-1)*Dly ij / Dty ij )= {{0.72,0.67},{0.67},{0.45}}.

[0150] According to the throughput coefficient Cof_thr ij and delay coefficient Cof_dly ij Calculate the synthesis coefficient

[0151] Cof_ctd ij =Cof_thr ij *Cof_dly ij ={{0.64,0.54},{0.2},{0.11}}.

[0152] Calculate the sum of all synthesis coefficients as the slice synthesis coefficient

[0153] COF_ctd i =∑ M Cof_ctd ij ={1.18,0.2,0.11}, M is Sdr ij ∈Sot i '.

[0154] S14. For any slice Sec i , i∈[1,m], based on the slice signal-to-noise ratio coefficient COF_snr i and synthesis coefficient COF_ctd i Calculate the slice service performance coefficient

[0155] COF_spf i =(COF_snr i +COF_ctd i ) / n i ={0.71,0.56,0.64}.

[0156] S2. Determine the physical resource occupancy of the slice, and allocate a corresponding resource occupancy coefficient according to the size of the physical resource occupancy, which is the slice resource coefficient.

[0157] S21. Determine the physical resource occupancy of the slice.

[0158] Calculate any slice Sec i , the total number of physical resources occupied by i∈[1,m]

[0159] Pod i =∑ j=1 ni Prb ij ={30,19,14};

[0160] Calculate the physical resource occupancy of the slice

[0161] Roc i =Pod i / NRB i ={0.75,0.63,0.47}.

[0162] S22. Set physical resource occupancy threshold ROC th =0.7, dividing the physical resource occupancy rate into several ranges.

[0163] S23. Set the corresponding resource occupancy coefficient for each physical resource occupancy range, namely the resource occupancy high coefficient cof min =0.3, resource possession coefficient cof med =0.8, low resource occupancy coefficient cof max =1.2, and coefficient 1, respectively pairing each coefficient with each physical resource occupancy range.

[0164] S23. Determine the range to which the slice physical resource occupancy rate belongs, and obtain the corresponding resource occupancy coefficient as the slice resource coefficient.

[0165] When Roc i When <0.5, calculate the slice resource coefficient COF_src i =cof max ;

[0166] When 0.5≤Roc i ≤ROC th When calculating the slice resource coefficient COF_srci =1;

[0167] When ROC is met th <Roc i ≤ROC th +(1-ROC th ) / 2, calculate the slice resource coefficient COF_src i =cof med ;

[0168] When ROC is met th +(1-ROC th ) / 2<Roc i When <1, calculate the slice resource coefficient COF_src i =cof min .

[0169] Get the slice resource coefficient COF_src i ={0.8,1,1.2}.

[0170] S3. Calculate the slice service quality coefficient based on the congestion rate.

[0171] S31. Set the service congestion threshold Coj th =0.4%, obtain the business congestion rate Coj ij ≥Coj th The business is congested and is included in the congestion set Sct i ,i∈[1,m],

[0172] Sct i ={{Srv(1,1), Srv(1,3)}, {Srv(2,1), Srv(2,2)}, {Srv(3,1), Srv(3,2), Srv(3,3)}}.

[0173] Get the service congestion rate Coj ij <Coj th The services are non-congested services and are included in the non-congested set Sct i ',

[0174] Sct i '={{Srv(1,2), Srv(1,4)}, {}, {}}.

[0175] S32. Determine the service quality coefficient of the congested service based on the service congestion threshold and congestion rate

[0176] Cof_sql ij =Coj th / Coj ij={{0.8,0.5},{0.8,0.36},{0.8,1,0.67}};

[0177] Calculate the service quality coefficient of non-congested services

[0178] Coefficient Cof_sql ij ={{1,1},{},{}}.

[0179] S33. Determine the slice service quality coefficient based on the service quality coefficient of all services in the slice

[0180] COF_sql i =∑ j=1 ni Cof_sql ij / ni={0.83,0.58,0.82}.

[0181] S4. Determine the slice allocation priority based on the slice service performance coefficient, resource coefficient, and service quality coefficient.

[0182] Calculating slice allocation priority

[0183] Pri i = COF_spf i *COF_src i * COF_ sql i ={0.47,0.33,0.63};

[0184] The slices that did not implement resource allocation in the previous round are {Sec1,Sec3}, and the allocation priority of the slices that did not implement real-time resource allocation is adjusted Pri i '=σ* Pri i , the final slice allocation priority is {0.52, 0.33, 0.69}, and the proportional fairness PF algorithm is used to allocate the unallocated resources and update the total number of physical resource blocks of all slices.

[0185] Simulation experiment:

[0186] The 5G network inter-slice resource allocation method based on scalable adjustment (hereinafter referred to as SA-NSRA) of the present invention and other algorithms based on idle coefficient (hereinafter referred to as IC-NSRA) are simulated on the MATLAB platform. The network and service configuration are performed according to the above table. The RB allocation in the random TTI and the RB average allocation are obtained as follows: Figure 2 and Figure 3 shown.

[0187] like Figure 2As shown, during the RB allocation process in a random TTI, the IC-NSRA algorithm allocates fewer RB resources overall than the SA-NSRA algorithm of the present invention. This is because IC-NSRA only considers the amount of idle resources, while SA-NSRA can comprehensively adjust multiple factors, including signal-to-noise ratio, throughput, latency, resource utilization, and service congestion. Furthermore, this adjustment is scalable and can be dynamically increased based on actual service needs. In terms of congestion rate control, the two algorithms are equally effective. Furthermore, the fundamental difference between SA-NSRA and IC-NSRA is that the former prioritizes services with good channel quality for scheduling, but to prevent services with poor channel quality from being starved, it can forcibly increase their priority based on their starvation level, thereby ensuring fair treatment for all services and significantly improving the efficiency of system resource allocation. Whether for eMBB, uRLLC, or mMTC slicing, SA-NSRA allocates higher resources than IC-NSRA.

[0188] like Figure 3 As shown, the averaged RB allocation of the two schemes is similar. Similarly, both schemes allocate more RBs to eMBB slices. However, because the SA-NSRA algorithm of the present invention treats throughput and service latency equally when synthesizing service performance coefficients, the performance of uRLLC and uRLLC slices is similar, resulting in similar numbers of RBs. mMTC, on the other hand, prioritizes service connectivity and is relatively underappreciated.

[0189] The specific embodiments described herein are merely illustrative of the spirit of the present invention. Persons skilled in the art may make various modifications, additions, or substitutions to the described specific embodiments without departing from the spirit of the present invention or exceeding the scope of the appended claims.

[0190] Although this document frequently uses terms such as premium channel service, signal-to-noise ratio coefficient, throughput coefficient, synthesis coefficient, slice resource coefficient, and service quality coefficient, the use of other terms is not excluded. These terms are used solely to more conveniently describe and explain the essence of the present invention; interpreting them as any additional limitations is contrary to the spirit of the present invention.

Claims

1. A 5G network inter-slice resource allocation method based on scalable regulation, characterized in that: The following steps are involved: Determine slice quality and non-quality channel services based on signal-to-noise ratio; For high-quality channel services, the signal-to-noise ratio coefficient is calculated based on the signal-to-noise ratio. The signal-to-noise ratio coefficient is 1 / (1+exp((-1)*decimal signal-to-noise ratio)). For non-high-quality channel services, the composite coefficient is determined by multiplying the throughput coefficient by the delay coefficient. The throughput coefficient is the ratio of the throughput to the ideal throughput, and the delay coefficient is exp((-1)*delay / delay tolerance). The slice service performance coefficient is calculated based on the signal-to-noise ratio coefficient and the composite coefficient. Determine the physical resource occupancy of the slice, and allocate the corresponding resource occupancy coefficient according to the size of the physical resource occupancy, which is the slice resource coefficient; The slice service quality coefficient is calculated based on the congestion rate, including: Determine congested services and non-congested services based on the service congestion rate; determine the service quality coefficient of the congested service based on the ratio of the service congestion threshold and the congestion rate, and set the service quality coefficient of the non-congested service; determine the service quality coefficient of the slice based on the service quality coefficients of all services in the slice; Determine the slice allocation priority based on the slice service performance coefficient, resource coefficient, and service quality coefficient; Allocate unassigned resources based on their allocation priorities.

2. The method for allocating resources between 5G network slices based on scalable adjustment according to claim 1, wherein: A signal-to-noise ratio threshold is set. Services with a signal-to-noise ratio greater than the signal-to-noise ratio threshold are considered high-quality channel services, and services with a signal-to-noise ratio not greater than the signal-to-noise ratio threshold are considered non-high-quality channel services.

3. The method for allocating resources between 5G network slices based on scalable adjustment according to claim 1, wherein: The signal-to-noise ratio coefficient of each high-quality channel service is calculated according to the service signal-to-noise ratio, and the sum of all signal-to-noise ratio coefficients is calculated as the slice signal-to-noise ratio coefficient.

4. The method for allocating resources between 5G network slices based on scalable adjustment according to claim 3, wherein: The throughput coefficient of each non-premium channel service is calculated based on the service throughput, the delay coefficient of each non-premium channel service is calculated based on the delay, the synthesis coefficient is calculated based on the throughput coefficient and the delay coefficient, and the sum of all synthesis coefficients is calculated as the slice synthesis coefficient.

5. The method for allocating resources between 5G network slices based on scalable adjustment according to claim 4 is characterized in that: The service performance coefficient is calculated based on the signal-to-noise ratio coefficient and the synthesis coefficient, including: The ratio of the sum of the slice service signal-to-noise ratio and the slice synthesis coefficient to the number of services in the slice.

6. The method for allocating resources between 5G network slices based on scalable adjustment according to claim 1, wherein: The resource occupancy coefficient is set according to the physical resource occupancy rate, which is the slice resource coefficient, including: Set physical resource occupancy rate thresholds and divide physical resource occupancy rate ranges into several ranges; Set the corresponding resource occupancy coefficient for each physical resource occupancy range; Determine the range of the slice physical resource occupancy rate and obtain the corresponding resource occupancy coefficient as the slice resource coefficient.

7. The method for allocating resources between 5G network slices based on scalable adjustment according to claim 1, wherein: Calculate the service quality coefficient based on the congestion rate, including: Set service congestion thresholds and determine congested services and non-congested services based on service congestion rates; Determine the service quality coefficient for congested services based on the service congestion threshold and congestion rate, and set the service quality coefficient for non-congested services; The slice service quality coefficient is determined based on the service quality coefficients of all services in the slice.

8. The method for allocating resources between 5G network slices based on scalable adjustment according to claim 7, wherein: The slice service quality coefficient is determined based on the service quality coefficients of all services in the slice, including: The ratio of the sum of the service quality coefficients of all services in a slice to the number of services in the slice.

9. A 5G network slice resource allocation method based on scalable adjustment according to any one of claims 1 to 8, characterized in that: The slice allocation priority is the product of the slice service performance coefficient, the slice resource coefficient and the slice service quality coefficient; Set the adjustment coefficient to dynamically adjust the priority of the slices that did not implement resource allocation in the previous round to the final allocation priority. The final allocation priority is the product of the adjustment coefficient and the slice allocation priority.

10. The method for allocating resources between 5G network slices based on scalable adjustment according to claim 9, wherein: According to the allocation priority, the PF algorithm is used to allocate the unallocated resources and update the total number of physical resource blocks of all slices.

Images