A resource preemption method based on user satisfaction maximization

Abstract

The application provides a resource preemption method based on user satisfaction maximization, and belongs to the technical field of resource allocation.The application is based on a centralized network architecture, establishes a resource preemption cost function model according to four optimization standards of preemption service priority, preemption service quantity, preemption bandwidth and user satisfaction, then arranges all preemption services in ascending order according to the cost value, executes different schemes according to the different weights when the cost value is the same, and finally preempts the services in sequence.The application can solve the transmission problem of high-priority burst service request, improve the important service delivery rate and user satisfaction, and reduce the influence on the preemption services as much as possible, so as to improve the system transmission value.

Description

Technical Field

[0001] The present invention relates to the technical field of resource allocation, and in particular to a resource preemption method based on maximizing user satisfaction. Background Art

[0002] In recent years, with the rapid development of mobile communication technology, cloud computing technology, and Internet applications, a large number of mobile terminals and intelligent Internet of Things devices have been continuously connected to the network, resulting in the switching systems in communication networks experiencing explosive growth in network service traffic. At the same time, emerging services have also put forward different QoS transmission requirements for the Internet. The transmission capabilities of each link in the network vary. Rationally scheduling bandwidth resources for service flows is a prerequisite for efficient and reliable information transmission and effective utilization of network resources. Therefore, it is necessary to design a reasonable resource scheduling scheme based on the current network status and different service requirements. Due to the suddenness and unpredictability of service requests, suboptimal decisions often occur in traditional routing planning. Therefore, the present invention designs a resource preemption scheme to achieve bandwidth resource scheduling. Summary of the Invention

[0003] In view of this, the present invention proposes a resource preemption method based on the centralized network architecture and based on maximizing user satisfaction. By designing a set of bandwidth preemption strategies, the transmission problem of high-priority burst service requests is solved, the delivery rate of important services is improved while minimizing the impact on preempted services, thereby improving the system transmission value.

[0004] Based on the above objectives, the technical solution provided by the present invention is:

[0005] A resource preemption method based on maximizing user satisfaction includes the following steps:

[0006] Step 1: Establish a resource preemption cost function model based on four optimization criteria: preemption service priority, preemption service quantity, preemption bandwidth, and user satisfaction. The resource preemption cost function model is:

[0007]

[0008] Where H(l) represents the cost of preempting service l; α, β, and γ are the weights of the three objective subfunctions; l represents the lth element in the set L, which is the set of preemptible services. The priority of maintaining services in the set is lower than the priority of establishing new services.

[0009] It refers to the value cost introduced by the amount of data transmitted by the service l when preempting the service l. K(l) represents the priority cost of the preempted service l. K(l) = 8-p(l), where p(l) is the maintenance priority of service l. w represents the completion degree of service transmission, w∈(0,1);

[0010] It refers to the cost of reducing the number of preempted connections when preempting service l, and b(l) is the bandwidth occupied by service l;

[0011] γ(b(l)-r) 2 It refers to the cost of bandwidth waste caused by preempting service l, r is the bandwidth that needs to be preempted by new or rerouted service ρ, and service ρ is the bandwidth that needs to be preempted on the transmission link e. j Bandwidth that needs to be seized r = b(ρ) - a j , a j is the transmission link e j The remaining available bandwidth is ρ, and b(ρ) is the bandwidth requirement of service ρ;

[0012] Step 2: Sort all preemptible services in ascending order by cost value H(l); and determine whether there are identical cost values ​​H(l). If so, execute different solutions using different configurations of α, β, and γ to obtain the sorted service set L'.

[0013] Step 3: Preempt the services in the sorted service set L' obtained in step 2 to obtain the preempted service set S and the wasted bandwidth Waste;

[0014] Step 4: Eliminate services with bandwidth smaller than Waste from the preemptive service set S to obtain a final preemptive service set.

[0015] Furthermore, the specific process of step 2 is:

[0016] Arrange all preemptible services in L in ascending order by cost value H(l) and determine whether there are services with the same cost value H(l). If so, implement different solutions by configuring α, β, and γ:

[0017] If the α value is the largest, the services are sorted in ascending order according to the value v(l). If v(l) are the same, they are sorted in ascending order according to (b(l)-r). 2 Sort the business in ascending order, if (b(l)-r) 2 If they are the same, the businesses are sorted in descending order according to b(l);

[0018] If the β value is the largest or the three are equal, then sort the businesses in descending order according to b(l). If b(l) are the same, then sort the businesses in ascending order according to value v(l). If v(l) are the same, then sort the businesses in ascending order according to (b(l)-r). 2 Sort the businesses in ascending order;

[0019] If the γ value is the largest, then press (b(l)-r) 2 Sort the business in ascending order, if (b(l)-r) 2If the values ​​of v(l) are the same, the businesses are sorted in ascending order according to their value cost v(l); if v(l) are the same, the businesses are sorted in descending order according to b(l).

[0020] Furthermore, the specific process of step 3 is:

[0021] Step 301: Seize the first service in L';

[0022] Step 302: Determine whether the preempted bandwidth Preempt of the current link is less than the bandwidth r that needs to be preempted;

[0023] Step 303: If Preempt <r,则将L’中第一个业务l’存入集合S,并在集合L’中删除对应业务,令Preempt=Preempt+b(l’),返回至步骤301;否则,计算浪费带宽Waste=Preempt-r,得到抢占业务集合S和浪费带宽Waste;其中,b(l’)是业务l’占用的带宽。

[0024] Furthermore, the specific process of step 4 is as follows:

[0025] Step 401: Determine whether there is a service in S whose bandwidth is less than or equal to Waste;

[0026] Step 402: If there are services in S whose bandwidth is less than or equal to Waste, sort the services that meet the requirements from high to low according to the loss cost value to obtain the set W', eliminate the first service s', and set Waste = Waste-b(s'), where b(s') is the bandwidth occupied by service s', and return to step 401; otherwise, obtain the final set of preempted services.

[0027] From the above description, it can be seen that the beneficial effects of the technical solution of the present invention are:

[0028] In real-world networks, administrators rarely prioritize improving user satisfaction. However, in QoS-enabled networks, users prioritize service continuity. When preemption is unavoidable, the continuity of the service being preempted is interrupted. Preemption at the beginning of a service transmission reduces user satisfaction, while preemption at the beginning of a service transmission leads to higher levels of dissatisfaction. This solution introduces the concept of service transmission completion into the cost function, reducing the probability of a service flow being preempted when it is about to complete transmission. Therefore, this solution can effectively improve user satisfaction. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 This is a flow chart of the resource preemption solution according to an embodiment of the present invention.

[0030] Figure 2This is a comparison chart between the solution of the present invention and the traditional v-prept solution in terms of waste of preemptive service bandwidth.

[0031] Figure 3 This is a comparison chart of the average priority of preempting services between the solution of the present invention and the traditional v-prept solution.

[0032] Figure 4 This is a comparison chart of the average transmission completion rate of the preemptive service between the solution of the present invention and the traditional v-prept solution. DETAILED DESCRIPTION

[0033] In order to facilitate those skilled in the art to understand the technical solution of the present invention, and at the same time, to make the technical purpose, technical solution and beneficial effects of the present invention clearer and to fully support the scope of protection of the claims, the technical solution of the present invention is further and more detailed explained below in the form of specific cases.

[0034] An intelligent routing method based on maximizing user satisfaction. In this method, values ​​are first set for different types of services, and service characteristics, service value, and topology information are input into a deep neural network structure. The neural network outputs the next hop node of the path, and then uses this node as the source node to continue outputting the next hop through the neural network. After the complete path is output, the reward is calculated, and the network is trained based on feedback until the system converges.

[0035] The specific steps include:

[0036] Step 1: Establish a resource preemption cost function model, specifically:

[0037] The resource preemption cost function model is constructed based on the following four optimization criteria:

[0038] 1) Preempt lower-priority traffic to avoid cascading preemption;

[0039] 2) Seize the least number of business flows to reduce the number of affected businesses;

[0040] 3) Minimize bandwidth preemption and avoid bandwidth waste;

[0041] 4) Improve user satisfaction and avoid preemption of business flows that are about to be transmitted.

[0042] Based on this, the resource preemption cost function model H(l) is:

[0043]

[0044] in:

[0045] α, β, and γ are the weights of the three objective sub-functions. By configuring α, β, and γ, each optimization criterion can be treated differently. The execution order of the optimization criteria can be flexibly changed based on the network administrator's specific weight configuration, and preemption is performed based on this order. If the α value is maximized, the goal is to optimize preemption priority; if the β value is maximized, the goal is to optimize the number of preempted services; if the γ value is maximized, the goal is to optimize preempted bandwidth. If the α, β, and γ values ​​are equal, the optimization goal is to optimize preempted bandwidth. The default goal is to optimize preempted bandwidth.

[0046] l represents the lth element in the set L;

[0047] L is a set of preemptible services to be selected. The maintenance priority of the services in the set is lower than the establishment priority of the new service. There are N elements in the set.

[0048] K(l) represents the lth element in the priority cost set K, which is the priority cost of the preempted service l;

[0049] K is a set of priority costs, which can be represented by K(1), K(2), ..., K(l), ..., K(N). When calculating it, it is generally assumed that the preemption cost K(l) and the retention cost p(l) are linearly related. The value of K(l) is calculated using the formula K(l) = 8 - p(l), where p(l) is the retention priority of service l.

[0050] This is the cost of preempting service l based on the amount of data already transmitted. K(l) = 8 - p(l) represents the value of the service and is related to its priority. Because preemption disrupts service continuity, the greater the amount of data already transmitted, the higher the cost and the lower the user satisfaction.

[0051] It refers to the cost of reducing the number of preempted connections when preempting service l, and b(l) is the bandwidth occupied by service l.

[0052] γ(b(l)-r) 2 It refers to the cost of bandwidth waste caused by preempting service l, r is the bandwidth that needs to be preempted by new or rerouted service ρ, and service ρ is the bandwidth that needs to be preempted on the transmission link e. j Bandwidth that needs to be seized r = b(ρ) - a j , a j is the transmission link e j The remaining available bandwidth is ρ, and b(ρ) is the bandwidth requirement of service ρ;

[0053] H(l) represents the total cost of pre-empting service l. The smaller H(l) is, the easier service l is pre-empted.

[0054] Step 2, arrange all pre-emptable services in L in ascending order according to the value H(l); and determine whether there are identical values H(l). If yes, execute different schemes through different configurations of a, β and γ to obtain a sorted service set L';

[0055] Arrange all pre-emptable services in L in ascending order according to the value H(l); and determine whether there are identical values H(l). If yes, execute different schemes through different configurations of a, β and γ:

[0056] If a is the largest, arrange services in ascending order according to the value v(l). If v(l) is identical, arrange services in ascending order according to (b(l)-r) 2 If (b(l)-r) 2 is identical, arrange services in descending order according to b(l).

[0057] If β is the largest or all of a, β and γ are equal, arrange services in descending order according to b(l). If b(l) is identical, arrange services in ascending order according to the value v(l). If v(l) is identical, arrange services in ascending order according to (b(l)-r) 2

[0058] If γ is the largest, arrange services in ascending order according to (b(l)-r) 2 If (b(l)-r) 2 is identical, arrange services in ascending order according to the value v(l). If v(l) is identical, arrange services in descending order according to b(l).

[0059] Step 3, pre-empt services in L' obtained in Step 2 to obtain a pre-empted service set S and wasted bandwidth Waste; the specific process is as follows:

[0060] Step 301: pre-empt the first service in L';

[0061] Step 302: determine whether the pre-empted bandwidth Preempt of the current link is less than the bandwidth r to be pre-empted.

[0062] ​Step 303: If Preempt <r,则将L’中第一个业务l’存入集合S,并在集合L’中删除对应业务,令Preempt=Preempt+b(l’),返回至步骤301;否则,计算浪费带宽Waste=Preempt-r,得到抢占业务集合S和浪费带宽Waste;其中,b(l’)是业务l’占用的带宽。

[0063] Step 4: Eliminate services with bandwidth smaller than Waste from the preemptive service set S to obtain a final preemptive service set.

[0064] The specific process is:

[0065] Step 401: Determine whether there is a service in S whose bandwidth is less than or equal to Waste;

[0066] Step 402: If there are services in S whose bandwidth is less than or equal to Waste, sort the services that meet the requirements from high to low according to the loss cost value to obtain the set W', eliminate the first service s', and set Waste = Waste-b(s'), where b(s') is the bandwidth occupied by service s', and return to step 401; otherwise, obtain the final set of preempted services.

[0067] Figure 2-Figure 4 This is a simulation comparison diagram of the solution proposed in the present invention and the traditional v-prept solution in terms of preemptive service bandwidth waste, average priority and average transmission completion. The simulation was performed using MATLAB2017. Figure 2-Figure 4 The horizontal axis is the number of simulations, totaling 1000. Each simulation randomly generates service flows and new service flows transmitted in the link, outputs the service set that needs to be preempted for each solution, and calculates bandwidth waste, average priority, and average transmission completion.

[0068] As can be seen from the figure, although the solution proposed in the present invention wastes relatively more bandwidth than the v-prept solution, the average priority and average transmission completion rate of the preempted services are lower than those of the traditional solution. This shows that the solution proposed in the present invention can significantly improve the delivery rate of important services and effectively enhance user satisfaction.

[0069] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A resource preemption method based on maximizing user satisfaction, characterized in that: It includes the following steps: Step 1: Establish a resource preemption cost function model according to four optimization criteria, namely preemption service priority, number of preemption services, preemption bandwidth, and user satisfaction. The resource preemption cost function model is as follows: In the formula, H(l) represents the cost value required for preemption service l; α, β, and γ are the weights of three objective sub-functions; l represents the l-th element in set L, and L is the set of candidate services for preemption. The holding priorities of services in the set are all lower than the establishment priority of the new service. It refers to the value cost introduced by the amount of data transmitted by the service l when preempting the service l. K(l) represents the priority cost of the preempted service l, K(l) = 8-p(l), p(l) is the maintenance priority of service l, w represents the completion degree of service transmission, w∈(0,1); It refers to the cost of reducing the number of preempted connections when preempting service l, and b(l) is the bandwidth occupied by service l; γ(b(l)-r) 2 It refers to the cost of bandwidth waste caused by preempting service l, r is the bandwidth that needs to be preempted by new or rerouted service ρ, and service ρ is the bandwidth that needs to be preempted on the transmission link e. j Bandwidth that needs to be seized r = b(ρ) - a j , a j is the transmission link e j The remaining available bandwidth is ρ, and b(ρ) is the bandwidth requirement of service ρ; Step 2: Sort all preemption services in ascending order according to the cost value H(l); and judge whether there are the same cost values H(l). If so, execute different solutions through different configurations of α, β, and γ to obtain the sorted service set L'. Step 3: Preempt services in the sorted service set L' obtained in Step 2 to obtain the preemption service set S and the wasted bandwidth Waste.

2. A resource preemption method based on maximizing user satisfaction according to claim 1, characterized in that: Step 4: Eliminate services in the preemption service set S with bandwidth less than Waste to obtain the final preemption service set. The specific process of Step 2 is as follows: If the α value is the largest, the services are sorted in ascending order according to the value v(l). If v(l) are the same, they are sorted in ascending order according to (b(l)-r). 2 Sort the business in ascending order, if (b(l)-r) 2 If they are the same, the businesses are sorted in descending order according to b(l); If the β value is the largest or the three are equal, then sort the businesses in descending order according to b(l). If b(l) are the same, then sort the businesses in ascending order according to value v(l). If v(l) are the same, then sort the businesses in ascending order according to (b(l)-r). 2 Sort the businesses in ascending order; If the γ value is the largest, then press (b(l)-r) 2 Sort the business in ascending order, if (b(l)-r) 2 If the values ​​of v(l) and b(l) are the same, the businesses are sorted in ascending order according to their value. If the values ​​of v(l) and b(l) are the same, the businesses are sorted in descending order according to their value.

3. The resource preemption method based on maximizing user satisfaction according to claim 2, characterized in that: Sort all preemption services in L in ascending order according to the cost value H(l), and judge whether there are the same cost values H(l). If so, execute different solutions through different configurations of α, β, and γ: The specific process of Step 3 is as follows: Step 301: Preempt the first service in L'. Step 302: Judge whether the pre-empted bandwidth Preempt of the current link is less than the required preemption bandwidth r. Step 303: If Preempt < r, deposit the first service l' in L' into set S, delete the corresponding service in set L', let Preempt = Preempt + b(l'), and return to Step 301.

4. The resource preemption method based on maximizing user satisfaction according to claim 3, characterized in that: Otherwise, calculate the wasted bandwidth Waste = Preempt - r to obtain the preemption service set S and the wasted bandwidth Waste; where, b(l') is the bandwidth occupied by service l'. The specific process of Step 4 is as follows: Step 401: Judge whether there is a service in S with bandwidth less than or equal to Waste. Step 402: If there is a service in S with bandwidth less than or equal to Waste, sort the services that meet the requirements in descending order according to the loss cost value to obtain set W', eliminate the first service s', and let Waste = Waste - b(s'), where b(s') is the bandwidth occupied by service s', and return to Step 401. Otherwise, obtain the final preemption service set.

Images