词条 | Proportionally fair |
释义 |
Weighted fair queuingProportionally fair scheduling can be achieved by means of weighted fair queuing (WFQ), by setting the scheduling weights for data flow to , where the cost is the amount of consumed resources per data bit. For instance:
User prioritizationAnother way to schedule data transfer that leads to similar results is through the use of prioritization coefficients.[3] Here we schedule the channel for the station that has the maximum of the priority function:
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.[4] Using and will yield the proportional fair scheduling algorithm used in 3G networks.[3] 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. See also
References1. ^{{Citation|title= Convergence of proportional-fair sharing algorithms under general conditions|journal=IEEE Transactions on Wireless Communications|date=July 2004|last1=Kushner|first1=H. J.|last2=Whiting|first2=P.A.|volume=3|issue=4|pages=1250–1259|doi= 10.1109/TWC.2004.830826|url=|postscript= . |citeseerx=10.1.1.8.6408}} 2. ^Guowang Miao, Jens Zander, Ki Won Sung, and Ben Slimane, Fundamentals of Mobile Data Networks, Cambridge University Press, {{ISBN|1107143217}}, 2016. 3. ^1 {{Citation| first1=Yang|last1=Ji|first2=Zhang|last2=Yifan|first3=Wang|last3=Ying|first4=Zhang|last4=Ping| contribution=Average rate updating mechanism in proportional fair scheduler for HDR| title=IEEE Global Telecommunications Conference, 2004 | editor-first=| editor-last=| publisher=IEEE| place=| pages=3464–3466| date=2004-11-29| doi= 10.1109/GLOCOM.2004.1379010| contribution-url=| volume=6 | isbn=978-0-7803-8794-2}} 4. ^Guowang Miao, Jens Zander, Ki Won Sung, and Ben Slimane, Fundamentals of Mobile Data Networks, Cambridge University Press, {{ISBN|1107143217}}, 2016. Further reading
4 : Radio resource management|Wireless|Mobile telecommunications|Network scheduling algorithms |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。