Network Performance Optimization in Constrained Queueing Systems
Most of literature assumed infinite buffer for users, which, however, is not practical in real networks. In this paper, we investigate downlink resource scheduling with constrained queueing. We first formulate an optimization model with the objective of maximizing the system rate under a limited queue length. Then two scheduling methods are proposed to solve this problem. One scheme is based on a virtual alarming threshold; the other is a prediction-based scheme. However, they still suffer from unfairness among rate allocations. To improve performance with respect to rate fairness, the factor of rate fairness is introduced into this optimization formulation finally. Numerical results are presented to demonstrate the efficiency of the proposed scheduling methods in terms of average system rate, maximum queue length and rate fairness, compared to some existing methods.
queue scheduling fairness constrained optimization prediction