The heavy traffic limit of an unbalanced generalized processor sharing model

From MaRDI portal
Publication:2476397




Abstract: This work considers a server that processes J classes using the generalized processor sharing discipline with base weight vector alpha=(alpha1,...,alphaJ) and redistribution weight vector . The invariant manifold mathcalM of the so-called fluid limit associated with this model is shown to have the form mathcalM=xinmathbbR+J:xj=0forjinmathcalS, where mathcalS is the set of strictly subcritical classes, which is identified explicitly in terms of the vectors alpha and and the long-run average work arrival rates gammaj of each class j. In addition, under general assumptions, it is shown that when the heavy traffic condition sumj=1Jgammaj=sumj=1Jalphaj holds, the functional central limit of the scaled unfinished work process is a reflected diffusion process that lies in mathcalM. The reflected diffusion limit is characterized by the so-called extended Skorokhod map and may fail to be a semimartingale. This generalizes earlier results obtained for the simpler, balanced case where gammaj=alphaj for j=1,...,J, in which case mathcalM=mathbbR+J and there is no state-space collapse. Standard techniques for obtaining diffusion approximations cannot be applied in the unbalanced case due to the particular structure of the GPS model. Along the way, this work also establishes a comparison principle for solutions to the extended Skorokhod map associated with this model, which may be of independent interest.



Cites work


Cited in
(21)






This page was built for publication: The heavy traffic limit of an unbalanced generalized processor sharing model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476397)