Scheduling of a Generalized Switch: Heavy Traffic Regime
نویسنده
چکیده
We consider a generalized switch model, which includes as special cases the model of multiuser data scheduling over a wireless medium [5, 1], the input-queued cross-bar switch model [3], and a discrete time version of a parallel server queueing system [2, 6]. Input flows, , are served in discrete time by a switch. Switch state follows a finite discrete time Markov chain. In each state , the switch chooses a scheduling decision from a finite set , which has the associated service rate vector .
منابع مشابه
Maxweight Scheduling in a Generalized Switch: State Space Collapse and Workload Minimization in Heavy Traffic by Alexander L. Stolyar
We consider a generalized switch model, which includes as special cases the model of multiuser data scheduling over a wireless medium, the inputqueued cross-bar switch model and a discrete time version of a parallel server queueing system. Input flows n = 1, . . . ,N are served in discrete time by a switch. The switch state follows a finite state, discrete time Markov chain. In each state m, th...
متن کاملCounter-Examples to the Optimality of MWS-α Policies for Scheduling in Generalized Switches
It has been conjectured that MWS-α scheduling policies with α going to zero are heavy-traffic optimal for scheduling in a generalized switch when the objective is to minimize the number of backlogged packets in the system. We examine this conjecture by first deriving optimal or heavy-traffic optimal policies for small switches and then comparing them to MWS-α policies. Our conclusion is that th...
متن کاملDynamic Scheduling of a Multiclass Queue in the Halfin-Whitt Heavy Traffic Regime
We consider a Markovian model of a multiclass queueing system in which a single large pool of servers attends to the various customer classes. Customers waiting to be served may abandon the queue, and there is a cost penalty associated with such abandonments. Service rates, abandonment rates, and abandonment penalties are generally different for the different classes. The problem studied is tha...
متن کاملScheduling Parallel Servers in the Nondegenerate Slowdown Diffusion Regime: Asymptotic Optimality Results1 by Rami Atar
We consider the problem of minimizing queue-length costs in a system with heterogenous parallel servers, operating in a many-server heavy-traffic regime with nondegenerate slowdown. This regime is distinct from the wellstudied heavy traffic diffusion regimes, namely the (single server) conventional regime and the (many-server) Halfin–Whitt regime. It has the distinguishing property that waiting...
متن کاملPathwise Optimality of the Exponential Scheduling Rule for Wireless Channels
We consider the problem of scheduling transmissions of multiple data users (flows) sharing the same wireless channel (server). The unique feature of this problem is the fact that the capacity (service rate) of the channel varies randomly with time and asynchronously for different users. We study a scheduling policy called Exponential scheduling rule, which was introduced in an earlier paper. Gi...
متن کامل