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 longer constant will improve long-term fairness at the expense of aggregate throughput and memory consumption of the scheduler.
US Patent Issued to Palo Alto Research Center on June 7 for "Proportionally Fair-Share Time Slot Reservations with a Fast Increase, Slow Decrease Rate Controller" (California Inventors)
Jun 14, 2011; ALEXANDRIA, Va., June 14 -- United States Patent no. 7,957,410, issued on June 7, was assigned to Palo Alto Research Center Inc....
US Patent Issued to New Jersey Institute of Technology on June 28 for "Providing Proportionally Fair Bandwidth Allocation in Communication Systems" (New Jersey Inventors)
Jul 01, 2011; ALEXANDRIA, Va., July 1 -- United States Patent no. 7,969,881, issued on June 28, was assigned to New Jersey Institute of...