Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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. Proportionally fair scheduling can be achieved by means of weighted fair queuing (WFQ), by setting the scheduling weights for data flow i to wi = 1 / ci, where the cost ci is the amount of consumed resources per data bit. Another way to schedule data transfer that leads to similar results is through the use of prioritization coefficients.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.