A 5G network slice access control method based on service type

Abstract

The application discloses a 5G network slice access control method based on service type, which comprises the following steps: 1) in a 5G network supporting multiple network slices, the type of a newly arrived service is judged, and the service is divided into a time delay sensitive service and a non-time delay sensitive service; if the service is the time delay sensitive service, step 2) is executed; if the service is the non-time delay sensitive service, step 3) is executed; 2) a bearing slice of the time delay sensitive service is selected; 3) a bearing slice of the non-time delay sensitive service is selected; 4) the next service needing transmission is waited for, and step 1) is executed. The application can minimize the time delay of the time delay sensitive service, realize the relative fairness of the time delay of various services, minimize the transmission waiting time of the non-time delay sensitive service, and improve user perception.

Description

Technical Field

[0001] This invention relates to a 5G network slice access control method, and more particularly to a 5G network slice access control method based on service type. Background Technology

[0002] In 5G network service application scenarios, the industry has proposed three scenarios: enhanced mobile broadband (eMBB), massive machine-type communications (mMTC), and ultra-reliable and low-latency communications (uRLLC). These three scenarios place different demands on 5G networks regarding speed, latency, and reliability. For example, eMBB services have relatively high requirements for network bandwidth and transmission rate; uRLLC services, on the other hand, have relatively high requirements for network latency and also require a certain level of network reliability.

[0003] To meet the performance requirements of different types of services on 5G networks, while also satisfying the requirements for service isolation, 5G network slicing technology has emerged.

[0004] Network slicing technology is now widely used in network information data transmission services. Each slice can be viewed as a fully functional logical network, and it is a key technology for achieving network flexibility and scalability.

[0005] 5G network slicing technology can build virtual, dedicated network blocks on the same hardware network equipment of an operator, so that they can be allocated to different users to meet the different network performance requirements of different users.

[0006] In multi-service scenarios, a single user may handle multiple different types of services, thus requiring different network performance metrics. When multiple performance metrics exist, the system needs to be able to divide the network into multiple slices and allocate them to appropriate slices based on the different performance requirements of different services, so that the network slice allocated to each user can be well adapted to the corresponding service.

[0007] Regarding 5G network slicing scheduling methods, some existing research uses game theory for resource allocation and service scheduling in network slicing. By assuming a game between users and network slice access providers, resource allocation is achieved while maximizing social benefits. However, this method has a drawback: it only guarantees the interests of the majority of users and access providers, leaving a minority of mobile users with very poor service quality, or even no service at all.

[0008] Other research uses the average allocation theory to divide network resources and schedule services. While this average allocation and scheduling of resources ensures fairness for all users, it ignores the different network performance requirements of various user services. For example, some services are sensitive to latency, while others are sensitive to bandwidth. This can lead to performance degradation and fail to adequately meet service needs and user experience.

[0009] Therefore, based on the above reasons, and considering that different users have different network performance requirements, how the system can allocate network slice resources to appropriate slices according to the different network performance requirements of different services during network slicing and service scheduling, so that the network slice allocated to each user can better adapt to the corresponding service, is a technical problem that urgently needs to be solved. Summary of the Invention

[0010] Purpose of the invention: The technical problem to be solved by the present invention is to provide a 5G network slicing access control method based on service type, which addresses the shortcomings of the existing technology.

[0011] To address the aforementioned technical problems, this invention discloses a 5G network slicing access control method based on service type, comprising the following steps:

[0012] Step 1: In a 5G network that supports multiple network slices, determine the type of the newly arrived service and classify it into latency-sensitive services and non-latency-sensitive services; if it is a latency-sensitive service, proceed to Step 2; if it is a non-latency-sensitive service, proceed to Step 3.

[0013] Step 2: Select the bearer slice for latency-sensitive services, as follows:

[0014] Considering the total traffic volume in the transmission waiting queue of each network slice, the estimated time required for each network slice to complete the transmission of a newly arrived service is calculated. The network slice with the smallest estimated time is selected as the bearer slice for the newly arrived service. When the estimated time is less than the latency requirement of the service itself, the newly arrived service is added to the end of the waiting queue of the selected slice and then waits to be transmitted. When the estimated time is greater than or equal to the latency requirement of the service itself, the newly arrived service is added to the waiting queue of the selected slice, and the order of all services waiting to be transmitted in the waiting queue is reordered and then waits to be transmitted.

[0015] Step 3: Select the bearer slice for non-latency-sensitive services, as follows:

[0016] Considering the physical resources and the remaining total traffic waiting to be transmitted in each network slice, calculate the ratio of physical resources to the remaining total traffic waiting to be transmitted in each slice, and select the network slice with the largest ratio as the slice to carry non-latency-sensitive services.

[0017] Step 4: Wait for the next service to arrive, then proceed to Step 1.

[0018] The 5G network described in step 1 includes N network slices, with the i-th network slice labeled SEC. i , i∈[1,N]; for network slice SEC i That is, the number of physical resources owned by the i-th network slice is RES. i In the aforementioned 5G network, the amount of traffic that a unit of physical resource can carry per unit of time is defined as TRA; let network slice SEC be... i There are already N in the transmission waiting queue. i There are several services, and the service volume of the j-th service is TRA. i-j , where j∈[1,N i In the 5G network described above, when a new service arrives and needs to be transmitted, let the amount of service that the newly arrived service needs to transmit be TRA. arr .

[0019] The specific method for selecting the bearer slice for latency-sensitive services as described in step 2 includes:

[0020] Step 2.1: Calculate the total traffic volume in the transmission waiting queue of each network slice;

[0021] Step 2.2: Calculate the estimated time required for each network slice to complete the transmission of newly arriving services;

[0022] Step 2.3: Determine the bearer slice for latency-sensitive services;

[0023] Step 2.4: Determine the position of the newly arrived delay-sensitive service in the transmission waiting queue of the bearer slice described in Step 2.3.

[0024] Step 2.1 involves calculating the total traffic TRA in the transmission waiting queue of each network slice. i Specific methods include:

[0025]

[0026] Among them, SEC i N represents the i-th network slice. i This represents the number of services in the transmission waiting queue, where the traffic volume of the j-th service is TRA. i-j For network slicing SECi The total traffic volume in the transmission waiting queue is TRA i .

[0027] Step 2.2, which involves calculating the estimated time required for each network slice to complete the transmission of a newly arriving service, includes the following specific methods:

[0028] Without changing the original order of services in the waiting queue, network slicing SEC i The estimated time required to complete the new arrival traffic transmission is T. i ,but:

[0029] T i =(TRA i +TRA arr ) / (RES i *TRA)

[0030] Among them, RES i Let TRA represent the physical resources owned by the i-th network slice, and let TRA represent the traffic volume that a unit of physical resources can carry per unit of time. arr The amount of traffic that needs to be transmitted for newly arriving services.

[0031] Step 2.3, which describes the method for determining the bearer slice for latency-sensitive services, specifically includes:

[0032] Based on the calculated estimated time T required to complete the transmission of the newly arrived service using the i-th network slice. i Where i∈[1,N], the estimated time T is chosen. i The network slice with the smallest estimated time T is selected as the bearer slice for newly arriving latency-sensitive services, thus obtaining a defined bearer slice. i The value is labeled as label T.

[0033] Step 2.4, which describes determining the position of a newly arriving delay-sensitive service in the transmission waiting queue of the bearer slice determined in step 2.3, specifically includes the following methods:

[0034] Let the latency requirement of a latency-sensitive service be... If the latency requirement is met, that is:

[0035]

[0036] Then, the newly arrived latency-sensitive service is added to the end of the transmission waiting queue in the bearer slice determined in step 2.3, and then step 4 is executed;

[0037] If the above latency requirements are not met, the order of each service in the transmission waiting queue in the determined bearer slice described in step 2.3 will be adjusted according to the preset rules, and then step 4 will be executed.

[0038] The preset rules mentioned in step 2.4 are as follows:

[0039] Let the determined bearer slice in step 2.3 be the j-th network slice, and its transmission waiting queue contain N... j There are several services, and the latency requirement for the k-th service is TRA. j-k , where k∈[1,N j ] Calculate the timeout transmission time for each service separately. Right now:

[0040]

[0041] Calculate the timeout transmission time for newly arrived latency-sensitive services. Right now:

[0042]

[0043] Based on the calculation and The values ​​are sorted from smallest to largest, and this order is used as the network slice SEC. j The original N j The order in which individual and newly arriving services are queued in the transmission waiting queue, network slicing SEC j The transmission of each service is completed sequentially according to this new arrangement.

[0044] Step 3, which involves selecting bearer slices for non-latency-sensitive services, specifically includes the following methods:

[0045] Computational Network Slicing SEC i Physical resources RES i The remaining traffic waiting to be transmitted, i.e., the total traffic in the transmission waiting queue (TRA). i The ratio CH i ,Right now:

[0046] CH i =RES i / TRA i

[0047] Select ratio CH i The network slice with the largest value, used as the bearer slice for non-latency-sensitive services, will increase the newly arrived non-latency-sensitive services to the ratio CH. i The network slice with the largest value is placed at the end of the transmission waiting queue, and then step 4 is executed.

[0048] The total traffic TRA in the transmission waiting queue mentioned in step 3 i The calculation method is the same as that described in step 2.1.

[0049] Beneficial effects:

[0050] 1. Considering the remaining traffic waiting to be transmitted in each network slice, calculate the estimated time required for the newly arrived traffic to complete transmission, and select the slice with the shortest time as the slice to carry the new traffic. This can minimize the latency of latency-sensitive traffic.

[0051] 2. When the minimum time required for all slices in the 5G network to complete transmission is greater than the latency requirement of the service itself (their time difference is the timeout transmission time), the order of services in the transmission waiting queue is reordered so that the timeout transmission time of each service is similar, thereby achieving relative fairness in the transmission latency of each service.

[0052] 3. Select the slice with the largest ratio of physical network resources to remaining traffic waiting to be transmitted as the slice to carry non-latency-sensitive services. This can minimize the transmission waiting time of non-latency-sensitive services and improve the user experience. Attached Figure Description

[0053] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments, and the advantages of the present invention in the above and / or other aspects will become clearer.

[0054] Figure 1 This is a schematic diagram of the process of the present invention. Detailed Implementation

[0055] A 5G network slicing access control method based on service type is proposed. In multi-type service scenarios, access control is implemented for services according to the different network indicator requirements of different service types, and the services are allocated to appropriate slices for carrying, so that each allocated network slice can better meet the service performance requirements. In this way, while completing 5G network slicing access control, the latency performance of latency-sensitive services can be guaranteed.

[0056] (1) Scheme Principle

[0057] In a 5G network that supports multiple slices, when a new service arrives, the type of the service is first determined and it is divided into latency-sensitive services and non-latency-sensitive services.

[0058] For latency-sensitive services, considering the total remaining pending traffic volume within each network slice, the estimated time required for each network slice to complete the transmission of a newly arrived service is calculated. The network slice with the shortest estimated time is selected as the carrier slice for the new service. When the calculated estimated time required to complete transmission is less than the latency requirement of the service itself, the newly arrived service is added to the end of the waiting queue of the selected slice and waits to be transmitted. This satisfies the latency requirement of the newly arrived service without affecting the transmission of existing services in the queue. When the estimated time required to complete transmission is greater than or equal to the latency requirement of the service itself (the time difference is defined as the timeout transmission time), the newly arrived service is added to the waiting queue of the selected slice, and the order of all services waiting to be transmitted in the queue is reordered to make the timeout transmission times of each service more similar, thereby achieving relative fairness in the timeout transmission of each service.

[0059] For non-latency-sensitive services, considering the physical resources of each network slice and the total remaining traffic waiting to be transmitted, the ratio of the physical resources of each slice to the total remaining traffic waiting to be transmitted is calculated. The network slice with the largest ratio is selected as the bearer slice for the non-latency-sensitive service. This can reduce the waiting time of non-latency-sensitive services in the transmission queue.

[0060] (2) Detailed description of the plan

[0061] In a 5G network that supports multiple slices, assuming there are N network slices, the i-th network slice is labeled SEC. i , i∈[1,N].

[0062] For slice SEC i That is, the number of physical resources owned by the i-th network slice is RES. i In 5G networks, the amount of traffic that a unit of physical resource can carry per unit of time is defined as TRA. Assume a slice SEC. i The transmission waiting queue already contains N. i There are several services, and the service volume of the j-th service is TRA. i-j , where j∈[1,N i ].

[0063] In a 5G network, when a new service arrives and needs to be transmitted, let's assume the amount of service to be transmitted is TRA. arr Then, select a suitable network bearer slice for it according to the following steps.

[0064] like Figure 1 As shown, a 5G network slicing access control method based on service type includes the following specific steps:

[0065] Step 1: Determine the type of the newly arrived service and classify it into latency-sensitive and non-latency-sensitive services. If it is a latency-sensitive service, proceed to Step 2; if it is a non-latency-sensitive service, proceed to Step 3.

[0066] Step 2: Select the bearer slice for latency-sensitive services.

[0067] Step 2.1: Calculate the total traffic volume in the transmission waiting queue for each network slice.

[0068] For the i-th network slice SEC i Let i ∈ [1, N], and assume that there are N pairs of data in its transmission waiting queue. i There are several industries, where the business volume of the j-th industry is TRA. i-j , where j∈[1,N i Therefore, for slice SEC i The total traffic volume in its transmission waiting queue is TRA i ,but:

[0069]

[0070] Step 2.2: Calculate the estimated time required for each network slice to complete the transmission of newly arriving services.

[0071] Assuming that the original order of services in the waiting queue is not changed, network slicing SEC i The estimated time required to complete the transmission of the newly arrived service is T. i ,but:

[0072] T i =(TRA i +TRA arr ) / (RES i *TRA) (2)

[0073] Among them, RES i Let TRA represent the number of physical resources possessed by the i-th network slice, and let TRA represent the traffic volume that a unit of physical resource can carry per unit of time. arr The amount of traffic that needs to be transmitted for newly arriving services.

[0074] Step 2.3: Determine the bearer slice for latency-sensitive services.

[0075] The time T required to complete the transmission of the newly arriving service based on the calculated i-th network slice. i Where i∈[1,N], choose T i The network slice with the smallest value is selected as the network bearer slice for newly arriving latency-sensitive services, and this smallest T value is calculated. i The value is labeled T.

[0076] Step 2.4: Determine the position of newly arrived latency-sensitive services in the slice waiting queue.

[0077] Assume the latency requirement for latency-sensitive services is If formula (3) is satisfied, that is:

[0078]

[0079] This will increase the newly achieved latency-sensitive services to T. i The network slice with the smallest value is placed at the end of the transmission waiting queue, and then step 4 is executed.

[0080] If formula (3) is not satisfied, then T should be adjusted according to the following principles. i The network slice with the smallest value waits for the order of various services in the transmission queue.

[0081] Assume T i The slice with the smallest value is the j-th network slice, and its transmission waiting queue contains N values. j Each service has a latency requirement of TRA. j-k , where k∈[1,N j ] Calculate the timeout transmission time for each service separately, that is:

[0082]

[0083] Calculate the timeout transmission time for newly arrived latency-sensitive services, i.e.:

[0084]

[0085] Based on the calculation and The values ​​are sorted from smallest to largest, and this order is used as the network slice SEC. j The original N j The order in which individual and newly arriving services are queued in the transmission waiting queue, network slicing SEC j Based on this new arrangement, the transmission of each service is completed sequentially, and then step 4 is executed.

[0086] Step 3: Select the bearer slice for non-latency-sensitive services.

[0087] For slice SEC i For i∈[1,N], since there are N queues waiting to be transmitted. i Several services are waiting to be transmitted, and the traffic volume of each service is TRA. i-j , where j∈[1,N i Therefore, for slice SECi The total traffic volume in its waiting transmission queue is but:

[0088]

[0089] Due to network slicing SEC i The number of physical resources is RES i Therefore, the slice SEC is calculated. i Physical resources RES i and remaining traffic waiting to be transmitted TRA i The ratio, that is:

[0090] CH i =RES i / TRA i (7)

[0091] Where i∈[1,N].

[0092] Select CH i The network slice with the largest value, used as the bearer slice for non-latency-sensitive services, will add newly arrived non-latency-sensitive services to CH. i The network slice with the largest value waits until the end of the transmission queue, and then proceeds to step 4.

[0093] Step 4: Wait for the next service to arrive, then proceed to Step 1.

[0094] In its specific implementation, this application provides a computer storage medium and a corresponding data processing unit. The computer storage medium is capable of storing a computer program, which, when executed by the data processing unit, can run the invention's content regarding a 5G network slicing access control method based on service type, as well as some or all of the steps in various embodiments. The storage medium can be a magnetic disk, optical disk, read-only memory (ROM), or random access memory (RAM), etc.

[0095] Those skilled in the art will clearly understand that the technical solutions in the embodiments of the present invention can be implemented using computer programs and their corresponding general-purpose hardware platforms. Based on this understanding, the technical solutions in the embodiments of the present invention, or the parts that contribute to the prior art, can be embodied in the form of computer programs, i.e., software products. These computer program software products can be stored in a storage medium and include several instructions to cause a device containing a data processing unit (which may be a personal computer, server, microcontroller, MUU, or network device, etc.) to execute the methods described in various embodiments or certain parts of the embodiments of the present invention.

[0096] This invention provides a concept and method for 5G network slicing access control based on service type. Many methods and approaches exist for implementing this technical solution; the above description is merely a preferred embodiment. It should be noted that those skilled in the art can make various improvements and modifications without departing from the principles of this invention, and these improvements and modifications should also be considered within the scope of protection of this invention. All components not explicitly stated in this embodiment can be implemented using existing technologies.

Claims

1. A 5G network slicing access control method based on service type, characterized in that, Includes the following steps: Step 1: In a 5G network that supports multiple network slices, determine the type of the newly arrived service and classify it into latency-sensitive services and non-latency-sensitive services; if it is a latency-sensitive service, proceed to Step 2; otherwise, proceed to Step 3. Step 2: Select the bearer slice for latency-sensitive services, as follows: Step 2.1: Calculate the total traffic volume in the transmission waiting queue of each network slice. Specific methods include: ； Where i represents the i-th network slice, N i Indicates the number of services in the transmission waiting queue, the first... The business volume of each business is TRA i-j For network slice i, the total traffic in the transmission waiting queue is TRA i ; Step 2.2: Calculate the estimated time required for each network slice to complete the transmission of newly arrived services. Specific methods include: Under the premise of not changing the original service order in the waiting queue, the network slice SEC i The estimated time required to complete the transmission of the newly arrived service is T i Then: ； in, Let TRA represent the physical resources owned by the i-th network slice, and let TRA represent the traffic volume that a unit of physical resources can carry per unit of time. arr The amount of traffic that needs to be transmitted for newly arriving services; Step 2.3: Determine the bearer slice for latency-sensitive services, that is, select the network slice with the shortest expected time as the bearer slice for newly arriving services. Specific methods include: According to the estimated time T i ,in Select the estimated time T i The network slice with the smallest estimated time T is selected as the bearer slice for newly arriving latency-sensitive services, thus obtaining a defined bearer slice. i The value is marked as tag T; Step 2.4: Determine the position of the newly arrived delay-sensitive service in the transmission waiting queue of the bearer slice described in Step 2.

3. If the estimated time is less than the delay requirement of the service itself, add the newly arrived service to the end of the waiting queue of the selected slice and wait to be transmitted; otherwise, add the newly arrived service to the waiting queue of the selected slice, and reorder all services waiting to be transmitted in the waiting queue, and then wait to be transmitted. The specific method includes: Let the latency requirement of a latency-sensitive service be... If the latency requirement is met, that is: ； Then, the newly arrived latency-sensitive service is added to the end of the transmission waiting queue in the bearer slice determined in step 2.3, and then step 4 is executed; If the above latency requirements are not met, then according to the preset rules, adjust the order of each service in the transmission waiting queue in the determined bearer slice described in step 2.3, and execute step 4; Step 3: Select the bearer slice for non-latency-sensitive services, as follows: Considering the physical resources and the remaining total traffic waiting to be transmitted in each network slice, calculate the ratio of physical resources to the remaining total traffic waiting to be transmitted in each slice, and select the network slice with the largest ratio as the slice to carry non-latency-sensitive services. Step 4: Wait for the next service to arrive, then proceed to Step 1.

2. The 5G network slicing access control method based on service type according to claim 1, characterized in that, The 5G network described in step 1 includes N network slices, with the i-th network slice labeled SEC. i , ; For network slicing SEC i That is, the number of physical resources owned by the i-th network slice is RES. i In the aforementioned 5G network, the amount of traffic that a unit of physical resource can carry per unit of time is defined as TRA; let network slice SEC be... i There are already N in the transmission waiting queue. i The first business, the first The business volume of each business is TRA i-j ,in In the aforementioned 5G network, when a new service arrives and needs to be transmitted, let the amount of service that needs to be transmitted be TRA. arr .

3. The 5G network slicing access control method based on service type according to claim 2, characterized in that, The preset rules mentioned in step 2.4 are as follows: Let the determined bearer slice in step 2.3 be the j-th network slice, and its transmission waiting queue contain N... j The first business, the first The latency requirement for each service is ,in Calculate the timeout transmission time for each service separately. ,Right now: ； Calculate the timeout transmission time for newly arrived latency-sensitive services. ,Right now: ； Based on the calculation and The values ​​are sorted from smallest to largest, and this order is used as the network slice SEC. j The original N j The network slice i is arranged in the transmission waiting queue according to the order of existing services and newly arrived services. Based on this new order, the network slice i completes the transmission of each service in sequence.

4. The 5G network slicing access control method based on service type according to claim 3, characterized in that, Step 3, which involves selecting bearer slices for non-latency-sensitive services, specifically includes the following methods: Computational Network Slicing SEC i Physical resources RES i The remaining traffic waiting to be transmitted, i.e., the total traffic in the transmission waiting queue (TRA). i ratio ,Right now: ； Select ratio The network slice with the largest value, used as the carrier slice for non-latency-sensitive services, will increase the newly arrived non-latency-sensitive services to the ratio. The network slice with the largest value is placed at the end of the transmission waiting queue, and then step 4 is executed.

5. The 5G network slicing access control method based on service type according to claim 4, characterized in that, The total traffic TRA in the transmission waiting queue mentioned in step 3 i The calculation method is the same as that described in step 2.1.

Images