A RAN Slicing Orchestration Method, System, Device, and Storage Medium
By building the rate delay optimization function and resource allocation function, the set of users that can be accessed to the base station is selected, which solves the problem of low utilization of network slicing resources and improves network performance.
Patent Information
- Application Number
- CN202211530137.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-11-30
- Publication Date
- 2025-07-11
- Estimated Expiration
- 2042-11-30
AI Technical Summary
The existing network slicing service solution leads to low resource utilization, which cannot meet the QoS requirements of all users, and the overall network performance is low.
By obtaining user data, building a rate delay optimization function and using the Lagrangian multiplier method and strong duality of the function to solve it, filtering out a set of users that can be accessed from the base station, combining the resource allocation optimization function to maximize network utility, and realizing user screening and resource allocation.
Improve the user access control of RAN slices, enhance network resource utilization and overall performance.
Smart Images

Figure CN115988506B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of 5G radio access network network slicing, and in particular to a RAN slicing orchestration method, system, device, and storage medium. Background Art
[0002] The service provisioning scheme of traditional networks is a best-effort model that distributes limited radio resources to all users as much as possible. After introducing network slicing, network slices can meet the different network requirements of different users. Existing network service schemes based on network slicing mainly focus on obtaining better slice deployment schemes through resource management in network slices. However, the infinite resources of the network are still limited and scarce. Since limited resources cannot enable all users to obtain services that meet their QoS requirements, the existing service provisioning mechanism for network slices allows any user to access, resulting in low resource utilization and low overall network performance. Summary of the Invention
[0003] Based on the above technical problems, the technical solution provided by the present invention is as follows: A RAN slicing orchestration method includes the following steps:
[0004] Obtain user data of all users in the mobile network of the current area. The user data includes the actual transmission rate, actual delay, required transmission rate, tolerated delay, maximum required transmission rate, and maximum tolerated delay of the user terminal;
[0005] The user QoS requirements include the transmission rate and delay of the user terminal. Taking the minimization of the difference between the actual transmission rate and the required transmission rate of the user and the difference between the actual delay and the tolerated delay as the goal, construct a rate-delay optimization function, determine the constraint conditions of the rate-delay optimization function, use the Lagrange multiplier method and the strong duality of the function to solve the rate-delay optimization function, and use the solution result of the rate-delay optimization function to screen all users in the mobile network of the current area to obtain an accessible base station user set and an eliminated user set;
[0006] Construct a resource allocation optimization function with the goal of maximizing network utility according to the weights of different network slices, and use a convex optimization modeling toolbox to simulate and solve the resource allocation optimization function to obtain a resource allocation result.
[0007] Preferably, the specific formula of the rate-delay optimization function is:
[0008]
[0009] where u is a user terminal in the area, and U is the set of all user terminals in the area, respectively represent the difference between the actual transmission rate and the required transmission rate of the user terminal u, and the difference between the actual delay and the tolerated delay respectively represent the maximum required transmission rate and the maximum tolerated delay of the user terminal u
[0010] Preferably, the constraint conditions of the rate-delay optimization function include the constraint on the amount of bandwidth resources provided by the network slice to the user terminal through the base station, the constraint on the actual transmission rate of the user terminal and the actual delay of the user terminal, and the constraint on the connection mode between the user terminal and the network slice through the base station
[0011] Among them, the constraint on the amount of bandwidth resources provided by the network slice to the user terminal through the base station is specifically as follows
[0012]
[0013] In the formula, N is the set of network slices, n is a slice in the set of network slices, u is a certain user terminal in the area, U is the set of all user terminals in the area, and k is the base station refers to the amount of radio resources provided by the slice n covered by the base station k
[0014] B is the total network bandwidth, U n represents the number of user terminals accessing the network slice, U total represents the total number of user terminals accessing represents the user association situation represents the amount of bandwidth resources provided by the network slice to the user terminal through the base station
[0015] The constraint on the actual transmission rate of the user terminal and the actual delay of the user terminal is specifically as follows
[0016]
[0017]
[0018] In the formula is the actual transmission rate of the user terminal is the actual delay of the user terminal respectively represent the difference between the actual transmission rate and the required transmission rate of the user terminal u, and the difference between the actual delay and the tolerated delay respectively represent the maximum transmission rate and the maximum tolerated delay of the user terminal u. The actual transmission rate of the user terminal is equal to the maximum transmission rate minus the difference between the actual transmission rate and the required transmission rate, and the actual delay of the user terminal is equal to the maximum tolerated delay plus the difference between the actual delay and the tolerated delay
[0019] The constraint on the connection method between the user terminal and the network slice through the base station is specifically that each user terminal can only access the network slice through one base station:
[0020]
[0021]
[0022] Preferably, the specific solution of the rate-delay optimization function by using the Lagrange multiplier method and the strong duality of the function is as follows:
[0023] Using the Lagrange multipliers λ and ν, introduce the constraint conditions of the actual transmission rate of the user terminal and the actual delay of the user terminal into the rate-delay optimization function to define the Lagrangian function in:
[0024]
[0025] where
[0026]
[0027] That is:
[0028]
[0029]
[0030] Preferably, using the solution result of the rate-delay optimization function to screen all users in the current area of the mobile network to obtain the set of users that can access the base station and the set of eliminated users is specifically as follows:
[0031] Through strong duality for L 2 (λ, ν, χ) is solved, and according to the solution result Determine whether the transmission rate and delay of the user terminal in the current area of the mobile network meet the QoS requirements. When it is determined that the QoS requirements are met, the users who meet the QoS requirements are divided into the set of users that can access the base station, and the users who do not meet the QoS requirements are divided into the set of eliminated users. Among them, the satisfaction of the QoS requirements specifically means that the difference between the actual transmission rate of the user and the required transmission rate, and the difference between the actual delay and the tolerated delay are both zero.
[0032] Preferably, after dividing the users who meet the QoS requirements into the set of users that can access the base station and the users who do not meet the QoS requirements into the set of eliminated users, it further includes:
[0033] Judge whether the set of users that can access the base station after user data screening occupies all the wireless resources of the network. If there are remaining wireless resources, change the QoS requirements to be met, and for L 2 (λ, ν, χ) is solved, and using L 2 the solution result of (λ, v, x) to screen users in the eliminated user set, and divide the users meeting the QoS requirements into the set of users that can access the base station until all wireless resources are occupied.
[0034] Preferably, the specific formula of the resource allocation optimization function is:
[0035]
[0036] where a n is the slice weight of different network slices, and the constraint conditions of the resource allocation optimization function are the same as those of the rate-delay optimization function.
[0037] The present invention also provides a RAN slice orchestration system, and the RAN slice orchestration system includes a data collection module, a processing module, and a slice orchestration module, wherein:
[0038] Build a triple structure composed of user terminals - base stations - network slices in the target area. A number of user terminals are evenly distributed in the current area, and users access all network slices covered by the base station through the user terminals;
[0039] The data collection module collects user data of all users in the mobile network of the current area through user terminals and base stations. The user data includes the actual transmission rate, actual delay, required transmission rate, tolerated delay, maximum required transmission rate, and maximum tolerated delay of the user terminals;
[0040] The processing module is electrically connected to the data collection module, obtains the user data of all users in the mobile network of the current area collected by the data collection module. A rate-delay optimization function and its constraint conditions are built inside the processing module. The rate-delay optimization function aims to minimize the difference between the actual transmission rate and the required transmission rate of users, and the difference between the actual delay and the tolerated delay. It is solved using the Lagrange multiplier method and the strong duality of the function. The processing module uses the solution result to screen all users in the mobile network of the current area to obtain a set of users that can access the base station and a set of eliminated users;
[0041] The slice orchestration module is electrically connected to the processing module, builds a resource allocation optimization function and its constraint conditions inside, and uses a convex optimization modeling toolbox to simulate and solve the resource allocation optimization function to obtain a resource allocation result.
[0042] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein, when the processor executes the program, it implements a RAN slice orchestration method as described in any embodiment of the present invention.
[0043] The present invention also provides a computer-readable storage medium, on which a computer program is stored, wherein, when the program is executed by a processor, it implements a RAN slice orchestration method as described in any embodiment of the present invention.
[0044] Compared with the prior art, the beneficial effects of the present invention are as follows:
[0045] The present invention relates to a RAN slice orchestration method, system, device, and storage medium. By introducing elastic variables to quantify the gap between the actual transmission rate and delay of the user side and the required rate and delay, constructing a function for user screening, using the Lagrangian relaxation method to solve the established function and screening out the set of users that can access the base station, all users in this set meet the QoS requirements; a resource allocation scheme is designed by constructing a function with the goal of maximizing network utility, and the final resource allocation result is obtained. This method strengthens the user access control of RAN slices and improves the network resource utilization rate and overall performance. BRIEF DESCRIPTION OF THE DRAWINGS
[0046] Figure 1 is the flowchart of the RAN slice orchestration method in the embodiment of the present invention;
[0047] Figure 2 is the triple structure model diagram of user terminal-base station-network slice in the embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS
[0048] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.
[0049] Embodiment 1
[0050] Please refer to Figure 1 , Embodiment 1 provides the following technical solution: a RAN slice orchestration method.
[0051] As Figure 2As shown in the figure, in the smart grid scenario, this embodiment adopts a single base station multi-slice model. A macro base station is placed at the center of a certain area. The base station supports three slices, which respectively correspond to the three service operations of the smart grid, namely mobile application service, information collection service, and power grid control service. Multiple user terminals UE are evenly distributed throughout the area. When users use their terminals to access the base station, they can access all network slices covered by the base station. The entire area forms a triple structure of user terminal UE (User Equipment) - base station BS (Base Station) - network slice NS (Network Slice). Among them, in this embodiment, N is the set of network slices, n is a slice in the set of network slices, u is a certain user terminal in the area, U is the set of all user terminals in the area, and k is the base station.
[0052] Obtain all user data in the smart grid of the current area. User terminals have different QoS requirements. In this embodiment, the transmission rate and delay are used to represent the QoS requirements of user terminals. Only when the actual transmission rate of the user terminal is greater than the minimum transmission rate required by the user terminal and the actual delay is less than the maximum tolerable delay of the user terminal, it is considered that the QoS requirements of the user terminal are met. Therefore, obtaining all user data includes the actual transmission rate, actual delay, required transmission rate, tolerable delay, maximum required transmission rate, and maximum tolerable delay of the user terminal. In this embodiment, it is assumed that the amount of data that user terminal u needs to transmit is q. represents the actual transmission rate of the user terminal. Specifically, it is the service rate provided by slice n for user terminal u through base station k. Assuming that the sub-channels are flat, after obtaining the actual transmission rate of the user terminal through the Shannon formula, the actual delay of the user terminal can be obtained through to obtain the actual delay of the user terminal.
[0053] When the difference between the actual transmission rate and the required transmission rate of the user and the difference between the actual delay and the tolerable delay are zero, the QoS requirements of the user terminal are met. The difference between the actual transmission rate and the required transmission rate of the user and the difference between the actual delay and the tolerable delay are used as elastic variables, and a rate-delay optimization function is constructed with the goal of minimizing the normalized value of the elastic variables:
[0054]
[0055] Among them, u is a certain user terminal in the area, and U is the set of all user terminals in the area. respectively represent the difference between the actual transmission rate and the required transmission rate of user terminal u, and the difference between the actual delay and the tolerable delay. respectively represent the maximum required transmission rate and the maximum tolerable delay of user terminal u.
[0056] Determine the constraint conditions of the rate-delay optimization function:
[0057] 1) Constraint on the amount of bandwidth resources provided by the network slice to the user terminal through the base station, that is, the total amount of resources provided by the network slice to the user terminal through the base station shall not exceed the total bandwidth resources included in the slice:
[0058]
[0059] Where N is the set of network slices, n is a slice in the set of network slices, u is a user terminal in the area, U is the set of all user terminals in the area, and k is the base station; Refers to the amount of radio resources provided by the slice n covered by the base station k, B is the total network bandwidth, U n Represents the number of user terminals accessing the network slice, U total Represents the total number of user terminals accessing; Represents the user association situation. The value of 1 indicates that the user terminal is associated with the network slice through the base station, and the value of 0 indicates no association. Represents the amount of bandwidth resources provided by the network slice to the user terminal through the base station;
[0060] 2) Constraints on the actual transmission rate of the user terminal and the actual delay of the user terminal, that is, the actual transmission rate of the user terminal is equal to the maximum transmission rate minus the difference between the actual transmission rate and the required transmission rate, and the actual delay of the user terminal is equal to the maximum tolerable delay plus the difference between the actual delay and the tolerable delay:
[0061]
[0062]
[0063] Where, Is the actual transmission rate of the user terminal; Is the actual delay of the user terminal; Respectively represent the difference between the actual transmission rate and the required transmission rate, and the difference between the actual delay and the tolerable delay of the user terminal u, Respectively represent the maximum transmission rate and the maximum tolerable delay of the user terminal u;
[0064] 3) Constraint on the connection method between the user terminal and the network slice through the base station, that is, each user terminal can only access the network slice through one base station:
[0065]
[0066]
[0067] Since the rate-delay optimization function is a multi-objective optimization function, and All are variables. In this embodiment, the idea of the complete hierarchical sequence method is referred to solve the function. First, the Lagrange multiplier method is used to solve the rate-delay optimization function. Specifically, the Lagrange multiplier λ and v are used to introduce the constraint conditions of the actual transmission rate and the actual delay of the user terminal into the rate-delay optimization function to define the Lagrangian function
[0068]
[0069] Among them,
[0070]
[0071] Since the elastic variable and the user association variable are independent of each other, so can be written as the following two parts:
[0072]
[0073]
[0074] When the Lagrange multiplier is determined, the strong duality is used to solve the above two parts to perform user data screening. By substituting all user data into the rate-delay optimization function to obtain the calculation result, the users whose calculation results meet the QoS requirements are divided into the set of users that can access the base station, and the users that do not meet the QoS requirements are divided into the set of eliminated users;
[0075] During the screening process, many users are eliminated because one of the two elastic variables is not zero. At this time, there are remaining radio resources in the network. Therefore, in order to maximize the number of access users, after fully considering the actual situation, this embodiment sets a value range for the elastic variable, that is Bring the set of eliminated users back into the Lagrangian function. If the elastic variable of the user terminal obtained by solving is within the given range, these users are also included in the set of users that can access the base station. Before the radio resources are fully occupied, continuously expand the value range of the elastic variable, and repeat the above calculation steps until the radio resources are fully occupied to obtain the final set of users that can access the base station.
[0076] Construct a resource allocation optimization function with the goal of maximizing network utility:
[0077]
[0078] Among them, a nFor the slice weights of different network slices, in this embodiment, three network slices of eMBB, mMTC, and URLLC are used to represent mobile application services, information collection services, and power grid control services in the smart grid, and the slice weights are 0.3, 0.2, and 0.5 respectively. The constraint conditions of the resource allocation optimization function are the same as those of the rate-delay optimization function. Since the resource allocation optimization function is a convex function, which conforms to the characteristics of convex optimization problems, and such problems must have solutions. Therefore, a convex optimization modeling toolbox such as the CVX toolbox in MATLAB software can be used to solve the simulation and obtain the final resource allocation result.
[0079] Embodiment 2
[0080] The present invention provides a RAN slice orchestration system, and the RAN slice orchestration system includes a data collection module, a processing module, and a slice orchestration module, wherein:
[0081] Build a triple structure consisting of user terminals - base stations - network slices in the target area. A number of user terminals are evenly distributed in the current area, and users access all network slices covered by the base station through the user terminals.
[0082] The data collection module collects user data of all users in the mobile network of the current area through user terminals and base stations. The user data includes the actual transmission rate, actual delay, required transmission rate, tolerated delay, maximum required transmission rate, and maximum tolerated delay of the user terminals.
[0083] The processing module is electrically connected to the data collection module, obtains the user data of all users in the mobile network of the current area collected by the data collection module. A rate-delay optimization function and its constraint conditions are built inside the processing module. The rate-delay optimization function aims to minimize the difference between the actual transmission rate and the required transmission rate of users, and the difference between the actual delay and the tolerated delay. It is solved using the Lagrange multiplier method and the strong duality of the function. The processing module uses the solution result to screen all users in the mobile network of the current area, and obtains a set of users who can access the base station and a set of eliminated users.
[0084] The slice orchestration module is electrically connected to the processing module, builds a resource allocation optimization function and its constraint conditions inside, and uses a convex optimization modeling toolbox to simulate and solve the resource allocation optimization function to obtain a resource allocation result.
[0085] Embodiment 3
[0086] The present invention provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor. The characteristic is that when the processor executes the program, it implements a RAN slice orchestration method as described in any embodiment of the present invention.
[0087] Embodiment 4
[0088] The present invention provides a computer-readable storage medium, on which a computer program is stored. It is characterized in that when the program is executed by a processor, it implements a RAN slice orchestration method as described in any embodiment of the present invention.
[0089] The above are only the embodiments of the present invention, and do not limit the patent scope of the present invention accordingly. Any equivalent structure or equivalent process transformation made by using the content of the specification and drawings of the present invention, or directly or indirectly applied in other related technical fields, shall be similarly included in the patent protection scope of the present invention.
Claims
1. A RAN slice orchestration method, characterized in that: Obtain the user data of all users in the mobile network of the current area, where the user data includes the actual transmission rate, actual delay, required transmission rate, tolerated delay, maximum required transmission rate, and maximum tolerated delay of the user terminal; Construct a rate-delay optimization function with the goal of minimizing the difference between the actual transmission rate and the required transmission rate of the user and the difference between the actual delay and the tolerated delay according to the user QoS requirements, and determine the constraint conditions of the rate-delay optimization function, including the constraint on the bandwidth resource amount provided by the network slice to the user terminal through the base station, the constraint on the actual transmission rate and actual delay of the user terminal, and the constraint on the connection method between the user terminal and the network slice through the base station; Among them, the constraint on the bandwidth resource amount provided by the network slice to the user terminal through the base station is specifically: Wherein, N is a set of network slices, n is a slice in the set of network slices, u is a user terminal in a region, U is a set of all user terminals in the region, and k is a base station; It refers to the amount of radio resources provided by the slice n covered by the base station k; B is the total network bandwidth, and U n represents the number of user terminals accessing the network slice, and U total represents the total number of user terminals accessing; represents the user association situation, represents the amount of bandwidth resources provided by the network slice to the user terminal through the base station; a n is the slice weight of different network slices; The constraint on the actual transmission rate and actual delay of the user terminal is specifically: Wherein, is the actual transmission rate of the user terminal; is the actual delay of the user terminal; respectively represent the difference between the actual transmission rate and the required transmission rate of user terminal u, and the difference between the actual delay and the tolerated delay, respectively represent the maximum transmission rate and the maximum tolerated delay of user terminal u. The actual transmission rate of the user terminal is equal to the maximum transmission rate minus the difference between the actual transmission rate and the required transmission rate, and the actual delay of the user terminal is equal to the maximum tolerated delay plus the difference between the actual delay and the tolerated delay; The constraint on the connection method between the user terminal and the network slice through the base station is that each user terminal can only access the network slice through one base station: Among them, the user QoS requirements include the transmission rate and delay of the user terminal; Use the Lagrange multiplier method and the strong duality of the function to solve the rate-delay optimization function, and use the solution result of the rate-delay optimization function to screen all users in the mobile network of the current area to obtain an accessible base station user set and an eliminated user set; Construct a resource allocation optimization function with the goal of maximizing the network utility according to the weights of different network slices, and use the convex optimization modeling toolbox to simulate and solve the resource allocation optimization function to obtain the resource allocation result.
2. The RAN slice orchestration method according to claim 1, wherein The specific formula of the rate-delay optimization function is:
3. The RAN slice orchestration method according to claim 2, wherein The specific process of using the Lagrange multiplier method and the strong duality of the function to solve the rate-delay optimization function is: Using the Lagrange multiplier λ and v, the constraint conditions of the actual transmission rate and the actual delay of the user terminal are introduced into the rate-delay optimization function to define the Lagrangian function as follows: Among them, That is:
4. The RAN slice scheduling method according to claim 3, wherein, The specific process of using the solution result of the rate-delay optimization function to screen all users in the mobile network of the current area to obtain an accessible base station user set and an eliminated user set is: Solve L 2 (λ, v, x) and, according to the solution result Determine whether the transmission rate and delay of user terminals in the mobile network of the current area meet the QoS requirements. When it is determined that the QoS requirements are met, divide the users who meet the QoS requirements into the set of users that can access the base station, and divide the users who do not meet the QoS requirements into the set of eliminated users. Among them, the specific meaning of meeting the QoS requirements is that the difference between the actual transmission rate and the required transmission rate of the user, and the difference between the actual delay and the tolerated delay are both zero.
5. The RAN slice orchestration method according to claim 4, wherein, Classify the users who meet the QoS requirements into the accessible base station user set, and classify the users who do not meet the QoS requirements into the eliminated user set. After that, it also includes: Determine whether the set of users that can access the base station after user data screening occupies all the wireless resources of the network. If there are remaining wireless resources, change the QoS requirements to be met, and for L 2 (λ, ν, x) is solved, and the solution result of L 2 (λ, ν, x) is used to screen users in the set of eliminated users, and the users that meet the QoS requirements are classified into the set of users that can access the base station until all the wireless resources are occupied.
6. A RAN slice orchestration method according to claim 5, characterized in that The specific formula of the resource allocation optimization function is: Among them, the constraint conditions of the resource allocation optimization function are the same as those of the rate-delay optimization function.
7. A RAN slice orchestration system for performing a RAN slice orchestration method according to any one of claims 1-6, characterized in that, The RAN slice orchestration system includes a data collection module, a processing module, and a slice orchestration module, where: Build a triple structure composed of user terminal - base station - network slice in the target area. A number of user terminals are evenly distributed in the current area, and users access all network slices covered by the base station through the user terminal; The data collection module collects the user data of all users in the mobile network of the current area through the user terminal and the base station. The user data includes the actual transmission rate, actual delay, required transmission rate, tolerated delay, maximum required transmission rate, and maximum tolerated delay of the user terminal; The processing module is electrically connected to the data acquisition module, obtains the user data of all users in the mobile network of the current area collected by the data acquisition module. A rate-delay optimization function and its constraint conditions are built inside the processing module. The rate-delay optimization function aims to minimize the difference between the actual transmission rate and the required transmission rate of users, and the difference between the actual delay and the tolerated delay, and is solved by using the Lagrange multiplier method and the strong duality of the function. The processing module uses the solution result to screen all users in the mobile network of the current area, and obtains a set of users that can access the base station and a set of eliminated users; The slice orchestration module is electrically connected to the processing module, and a resource allocation optimization function and its constraint conditions are built inside. The convex optimization modeling toolbox is used to simulate and solve the resource allocation optimization function, and a resource allocation result is obtained.
8. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and capable of running on the processor, characterized in that, When the processor executes the program, it implements a RAN slice orchestration method according to any one of claims 1 to 6.
9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements a RAN slice orchestration method according to any one of claims 1 to 6.
Citation Information
Patent Citations
Network slice resource optimization method and device based on deep reinforcement learning
CN114980327A
Network slicing and computing power resource allocation method and system based on game theory
CN115209555A