Premium
A performance evaluation framework for packet scheduling algorithms in wireless system
Author(s) -
Zhao X.,
Liang H.
Publication year - 2011
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1892
Subject(s) - computer science , maximum throughput scheduling , network packet , scheduling (production processes) , round robin scheduling , algorithm , wireless , fair share scheduling , distributed computing , computer network , mathematical optimization , quality of service , mathematics , telecommunications
SUMMARY The question of how to evaluate wireless packet scheduling algorithms with a comprehensive consideration of different performance metrics is investigated in this paper. By studying the intrinsic relationship between system throughput and fairness, a performance evaluation problem for packet scheduling algorithms in a wireless system is formulated. Through the use of nonlinear programming method, the performance evaluation framework for weighted‐type packet scheduling algorithms can be established. The performances of some typical packet scheduling algorithms for multiuser wireless communications are also evaluated in this framework as examples. Copyright © 2011 John Wiley & Sons, Ltd.