A fair scheduling algorithm based on proportional compensation for wireless networks
Jian Song, Lemin Li
Abstract
Jian Song, Lemin Li
Abstract
In this paper, we propose a fair scheduling algorithm based on proportional compensation mechanism for wireless networks. The proposed algorithm is capable of differentiate application-level services and use different queuing strategies for each class of service. We also introduce a compensation mechanism and a resource re-allocation method to achieve fairness.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we propose a fair scheduling algorithm based on proportional compensation mechanism for wireless networks. The proposed algorithm is capable of differentiate application-level services and use different queuing strategies for each class of service. We also introduce a compensation mechanism and a resource re-allocation method to achieve fairness.
Key concepts: Proportionally fair, Computer science, Fair queuing, Maximum throughput scheduling, Weighted fair queueing, Queueing theory, Scheduling (production processes), Computer network