Proportional-fair scheduling is a compromise-based scheduling algorithm. It maintains a balance between two competing interests: trying to maximize the total throughput of the network, wired or not, while at the same time allowing all users at least a minimal level of service. It does this 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.
Connections
In Field
Source Proportional-fair scheduling (Wikipedia)
Sources
Proportional-fair scheduling (Wikipedia)
In Group: Scheduling Algorithms, Lead section
Proportional-fair scheduling is a compromise-based scheduling algorithm.
In Field: Computer Networking, Lead section
Proportional-fair scheduling is a compromise-based scheduling algorithm.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.