A method and system for 5G network slice inter-resource allocation based on service distribution

Abstract

The application discloses a 5G network slice inter-resource allocation method and system based on service distribution, relates to the technical field of resource processing, and first calculates service priorities, calculates the throughput priority, the time delay priority and the connection density priority of different slices according to the throughput, the time delay and the connection density of different services in the slice, and then combines the weighted priorities into service priorities; the idle priority is calculated by combining the service congestion rate with the number of idle resource blocks; the composite priority is converted by using the service priority and the idle priority; the number of services in the slice center area is screened according to the signal level of different services, and the comprehensive priority for evaluating the resource allocation of each slice is finally obtained according to the number of services; the PF algorithm is adopted to allocate resources among the slices; and dynamic resource control is implemented on the slices according to the load state and the service quality of the slices.

Description

Technical Field

[0001] This invention relates to the field of resource processing technology, specifically a method and system for resource allocation among 5G network slices based on service distribution. Background Technology

[0002] In 5G networks, resource allocation between slices is a key factor in ensuring service quality. By allocating different resources to different types of data streams, higher network efficiency can be achieved while meeting the needs of various services. However, how to implement a simple and efficient method for resource allocation between slices remains an unsolved problem. To address this, existing patent number 202411435636.9 discloses a network slice resource allocation method based on idle coefficient (IC-NSRA). This method calculates the idle coefficient of each slice by utilizing the number of idle resources and the total number of resources in each slice, combined with the congestion status of each service within the slice. It then combines load priority and signal priority to obtain a comprehensive priority for evaluating the resource allocation of each slice. IC-NSRA can effectively reduce slice congestion rates, but it also has some problems: firstly, the slice label type is fixed, making it impossible to calculate mixed-type services; secondly, the signal quality level indicators are not refined according to the specific service type and location, thus preventing dynamic resource allocation of slices. 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 among 5G network slices based on service distribution. Firstly, the objective of this invention can be achieved through the following technical solution: a resource allocation method among 5G network slices based on service distribution, the method comprising the following steps: Obtain resource service data of network slices, wherein the resource service data of network slices includes the total number of physical resource blocks allocated to the network slice, the number of idle physical resource blocks at the current time, the average throughput, average latency, average connection density, service reference signal received power and service congestion rate generated by services within the network slice in the first two time slots at the current time. The throughput priority, latency priority, and connection density priority of different slices are calculated based on the average throughput, average latency, and average connection density generated by services within the network slice in the two time slots before the current time. The idle priority is calculated based on the service congestion rate, the total number of physical resource blocks allocated to the network slice, and the number of idle physical resource blocks at the current time. Based on preset throughput weight, latency weight, and connection density weight, the throughput priority, latency priority, and connection density priority of different slices are weighted and merged to obtain the service priority. The composite priority is then synthesized based on the service priority and idle priority. The number of services whose service reference signal received power is greater than or equal to a preset service reference signal received power threshold is obtained. The ratio of the number of services to the total number of services in the slice is calculated to obtain the central service ratio. The final allocation priority of the network slice is calculated based on the composite priority and the central service ratio. The network slice resource is allocated based on the final allocation priority of the network slice.

[0004] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the resource service data of the network slice as follows: include Network slices Network slicing Total number of allocated physical resource blocks The number of free physical resource blocks at the current moment. ;slice It already contains Business Corresponding to any business The average throughput generated in the two time slots before the current moment Average latency and average connection density Service reference signal received power and business congestion rate .

[0005] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the calculation process for the throughput priority, latency priority, and connection density priority of the different slices is as follows: For any slice Calculate all of its services Sum of average throughput The sum of average delays and the sum of average connection densities ; Calculate the sum of throughput for all slices The sum of the reciprocals of the average delay of all slices And the sum of the inverses of the average connectivity density of all slices. ; Calculate arbitrary slices throughput priority Arbitrary slice Delay priority and arbitrary slices Connection density priority .

[0006] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the calculation of the idle priority is as follows: For any slice Calculate all of its services Mathematical expectation of congestion rate ; Calculate all slices idle priority .

[0007] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the calculation process of the composite priority, as follows: Set throughput weight Delay weight ; Calculate connection density weights ; For any slice Calculate its business priority ; Calculate arbitrary slices Composite priority .

[0008] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the calculation process of the central business ratio is as follows: Set the center reference signal received power threshold For any slice Count all those that meet the conditions Business quantity ; Set the center level Computing center business ratio .

[0009] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the calculation of the final allocation priority of the network slice is as follows: Calculate arbitrary slices Final allocation priority: Based on the final allocation priority of network slices, the resource allocation of network slices adopts the proportionally fair PF algorithm to allocate unallocated resources and update the total number of physical resource blocks of all slices.

[0010] Secondly, in order to achieve the above objectives, this invention discloses a resource allocation system for 5G network slices based on service distribution, comprising: The data acquisition module is used to acquire the resource service data of the network slice, wherein the resource service data of the network slice includes the total number of physical resource blocks allocated to the network slice, the number of idle physical resource blocks at the current time, the average throughput, average latency, average connection density, service reference signal received power and service congestion rate generated by the services within the network slice in the first two time slots at the current time. The idle priority module is used to calculate the throughput priority, latency priority and connection density priority of different slices based on the average throughput, average latency and average connection density generated by services in the first two time slots of the current time. The idle priority is calculated based on the service congestion rate, the total number of physical resource blocks allocated to the network slice and the number of idle physical resource blocks at the current time. The composite priority module is used to perform weighted merging calculations on the throughput priority, latency priority and connection density priority of different slices based on preset throughput weight, latency weight and connection density weight to obtain the service priority, and synthesize the composite priority based on the service priority and idle priority; The resource allocation module is used to obtain the number of services whose service reference signal received power is greater than or equal to the preset service reference signal received power threshold, calculate the ratio of the number of services to the total number of services in the slice to obtain the central service ratio, calculate the final allocation priority of the network slice based on the composite priority and the central service ratio, and perform resource allocation of the network slice based on the final allocation priority of the network slice.

[0011] 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. When the processor loads and executes the computer program, it employs a resource allocation method for 5G network slices based on service distribution as described above.

[0012] In another aspect of the present invention, in order to achieve the above-mentioned 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 5G network slices based on service distribution as described above is adopted.

[0013] The beneficial effects of this invention are: This invention can perform detailed analysis of service types within a slice and calculate the throughput priority, latency priority, and connection density priority of different slices, and then convert these into service priorities. It can calculate idle priority based on the congestion status of services and the number of idle resource blocks; it can calculate composite priority by combining service priority and idle priority; it can identify all services within the central area of ​​a slice, calculate the final allocation priority based on the distribution of central services, and implement dynamic resource allocation between slices; it can ensure that services are always in a favorable slice environment, providing real-time assurance for improved customer experience, and realizing dynamic allocation of resources within a slice. Attached Figure Description

[0014] 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 comparison chart of the RB allocation of the random TTI of this invention and other algorithms; Figure 4 This is a comparison chart of the average RB allocation of this invention and other algorithms; Figure 5 This is a schematic diagram of the system structure of the present invention. Detailed Implementation

[0015] 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.

[0016] Example 1: like Figure 1 As shown, a resource allocation method for 5G network slices based on service distribution includes the following steps: S101: Obtain the resource service data of the network slice, wherein the resource service data of the network slice includes the total number of physical resource blocks allocated to the network slice, the number of idle physical resource blocks at the current time, the average throughput, average latency, average connection density, service reference signal received power and service congestion rate generated by the services within the network slice in the first two time slots at the current time. Specifically, the resource service data for network slicing is as follows: include Network slices Network slicing Total number of allocated physical resource blocks The number of free physical resource blocks at the current moment. ;slice It already contains Business Corresponding to any business The average throughput generated in the two time slots before the current moment Average latency and average connection density Service reference signal received power and business congestion rate ; S102: The throughput priority, latency priority and connection density priority of different slices are calculated based on the average throughput, average latency and average connection density generated by the services in the first two time slots of the current time. The idle priority is calculated based on the service congestion rate, the total number of physical resource blocks allocated to the network slice and the number of idle physical resource blocks at the current time. The calculation process for throughput priority, latency priority, and connection density priority of different slices is as follows: For any slice Calculate all of its services Sum of average throughput The sum of average delays ), and the sum of average connection densities. ; Calculate the sum of throughput for all slices The sum of the reciprocals of the average delay of all slices And the sum of the inverses of the average connectivity density of all slices. ; Calculate arbitrary slices throughput priority Arbitrary slice Delay priority and arbitrary slices Connection density priority ; The calculation process for idle priority: For any slice Calculate all of its services Mathematical expectation of congestion rate ; Calculate all slices idle priority ; S103: Based on preset throughput weight, latency weight, and connection density weight, the throughput priority, latency priority, and connection density priority of different slices are weighted and merged to obtain the service priority. The composite priority is then synthesized based on the service priority and idle priority. The process for determining composite priority is as follows: Set throughput weight Delay weight ; Calculate connection density weights ; For any slice Calculate its business priority ; Calculate arbitrary slices Composite priority ; S104: Obtain the number of services whose service reference signal received power is greater than or equal to the preset service reference signal received power threshold, calculate the ratio of the number of services to the total number of services in the slice to obtain the central service ratio, calculate the final allocation priority of the network slice based on the composite priority and the central service ratio, and allocate network slice resources based on the final allocation priority of the network slice.

[0017] The calculation process for the central business ratio is as follows: Set the center reference signal received power threshold For any slice Count all those that meet the conditions Business quantity ; Set the center level Computing center business ratio ; The final allocation priority of network slices is calculated as follows: Calculate arbitrary slices Final allocation priority: Based on the final allocation priority of network slices, the resource allocation of network slices adopts the proportionally fair PF algorithm to allocate unallocated resources and update the total number of physical resource blocks of all slices.

[0018] Specifically, the present invention will be further illustrated below through embodiments: 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 service distribution, including the following steps: service priority calculation, service congestion control, composite priority determination, central service identification, and inter-slice resource allocation. Step 1: Calculate business priority; Step 1-1: For any slice Calculate all of its services Sum of average throughput The sum of average delays and the sum of average connection densities ; Step 1-2: Calculate the sum of throughput for all slices. The sum of the reciprocals of the average delay of all slices And the sum of the inverses of the average connectivity density of all slices. ; Steps 1-3: Calculate any slice throughput priority Arbitrary slice Delay priority and arbitrary slices Connection density priority ; Step 2: Service congestion control; Step 2-1: For any slice Calculate all of its services Mathematical expectation of congestion rate ; Step 2-2: Calculate all slices idle priority ; Step 3: Determine the composite priority; Step 3-1: Calculate the connection density weights ; Step 3-2: For any slice Calculate its business priority ; Step 3-3: Calculate any slice Composite priority ; Step 4: Central Business Identification; Step 4-1: For any slice Count all those that meet the conditions Business quantity ; Step 4-2: Set the center level Computing center business ratio ; Step 5: Resource allocation between slices; Step 5-1: Calculate any slice Final allocation priority ; Step 5-2: The system uses a proportionally fair PF algorithm to allocate unallocated resources based on this priority and updates the total number of physical resource blocks for all slices. Simulation experiment: The SD-NSRA resource allocation method for 5G network slices based on service distribution of the present invention was simulated on a MATLAB platform with the IC-NSRA algorithm based on idle coefficient. Network and service configurations were performed according to the above table. The resulting RB allocation in the random TTI and the average RB allocation are shown in the appendix. Figures 3-4 As shown.

[0019] like Figure 3 As shown, in the RB allocation process in random TTI, the IC-NSRA algorithm based on the idle coefficient generally allocates fewer RB resources than the SD-NSRA algorithm in this paper. This is because SD-NSRA, in addition to considering the idle resource quantity factor involved in the IC-NSRA algorithm, also calculates the distribution of services and allocates more resources to services in the center area of ​​the slice, because the service signal quality level in this area is the highest and the customer perception is better. In terms of congestion rate control, the two algorithms are equally effective. In addition, since SD-NSRA does not consider the slice type separately like IC-NSRA, slices of different label types are dynamically adjusted more by weight. Therefore, in the allocation graph, because the throughput weight is higher than the delay weight, the resources allocated to eMBB slices are significantly higher than those allocated to uRLLC slices, and so on. like Figure 4As shown, the RB allocation of the two schemes is not significantly different after averaging. Similarly, both schemes allocate more RBs to eMBB slices, but due to the signal level settings in Tables 2 and 3, the proportion of services in the central area of ​​eMBB and mMTC slices is larger, thus enabling them to acquire more RB resources. However, the number of services in the center and edge of uRLLC slices is not significantly different, resulting in little difference in the final number of RBs acquired.

[0020] Example 2: To achieve the above objective, based on Example 1, as follows... Figure 5 As shown, this invention discloses a resource allocation system for 5G network slices based on service distribution, comprising: The data acquisition module 11 is used to acquire the resource service data of the network slice, wherein the resource service data of the network slice includes the total number of physical resource blocks allocated to the network slice, the number of idle physical resource blocks at the current time, the average throughput, average latency, average connection density, service reference signal received power and service congestion rate generated by the services in the network slice in the first two time slots at the current time. The idle priority module 12 is used to calculate the throughput priority, latency priority and connection density priority of different slices based on the average throughput, average latency and average connection density generated by the services in the first two time slots of the current time. It also calculates the idle priority based on the service congestion rate, the total number of physical resource blocks allocated to the network slice and the number of idle physical resource blocks at the current time. The composite priority module 13 is used to perform weighted merging calculations on the throughput priority, latency priority and connection density priority of different slices based on preset throughput weight, latency weight and connection density weight to obtain the service priority, and synthesize the composite priority based on the service priority and idle priority. The resource allocation module 14 is used to obtain the number of services whose service reference signal received power is greater than or equal to the preset service reference signal received power threshold, calculate the ratio of the number of services to the total number of services in the slice to obtain the central service ratio, calculate the final allocation priority of the network slice based on the composite priority and the central service ratio, and perform resource allocation of the network slice based on the final allocation priority of the network slice.

[0021] 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.

[0022] 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.

[0023] 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.

[0024] 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 5G network slices based on service distribution, characterized in that, The method includes the following steps: Obtain resource service data of network slices, wherein the resource service data of network slices includes the total number of physical resource blocks allocated to the network slice, the number of idle physical resource blocks at the current time, the average throughput, average latency, average connection density, service reference signal received power and service congestion rate generated by services within the network slice in the first two time slots at the current time. The throughput priority, latency priority, and connection density priority of different slices are calculated based on the average throughput, average latency, and average connection density generated by services within the network slice in the two time slots before the current time. The idle priority is calculated based on the service congestion rate, the total number of physical resource blocks allocated to the network slice, and the number of idle physical resource blocks at the current time. Based on preset throughput weight, latency weight, and connection density weight, the throughput priority, latency priority, and connection density priority of different slices are weighted and merged to obtain the service priority. The composite priority is then synthesized based on the service priority and idle priority. The number of services whose service reference signal received power is greater than or equal to a preset service reference signal received power threshold is obtained. The ratio of the number of services to the total number of services in the slice is calculated to obtain the central service ratio. The final allocation priority of the network slice is calculated based on the composite priority and the central service ratio. The network slice resource is allocated based on the final allocation priority of the network slice.

2. The resource allocation method among 5G network slices based on service distribution according to claim 1, characterized in that, The resource service data of the network slice is as follows: include Network slices Network slicing Total number of allocated physical resource blocks The number of free physical resource blocks at the current moment. ;slice It already contains Business Corresponding to any business The average throughput generated in the two time slots before the current moment Average latency and average connection density Service reference signal received power and business congestion rate .

3. The resource allocation method among 5G network slices based on service distribution according to claim 1, characterized in that, The calculation process for the throughput priority, latency priority, and connection density priority of the different slices is as follows: For any slice Calculate all of its services Sum of average throughput The sum of average delays and the sum of average connection densities ; Calculate the sum of throughput for all slices The sum of the reciprocals of the average delay of all slices And the sum of the inverses of the average connectivity density of all slices. ; Calculate arbitrary slices throughput priority Arbitrary slice Delay priority and arbitrary slices Connection density priority .

4. The resource allocation method among 5G network slices based on service distribution according to claim 1, characterized in that, The idle priority is calculated as follows: For any slice Calculate all of its services Mathematical expectation of congestion rate ; Calculate all slices idle priority .

5. A method for resource allocation among 5G network slices based on service distribution according to claim 1, characterized in that, The calculation process for the composite priority is as follows: Set throughput weight Delay weight ; Calculate connection density weights ; For any slice Calculate its business priority ; Calculate arbitrary slices Composite priority .

6. The resource allocation method among 5G network slices based on service distribution according to claim 1, characterized in that, The calculation process for the central business ratio is as follows: Set the center reference signal received power threshold For any slice Count all those that meet the conditions Business quantity ; Set the center level Computing center business ratio .

7. The resource allocation method among 5G network slices based on service distribution according to claim 1, characterized in that, The final allocation priority of the network slice is calculated as follows: Calculate arbitrary slices Final allocation priority: Based on the final allocation priority of network slices, the resource allocation of network slices adopts the proportionally fair PF algorithm to allocate unallocated resources and update the total number of physical resource blocks of all slices.

8. A resource allocation system for 5G network slices based on service distribution, employing the resource allocation method for 5G network slices based on service distribution as described in any one of claims 1 to 7, characterized in that, include: The data acquisition module is used to acquire the resource service data of the network slice, wherein the resource service data of the network slice includes the total number of physical resource blocks allocated to the network slice, the number of idle physical resource blocks at the current time, the average throughput, average latency, average connection density, service reference signal received power and service congestion rate generated by the services within the network slice in the first two time slots at the current time. The idle priority module is used to calculate the throughput priority, latency priority and connection density priority of different slices based on the average throughput, average latency and average connection density generated by services in the first two time slots of the current time. The idle priority is calculated based on the service congestion rate, the total number of physical resource blocks allocated to the network slice and the number of idle physical resource blocks at the current time. The composite priority module is used to perform weighted merging calculations on the throughput priority, latency priority and connection density priority of different slices based on preset throughput weight, latency weight and connection density weight to obtain the service priority, and synthesize the composite priority based on the service priority and idle priority; The resource allocation module is used to obtain the number of services whose service reference signal received power is greater than or equal to the preset service reference signal received power threshold, calculate the ratio of the number of services to the total number of services in the slice to obtain the central service ratio, calculate the final allocation priority of the network slice based on the composite priority and the central service ratio, and perform resource allocation of the network slice based on the final allocation priority of the network slice.

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 5G network slices based on service distribution, 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 5G network slices based on service distribution, as described in any one of claims 1 to 7.

Images