Scheduling method

Abstract

The invention provides a scheduling method. According to the scheduling method, a weight calculation formula in a traditional direct proportion fairness method is adjusted according to the ratio of the service requirement rate of UE (User Equipment) to the current instantaneous speed smooth value of the UE, so that the UE with higher service requirement speed and poor channel transmission capability can obtain higher scheduling weight, and thus the scheduling fairness among users with different speed requirements is realized.

Description

technical field [0001] The invention relates to the scheduling technology of the mobile communication system, in particular to a proportional fair scheduling method. Background technique [0002] At present, there are two commonly used scheduling methods in mobile communication systems, one is the round-robin scheduling method, and the other is the proportional fair scheduling method. The round robin scheduling method is to schedule each user equipment (UE) sequentially in a round robin manner, and in this method, all UEs have an equal chance of being scheduled. In the proportional fair scheduling method, the ratio of the instantaneous rate fed back by the UE (that is, the peak rate) to the actual transmission rate is used as the scheduling priority weight, that is, the UE with the largest ratio is selected as the scheduled object. The specific method is as shown in formula (1). Show: [0003] k = arg max ...

AI Technical Summary

Problems solved by technology

[0006] It can be seen from formula (1) that the proportional fair scheduling method is to select the users to schedule, due to r i (n) only reflects the peak rate of the i-th UE on a certain physical layer resource block when scheduling subframe n, as the scheduling priority weight It cannot reflect the QoS requirements of the UE, that is to say, the existing proportional fair scheduling method does not consider the user's service demand rate and the user's channel transmission capacity, and is only suitable for best-effort data service scheduling

Therefore, for Guaranteed Bit Rate (GBR) services with different service rate requirements of different UEs, the above proportional fair scheduling method cannot better achieve scheduling fairness

[0007] It can be seen that in the above-mentioned existing scheduling methods, neither the proportional fair scheduling method nor the round robin method can reflect the QoS requirements of the UE. Therefore, for different UEs to be scheduled with different service rate requirements, it is impossible to truly achieve fair scheduling. sex

Images