اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHeavy traffic limit for a processor sharing queue with soft deadlines
117
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper considers a GI/GI/1 processor sharing queue in which jobs have soft deadlines. At each point in time, the collection of residual service times and deadlines is modeled using a random counting measure on the right half-plane. The limit of this measure valued process is obtained under diffusion scaling and heavy traffic conditions and is characterized as a deterministic function of the limiting queue length process. As special cases, one obtains diffusion approximations for the lead time profile and the profile of times in queue. One also obtains a snapshot principle for sojourn times.
قيم البحث
اقرأ أيضاً
This work considers a server that processes $J$ classes using the generalized processor sharing discipline with base weight vector $alpha=(alpha _1,...,alpha_J)$ and redistribution weight vector $beta=(beta_1,...,beta_J)$. The invariant manifold $mat
hcal{M}$ of the so-called fluid limit associated with this model is shown to have the form $mathcal{M}={xinmathbb{R}_+^J:x_j=0 for jinmathcal{S}}$, where $mathcal{S}$ is the set of strictly subcritical classes, which is identified explicitly in terms of the vectors $alpha$ and $beta$ and the long-run average work arrival rates $gamma_j$ of each class $j$. In addition, under general assumptions, it is shown that when the heavy traffic condition $sum_{j=1}^Jgamma_j=sum_{j=1}^Jalpha_j$ holds, the functional central limit of the scaled unfinished work process is a reflected diffusion process that lies in $mathcal{M}$. 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 $gamma_j=alpha_j$ for $j=1,...,J$, in which case $mathcal{M}=mathbb{R}_+^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.
For a multiclass G/G/1 queue with finite buffers, admission and scheduling control, and holding and rejection costs, we construct a policy that is asymptotically optimal in the heavy traffic limit. The policy is specified in terms of a single paramet
er which constitutes the free boundary point from the Harrison-Taksar free boundary problem, but otherwise depends explicitly on the problem data. The c mu priority rule is also used by the policy, but in a way that is novel, and, in particular, different than that used in problems with infinite buffers. We also address an analogous problem where buffer constraints are replaced by throughput time constraints.
The focus of this paper is on the asymptotics of large-time numbers of customers in time-periodic Markovian many-server queues with customer abandonment in heavy traffic. Limit theorems are obtained for the periodic number-of-customers processes unde
r the fluid and diffusion scalings. Other results concern limits for general time-dependent queues and for time-homogeneous queues in steady state.
A scheduled arrival process is one in which the n th arrival is scheduled for time n, but instead occurs at a different time. The difference between the scheduled time and the arrival time is called the perturbation. The sequence of perturbations is
assumed to be iid. We describe here the behavior of a single server queue fed by such traffic in which the processing times are deterministic. A particular focus is on perturbation with Pareto-like tails but with finite mean. We obtain tail approximations for the steady-state workload in both cases where the queue is critically loaded and under a heavy-traffic regime. A key to our approach is our analysis of the tail behavior of a sum of independent Bernoulli random variables with success probability following a power law with parameter strictly larger than 1.
We consider a processor sharing queue where the number of jobs served at any time is limited to $K$, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this measure-valued
process is obtained under diffusion scaling and heavy traffic conditions. As a consequence, the limit of the system size process is proved to be a piece-wise reflected Brownian motion.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
