MaxWeight Scheduling: Asymptotic Behavior of Unscaled Queue-Differentials in Heavy Traffic
From MaRDI portal
Publication:6259042
arXiv1502.03793MaRDI QIDQ6259042FDOQ6259042
Authors: Rahul Singh, Alexander L. Stolyar 
Publication date: 12 February 2015
Abstract: The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the amount of service that will be provided. We are primarily motivated by the following question: in the heavy traffic regime, when the switch load approaches critical level, will the service processes provided to each flow remain "smooth" (i.e., without large gaps in service)? Addressing this question reduces to the analysis of the asymptotic behavior of the unscaled queue-differential process in heavy traffic. We prove that the stationary regime of this process converges to that of a positive recurrent Markov chain, whose structure we explicitly describe. This in turn implies asymptotic "smoothness" of the service processes.
Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15)
This page was built for publication: MaxWeight Scheduling: Asymptotic Behavior of Unscaled Queue-Differentials in Heavy Traffic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6259042)
