CN113709888B - 5G fairness scheduling method and device considering time delay under eMB scene - Google Patents

5G fairness scheduling method and device considering time delay under eMB scene Download PDF

Info

Publication number
CN113709888B
CN113709888B CN202111251270.6A CN202111251270A CN113709888B CN 113709888 B CN113709888 B CN 113709888B CN 202111251270 A CN202111251270 A CN 202111251270A CN 113709888 B CN113709888 B CN 113709888B
Authority
CN
China
Prior art keywords
service
services
scheduling
value
priority
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111251270.6A
Other languages
Chinese (zh)
Other versions
CN113709888A (en
Inventor
肖清华
朱东照
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huaxin Consulting Co Ltd
Original Assignee
Huaxin Consulting Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huaxin Consulting Co Ltd filed Critical Huaxin Consulting Co Ltd
Priority to CN202111251270.6A priority Critical patent/CN113709888B/en
Publication of CN113709888A publication Critical patent/CN113709888A/en
Application granted granted Critical
Publication of CN113709888B publication Critical patent/CN113709888B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The application discloses a 5G fairness scheduling method considering time delay under an eMB scene, which is used for endowing higher priority scheduling by identifying the time delay switching value of each service and continuously scanning the round-robin times. For rate applications in different scenarios of eMBB, if the rate requirements are easier to satisfy, best-effort services are provided on the premise of considering fairness. Therefore, the time delay requirement of each service and the scheduling fairness can be ensured while the high throughput of the eMBB is met. In addition, the application also provides a 5G fairness scheduling device, computer equipment and a computer readable storage medium which take time delay into consideration under the eMBB scene, and the technical effect of the method corresponds to that of the method.

Description

5G fairness scheduling method and device considering time delay under eMB scene
Technical Field
The present application relates to the field of mobile communications technologies, and in particular, to a 5G fairness scheduling method, apparatus, computer device, and computer-readable storage medium considering latency under an eMBB scenario.
Background
ITU (International telecommunications Union) defines three major service application scenarios of 5G networks, namely eMBB (Enhanced Mobile Broadband), urrllc (Ultra Reliable and Low Latency Communication), and mtc (Massive Machine Type Communication). The eMBB meets the business requirements of large bandwidth and large throughput of personal and enterprise users; the uRLLC meets the service requirements of low time delay and low jitter. The actual service scheduling focuses more on one of the scenarios, but it is a very considerable problem how to consider multiple scenarios, such as meeting the requirements of high throughput and low delay of urrllc as much as possible while meeting the requirements of high throughput in the most widely applied eMBB scenario.
Disclosure of Invention
The application aims to provide a 5G fairness scheduling method, a device, computer equipment and a computer readable storage medium which take time delay into consideration in an eMB scene, and is used for solving the problem that the current resource scheduling scheme cannot simultaneously meet the high throughput requirement in the eMB scene and the low time delay requirement in the uRLLC scene. The specific scheme is as follows:
in a first aspect, the present application provides a 5G fairness scheduling method considering latency under an eMBB scenario, including:
calculating the delay deviation of each service at the current moment, if the delay deviation is less than or equal to the product of the delay early warning coefficient and the delay tolerance of the service, setting the delay switching value of the service to be 1, and otherwise, setting the delay switching value of the service to be 0;
calculating the ratio of the throughput of each service to the throughput of all services to serve as an initial value of the scheduling priority of the service, and recording the maximum value of the ratio of all services;
tracking each service, if a service with the number of times of the sky exceeding the warning threshold value of the sky, dividing the service from the service set to the sky set, updating the numerical value of the scheduling priority of the service in the sky set to the maximum value of the ratio of all the services, and recording the divided service set as a first set;
calculating mathematical expected values of application rates of all services, and for each service in the first set, if the ideal application rate is less than the mathematical expected values of the application rates of all services, dividing the service from the first set into a moderate best-effort set, and recording the divided first set as a second set; calculating mathematical expected values of the scheduling priorities of all services, and updating the numerical values of the scheduling priorities of the services in the moderate best effort set into the mathematical expected values of the scheduling priorities of all services;
calculating a stepping priority;
and screening out services meeting a first condition from the second set to serve as a third set, wherein the first condition is as follows: the application rate of the service is greater than or equal to the ideal application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the third set, the numerical value of the scheduling priority is not updated;
and screening out services meeting a second condition from the second set to serve as a fourth set, wherein the second condition is as follows: the ideal application rate of the service is greater than or equal to the mathematical expected value of the application rates of all the services and is greater than the application rate of the service; determining the maximum value of the scheduling priority of all the services in the fourth set; for each service in the fourth set, if the delay switching value is 0, updating the numerical value of the scheduling priority to the maximum value of the scheduling priority of all the services in the fourth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the maximum value of the scheduling priority of all the services in the fourth set and the stepping priority, and setting the delay switching value to be 0;
and screening out services meeting a third condition from the second set to serve as a fifth set, wherein the third condition is as follows: the ideal application rate of the service is greater than the application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the fifth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the current numerical value of the scheduling priority and the stepping priority, and if the delay switching value is 0, not updating the numerical value of the scheduling priority;
and scheduling the services by using a 5G scheduler according to the scheduling priority of all services.
Optionally, the calculating a mathematical expected value of the application rates of all services includes:
calculating the mathematical expectation value of the application rate of all services according to a first formula, wherein the first formula is as follows:
Figure DEST_PATH_IMAGE001
wherein,
Figure 100002_DEST_PATH_IMAGE002
as a mathematical expectation of the application rate for all services,
Figure DEST_PATH_IMAGE003
the application rate of the ith service is n, and the total number of the services is n.
Optionally, the calculating a mathematical expected value of the scheduling priority of all services includes:
calculating the mathematical expectation value of the scheduling priority of all services according to a second formula, wherein the second formula is as follows:
Figure 100002_DEST_PATH_IMAGE004
wherein,
Figure DEST_PATH_IMAGE005
the mathematical expectation of the scheduling priority for all traffic,
Figure 100002_DEST_PATH_IMAGE006
and the scheduling priority of the ith service is defined, and n is the total number of the services.
Optionally, the calculating the step priority includes:
and calculating the quotient of the mathematical expected value of the scheduling priority of all the services and the total number of the services as the stepping priority.
In a second aspect, the present application provides a 5G fairness scheduling apparatus considering latency under an eMBB scenario, including:
the delay switching value setting module is used for calculating the delay deviation of each service at the current moment, if the delay deviation is less than or equal to the product of the delay early warning coefficient and the delay tolerance of the service, the delay switching value of the service is set to be 1, and if not, the delay switching value of the service is set to be 0;
the initial value setting module is used for calculating the ratio of the throughput of each service to the throughput of all the services to serve as the initial value of the scheduling priority of the service and recording the maximum value of the ratio of all the services;
the first updating module is used for tracking each service, if the number of times of the sky-around exceeds the warning threshold value of the sky-around, the service is divided into the sky-around set from the service set, the value of the scheduling priority of the service in the sky-around set is updated to the maximum value of the ratio of all the services, and the divided service set is recorded as a first set;
the second updating module is used for calculating the mathematical expected value of the application rate of all the services, and for each service in the first set, if the ideal application rate is less than the mathematical expected value of the application rate of all the services, the service is divided into a moderate best-effort set from the first set, and the divided first set is marked as a second set; calculating mathematical expected values of the scheduling priorities of all services, and updating the numerical values of the scheduling priorities of the services in the moderate best effort set into the mathematical expected values of the scheduling priorities of all services;
the step priority calculating module is used for calculating step priority;
and the screening module is used for screening out the services meeting the first condition from the second set to be used as a third set, and the first condition is as follows: the application rate of the service is greater than or equal to the ideal application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the third set, the numerical value of the scheduling priority is not updated;
a third updating module, configured to screen, from the second set, a service that meets a second condition, as a fourth set, where the second condition is: the ideal application rate of the service is greater than or equal to the mathematical expected value of the application rates of all the services and is greater than the application rate of the service; determining the maximum value of the scheduling priority of all the services in the fourth set; for each service in the fourth set, if the delay switching value is 0, updating the numerical value of the scheduling priority to the maximum value of the scheduling priority of all the services in the fourth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the maximum value of the scheduling priority of all the services in the fourth set and the stepping priority, and setting the delay switching value to be 0;
a fourth updating module, configured to screen, from the second set, a service that meets a third condition, as a fifth set, where the third condition is: the ideal application rate of the service is greater than the application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the fifth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the current numerical value of the scheduling priority and the stepping priority, and if the delay switching value is 0, not updating the numerical value of the scheduling priority;
and the scheduling module is used for scheduling the services by using the 5G scheduler according to the scheduling priorities of all the services.
Optionally, the second updating module is configured to:
calculating the mathematical expectation value of the application rate of all services according to a first formula, wherein the first formula is as follows:
Figure 53749DEST_PATH_IMAGE001
wherein,
Figure 610632DEST_PATH_IMAGE002
as a mathematical expectation of the application rate for all services,
Figure 346507DEST_PATH_IMAGE003
the application rate of the ith service is n, and the total number of the services is n.
Optionally, the second updating module is configured to:
calculating the mathematical expectation value of the scheduling priority of all services according to a second formula, wherein the second formula is as follows:
Figure 748669DEST_PATH_IMAGE004
wherein,
Figure 135657DEST_PATH_IMAGE005
the mathematical expectation of the scheduling priority for all traffic,
Figure 66704DEST_PATH_IMAGE006
and the scheduling priority of the ith service is defined, and n is the total number of the services.
Optionally, the step priority calculating module is configured to:
and calculating the quotient of the mathematical expected value of the scheduling priority of all the services and the total number of the services as the stepping priority.
In a third aspect, the present application provides a computer device comprising:
a memory for storing a computer program;
and the processor is used for executing the computer program to realize the 5G fairness scheduling method which takes time delay into consideration under the eMB scene.
In a fourth aspect, the present application provides a computer-readable storage medium, having a computer program stored thereon, where the computer program is used to implement the 5G fairness scheduling method with latency compromise under the eMBB scenario as described above when the computer program is executed by a processor.
The 5G fairness scheduling method considering time delay under the eMB scene provided by the application is used for endowing higher priority scheduling by identifying the time delay switching value of each service and continuously scanning the round-robin times. For rate applications in different scenarios of eMBB, if the rate requirements are easier to satisfy, best-effort services are provided on the premise of considering fairness. Therefore, the time delay requirement of each service and the scheduling fairness can be ensured while the high throughput of the eMBB is met. The following effects are finally achieved: the condition of service null is avoided as much as possible, service delay is guaranteed to be within an allowable range, the throughput of the whole system is improved to the maximum extent according to the difference of service application rates, and the service requirement under an eMBB scene is met.
In addition, the application also provides a 5G fairness scheduling device, a computer device and a computer readable storage medium considering time delay under the eMBB scenario, and the technical effect of the scheduling device corresponds to the technical effect of the method, which is not described herein again.
Drawings
For a clearer explanation of the embodiments or technical solutions of the prior art of the present application, the drawings needed for the description of the embodiments or prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart of a first embodiment of a 5G fairness scheduling method considering latency under an eMBB scenario provided in the present application;
fig. 2 is a flowchart of a second embodiment of a 5G fairness scheduling method considering latency under an eMBB scenario provided by the present application;
fig. 3 is a throughput comparison graph of the 5G fairness scheduling method considering delay under the eMBB scenario provided by the present application and other algorithms;
fig. 4 is a time delay comparison diagram of a 5G fairness scheduling method considering time delay in an eMBB scenario provided by the present application and other algorithms;
fig. 5 is a comparison diagram of scheduling fairness of the 5G fairness scheduling method considering time delay in the eMBB scenario provided by the present application and other algorithms;
fig. 6 is a schematic diagram of an embodiment of a 5G fairness scheduling apparatus considering latency under an eMBB scenario provided in the present application.
Detailed Description
In order that those skilled in the art will better understand the disclosure, the following detailed description will be given with reference to the accompanying drawings. It is to be understood that the embodiments described are only a few embodiments of the present application and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The application aims to improve the system throughput more in an eMBB scene, meet the time delay requirements of various services, and automatically perform scheduling priority matching according to different rates of the services on the premise of guaranteeing fairness, so that a 5G fairness scheduling method, a device, computer equipment and a computer readable storage medium which take time delay into consideration in the eMBB scene are provided.
A first embodiment of a 5G fairness scheduling method considering latency under an eMBB scenario provided in the present application is described below, with reference to fig. 1, the first embodiment includes:
s11, calculating the time delay deviation of each service at the current moment, if the time delay deviation is less than or equal to the product of the time delay early warning coefficient and the time delay tolerance of the service, setting the time delay switching value of the service as 1, otherwise, setting the time delay switching value of the service as 0;
s12, calculating the ratio of the throughput of each service to the throughput of all services to be used as the initial value of the scheduling priority of the service, and recording the maximum value of the ratio of all services;
s13, tracking each service, if a service with the number of times of the sky exceeding the warning threshold value of the sky, dividing the service from the service set to the sky set, updating the value of the scheduling priority of the service in the sky set to the maximum value of the ratio of all the services, and recording the divided service set as a first set;
s14, calculating mathematical expectation values of the application rates of all services, and for each service in the first set, if the ideal application rate is less than the mathematical expectation values of the application rates of all services, dividing the service from the first set into a moderate best effort set, and recording the divided first set as a second set; calculating mathematical expected values of the scheduling priorities of all services, and updating the numerical values of the scheduling priorities of the services in the moderate best effort set into the mathematical expected values of the scheduling priorities of all services;
as a specific implementation manner, the mathematical expectation value of the application rate of all services is calculated according to a first formula, where the first formula is as follows:
Figure 555454DEST_PATH_IMAGE001
wherein,
Figure 10575DEST_PATH_IMAGE002
as a mathematical expectation of the application rate for all services,
Figure 268381DEST_PATH_IMAGE003
the application rate of the ith service is n, and the total number of the services is n.
As a specific implementation manner, the mathematical expected value of the scheduling priority of all services is calculated according to a second formula, and the second formula is as follows:
Figure 167067DEST_PATH_IMAGE004
wherein,
Figure 143113DEST_PATH_IMAGE005
the mathematical expectation of the scheduling priority for all traffic,
Figure 887078DEST_PATH_IMAGE006
and the scheduling priority of the ith service is defined, and n is the total number of the services.
S15, calculating the stepping priority;
specifically, the quotient of the mathematical expected value of the scheduling priority of all the services and the total number of the services is calculated as the stepping priority.
S16, screening out the services meeting the first condition from the second set as a third set, wherein the first condition is as follows: the application rate of the service is greater than or equal to the ideal application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the third set, the numerical value of the scheduling priority is not updated;
s17, screening out services meeting a second condition from the second set to serve as a fourth set, wherein the second condition is as follows: the ideal application rate of the service is greater than or equal to the mathematical expected value of the application rates of all the services and is greater than the application rate of the service; determining the maximum value of the scheduling priority of all the services in the fourth set; for each service in the fourth set, if the delay switching value is 0, updating the numerical value of the scheduling priority to the maximum value of the scheduling priority of all the services in the fourth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the maximum value of the scheduling priority of all the services in the fourth set and the stepping priority, and setting the delay switching value to be 0;
s18, screening out services meeting a third condition from the second set, and taking the services as a fifth set, wherein the third condition is as follows: the ideal application rate of the service is greater than the application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the fifth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the current numerical value of the scheduling priority and the stepping priority, and if the delay switching value is 0, not updating the numerical value of the scheduling priority;
and S19, scheduling the services according to the scheduling priorities of all services by using the 5G scheduler.
A second embodiment of the 5G fairness scheduling method considering latency under the eMBB scenario provided by the present application is described in detail below.
In the second embodiment, n services are included
Figure DEST_PATH_IMAGE007
The application rate of each service is
Figure 100002_DEST_PATH_IMAGE008
The ideal rate is
Figure DEST_PATH_IMAGE009
The current service delay is
Figure 100002_DEST_PATH_IMAGE010
The corresponding delay tolerance is
Figure DEST_PATH_IMAGE011
。
The overall implementation process of the second embodiment is shown in fig. 2, and mainly includes the following steps: the method comprises the following steps: time delay switching value identification, round-robin scanning, moderate best-effort set monitoring, differential tracking and scheduling implementation. The following describes each step separately.
S21, identifying a time delay switching value;
s21-1, setting a 1 st service data table, wherein the 1 st service data table comprises a service name, a current rate, an ideal rate, time delay tolerance, round-robin frequency and the like;
s21-2, setting time delay early warning coefficient of service
Figure 100002_DEST_PATH_IMAGE012
For the current time
Figure 310975DEST_PATH_IMAGE007
Each service in (1)
Figure DEST_PATH_IMAGE013
Calculating the degree of delay deviation
Figure DEST_PATH_IMAGE014
If it satisfies
Figure DEST_PATH_IMAGE015
The delay switching value of the service is set to 1, otherwise, the delay switching value is set to 0.
S22, scanning in wheel space;
s22-1, for
Figure DEST_PATH_IMAGE016
Each service in (1)
Figure DEST_PATH_IMAGE017
Setting its initial scheduling priority
Figure DEST_PATH_IMAGE018
(ii) a Calculating the total throughput of all current services
Figure DEST_PATH_IMAGE019
Calculating
Figure DEST_PATH_IMAGE020
Calculating
Figure DEST_PATH_IMAGE021
Wherein
Figure DEST_PATH_IMAGE022
represents a maximum function;
s22-2, setting the wheel-space early warning threshold value of all current services
Figure DEST_PATH_IMAGE023
(ii) a For all services
Figure DEST_PATH_IMAGE024
Tracking, scheduling each round of empty once, counter of corresponding service
Figure DEST_PATH_IMAGE025
Adding 1; if it is present
Figure DEST_PATH_IMAGE026
Then the service is sent
Figure DEST_PATH_IMAGE027
Is incorporated into the wheel space collection
Figure DEST_PATH_IMAGE028
Calculating
Figure DEST_PATH_IMAGE029
。
S23, monitoring a moderate best effort set;
s23-1, calculating the mathematical expected value of the application rate
Figure DEST_PATH_IMAGE030
(ii) a To the collection
Figure DEST_PATH_IMAGE031
Each service in (1)
Figure DEST_PATH_IMAGE032
If it satisfies
Figure DEST_PATH_IMAGE033
And
Figure DEST_PATH_IMAGE034
then the service is sent
Figure DEST_PATH_IMAGE035
Incorporated into the moderate best effort set MBE,
Figure DEST_PATH_IMAGE036
；
s23-2, calculating mathematical expectation value of all service priority
Figure DEST_PATH_IMAGE037
Updating the priority of each service in the MBE set
Figure DEST_PATH_IMAGE038
。
S24, differential tracking;
s24-1, calculating step priority
Figure DEST_PATH_IMAGE039
；
S24-2, for service sets
Figure DEST_PATH_IMAGE040
；；
In that
Figure DEST_PATH_IMAGE041
Medium screening meets the Case1 condition
Figure DEST_PATH_IMAGE042
Set of (2)
Figure DEST_PATH_IMAGE043
Hold, hold
Figure 39284DEST_PATH_IMAGE043
Priority of traffic in
Figure DEST_PATH_IMAGE044
Is not changed, i.e.
Figure DEST_PATH_IMAGE045
；
In that
Figure DEST_PATH_IMAGE046
Medium screening meets the Case2 condition
Figure DEST_PATH_IMAGE047
Set of (2)
Figure DEST_PATH_IMAGE048
Calculating the maximum value of the service priority
Figure DEST_PATH_IMAGE049
；
To pair
Figure DEST_PATH_IMAGE050
If the delay switching value is 0, the priority of each service is updated
Figure DEST_PATH_IMAGE051
=
Figure DEST_PATH_IMAGE052
(ii) a To pair
Figure 277193DEST_PATH_IMAGE050
If the amount of the over-delay switch is 1, the priority of each service is updated
Figure 90429DEST_PATH_IMAGE051
=
Figure DEST_PATH_IMAGE053
And the time-out switching value is set to 0; in that
Figure 791668DEST_PATH_IMAGE041
Medium screening meets the Case3 condition
Figure DEST_PATH_IMAGE054
Set of (2)
Figure DEST_PATH_IMAGE055
(ii) a To pair
Figure 750266DEST_PATH_IMAGE055
If the delay switching value is 0, then keeping
Figure 169746DEST_PATH_IMAGE055
Priority of traffic in
Figure 521093DEST_PATH_IMAGE044
The change is not changed; to pair
Figure 607998DEST_PATH_IMAGE055
If the delay switch amount is 1, the priority of each service is updated
Figure 534234DEST_PATH_IMAGE051
=
Figure DEST_PATH_IMAGE056
And will exceed the switch value set to 0.
S25, scheduling implementation;
for service sets with updated priority
Figure 175431DEST_PATH_IMAGE007
According to the updated
Figure 64890DEST_PATH_IMAGE018
And sending the data to a 5G scheduler for scheduling.
The scheduling process of this embodiment is specifically described below by taking n =6 as an example, and the service conditions developed by the 5G system at the current time are as shown in table 1:
TABLE 1
Figure DEST_PATH_IMAGE057
The basic data are shown in table 2:
TABLE 2
Figure DEST_PATH_IMAGE058
The 5G fairness scheduling method considering latency under the eMBB scenario of the present embodiment includes the following steps:
step 1: identifying time delay switching value;
for the current time
Figure 724410DEST_PATH_IMAGE007
Each service in (1)
Figure 306701DEST_PATH_IMAGE013
Calculating the degree of delay deviation
Figure DEST_PATH_IMAGE059
Satisfy the following requirements
Figure 435194DEST_PATH_IMAGE015
Is a service set of
Figure DEST_PATH_IMAGE060
The time-out switching values of these services are set to 1,
Figure DEST_PATH_IMAGE061
the delay switching value of (1) is set to 0.
Step 2: scanning in the wheel space;
step 2-1: for the
Figure 846453DEST_PATH_IMAGE016
Each service in (1)
Figure DEST_PATH_IMAGE062
Calculating the total throughput
Figure DEST_PATH_IMAGE063
Calculating
Figure DEST_PATH_IMAGE064
And then calculate
Figure DEST_PATH_IMAGE065
；
Step 2-2: satisfy the requirement of
Figure 298163DEST_PATH_IMAGE026
In a wheel space
Figure DEST_PATH_IMAGE066
Calculating
Figure DEST_PATH_IMAGE067
。
And step 3: moderate best effort collection monitoring;
step 3-1, calculating the mathematical expected value of the application rate
Figure DEST_PATH_IMAGE068
(ii) a To the collection
Figure DEST_PATH_IMAGE069
Each service in (1)
Figure 707147DEST_PATH_IMAGE032
Satisfy the following requirements
Figure 854095DEST_PATH_IMAGE033
And
Figure 616514DEST_PATH_IMAGE034
moderate best effort collection of
Figure DEST_PATH_IMAGE070
；
Step 3-2: calculating mathematical expectation of all traffic priorities
Figure DEST_PATH_IMAGE071
Updating the priority of each service in the MBE set
Figure DEST_PATH_IMAGE072
。
And 4, step 4: differential tracking;
step 4-1: calculating step priorities
Figure DEST_PATH_IMAGE073
；
Step 4-2: for service sets
Figure DEST_PATH_IMAGE074
；
In that
Figure 657152DEST_PATH_IMAGE041
Medium screening meets the Case1 condition
Figure 581245DEST_PATH_IMAGE042
Set of (2)
Figure DEST_PATH_IMAGE075
Hold, hold
Figure 939457DEST_PATH_IMAGE043
Priority of traffic in
Figure 974410DEST_PATH_IMAGE044
Is not changed, i.e.
Figure DEST_PATH_IMAGE076
；
In that
Figure 744919DEST_PATH_IMAGE041
Medium screening meets the Case2 condition
Figure 574335DEST_PATH_IMAGE047
Set of (2)
Figure DEST_PATH_IMAGE077
Calculating the maximum value of the service priority
Figure DEST_PATH_IMAGE078
；
Figure 148405DEST_PATH_IMAGE050
In
Figure DEST_PATH_IMAGE079
If the delay switching value is 0, the priority is updated
Figure DEST_PATH_IMAGE080
=
Figure DEST_PATH_IMAGE081
；
Figure DEST_PATH_IMAGE082
In
Figure DEST_PATH_IMAGE083
If the delay switching value is 1, the priority is updated
Figure DEST_PATH_IMAGE084
=
Figure DEST_PATH_IMAGE085
And the time delay switching value is set to 0;
in that
Figure 580523DEST_PATH_IMAGE041
Medium screening meets the Case3 condition
Figure 205540DEST_PATH_IMAGE054
Set of (2)
Figure DEST_PATH_IMAGE086
；
Figure DEST_PATH_IMAGE087
If the delay switching value is 1, the priority is updated
Figure DEST_PATH_IMAGE088
=
Figure DEST_PATH_IMAGE089
And sets its delay switching value to 0.
And 5: scheduling implementation;
for service sets with updated priority
Figure 392807DEST_PATH_IMAGE007
According to after updateIs/are as follows
Figure DEST_PATH_IMAGE090
And sending the data to a 5G scheduler for scheduling.
MATLAB platform simulation is performed on four methods, namely a 5G fairness scheduling method giving consideration to time delay in an eMBB scenario, an LTE fairness scheduling method with priority to throughput (TFFG method for short), RR, and M-LWDF in this embodiment, a certain user is randomly scattered, a random service is configured, the total load of a 5G base station gNB is kept at about 50%, several services are forced to be nulled, and the obtained throughput, time delay, and fairness are respectively shown in fig. 3 to 5.
As shown in fig. 3, the 5G fairness scheduling method considering latency in the eMBB scenario of this embodiment performs priority scheduling on services meeting requirements as much as possible, so as to improve system throughput, while TFFG adopts a cutting-off manner, so that throughput improvement is obvious, but latency improvement and fairness reduction are brought. M-LWDF is a modified maximum weight algorithm, although time delay is also considered, the method is relatively unobvious in the aspect of throughput embodiment, and RR throughput performance is the lowest;
as shown in fig. 4, the 5G fairness scheduling method considering delay in the eMBB scenario of this embodiment has the best delay control effect, mainly because a delay control threshold is introduced, and the service with delay switching value of 1 is scheduled in time, so that the overall service delay is reduced, and the effect is much better than that of the TFFG and M-LWDF methods;
as shown in fig. 5, fairness RR of several algorithms is still better, and the 5G fairness scheduling method that takes account of time delay in the eMBB scenario of this embodiment is next to M-LWDF and TFFG, which aggressively schedules high throughput users and may generate a large side effect under the condition that the total resources of the system are limited, that is, low-rate services are preempted, fairness of scheduling is naturally reduced, which is relatively speaking, the 5G fairness scheduling method that takes account of time delay in the eMBB scenario of this embodiment can take account of both throughput and time delay.
The following introduces a 5G fairness scheduling device considering latency under an eMBB scenario provided in the embodiment of the present application, and the 5G fairness scheduling device considering latency under the eMBB scenario described below and the 5G fairness scheduling method considering latency under the eMBB scenario described above may be referred to correspondingly.
As shown in fig. 6, the 5G fairness scheduling apparatus with consideration of time delay in the eMBB scenario of this embodiment includes:
the delay switching value setting module 61 is configured to calculate a delay deviation of each service at the current time, and set the delay switching value of the service to 1 if the delay deviation is less than or equal to a product of a delay early warning coefficient and a delay tolerance of the service, and otherwise set the delay switching value of the service to 0;
an initial value setting module 62, configured to calculate a ratio of the throughput of each service to the throughput of all services, to serve as an initial value of the scheduling priority of the service, and record a maximum value of the ratio of all services;
a first updating module 63, configured to track each service, if there is a service whose number of times of sky-around exceeds a warning threshold, divide the service from the service set to a sky-around set, update a value of a scheduling priority of the service in the sky-around set to a maximum value of ratios of all services, and mark the divided service set as a first set;
a second updating module 64, configured to calculate mathematical expected values of application rates of all services, and for each service in the first set, if the ideal application rate is smaller than the mathematical expected value of the application rates of all services, divide the service from the first set into a moderate best effort set, and mark the divided first set as a second set; calculating mathematical expected values of the scheduling priorities of all services, and updating the numerical values of the scheduling priorities of the services in the moderate best effort set into the mathematical expected values of the scheduling priorities of all services;
a step priority calculation module 65 for calculating a step priority;
a screening module 66, configured to screen, from the second set, a service that meets a first condition, as a third set, where the first condition is: the application rate of the service is greater than or equal to the ideal application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the third set, the numerical value of the scheduling priority is not updated;
a third updating module 67, configured to screen, from the second set, services that meet a second condition, as a fourth set, where the second condition is: the ideal application rate of the service is greater than or equal to the mathematical expected value of the application rates of all the services and is greater than the application rate of the service; determining the maximum value of the scheduling priority of all the services in the fourth set; for each service in the fourth set, if the delay switching value is 0, updating the numerical value of the scheduling priority to the maximum value of the scheduling priority of all the services in the fourth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the maximum value of the scheduling priority of all the services in the fourth set and the stepping priority, and setting the delay switching value to be 0;
a fourth updating module 68, configured to screen, from the second set, services that satisfy a third condition, as a fifth set, where the third condition is: the ideal application rate of the service is greater than the application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the fifth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the current numerical value of the scheduling priority and the stepping priority, and if the delay switching value is 0, not updating the numerical value of the scheduling priority;
and a scheduling module 69, configured to schedule the services according to the scheduling priorities of all the services by using the 5G scheduler.
In some specific embodiments, the second updating module is configured to:
calculating the mathematical expectation value of the application rate of all services according to a first formula, wherein the first formula is as follows:
Figure 454173DEST_PATH_IMAGE001
wherein,
Figure 362086DEST_PATH_IMAGE002
mathematical expectation of application rates for all servicesThe value of the one or more of the one,
Figure 841609DEST_PATH_IMAGE003
the application rate of the ith service is n, and the total number of the services is n.
In some specific embodiments, the second updating module is configured to:
calculating the mathematical expectation value of the scheduling priority of all services according to a second formula, wherein the second formula is as follows:
Figure 543986DEST_PATH_IMAGE004
wherein,
Figure 108959DEST_PATH_IMAGE005
the mathematical expectation of the scheduling priority for all traffic,
Figure 804252DEST_PATH_IMAGE006
and the scheduling priority of the ith service is defined, and n is the total number of the services.
In some specific embodiments, the step priority calculation module is configured to:
and calculating the quotient of the mathematical expected value of the scheduling priority of all the services and the total number of the services as the stepping priority.
In addition, the present application also provides a computer device, comprising:
a memory for storing a computer program;
a processor configured to execute the computer program to implement the 5G fairness scheduling method with latency taken into account in the eMBB scenario as described above.
Finally, the present application provides a computer-readable storage medium having a computer program stored thereon, where the computer program is used to implement the 5G fairness scheduling method with latency under the eMBB scenario as described above when the computer program is executed by a processor.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The above detailed descriptions of the solutions provided in the present application, and the specific examples applied herein are set forth to explain the principles and implementations of the present application, and the above descriptions of the examples are only used to help understand the method and its core ideas of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims (8)

1. A5G fairness scheduling method giving consideration to time delay in an eMB scene is characterized by comprising the following steps:
calculating the delay deviation of each service at the current moment, if the delay deviation is less than or equal to the product of the delay early warning coefficient and the delay tolerance of the service, setting the delay switching value of the service to be 1, and otherwise, setting the delay switching value of the service to be 0;
calculating the ratio of the throughput of each service to the throughput of all services to serve as an initial value of the scheduling priority of the service, and recording the maximum value of the ratio of all services;
tracking each service, if a service with the number of times of the sky exceeding the warning threshold value of the sky, dividing the service from the service set to the sky set, updating the numerical value of the scheduling priority of the service in the sky set to the maximum value of the ratio of all the services, and recording the divided service set as a first set;
calculating mathematical expected values of application rates of all services, and for each service in the first set, if the ideal application rate is less than the mathematical expected values of the application rates of all services, dividing the service from the first set into a moderate best-effort set, and recording the divided first set as a second set; calculating mathematical expected values of the scheduling priorities of all services, and updating the numerical values of the scheduling priorities of the services in the moderate best effort set into the mathematical expected values of the scheduling priorities of all services;
calculating a stepping priority; the calculating the step priority comprises: calculating the quotient of the mathematical expected value of the scheduling priority of all services and the total number of the services as the stepping priority;
and screening out services meeting a first condition from the second set to serve as a third set, wherein the first condition is as follows: the application rate of the service is greater than or equal to the ideal application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the third set, the numerical value of the scheduling priority is not updated;
and screening out services meeting a second condition from the second set to serve as a fourth set, wherein the second condition is as follows: the ideal application rate of the service is greater than or equal to the mathematical expected value of the application rates of all the services and is greater than the application rate of the service; determining the maximum value of the scheduling priority of all the services in the fourth set; for each service in the fourth set, if the delay switching value is 0, updating the numerical value of the scheduling priority to the maximum value of the scheduling priority of all the services in the fourth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the maximum value of the scheduling priority of all the services in the fourth set and the stepping priority, and setting the delay switching value to be 0;
and screening out services meeting a third condition from the second set to serve as a fifth set, wherein the third condition is as follows: the ideal application rate of the service is greater than the application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the fifth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the current numerical value of the scheduling priority and the stepping priority, and if the delay switching value is 0, not updating the numerical value of the scheduling priority;
and scheduling the services by using a 5G scheduler according to the scheduling priority of all services.
2. The method of claim 1, wherein said calculating a mathematical expectation of the application rates for all services comprises:
calculating the mathematical expectation value of the application rate of all services according to a first formula, wherein the first formula is as follows:
Figure DEST_PATH_IMAGE002
wherein,
Figure DEST_PATH_IMAGE004
as a mathematical expectation of the application rate for all services,
Figure DEST_PATH_IMAGE006
the application rate of the ith service is n, and the total number of the services is n.
3. The method of claim 1, wherein said calculating a mathematical expectation of scheduling priorities for all services comprises:
calculating the mathematical expectation value of the scheduling priority of all services according to a second formula, wherein the second formula is as follows:
Figure DEST_PATH_IMAGE008
wherein,
Figure DEST_PATH_IMAGE010
the mathematical expectation of the scheduling priority for all traffic,
Figure DEST_PATH_IMAGE012
and the scheduling priority of the ith service is defined, and n is the total number of the services.
4. The utility model provides a compromise 5G fairness scheduling device of time delay under eMB scene which characterized in that includes:
the delay switching value setting module is used for calculating the delay deviation of each service at the current moment, if the delay deviation is less than or equal to the product of the delay early warning coefficient and the delay tolerance of the service, the delay switching value of the service is set to be 1, and if not, the delay switching value of the service is set to be 0;
the initial value setting module is used for calculating the ratio of the throughput of each service to the throughput of all the services to serve as the initial value of the scheduling priority of the service and recording the maximum value of the ratio of all the services;
the first updating module is used for tracking each service, if the number of times of the sky-around exceeds the warning threshold value of the sky-around, the service is divided into the sky-around set from the service set, the value of the scheduling priority of the service in the sky-around set is updated to the maximum value of the ratio of all the services, and the divided service set is recorded as a first set;
the second updating module is used for calculating the mathematical expected value of the application rate of all the services, and for each service in the first set, if the ideal application rate is less than the mathematical expected value of the application rate of all the services, the service is divided into a moderate best-effort set from the first set, and the divided first set is marked as a second set; calculating mathematical expected values of the scheduling priorities of all services, and updating the numerical values of the scheduling priorities of the services in the moderate best effort set into the mathematical expected values of the scheduling priorities of all services;
the step priority calculating module is used for calculating step priority; the step priority calculation module is configured to: calculating the quotient of the mathematical expected value of the scheduling priority of all services and the total number of the services as the stepping priority;
and the screening module is used for screening out the services meeting the first condition from the second set to be used as a third set, and the first condition is as follows: the application rate of the service is greater than or equal to the ideal application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the third set, the numerical value of the scheduling priority is not updated;
a third updating module, configured to screen, from the second set, a service that meets a second condition, as a fourth set, where the second condition is: the ideal application rate of the service is greater than or equal to the mathematical expected value of the application rates of all the services and is greater than the application rate of the service; determining the maximum value of the scheduling priority of all the services in the fourth set; for each service in the fourth set, if the delay switching value is 0, updating the numerical value of the scheduling priority to the maximum value of the scheduling priority of all the services in the fourth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the maximum value of the scheduling priority of all the services in the fourth set and the stepping priority, and setting the delay switching value to be 0;
a fourth updating module, configured to screen, from the second set, a service that meets a third condition, as a fifth set, where the third condition is: the ideal application rate of the service is greater than the application rate of the service and is greater than or equal to the mathematical expected value of the application rates of all services; for each service in the fifth set, if the delay switching value is 1, updating the numerical value of the scheduling priority to the sum of the current numerical value of the scheduling priority and the stepping priority, and if the delay switching value is 0, not updating the numerical value of the scheduling priority;
and the scheduling module is used for scheduling the services by using the 5G scheduler according to the scheduling priorities of all the services.
5. The apparatus of claim 4, wherein the second update module is to:
calculating the mathematical expectation value of the application rate of all services according to a first formula, wherein the first formula is as follows:
Figure DEST_PATH_IMAGE002A
wherein,
Figure 698513DEST_PATH_IMAGE004
as a mathematical expectation of the application rate for all services,
Figure 350074DEST_PATH_IMAGE006
the application rate of the ith service is n, and the total number of the services is n.
6. The apparatus of claim 4, wherein the second update module is to:
calculating the mathematical expectation value of the scheduling priority of all services according to a second formula, wherein the second formula is as follows:
Figure DEST_PATH_IMAGE008A
wherein,
Figure 801915DEST_PATH_IMAGE010
the mathematical expectation of the scheduling priority for all traffic,
Figure 915234DEST_PATH_IMAGE012
and the scheduling priority of the ith service is defined, and n is the total number of the services.
7. A computer device, comprising:
a memory for storing a computer program;
a processor configured to execute the computer program to implement the method for 5G fairness scheduling with latency tradeoff in the eMBB scenario of any of claims 1 to 3.
8. A computer-readable storage medium, having a computer program stored thereon, wherein the computer program, when being executed by a processor, is configured to implement the method for latency-tolerant 5G fairness scheduling in an eMBB scenario as claimed in any one of claims 1 to 3.
CN202111251270.6A 2021-10-27 2021-10-27 5G fairness scheduling method and device considering time delay under eMB scene Active CN113709888B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111251270.6A CN113709888B (en) 2021-10-27 2021-10-27 5G fairness scheduling method and device considering time delay under eMB scene

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111251270.6A CN113709888B (en) 2021-10-27 2021-10-27 5G fairness scheduling method and device considering time delay under eMB scene

Publications (2)

Publication Number Publication Date
CN113709888A CN113709888A (en) 2021-11-26
CN113709888B true CN113709888B (en) 2022-01-18

Family

ID=78646942

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111251270.6A Active CN113709888B (en) 2021-10-27 2021-10-27 5G fairness scheduling method and device considering time delay under eMB scene

Country Status (1)

Country Link
CN (1) CN113709888B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107105505A (en) * 2017-04-05 2017-08-29 华信咨询设计研究院有限公司 Multi-service dynamic dispatching method based on QCI

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109802819B (en) * 2017-11-16 2024-03-05 北京三星通信技术研究有限公司 Uplink control information processing method and terminal

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107105505A (en) * 2017-04-05 2017-08-29 华信咨询设计研究院有限公司 Multi-service dynamic dispatching method based on QCI

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
eMBB 与 URLLC 混合业务场景下的用户调度和资源分配;尹光辉等;《电力信息与通信技术》;20191231;全文 *
Multiplexing URLLC Traffic Within eMBB Services in 5G NR: Fair Scheduling;Hao Yin.et al;《IEEE TRANSACTIONS ON COMMUNICATIONS》;20210228;全文 *
基于QCI的LTE 多业务动态调度算法;肖清华;《邮电设计技术》;20170731;全文 *

Also Published As

Publication number Publication date
CN113709888A (en) 2021-11-26

Similar Documents

Publication Publication Date Title
US9019852B2 (en) Method and device for adjusting service processing resources of a multi-mode base station system
CN110248417B (en) Resource allocation method and system for communication service in power Internet of things
US20180375957A1 (en) Access scheduling method and apparatus for terminal, and computer storage medium
CN108494788A (en) Transmission method, data transmission device and the computer readable storage medium of data
EP3128778A1 (en) Network sharing method, apparatus and system, and computer storage medium
CN108600783A (en) A kind of method of frame rate adjusting, device and terminal device
CN110780986A (en) Internet of things task scheduling method and system based on mobile edge computing
CN113709888B (en) 5G fairness scheduling method and device considering time delay under eMB scene
CN112672364A (en) Policy configuration method and device, related equipment and storage medium
CN113596106A (en) Time delay sensitive type slice resource scheduling method based on multi-edge server cooperation
CN112469132A (en) Carrier resource scheduling method and device
CN112188500B (en) Dynamic spectrum resource allocation method and device
CN105828407A (en) Service acceptance control method and base station
CN107155220B (en) Resource scheduling method and device
CN114449664A (en) Uplink resource allocation method, system, intelligent terminal and storage medium
CN114521027A (en) Method and device for dynamically scheduling power grid resources, electronic equipment and storage medium
WO2011157082A1 (en) Power overload control method and base station
CN109600797B (en) Load unloading method under non-orthogonal multiple access mechanism
WO2024067595A1 (en) Signal transmission method and apparatus, and terminal device
KR102434985B1 (en) Apparatus and Method for allocating Resource in a RAN Sharing Environment
CN112996126B (en) Service processing method and 5G base station
CN103428774B (en) Resource regulating method and device
CN108810909B (en) Cell merging method, cell merging control device and network controller
WO2021129618A1 (en) User transmission mode switching method, electronic device, and storage medium
CN107277862A (en) A kind of transmission of video dispatching method under mobile cloud computing environment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant