On the asymptotic optimality of the gradient scheduling algorithm for multiuser throughput allocation

On the asymptotic optimality of the gradient scheduling algorithm for multiuser throughput allocation

0.00 Avg rating0 Votes
Article ID: iaor20073881
Country: United States
Volume: 53
Issue: 1
Start Page Number: 12
End Page Number: 25
Publication Date: Jan 2005
Journal: Operations Research
Authors:
Keywords: scheduling, communication
Abstract:

We consider the model where N queues (users) are served in discrete time by a generalized switch. The switch state is random, and it determines the set of possible service rate choices (scheduling decisions) in each time slot. This model is primarily motivated by the problem of scheduling transmissions of N data users in a shared time-varying wireless environment, but also includes other applications such as input-queued cross-bar switches and parallel flexible server systems. The objective is to find a scheduling strategy maximizing a concave utility function H(u1,…,uN), where uns are long-term average service rates (data throughputs) of the users, assuming users always have data to be served. We prove asymptotic optimality of the gradient scheduling algorithm (which generalizes the well-known proportional fair algorithm) for our model, which, in particular, allows for simultaneous service of multiple users and for discrete sets of scheduling decisions. Analysis of the transient dynamics of user throughputs is the key part of this work.

Reviews

Required fields are marked *. Your email address will not be published.