Wireless Packet Scheduling Algorithm with Small-scale Fairness
Renbo Li
Abstract
Renbo Li
Abstract
Considering the limit of user's access delay while making verdict,a scheduling algorithm named M-PF based on proportion fair scheduling algorithm is proposed.A wireless packet scheduling system model is established.Through simulation properties of the new algorithm in small-scale service time guarantee,large-scale service time fairness and system throughput are analyzed,and study of systematic parameters affecting properties of this algorithm is completed.Results show that the new algorithm can provide better service to the small-scale time as well as good performance in system throughput and large-scale 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.
Considering the limit of user's access delay while making verdict,a scheduling algorithm named M-PF based on proportion fair scheduling algorithm is proposed.A wireless packet scheduling system model is established.Through simulation properties of the new algorithm in small-scale service time guarantee,large-scale service time fairness and system throughput are analyzed,and study of systematic parameters affecting properties of this algorithm is completed.Results show that the new algorithm can provide better service to the small-scale time as well as good performance in system throughput and large-scale fairness.
Key concepts: Computer science, Maximum throughput scheduling, Fairness measure, Scheduling (production processes), Round-robin scheduling, Algorithm, Fair-share scheduling, Network packet