Network slice access control method and system based on dynamic multitask

Abstract

The invention discloses a dynamic multitask-based network slice access control method and system, and relates to the technical field of communication network management and control, and the method comprises the steps: obtaining network related parameters, carrying out the business throughput capacity calculation and load evaluation based on the network related parameters, and obtaining the throughput capacity of a business in a slice and the load ratio of the slice; based on a preset multiplication coefficient, calculating a time delay coefficient and a throughput coefficient respectively based on the network related parameters and the throughput of the service in the slice; calculating an access criterion value of the slice and a control priority of a new arrival service based on the load ratio, the time delay coefficient and the throughput coefficient of the slice; and based on the service type label of the newly arriving service with the highest control priority of the newly arriving service, selecting the slice with the maximum access criterion value of the slice from the slices of the same type for access, determining the waiting times of the newly arriving service which is not accessed, and if the waiting times of the newly arriving service which is not accessed exceed a preset threshold value, accessing the newly arriving service which is not accessed. And dynamically adjusting the control priority of the corresponding new arrival service, so that the corresponding new arrival service is preferentially in the subsequent access slice.

Description

Technical Field

[0001] This invention relates to the field of communication network management and control technology, specifically a network slicing access control method and system based on dynamic multi-task. Background Technology

[0002] In recent years, with the rapid development of information technology, the number of mobile network applications and access devices has exploded. By 2023, the number of mobile devices worldwide had increased by nearly 500 million in the past five years. Furthermore, with the widespread application of numerous emerging vertical industries such as smart cities and edge computing, user needs have become more diversified. Among these, a common problem is how to achieve simple and effective access control.

[0003] In the prior art, patent number 202211365786.8 discloses a 5G network slicing access control method based on service type. This method first determines the service type, and then selects different principles to implement network slice access control based on whether it is a latency-sensitive service. This approach is simple, easy to implement, and efficient, but it does not give much consideration to the slice load issue, nor does it take into account the quality of the sliced ​​network. As more and more accesses occur, the slice load increases, the possibility of service collisions rises sharply, and the probability of access failure also increases dramatically. Summary of the Invention

[0004] To address the shortcomings mentioned in the background section, the present invention aims to provide a network slicing access control method and system based on dynamic multi-task.

[0005] Firstly, the objective of this invention can be achieved through the following technical solution: a network slicing access control method based on dynamic multi-task, the method comprising the following steps: Obtain network-related parameters, including slice attribute parameters, existing service parameters within the slice, and multiple newly arrived service parameters; calculate service throughput and assess load based on the network-related parameters to obtain the service throughput within the slice and the slice load ratio; Based on a preset multiplication factor, and based on network-related parameters and the throughput of services within the slice, the latency coefficient and throughput coefficient are calculated respectively; based on the slice's load ratio and the latency coefficient and throughput coefficient, the slice's access criterion value and the control priority of newly arriving services are calculated. Based on the service type label of the new arrival service with the highest control priority, within the same type of slice, the slice with the largest access criterion value is selected for access. The waiting number of new arrival services that have not been accessed is determined. If the waiting number of new arrival services that have not been accessed exceeds a preset threshold, the control priority of the corresponding new arrival service is dynamically adjusted so that the corresponding new arrival service is given priority in subsequent slice access.

[0006] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the slice attribute parameter includes slices. Current signal-to-noise ratio of the slice Total number of physical resource blocks Slice label ; The business parameters already stored in the slice include the slice itself. It already contains Business Corresponding to any business Current waiting time Delay tolerance Number of physical resource blocks occupied Business target throughput ; Multiple new arrival service parameters include multiple new service applications. Each new service has a waiting time delay Delay tolerance Request throughput and target throughput New business tags .

[0007] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the calculation process for the throughput of services within the slice is as follows: Set subcarrier bandwidth One resource block occupies a number of subcarriers ; Calculate the bandwidth of a single resource block ; slice The signal-to-noise ratio is converted to a decimal value. ,in, Represent a power function; calculate arbitrary slices Chinese business throughput ,in, It represents a logarithm with base 10.

[0008] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the calculation process of the load ratio of the slice is as follows: For any slice Calculate all of its services Total amount of physical resource blocks occupied Calculate slices load ; Set load threshold ; Calculate slices load ratio .

[0009] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: calculating the latency coefficient and throughput coefficient based on a preset multiplication factor and based on network-related parameters and the throughput of services within the slice, including the calculation of services already existing within the slice and the calculation of multiple newly arriving services, wherein the calculation of services already existing within the slice is as follows: Set the multiplication factor For slices Any existing business in First calculate the latency ratio throughput ratio Calculate its time delay coefficient. Calculate its throughput coefficient ,in, Represents an exponential function with the natural constant as its base; The calculations for multiple newly arriving services are as follows: For newly arriving business Similarly, first calculate its latency ratio. throughput ratio Calculate its time delay coefficient. Calculate its throughput coefficient .

[0010] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: the process of calculating the slice access criterion value based on the slice's load ratio, latency coefficient, and throughput coefficient, comprising: For any slice Calculate all business within it Mean of delay coefficient Calculate all business within it Mean throughput coefficient ; For any slice Calculate its access criterion value .

[0011] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: calculating the control priority of newly arriving services based on the load ratio, latency coefficient, and throughput coefficient of the slice. For any new business Calculate its control priority Find new businesses with the highest priority. and its corresponding business tags ; Find those that meet the conditions All slices Include it in the same tag set ;like If not empty, then... Find the slice with the maximum access criterion value. For new business Implement access; if If empty, then directly from Find the slice with the maximum access criterion value. For new business Implement access; Set delay increment factor Throughput Increment Coefficient Mixed increasing coefficient Hunger threshold For the current new business Any other services that have not been implemented in China The number of times they went hungry If the conditions are met If it is a time-delay service, then its priority is increased; if it is a time-delay service, then If it is a throughput-type business, then If it is a hybrid business, then The remaining new services, after priority updates, will be rearranged and await the next access.

[0012] Secondly, in order to achieve the above objectives, the present invention discloses a network slicing access control system based on dynamic multi-task, comprising: The data acquisition module is used to acquire network-related parameters, including slice attribute parameters, existing service parameters within the slice, and multiple newly arrived service parameters; based on the network-related parameters, it calculates service throughput and assesses load to obtain the throughput of services within the slice and the load ratio of the slice; The access permission module is used to calculate the latency coefficient and throughput coefficient based on a preset multiplication factor, and based on network-related parameters and the throughput of services within the slice respectively; and to calculate the access criterion value of the slice and the control priority of newly arriving services based on the slice's load ratio and latency coefficient and throughput coefficient. The slice priority access module is used to select the slice with the highest access criterion value within the same type of slice based on the service type label of the newly arrived service with the highest control priority. It determines the number of times a newly arrived service that has not been accessed waits. If the number of times a newly arrived service that has not been accessed waits exceeds a preset threshold, the control priority of the corresponding newly arrived service is dynamically adjusted so that the corresponding newly arrived service is given priority in subsequent slice access.

[0013] In another aspect of the present invention, in order to achieve the above-mentioned objective, a terminal device is disclosed, including a memory, a processor, and a computer program stored in the memory and capable of running on the processor. The memory stores the computer program capable of running on the processor, and when the processor loads and executes the computer program, it employs a network slicing access control method based on dynamic multitasking as described above.

[0014] In another aspect of the present invention, in order to achieve the above-mentioned objective, a computer-readable storage medium is disclosed, wherein the computer-readable storage medium stores a computer program, characterized in that, when the computer program is loaded and executed by a processor, it employs a network slicing access control method based on dynamic multitasking as described above.

[0015] The beneficial effects of this invention are: This invention can calculate the throughput capacity of a service based on the slice environment; calculate the slice load based on the amount of resources occupied by the service; calculate the latency ratio based on latency and latency tolerance; calculate the throughput ratio based on actual throughput and ideal throughput; and then calculate the latency coefficient and throughput coefficient of all services. It can also calculate the access criteria values ​​for different slices and calculate the corresponding control priority based on the status of new services; match the optimal slice for access based on the corresponding new service tags; and dynamically adjust the priority of starved new services. Furthermore, it ensures that services are always in a favorable slice environment, providing real-time assurance for improved customer experience and increasing the probability of successful slice access. Attached Figure Description

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

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

[0018] Example 1: like Figure 1 As shown, a network slicing access control method based on dynamic multi-task is described, which includes the following steps: S101: Obtain network-related parameters, including slice attribute parameters, existing service parameters within the slice, and multiple newly arrived service parameters; calculate service throughput and assess load based on the network-related parameters to obtain the service throughput within the slice and the slice load ratio; Specifically, the network-related parameters should be set as follows: Includes three types of tags ; Network slices Network slicing Current signal-to-noise ratio Total number of physical resource blocks Slice label ;slice It already contains Business Corresponding to any business Current waiting time Delay tolerance Number of physical resource blocks occupied Business target throughput There are currently multiple new business applications. Each new service has a waiting time delay Delay tolerance Request throughput and target throughput New business tags ; The calculation process for the throughput of services within a slice is as follows: Set subcarrier bandwidth One resource block occupies a number of subcarriers ; Calculate the bandwidth of a single resource block ; slice The signal-to-noise ratio is converted to a decimal value. ,in, Represent a power function; calculate arbitrary slices Chinese business throughput ,in, Represents a logarithm to the base 10; The calculation process for the load ratio of the slice is as follows: For any slice Calculate all of its services Total amount of physical resource blocks occupied Calculate slices load ; Set load threshold ; Calculate slices load ratio ; S102: Based on the preset multiplication factor, and based on the network-related parameters and the throughput of services within the slice, the latency coefficient and throughput coefficient are calculated respectively; based on the slice's load ratio and the latency coefficient and throughput coefficient, the slice's access criterion value and the control priority of newly arriving services are calculated. Based on a preset multiplication factor, and based on network-related parameters and the throughput of services within the slice, the latency coefficient and throughput coefficient are calculated respectively. This includes calculations for services already existing within the slice and calculations for multiple newly arriving services. The calculations for services already existing within the slice are as follows: Set the multiplication factor For slices Any business in First calculate the latency ratio throughput ratio Based on this, calculate its time delay coefficient. Calculate its throughput coefficient ,in, Represents an exponential function with the natural constant as its base; The calculations for multiple newly arriving services are as follows: For new business Similarly, first calculate its latency ratio. throughput ratio Based on this, calculate its time delay coefficient. Calculate its throughput coefficient ; The process of calculating the slice access criterion value based on the slice's load ratio, latency coefficient, and throughput coefficient includes: For any slice Calculate all business within it Mean of delay coefficient Calculate all business within it Mean throughput coefficient ; For any slice Calculate its access criterion value ; The control priority of newly arriving services is calculated based on the load ratio, latency coefficient, and throughput coefficient of the slice: For any new business Calculate its control priority Find new businesses with the highest priority. and its corresponding business tags ; S103: Based on the service type label of the new arrival service with the highest control priority, within the same type of slice, select the slice with the largest access criterion value for access, determine the waiting number of new arrival services that have not been accessed, and if the waiting number of new arrival services that have not been accessed exceeds a preset threshold, dynamically adjust the control priority of the corresponding new arrival service so that the corresponding new arrival service is given priority in subsequent slice access.

[0019] Find those that meet the conditions All slices Include it in the same tag set ;like If not empty, then... Find the slice with the maximum access criterion value. For new business Implement access; if If empty, then directly from Find the slice with the maximum access criterion value. For new business Implement access; Set delay increment factor Throughput Increment Coefficient Mixed increasing coefficient The incrementing coefficient is used to update the corresponding priority level. The greater the latency, the lower the priority; [This refers to a specific event or threshold, likely related to starvation.] For the current new business Any other services that have not been implemented in China The number of times they went hungry If the conditions are met If it is a time-delay service, then its priority is increased; if it is a time-delay service, then If it is a throughput-type business, then If it is a hybrid business, then The remaining new services will be rearranged after the priority is updated; access will be based on the updated priority, with higher priority services appearing earlier; then wait for the next access. 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 Table 1: Table 1. Services Existing in Each 5G Network Slice The details of new business are shown in Table 2: Table 2 New Arrival Business Status The basic data is shown in Table 3: Table 3 Basic Data This example describes a 5G network slicing access control method based on dynamic multi-task, including the following steps: service throughput capacity calculation, slice load assessment, latency and throughput coefficient synthesis, access criterion determination, and new service access control. Step 1: Calculate business throughput capacity; Step 1-1: Calculate the bandwidth of a single resource block ; Steps 1-2: Slice each piece The signal-to-noise ratio is converted to a decimal value. ; Calculate any slice Chinese business throughput ; Step 2: Slice load assessment; Step 2-1: For any slice Calculate all of its services Total amount of physical resource blocks occupied Calculate slices load ; Step 2-2: Calculate slices load ratio ; Step 3: Synthesize latency and throughput coefficients; Step 3-1: For the slice Any business in First calculate the latency ratio throughput ratio Based on this, calculate its time delay coefficient. Calculate its throughput coefficient ; Step 3-2: For new business Similarly, first calculate its latency ratio. throughput ratio Based on this, calculate its time delay coefficient. Calculate its throughput coefficient ; Step 4: Determine access criteria; Step 4-1: For any slice Calculate all business within it Mean of delay coefficient Calculate all business within it Mean throughput coefficient ; Step 4-2: For any slice Calculate its access criterion value ; Step 5: New service access control; Step 5-1: For any new business Calculate its control priority Find new businesses with the highest priority. and its corresponding business tags ; Step 5-2: Find those that meet the conditions All slices Include it in the same tag set ; If not empty, then... Find the slice with the maximum access criterion value of 0.32. For new business Implement access; Step 5-3: For the current new business Any other services that have not been implemented in China The number of times they went hungry None of them meet the conditions. Its priority does not increase, and it waits for the next access; Simulation experiment: The DM-NSAC-based 5G network slicing access control method of the present invention, based on dynamic multi-task, and the 5G network slicing access control method based on service type were simulated on a MATLAB platform. Network and service configurations were performed according to the above table. The resulting average access latency and access throughput are shown in the appendix. Figures 3 to 4 As shown.

[0020] like Figure 3As shown, both algorithms share the common operation of connecting latency-sensitive services to latency-sensitive slices to meet their latency requirements. Therefore, at the beginning of the simulation, the slice load is low, the possibility of service collisions is small, and the access latency of the slices is comparable. However, as the number of connected services increases, the slice links become increasingly congested, and the access latency of both algorithms increases. The difference lies in the fact that this DM-NSAC algorithm has a starvation compensation mechanism, which can effectively reduce service latency. Furthermore, it applies a latency increment coefficient to latency-sensitive services, which can quickly improve their access control priority. Reflected in the latency curve, this algorithm generally outperforms existing algorithms. like Figure 4 As shown, access throughput reflects slice bandwidth performance. Existing methods for throughput-sensitive services simply control the amount of physical resources consumed per unit of traffic within the transmission queue, without specific analysis of the specific problems. DM-NSAC, however, employs two approaches for throughput-sensitive services: first, accessing throughput-oriented slices; second, increasing the throughput increment factor to meet throughput requirements. Reflected in the curves, DM-NSAC consistently outperforms existing methods in throughput performance. Furthermore, as the number of access services increases, the latter's throughput jitter is significantly less than the former's, which is detrimental to improving customer experience and reduces the robustness of the sliced ​​network.

[0021] Example 2: To achieve the above objective, based on Example 1, as follows... Figure 5 As shown, this invention discloses a network slicing access control system based on dynamic multi-task, comprising: The data acquisition module 11 is used to acquire network-related parameters, including slice attribute parameters, existing service parameters within the slice, and multiple newly arrived service parameters; based on the network-related parameters, it calculates service throughput and assesses load to obtain the throughput of services within the slice and the load ratio of the slice; The access permission module 12 is used to calculate the latency coefficient and throughput coefficient based on a preset multiplication factor, and based on network-related parameters and the throughput of services within the slice respectively; and to calculate the access criterion value of the slice and the control priority of newly arriving services based on the slice's load ratio, latency coefficient, and throughput coefficient. The slice priority access module 13 is used to select the slice with the largest access criterion value within the same type of slice based on the service type label of the newly arrived service with the highest control priority. It determines the number of times a newly arrived service that has not been accessed waits. If the number of times a newly arrived service that has not been accessed waits exceeds a preset threshold, it dynamically adjusts the control priority of the corresponding newly arrived service so that the corresponding newly arrived service is given priority in subsequent slice access.

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

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

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

[0025] 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 network slicing access control method based on dynamic multi-task, characterized in that, The method includes the following steps: Obtain network-related parameters, including slice attribute parameters, existing service parameters within the slice, and multiple newly arrived service parameters; calculate service throughput and assess load based on the network-related parameters to obtain the service throughput within the slice and the slice load ratio; Based on a preset multiplication factor, and based on network-related parameters and the throughput of services within the slice, the latency coefficient and throughput coefficient are calculated respectively; based on the slice's load ratio and the latency coefficient and throughput coefficient, the slice's access criterion value and the control priority of newly arriving services are calculated. Based on the service type label of the new arrival service with the highest control priority, within the same type of slice, the slice with the largest access criterion value is selected for access. The waiting number of new arrival services that have not been accessed is determined. If the waiting number of new arrival services that have not been accessed exceeds a preset threshold, the control priority of the corresponding new arrival service is dynamically adjusted so that the corresponding new arrival service is given priority in subsequent slice access.

2. The network slicing access control method based on dynamic multi-task as described in claim 1, characterized in that, The slice attribute parameters include slice Current signal-to-noise ratio of the slice Total number of physical resource blocks Slice label ; The business parameters already stored in the slice include the slice itself. It already contains Business Corresponding to any business Current waiting time Delay tolerance Number of physical resource blocks occupied Business target throughput ; Multiple new arrival service parameters include multiple new service applications. Each new service has a waiting time delay Delay tolerance Request throughput and target throughput New business tags .

3. The network slicing access control method based on dynamic multi-task as described in claim 1, characterized in that, The calculation process for the throughput of services within the slice is as follows: Set subcarrier bandwidth One resource block occupies a number of subcarriers ; Calculate the bandwidth of a single resource block ; slice The signal-to-noise ratio is converted to a decimal value. ,in, Represent a power function; calculate arbitrary slices Chinese business throughput ,in, It represents a logarithm with base 10.

4. The network slicing access control method based on dynamic multi-task as described in claim 1, characterized in that, The calculation process for the load ratio of the slice is as follows: For any slice Calculate all of its services Total amount of physical resource blocks occupied Calculate slices load ; Set load threshold ; Calculate slices load ratio .

5. The network slicing access control method based on dynamic multi-task as described in claim 1, characterized in that, The latency coefficient and throughput coefficient are calculated based on a preset multiplication factor and network-related parameters and the throughput of services within the slice, respectively. This includes calculations for services already existing within the slice and calculations for multiple newly arriving services. The calculations for services already existing within the slice are as follows: Set the multiplication factor For slices Any existing business in First calculate the latency ratio throughput ratio Calculate its time delay coefficient. Calculate its throughput coefficient ,in, Represents an exponential function with the natural constant as its base; The calculations for multiple newly arriving services are as follows: For newly arriving business Similarly, first calculate its latency ratio. throughput ratio Calculate its time delay coefficient. Calculate its throughput coefficient .

6. The network slicing access control method based on dynamic multi-task as described in claim 1, characterized in that, The process of calculating the slice access criterion value based on slice load ratio, latency coefficient, and throughput coefficient includes: For any slice Calculate all business within it Mean of delay coefficient Calculate all business within it Mean of throughput coefficient ; For any slice Calculate its access criterion value .

7. The network slicing access control method based on dynamic multi-task as described in claim 6, characterized in that, The control priority of newly arriving services is calculated based on the load ratio, latency coefficient, and throughput coefficient of the slice: For any new business Calculate its control priority Find new businesses with the highest priority. and its corresponding business tags ; Find those that meet the conditions All slices Include it in the same tag set ;like If not empty, then... Find the slice with the maximum access criterion value. For new business Implement access; if If empty, then directly from Find the slice with the maximum access criterion value. For new business Implement access; Set delay increment factor Throughput Increment Coefficient Mixed increasing coefficient Hunger threshold For the current new business Any other services that have not been implemented in China The number of times they went hungry If the conditions are met If it is a time-delay service, then its priority is increased; if it is a time-delay service, then If it is a throughput-type business, then ; If it is a hybrid business, then The remaining new services, after priority updates, will be rearranged and await the next access.

8. A network slicing access control system based on dynamic multi-task, employing the network slicing access control method based on dynamic multi-task as described in any one of claims 1 to 7, characterized in that, include: The data acquisition module is used to acquire network-related parameters, including slice attribute parameters, existing service parameters within the slice, and multiple newly arrived service parameters; based on the network-related parameters, it calculates service throughput and assesses load to obtain the throughput of services within the slice and the load ratio of the slice; The access permission module is used to calculate the latency coefficient and throughput coefficient based on a preset multiplication factor, and based on network-related parameters and the throughput of services within the slice respectively; and to calculate the access criterion value of the slice and the control priority of newly arriving services based on the slice's load ratio and latency coefficient and throughput coefficient. The slice priority access module is used to select the slice with the highest access criterion value within the same type of slice based on the service type label of the newly arrived service with the highest control priority. It determines the number of times a newly arrived service that has not been accessed waits. If the number of times a newly arrived service that has not been accessed waits exceeds a preset threshold, the control priority of the corresponding newly arrived service is dynamically adjusted so that the corresponding newly arrived service is given priority in subsequent slice access.

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 network slicing access control method based on dynamic multitasking 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 network slicing access control method based on dynamic multitasking as described in any one of claims 1 to 7.

Images