Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the $M_t/M_t/K_t+M_t$ queue in heavy traffic
321
0
0.0
(
0
)
Authors
Anatolii A. Puhalskii
Ask ChatGPT about the research
No Arabic abstract
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 under the fluid and diffusion scalings. Other results concern limits for general time-dependent queues and for time-homogeneous queues in steady state.
rate research
Read More
We present a joint extraction of the strong coupling $alpha_s$ and the top-quark pole mass $m_t$ from measurements of top-quark pair production performed by the ATLAS and CMS experiments at the 8 TeV LHC. For the first time, differential NNLO theory predictions for different values of the top-quark mass are utilised for four kinematic distributions: the average transverse momentum of the top-quark, its average rapidity and the pair invariant mass and rapidity. The use of fastNLO tables for these distributions allows rapid evaluation of the differential theory predictions for different PDF sets. We consider the single differential distributions from the experiments both separately and in combination in order to obtain the best fit to theory. Our final values are $alpha_s=0.1159^{+0.0013}_{-0.0014}$ and $m_t=173.8^{+0.8}_{-0.8}$ GeV which are compatible with previous extractions using top-quark measurements. In the case of $m_t$, our value is also compatible with the world average value collated by the Particle Data Group.
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.
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 parameter 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.
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.
In this note, we apply Steins method to analyze the steady-state distribution of queueing systems in the traditional heavy-traffic regime. Compared to previous methods (e.g., drift method and transform method), Steins method allows us to establish stronger results with simple and template proofs. In particular, we consider discrete-time systems in this note. We first introduce the key ideas of Steins method for heavy-traffic analysis through a single-server system. Then, we apply the developed template to analyze both load balancing problems and scheduling problems. All these three examples demonstrate the power and flexibility of Steins method in heavy-traffic analysis. In particular, we can see that one appealing property of Steins method is that it combines the advantages of both the drift method and the transform method.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
