CN111865705A - Scheduling performance evaluation method and device - Google Patents

Scheduling performance evaluation method and device Download PDF

Info

Publication number
CN111865705A
CN111865705A CN201910333892.XA CN201910333892A CN111865705A CN 111865705 A CN111865705 A CN 111865705A CN 201910333892 A CN201910333892 A CN 201910333892A CN 111865705 A CN111865705 A CN 111865705A
Authority
CN
China
Prior art keywords
scheduling
qos
throughput
performance
index
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.)
Withdrawn
Application number
CN201910333892.XA
Other languages
Chinese (zh)
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.)
Potevio Information Technology Co Ltd
Original Assignee
Potevio Information Technology 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 Potevio Information Technology Co Ltd filed Critical Potevio Information Technology Co Ltd
Priority to CN201910333892.XA priority Critical patent/CN111865705A/en
Publication of CN111865705A publication Critical patent/CN111865705A/en
Withdrawn legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0823—Errors, e.g. transmission errors
    • H04L43/0829—Packet loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852—Delays
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H04L43/0888—Throughput
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H04L43/0894—Packet rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition

Abstract

The embodiment of the invention provides a scheduling performance evaluation method and device. The method comprises the following steps: quantifying and evaluating each index according to the acquired data, wherein the index comprises scheduling fairness, system throughput and/or QoS satisfaction; carrying out weighting operation on each quantized index, and evaluating the comprehensive scheduling performance of the system; the calculation formula of the comprehensive scheduling performance of the system is as follows: SP ═ α ═ Th + β ═ CS + γ ═ F, where α + β + γ ═ 1, α ≦ 1 equal to or greater than 0, β ≦ 1 equal to or greater than 0, and γ ≦ 1 equal to or greater than 0; SP is the weighted operation of Th, CS and F, alpha, beta and gamma are weighted factors, Th represents the system throughput performance, CS represents the QoS satisfaction degree, and F represents the scheduling fairness; SP is more than 0 and less than or equal to 1, and the larger SP is, the better comprehensive scheduling performance is. The embodiment of the invention combines the scheduling fairness, the system throughput and the QoS satisfaction degree to carry out quantization and weighting operation, comprehensively evaluates the scheduling performance, can set corresponding weights according to different application scenes, and has wide and flexible use scenes.

Description

Scheduling performance evaluation method and device
Technical Field
The invention relates to the technical field of communication, in particular to a scheduling performance evaluation method and device.
Background
At present, the evaluation method aiming at the aspect of scheduling performance is basically a technology in the aspect of algorithm design, no specific method aiming at algorithm evaluation exists, algorithm simulation is limited to one consideration in certain aspects, and the emphasis points are different.
For different application scenarios, requirements for QoS (Quality of Service) indexes, user fairness and throughput are different, QoS is not considered in some application scenarios, and user fairness or system throughput is not considered in some application scenarios.
Disclosure of Invention
Aiming at the problems in the prior art, the embodiment of the invention provides a scheduling performance evaluation method and device.
The embodiment of the invention provides a scheduling performance evaluation method, which comprises the following steps: determining indexes to be considered and the weight of each index according to the service scene and the scheduling requirement; acquiring related data according to an index to be considered, wherein the related data comprises cell throughput, scheduling resource number, scheduling times, QoS time delay, QoS service packet loss rate and guaranteed rate GBR; the method further comprises the following steps:
quantifying and evaluating each index according to the acquired data, wherein the index comprises scheduling fairness, system throughput and/or QoS satisfaction;
Carrying out weighting operation on each quantized index, and evaluating the comprehensive scheduling performance of the system;
the calculation formula of the comprehensive scheduling performance of the system is as follows:
SP＝α*Th+β*CS+γ*F
wherein, alpha + beta + gamma is 1, alpha is more than or equal to 0 and less than or equal to 1, beta is more than or equal to 0 and less than or equal to 1, and gamma is more than or equal to 0 and less than or equal to 1;
SP is the weighted operation of Th, CS and F, alpha, beta and gamma are weighted factors, Th represents the system throughput performance, CS represents the QoS satisfaction degree, and F represents the scheduling fairness;
SP is more than 0 and less than or equal to 1, and the larger SP is, the better comprehensive scheduling performance is.
The embodiment of the invention provides a scheduling performance evaluation device, which comprises: the determining unit is used for determining the indexes to be considered and the weight of each index according to the service scene and the scheduling requirement; the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring related data according to an index which needs to be considered, and the related data comprises cell throughput, scheduling resource number, scheduling times, QoS (quality of service) time delay, QoS (quality of service) service packet loss rate and guaranteed rate GBR; the device further comprises:
the first evaluation unit is used for quantifying and evaluating each index according to the acquired data, wherein the index comprises scheduling fairness, system throughput and/or QoS satisfaction;
the second evaluation unit is used for carrying out weighting operation on each quantized index and evaluating the comprehensive scheduling performance of the system;
The calculation formula of the comprehensive scheduling performance of the system is as follows:
SP＝α*Th+β*CS+γ*F
wherein, alpha + beta + gamma is 1, alpha is more than or equal to 0 and less than or equal to 1, beta is more than or equal to 0 and less than or equal to 1, and gamma is more than or equal to 0 and less than or equal to 1;
SP is the weighted operation of Th, CS and F, alpha, beta and gamma are weighted factors, Th represents the system throughput performance, CS represents the QoS satisfaction degree, and F represents the scheduling fairness;
SP is more than 0 and less than or equal to 1, and the larger SP is, the better comprehensive scheduling performance is.
The embodiment of the invention also provides electronic equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the scheduling performance evaluation method when executing the program.
An embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the scheduling performance evaluation method.
The scheduling performance evaluation method and device provided by the embodiment of the invention combine scheduling fairness, system throughput and QoS satisfaction to carry out quantization and weighting operation, comprehensively evaluate the scheduling performance, can set corresponding weights according to different application scenes, and are wide and flexible in use scenes.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a schematic flowchart of a scheduling performance evaluation method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of an evaluation apparatus applying the scheduling performance evaluation method provided by the embodiment of the present invention;
fig. 3 is a schematic flowchart of a scheduling performance evaluation method according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a scheduling performance evaluation method apparatus according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. 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 invention.
Fig. 1 shows a schematic flow chart of a scheduling performance evaluation method according to an embodiment of the present invention.
The embodiment of the invention provides a scheduling performance evaluation method, which comprises the following steps: determining indexes to be considered and the weight of each index according to the service scene and the scheduling requirement; acquiring related data according to an index to be considered, where the related data includes cell throughput, scheduling resource number, scheduling times, QoS delay, QoS service packet loss rate, and guaranteed rate GBR, as shown in fig. 1, the method further includes:
S11, quantifying and evaluating each index according to the collected data, wherein the index comprises scheduling fairness, system throughput and/or QoS satisfaction;
specifically, according to the consideration requirement, through corresponding data acquisition, the corresponding quantization index is calculated: scheduling fairness, throughput and QoS satisfaction respectively show the performance of fairness, throughput and QoS satisfaction.
Fig. 2 shows an evaluation apparatus to which the scheduling performance evaluation method provided by the embodiment of the present invention is applied.
As shown in fig. 2, the device is divided into four parts: the system comprises an evaluated part, a triggering part, a scheduling data acquisition part and a result analysis and evaluation part. The base station and the terminal are scheduling participants, and the base station belongs to an evaluated part; the channel simulator belongs to a trigger part, generates interference, path loss and the like to simulate a real wireless environment, triggers the change of channel conditions between a terminal and a base station, and further triggers the terminal to be in different channel qualities. The scheduling and collecting module is responsible for continuously collecting information such as cell throughput, scheduling times of each user, scheduling resource number of each user, GBR (guaranteed Bit Rate) bearing Rate, QoS service delay, QoS service packet loss Rate and the like, and the more the sample points are, the more accurate the evaluation result is. The scheduling performance evaluation module is responsible for analyzing and evaluating the collected cell throughput, the scheduling times of each user, the scheduling resource number of each user, the GBR bearing rate, the QoS service delay, the QoS service packet loss rate and the like.
S12, carrying out weighting operation on each quantized index, and evaluating the comprehensive scheduling performance of the system;
the calculation formula of the comprehensive scheduling performance of the system is as follows:
SP＝α*Th+β*CS+γ*F
wherein, alpha + beta + gamma is 1, alpha is more than or equal to 0 and less than or equal to 1, beta is more than or equal to 0 and less than or equal to 1, and gamma is more than or equal to 0 and less than or equal to 1;
SP is the weighted operation of Th, CS and F, alpha, beta and gamma are weighted factors, Th represents the system throughput performance, CS represents the QoS satisfaction degree, and F represents the scheduling fairness;
SP is more than 0 and less than or equal to 1, and the larger SP is, the better comprehensive scheduling performance is.
Specifically, α, β, and γ are weights, which represent trade-offs between various requirements for system throughput and QoS and scheduling fairness, and can perform a weighted evaluation according to actual usage requirements. The larger the SP value is, the better the comprehensive scheduling performance is, and the smaller the SP value is, the lower the comprehensive scheduling performance is.
The embodiment of the invention combines scheduling fairness, system throughput and QoS satisfaction, sets different weights according to practical application scenes and consideration requirements through quantization and weighting operation, and provides a formula for evaluating the comprehensive scheduling performance of the system. If the comprehensive performance is poor, the problem of algorithm implementation can be checked by checking the poor quantitative indexes of the sub-performances (scheduling fairness, system throughput and QoS satisfaction degree), and the scheduling algorithm can be optimized in a targeted manner.
The scheduling performance evaluation method provided by the embodiment of the invention combines scheduling fairness, system throughput and QoS satisfaction to carry out quantization and weighting operation, comprehensively evaluates the scheduling performance, can set corresponding weights according to different application scenes, and has wide and flexible use scenes.
On the basis of the foregoing embodiment, S11 specifically includes:
when the scheduling fairness index needs to be considered, the scheduling fairness F is calculated according to the number of the acquired scheduling resources and the scheduling times, and the calculation formula is as follows:
Figure BDA0002038557630000041
wherein n represents the number of users, XiNumber of allocated resources, T, for user iiScheduled times for user i;
f is more than 0 and less than or equal to 1, and the larger F is, the more fair the scheduling among users is.
Specifically, in some application scenarios, the scheduling algorithm needs to consider not only fairness of resource allocation but also fairness of scheduling times, and whether resource scheduling is uniform or not is examined under the condition of continuous available resource blocks; and under the condition of fragmentizing available resources, whether the resource scheduling is uniformly quantized by using the formula and the scheduling fairness F is evaluated is examined. A larger F indicates a fair scheduling among users, and a smaller F indicates an unfair scheduling.
The embodiment of the invention can respectively evaluate the comprehensive scheduling performance and the sub-performance (scheduling fairness), and if the comprehensive performance is poor, the problem can be solved by checking the poor quantitative indexes of the sub-performance, and the scheduling algorithm can be optimized in a targeted manner.
On the basis of the foregoing embodiment, S11 specifically further includes:
when the system throughput index needs to be considered, the system throughput performance Th is calculated according to the acquired cell throughput and the theoretical throughput, and the calculation formula is as follows:
Figure BDA0002038557630000051
wherein ThthFor all users of the current system the actual throughput, including the edge user throughput and the central user throughput, ThgTheoretical throughput;
0 < Th ≦ 1, with a greater Th indicating a greater system throughput.
Specifically, in a typical application scenario, there are many users and a system load is large, where there are cell center users and edge users, and if a scheduling algorithm only considers QoS index and fairness, there are cases where the edge users obtain more resource scheduling and the center users obtain less resource scheduling, resulting in low system throughput and low resource transmission efficiency. The throughput performance Th is quantized using the above formula.
The larger the value of Th is, the larger the system obtains throughput, the more scheduling resources are obtained by users with good channel quality, and the resource transmission efficiency is higher; when system resources are fully scheduled or close to fully scheduled, it is more meaningful for throughput performance considerations.
The embodiment of the invention can respectively evaluate the comprehensive scheduling performance and the sub-performance (system throughput), and if the comprehensive performance is poorer, the problem of algorithm realization can be checked by checking the poorer quantitative indexes of the sub-performance, so that the scheduling algorithm is optimized in a targeted manner.
On the basis of the foregoing embodiment, S11 specifically further includes:
when the QoS satisfaction index needs to be considered, the QoS satisfaction CS is calculated according to the collected QoS time delay, the QoS service packet loss rate and the guaranteed rate GBR, and the calculation formula is as follows:
Figure BDA0002038557630000052
wherein, Bstotal-GRNumber of services for guaranteed rate requirements, Bstotal-TDFor the number of services required by the time delay, Bstotal-PLFor the number of services with packet loss rate requirement, GRQoSTo account for the number of services whose average rate exceeds the guaranteed rate within a period, TDQoSFor consideration of the number of services whose average delay in a period is less than the QoS delay requirement, PLQoSConsidering the number of services with the packet loss rate lower than the QoS requirement in the period;
e, theta and mu are respectively a guaranteed rate weight, a time delay weight and a packet loss rate weight;
CS is more than 0 and less than or equal to 1, and the larger CS is, the higher the overall QoS satisfaction degree is.
Specifically, the user satisfaction is considered from three important and common aspects, namely time delay, guaranteed rate (GBR) and packet loss rate, and the overall user satisfaction CS is quantified by using the above formula.
The larger the CS is, the higher the overall QoS satisfaction degree is, the epsilon, the theta and the mu are weight values, different weight values are set, different goals of QoS can be balanced, and the more important QoS requirements can be subjected to the side evaluation.
The embodiment of the invention can respectively evaluate the comprehensive scheduling performance and the sub-performance (QoS satisfaction), and if the comprehensive performance is poorer, the problem of algorithm realization can be checked by checking which sub-performance quantization indexes are poorer, so that the scheduling algorithm is optimized in a pertinence manner.
Fig. 3 is a flowchart illustrating a scheduling performance evaluation method according to an embodiment of the present invention.
As shown in fig. 3, the method specifically includes the following steps:
determining specific indexes to be considered according to the service scene and the scheduling requirement;
collecting relevant data according to the determined indexes of specific consideration: the method comprises the following steps of (1) cell throughput, scheduling resource number, scheduling times, QoS time delay, QoS service packet loss rate and guaranteed rate GBR;
if the user fairness consideration needs to be met, calculating scheduling fairness F according to the number of the acquired scheduling resources and the scheduling times;
if a system throughput consideration requirement exists, calculating a system throughput performance Th according to the acquired cell throughput and the theoretical throughput;
if the QoS satisfaction degree consideration requirement exists, setting a QoS index guarantee rate GBR, a time delay and packet loss rate weight value epsilon, theta and mu, and calculating the QoS satisfaction degree CS;
And setting scheduling fairness, system throughput and QoS satisfaction degree weights alpha, beta and gamma according to the determined index requirements and the emphasis points of specific consideration, and calculating comprehensive scheduling performance SP.
The following illustrates an application of the scheduling performance evaluation method provided by the embodiment of the present invention in each scenario.
In a first scenario, for an application scenario without QoS requirements, only scheduling fairness and throughput are considered, for example, all services are FTP (File Transfer Protocol) services, a QoS satisfaction weight β is 0, and a throughput weight α and a scheduling fairness weight γ are set according to actual conditions and requirements.
SP＝α*Th+γ*F
Wherein, alpha + gamma is 1, alpha is more than 0 and less than 1, and gamma is more than 0 and less than 1.
And for an application scenario with a requirement only on the QoS, if a session service and a streaming media service exist, the QoS index is mainly considered, because the service types are different, the scheduling fairness is not considered, the overall service volume is small, the cell throughput is not considered, the throughput weight α is 0, the scheduling fairness weight γ is 0, the QoS satisfaction weight β is 1, the QoS satisfaction is mainly concerned at this time, and the weight e, θ and μ of the guaranteed rate (GBR), the time delay and the packet loss rate are set according to the QoS target requirement balance.
SP＝CS
And a third scenario, for application scenarios with different service types, namely, session type services, streaming media, interactive services and background type services, the QoS satisfaction and the system throughput need to be considered, because the service types are different, the scheduling fairness is not considered, the corresponding weight gamma is 0, the system throughput and the QoS satisfaction weights alpha and beta are set according to the actual situation, and the weights e, theta and mu for guaranteeing the rate, the time delay and the packet loss rate are set according to the QoS target requirement balance.
SP＝α*Th+β*CS
Wherein, alpha + beta is 1, alpha is more than 0 and less than 1, and beta is more than 0 and less than 1.
Fig. 4 shows a schematic structural diagram of a scheduling performance evaluation apparatus according to an embodiment of the present invention.
As shown in fig. 4, the scheduling performance evaluation apparatus provided in the embodiment of the present invention includes: the determining unit is used for determining the indexes to be considered and the weight of each index according to the service scene and the scheduling requirement; the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring related data according to an index which needs to be considered, and the related data comprises cell throughput, scheduling resource number, scheduling times, QoS (quality of service) time delay, QoS (quality of service) service packet loss rate and guaranteed rate GBR; as shown in fig. 4, the apparatus further includes: a first evaluation unit 11 and a second evaluation unit 12, wherein:
The first evaluation unit 11 is configured to quantify and evaluate each index according to the acquired data, where the index includes scheduling fairness, system throughput, and/or QoS satisfaction;
specifically, according to the consideration requirement, through corresponding data acquisition, the corresponding quantization index is calculated: scheduling fairness, throughput and QoS satisfaction respectively show the performance of fairness, throughput and QoS satisfaction.
The second evaluation unit 12 is configured to perform weighting operation on each quantized index, and evaluate the comprehensive scheduling performance of the system;
the calculation formula of the comprehensive scheduling performance of the system is as follows:
SP＝α*Th+β*CS+γ*F
wherein, alpha + beta + gamma is 1, alpha is more than or equal to 0 and less than or equal to 1, beta is more than or equal to 0 and less than or equal to 1, and gamma is more than or equal to 0 and less than or equal to 1;
SP is the weighted operation of Th, CS and F, alpha, beta and gamma are weighted factors, Th represents the system throughput performance, CS represents the QoS satisfaction degree, and F represents the scheduling fairness;
SP is more than 0 and less than or equal to 1, and the larger SP is, the better comprehensive scheduling performance is.
Specifically, α, β, and γ are weights, which represent trade-offs between various requirements for system throughput and QoS and scheduling fairness, and can perform a weighted evaluation according to actual usage requirements. The larger the SP value is, the better the comprehensive scheduling performance is, and the smaller the SP value is, the lower the comprehensive scheduling performance is.
The embodiment of the invention combines scheduling fairness, system throughput and QoS satisfaction, sets different weights according to practical application scenes and consideration requirements through quantization and weighting operation, and provides a formula for evaluating the comprehensive scheduling performance of the system. If the comprehensive performance is poor, the problem of algorithm implementation can be checked by checking the poor quantitative indexes of the sub-performances (scheduling fairness, system throughput and QoS satisfaction degree), and the scheduling algorithm can be optimized in a targeted manner.
The scheduling performance evaluation device provided by the embodiment of the invention performs quantization and weighting operation by combining scheduling fairness, system throughput and QoS satisfaction, comprehensively evaluates the scheduling performance, can set corresponding weights according to different application scenes, and has wide and flexible use scenes.
On the basis of the above embodiment, the first evaluation unit 11 includes:
the first evaluation module is used for calculating the scheduling fairness F according to the number of the acquired scheduling resources and the scheduling times when the scheduling fairness index needs to be considered, and the calculation formula is as follows:
Figure BDA0002038557630000081
wherein n represents the number of users, XiNumber of allocated resources, T, for user iiScheduled times for user i;
f is more than 0 and less than or equal to 1, and the larger F is, the more fair the scheduling among users is.
Specifically, in some application scenarios, the scheduling algorithm needs to consider not only fairness of resource allocation but also fairness of scheduling times, and whether resource scheduling is uniform or not is examined under the condition of continuous available resource blocks; and under the condition of fragmentizing available resources, whether the resource scheduling is uniformly quantized by using the formula and the scheduling fairness F is evaluated is examined. A larger F indicates a fair scheduling among users, and a smaller F indicates an unfair scheduling.
The embodiment of the invention can respectively evaluate the comprehensive scheduling performance and the sub-performance (scheduling fairness), and if the comprehensive performance is poor, the problem can be solved by checking the poor quantitative indexes of the sub-performance, and the scheduling algorithm can be optimized in a targeted manner.
On the basis of the above embodiment, the first evaluation unit 11 further includes:
the second evaluation module is used for calculating the throughput performance Th of the system according to the acquired cell throughput and the theoretical throughput when the system throughput index needs to be considered, and the calculation formula is as follows:
Figure BDA0002038557630000091
wherein ThthFor all users of the current system the actual throughput, including the edge user throughput and the central user throughput, ThgTheoretical throughput;
0 < Th ≦ 1, with a greater Th indicating a greater system throughput.
Specifically, in a typical application scenario, there are many users and a system load is large, where there are cell center users and edge users, and if a scheduling algorithm only considers QoS index and fairness, there are cases where the edge users obtain more resource scheduling and the center users obtain less resource scheduling, resulting in low system throughput and low resource transmission efficiency. The throughput performance Th is quantized using the above formula.
The larger the value of Th is, the larger the system obtains throughput, the more scheduling resources are obtained by users with good channel quality, and the resource transmission efficiency is higher; when system resources are fully scheduled or close to fully scheduled, it is more meaningful for throughput performance considerations.
The embodiment of the invention can respectively evaluate the comprehensive scheduling performance and the sub-performance (system throughput), and if the comprehensive performance is poorer, the problem of algorithm realization can be checked by checking the poorer quantitative indexes of the sub-performance, so that the scheduling algorithm is optimized in a targeted manner.
On the basis of the above embodiment, the first evaluation unit 11 further includes:
And the third evaluation module is used for calculating the QoS satisfaction CS according to the collected QoS time delay, the QoS service packet loss rate and the guaranteed rate GBR when the QoS satisfaction index needs to be considered, and the calculation formula is as follows:
Figure BDA0002038557630000092
wherein, Bstotal-GRNumber of services for guaranteed rate requirements, Bstotal-TDFor the number of services required by the time delay, Bstotal-PLFor the number of services with packet loss rate requirement, GRQoSTo account for the number of services whose average rate exceeds the guaranteed rate within a period, TDQoSFor consideration of the number of services whose average delay in a period is less than the QoS delay requirement, PLQoSConsidering the number of services with the packet loss rate lower than the QoS requirement in the period;
e, theta and mu are respectively a guaranteed rate weight, a time delay weight and a packet loss rate weight;
CS is more than 0 and less than or equal to 1, and the larger CS is, the higher the overall QoS satisfaction degree is.
Specifically, the user satisfaction is considered from three important and common aspects, namely time delay, guaranteed rate (GBR) and packet loss rate, and the overall user satisfaction CS is quantified by using the above formula.
The larger the CS is, the higher the overall QoS satisfaction degree is, the epsilon, the theta and the mu are weight values, different weight values are set, different goals of QoS can be balanced, and the more important QoS requirements can be subjected to the side evaluation.
The embodiment of the invention can respectively evaluate the comprehensive scheduling performance and the sub-performance (QoS satisfaction), and if the comprehensive performance is poorer, the problem of algorithm realization can be checked by checking which sub-performance quantization indexes are poorer, so that the scheduling algorithm is optimized in a pertinence manner.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
An example is as follows:
fig. 5 illustrates a physical structure diagram of a server, and as shown in fig. 5, the server may include: a processor (processor)21, a communication Interface (communication Interface)22, a memory (memory)23 and a communication bus 24, wherein the processor 21, the communication Interface 22 and the memory 23 complete communication with each other through the communication bus 24. Processor 21 may call logic instructions in memory 23 to perform the following method:
quantifying and evaluating each index according to the acquired data, wherein the index comprises scheduling fairness, system throughput and/or QoS satisfaction;
carrying out weighting operation on each quantized index, and evaluating the comprehensive scheduling performance of the system;
The calculation formula of the comprehensive scheduling performance of the system is as follows:
SP＝α*Th+β*CS+γ*F
wherein, alpha + beta + gamma is 1, alpha is more than or equal to 0 and less than or equal to 1, beta is more than or equal to 0 and less than or equal to 1, and gamma is more than or equal to 0 and less than or equal to 1;
SP is the weighted operation of Th, CS and F, alpha, beta and gamma are weighted factors, Th represents the system throughput performance, CS represents the QoS satisfaction degree, and F represents the scheduling fairness;
SP is more than 0 and less than or equal to 1, and the larger SP is, the better comprehensive scheduling performance is.
In addition, the logic instructions in the memory 23 may be implemented in the form of software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.

Claims (10)

1. A scheduling performance evaluation method comprises the following steps: determining indexes to be considered and the weight of each index according to the service scene and the scheduling requirement; acquiring related data according to an index to be considered, wherein the related data comprises cell throughput, scheduling resource number, scheduling times, QoS time delay, QoS service packet loss rate and guaranteed rate GBR; characterized in that the method further comprises:
quantifying and evaluating each index according to the acquired data, wherein the index comprises scheduling fairness, system throughput and/or QoS satisfaction;
carrying out weighting operation on each quantized index, and evaluating the comprehensive scheduling performance of the system;
the calculation formula of the comprehensive scheduling performance of the system is as follows:
SP＝α*Th+β*CS+γ*F
wherein, alpha + beta + gamma is 1, alpha is more than or equal to 0 and less than or equal to 1, beta is more than or equal to 0 and less than or equal to 1, and gamma is more than or equal to 0 and less than or equal to 1;
SP is the weighted operation of Th, CS and F, alpha, beta and gamma are weighted factors, Th represents the system throughput performance, CS represents the QoS satisfaction degree, and F represents the scheduling fairness;
SP is more than 0 and less than or equal to 1, and the larger SP is, the better comprehensive scheduling performance is.
2. The method according to claim 1, wherein the quantifying and evaluating each index according to the collected data comprises:
when the scheduling fairness index needs to be considered, the scheduling fairness F is calculated according to the number of the acquired scheduling resources and the scheduling times, and the calculation formula is as follows:
Figure FDA0002038557620000011
Wherein n represents the number of users, XiNumber of allocated resources, T, for user iiScheduled times for user i;
0< F ≦ 1, with larger F indicating fair scheduling among users.
3. The method according to claim 1, wherein the quantifying and evaluating each index according to the collected data further comprises:
when the system throughput index needs to be considered, the system throughput performance Th is calculated according to the acquired cell throughput and the theoretical throughput, and the calculation formula is as follows:
Figure FDA0002038557620000012
wherein ThthFor all users of the current system the actual throughput, including the edge user throughput and the central user throughput, ThgTheoretical throughput;
0< Th ≦ 1, with a greater Th indicating a greater system throughput.
4. The method according to claim 1, wherein the quantifying and evaluating each index according to the collected data further comprises:
when the QoS satisfaction index needs to be considered, the QoS satisfaction CS is calculated according to the collected QoS time delay, the QoS service packet loss rate and the guaranteed rate GBR, and the calculation formula is as follows:
Figure FDA0002038557620000021
wherein, Bstotal-GRNumber of services for guaranteed rate requirements, Bstotal-TDFor the number of services required by the time delay, Bstotal-PLFor the number of services with packet loss rate requirement, GR QosTo account for the number of services whose average rate exceeds the guaranteed rate within a period, TDQosFor consideration of the number of services whose average delay in a period is less than the QoS delay requirement, PLQosConsidering the number of services with the packet loss rate lower than the QoS requirement in the period;
e, theta and mu are respectively a guaranteed rate weight, a time delay weight and a packet loss rate weight;
0< CS ≦ 1, with a larger CS indicating a higher overall QoS satisfaction.
5. A scheduling performance evaluation apparatus comprising: the determining unit is used for determining the indexes to be considered and the weight of each index according to the service scene and the scheduling requirement; the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring related data according to an index which needs to be considered, and the related data comprises cell throughput, scheduling resource number, scheduling times, QoS (quality of service) time delay, QoS (quality of service) service packet loss rate and guaranteed rate GBR; characterized in that the device further comprises:
the first evaluation unit is used for quantifying and evaluating each index according to the acquired data, wherein the index comprises scheduling fairness, system throughput and/or QoS satisfaction;
the second evaluation unit is used for carrying out weighting operation on each quantized index and evaluating the comprehensive scheduling performance of the system;
the calculation formula of the comprehensive scheduling performance of the system is as follows:
SP＝α*Th+β*CS+γ*F
Wherein, alpha + beta + gamma is 1, alpha is more than or equal to 0 and less than or equal to 1, beta is more than or equal to 0 and less than or equal to 1, and gamma is more than or equal to 0 and less than or equal to 1;
SP is the weighted operation of Th, CS and F, alpha, beta and gamma are weighted factors, Th represents the system throughput performance, CS represents the QoS satisfaction degree, and F represents the scheduling fairness;
SP is more than 0 and less than or equal to 1, and the larger SP is, the better comprehensive scheduling performance is.
6. The scheduling performance evaluating apparatus according to claim 5, wherein the first evaluating unit includes:
the first evaluation module is used for calculating the scheduling fairness F according to the number of the acquired scheduling resources and the scheduling times when the scheduling fairness index needs to be considered, and the calculation formula is as follows:
Figure FDA0002038557620000022
wherein n represents the number of users, XiNumber of allocated resources, T, for user iiScheduled times for user i;
0< F ≦ 1, with larger F indicating fair scheduling among users.
7. The scheduling performance evaluating apparatus according to claim 5, wherein the first evaluating unit further comprises:
the second evaluation module is used for calculating the throughput performance Th of the system according to the acquired cell throughput and the theoretical throughput when the system throughput index needs to be considered, and the calculation formula is as follows:
Figure FDA0002038557620000031
wherein ThthFor all users of the current system the actual throughput, including the edge user throughput and the central user throughput, Th gTheoretical throughput;
0< Th ≦ 1, with a greater Th indicating a greater system throughput.
8. The apparatus of claim 5, wherein the first evaluation unit further comprises:
and the third evaluation module is used for calculating the QoS satisfaction CS according to the collected QoS time delay, the QoS service packet loss rate and the guaranteed rate GBR when the QoS satisfaction index needs to be considered, and the calculation formula is as follows:
Figure FDA0002038557620000032
wherein, Bstotal-GRNumber of services for guaranteed rate requirements, Bstotal-TDFor the number of services required by the time delay, Bstotal-PLFor the number of services with packet loss rate requirement, GRQosTo account for the number of services whose average rate exceeds the guaranteed rate within a period, TDQosFor consideration of the number of services whose average delay in a period is less than the QoS delay requirement, PLQosConsidering the number of services with the packet loss rate lower than the QoS requirement in the period;
e, theta and mu are respectively a guaranteed rate weight, a time delay weight and a packet loss rate weight;
0< CS ≦ 1, with a larger CS indicating a higher overall QoS satisfaction.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the steps of the scheduling performance evaluation method according to any one of claims 1 to 4 are implemented when the processor executes the program.
10. A non-transitory computer readable storage medium, having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the scheduling performance evaluation method of any one of claims 1 to 4.
CN201910333892.XA 2019-04-24 2019-04-24 Scheduling performance evaluation method and device Withdrawn CN111865705A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910333892.XA CN111865705A (en) 2019-04-24 2019-04-24 Scheduling performance evaluation method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910333892.XA CN111865705A (en) 2019-04-24 2019-04-24 Scheduling performance evaluation method and device

Publications (1)

Publication Number Publication Date
CN111865705A true CN111865705A (en) 2020-10-30

Family

ID=72952122

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910333892.XA Withdrawn CN111865705A (en) 2019-04-24 2019-04-24 Scheduling performance evaluation method and device

Country Status (1)

Country Link
CN (1) CN111865705A (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1820517A (en) * 2003-11-14 2006-08-16 中兴通讯股份有限公司 Grouped dispatching method of wireless communication system
CN102083221A (en) * 2009-11-27 2011-06-01 中国移动通信集团北京有限公司 Resource scheduling method and device based on HSDPA (high speed downlink packet access)
CN102858015A (en) * 2011-06-30 2013-01-02 普天信息技术研究院有限公司 Multi-service scheduling method
CN103354664A (en) * 2013-06-27 2013-10-16 华为技术有限公司 Method and apparatus for scheduling user
US20140126364A1 (en) * 2009-06-12 2014-05-08 Cygnus Broadband, Inc. Systems and methods for prioritizing and scheduling packets in a communication network
CN103929822A (en) * 2014-05-13 2014-07-16 武汉邮电科学研究院 LTE proportional fair scheduling method
CN105163392A (en) * 2015-08-12 2015-12-16 西安电子科技大学 Multi-base-station multi-user proportional-fairness scheduling method with guarantee of service quality
CN106471763A (en) * 2014-07-02 2017-03-01 瑞典爱立信有限公司 The method and apparatus realizing the self-adapting detecting to dispatch request
CN106714323A (en) * 2017-01-12 2017-05-24 南京邮电大学 Priority distinguishing and dispatching method of heterogeneous flow in 4G network
CN107409065A (en) * 2015-04-08 2017-11-28 华为技术有限公司 A kind of quality of service measures method, apparatus and a kind of base station
CN108563498A (en) * 2018-04-12 2018-09-21 武汉轻工大学 A kind of cloud computing method for scheduling task and simulation system

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1820517A (en) * 2003-11-14 2006-08-16 中兴通讯股份有限公司 Grouped dispatching method of wireless communication system
US20140126364A1 (en) * 2009-06-12 2014-05-08 Cygnus Broadband, Inc. Systems and methods for prioritizing and scheduling packets in a communication network
CN102083221A (en) * 2009-11-27 2011-06-01 中国移动通信集团北京有限公司 Resource scheduling method and device based on HSDPA (high speed downlink packet access)
CN102858015A (en) * 2011-06-30 2013-01-02 普天信息技术研究院有限公司 Multi-service scheduling method
CN103354664A (en) * 2013-06-27 2013-10-16 华为技术有限公司 Method and apparatus for scheduling user
CN103929822A (en) * 2014-05-13 2014-07-16 武汉邮电科学研究院 LTE proportional fair scheduling method
CN106471763A (en) * 2014-07-02 2017-03-01 瑞典爱立信有限公司 The method and apparatus realizing the self-adapting detecting to dispatch request
EP3164956A1 (en) * 2014-07-02 2017-05-10 Telefonaktiebolaget LM Ericsson (publ) Method and arrangement enabling adaptive detection of scheduling requests
CN107409065A (en) * 2015-04-08 2017-11-28 华为技术有限公司 A kind of quality of service measures method, apparatus and a kind of base station
CN105163392A (en) * 2015-08-12 2015-12-16 西安电子科技大学 Multi-base-station multi-user proportional-fairness scheduling method with guarantee of service quality
CN106714323A (en) * 2017-01-12 2017-05-24 南京邮电大学 Priority distinguishing and dispatching method of heterogeneous flow in 4G network
CN108563498A (en) * 2018-04-12 2018-09-21 武汉轻工大学 A kind of cloud computing method for scheduling task and simulation system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
蔡灵灵，赵建立，宋荣芳: ""提供QoS保证的比例公平调度改进算法及其应用"", 《中国电子科学研究院学报》 *

Similar Documents

Publication Publication Date Title
JP5113284B2 (en) Method and apparatus for assigning network rates
KR20140035479A (en) A scheduling concept
CN111246586A (en) Method and system for distributing smart grid resources based on genetic algorithm
CN109548161B (en) Method, device and terminal equipment for scheduling wireless resources
CN109548164B (en) Self-adaptive scheduling switching method and system based on load demand
CN111328146B (en) Service scheduling method for optimizing transmission rate weight based on genetic algorithm
Brehm et al. Overload-state downlink resource allocation in LTE MAC layer
EP3291621A1 (en) Resource allocation method, apparatus and system, and base station
Lucas‐Estañ et al. Bankruptcy‐based radio resource management for multimedia mobile networks
Ang et al. Two-level scheduling framework with frame level scheduling and exponential rule in wireless network
CN113079045B (en) Bandwidth allocation method, device, server and storage medium
CN102984717B (en) The evaluation method and system of power system capacity
CN107204930A (en) Token adding method and device
CN104301944B (en) Resource capability distribution method and equipment
CN112153702A (en) Local area network bandwidth resource allocation method, storage device and equipment
CN111865705A (en) Scheduling performance evaluation method and device
CN108834214B (en) Time slot resource allocation method and device based on uplink and downlink queue balance
CN107306419A (en) A kind of end-to-end quality appraisal procedure and device
CN115955698A (en) 5G network slicing system based on smart power grid
Pinheiro et al. Performance and data traffic analysis of mobile cloud environments
Hajjawi et al. Teleoperation scheduling algorithm for smart grid communications in LTE network
CN114222371A (en) Flow scheduling method for coexistence of eMBB (enhanced multimedia broadcast/multicast service) and uRLLC (unified radio link control) equipment
CN109121165B (en) Load balancing processing method and device based on uplink big packet service
Parzy et al. QoS support in radio resource sharing with Cournot competition
CN107409065A (en) A kind of quality of service measures method, apparatus and a kind of base station

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
WW01 Invention patent application withdrawn after publication
WW01 Invention patent application withdrawn after publication

Application publication date: 20201030