Proportionally Fair
Encyclopedia
Proportional fair is a compromise-based scheduling algorithm. It's based upon maintaining a balance between two competing interests: Trying to maximize total wireless network
throughput while at the same time allowing all users at least a minimal level of service. This is done by assigning each data flow a data rate or a scheduling priority (depending on the implementation) that is inversely proportional to its anticipated resource consumption.
(WFQ), by setting the scheduling weights for data flow
to 
, where the cost 
is the amount of consumed resources per data bit. For instance:
By adjusting
and 
in the formula above, we are able to adjust the balance between serving the best mobiles (the ones in the best channel conditions) more often and serving the costly mobiles often enough that they have an acceptable level of performance.
In the extreme case (
and 
) the scheduler acts in a round-robin fashion and serves all mobiles equally often, with no regard for resource consumption. If 
and 
then the scheduler will always serve the mobile with the best channel conditions. This will maximize the throughput of the channel while stations with low 
are not served at all. Using 
and 
will yield the proportional fair scheduling algorithm used in 3G networks.
This technique can be further parametrized by using a "memory constant" that determines the period of time over which the station data rate used in calculating the priority function is averaged. A larger constant generally improves throughput at the expense of reduced short-term fairness.
Wireless network
Wireless network refers to any type of computer network that is not connected by cables of any kind. It is a method by which homes, telecommunications networks and enterprise installations avoid the costly process of introducing cables into a building, or as a connection between various equipment...
throughput while at the same time allowing all users at least a minimal level of service. This is done by assigning each data flow a data rate or a scheduling priority (depending on the implementation) that is inversely proportional to its anticipated resource consumption.
Weighted fair queuing
Proportionally fair scheduling can be achieved by means of weighted fair queuingWeighted fair queuing
Weighted fair queuing is a data packet scheduling technique allowing different scheduling priorities to statistically multiplexed data flows.WFQ is a generalization of fair queuing . Both in WFQ and FQ, each data flow has a separate FIFO queue...
(WFQ), by setting the scheduling weights for data flow
to , where the cost is the amount of consumed resources per data bit. For instance:
- In CDMA spread spectrum cellular networks, the cost may be the required energy per bit in the transmit power control (the increased interference level).
- In wireless communication with link adaptationLink adaptationLink adaptation, or adaptive coding and modulation , is a term used in wireless communications to denote the matching of the modulation, coding and other signal and protocol parameters to the conditions on the radio link Link adaptation, or adaptive coding and modulation (ACM), is a term used in...
, the cost may be the required time to transmit a certain number of bits using the modulation and error coding scheme that this required. An example of this is EVDO networks, where reported SNRSignal-to-noise ratioSignal-to-noise ratio is a measure used in science and engineering that compares the level of a desired signal to the level of background noise. It is defined as the ratio of signal power to the noise power. A ratio higher than 1:1 indicates more signal than noise...
is used as the primary costing factor. - In wireless networks with fast Dynamic Channel Allocation, the cost may be the number of nearby base station sites that can not use the same frequency channel simultaneously, in view to avoid co-channel interference.
User prioritization
Another way to schedule data transfer that leads to similar results is through the use of prioritization coefficients. Here we schedule the channel for the station that has the maximum of the priority function:
-
denotes the data rate potentially achievable for the station in the present time slot. -
is the historical average data rate of this station. -
and 
tune the "fairness" of the scheduler.
By adjusting
and in the formula above, we are able to adjust the balance between serving the best mobiles (the ones in the best channel conditions) more often and serving the costly mobiles often enough that they have an acceptable level of performance.In the extreme case (
and ) the scheduler acts in a round-robin fashion and serves all mobiles equally often, with no regard for resource consumption. If and then the scheduler will always serve the mobile with the best channel conditions. This will maximize the throughput of the channel while stations with low are not served at all. Using and will yield the proportional fair scheduling algorithm used in 3G networks.This technique can be further parametrized by using a "memory constant" that determines the period of time over which the station data rate used in calculating the priority function is averaged. A larger constant generally improves throughput at the expense of reduced short-term fairness.