Uniform approximations for the \(M/G/1\) queue with subexponential processing times (Q543561): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
From the authors' abstract and the introduction: ``The asymptotic behaviour of the distribution of an \(M/G/1\) queue with subexponential service time distribution and FIFO (first in, first out) scheduling are investigated. The steady state waiting time distribution of this queue is described by the so-called heavy-traffic approximation and heavy-tail asymptotic. In the main result of this paper, the observation is made that the behaviour of the studied waiting-time for service time distributions decaying slower than subexponentially includes a third region where neither the heavy-traffic approximation nor the heavy-tail asymptotic are valid. The authors provide details of the used approximation of the steady-state waiting time for which they derive uniform expressions of the minimum conditions for the service time distribution. This approach allows them to draw a connection between the asymptotic behaviour of the steady-state waiting time distribution and that of the associated random walk. The obtained results can be of practical use for numerical approximations of the steady-state waiting time distribution. The results are confirmed by some simulations, the main idea of which is based on the numerical computation of the integrated tail distribution of these processing times and their first few moments. In all these experiments the heavy-tail asymptotic holds tend to the mean and variance of the integrated tail distribution.'' | |||
Property / review text: From the authors' abstract and the introduction: ``The asymptotic behaviour of the distribution of an \(M/G/1\) queue with subexponential service time distribution and FIFO (first in, first out) scheduling are investigated. The steady state waiting time distribution of this queue is described by the so-called heavy-traffic approximation and heavy-tail asymptotic. In the main result of this paper, the observation is made that the behaviour of the studied waiting-time for service time distributions decaying slower than subexponentially includes a third region where neither the heavy-traffic approximation nor the heavy-tail asymptotic are valid. The authors provide details of the used approximation of the steady-state waiting time for which they derive uniform expressions of the minimum conditions for the service time distribution. This approach allows them to draw a connection between the asymptotic behaviour of the steady-state waiting time distribution and that of the associated random walk. The obtained results can be of practical use for numerical approximations of the steady-state waiting time distribution. The results are confirmed by some simulations, the main idea of which is based on the numerical computation of the integrated tail distribution of these processing times and their first few moments. In all these experiments the heavy-tail asymptotic holds tend to the mean and variance of the integrated tail distribution.'' / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jerzy Martyna / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60K25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60F10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5909330 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
queueing theory | |||
Property / zbMATH Keywords: queueing theory / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
performance evaluation | |||
Property / zbMATH Keywords: performance evaluation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
queueing, scheduling | |||
Property / zbMATH Keywords: queueing, scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
large deviations | |||
Property / zbMATH Keywords: large deviations / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2058288311 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1009.5327 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applied Probability and Queues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved algorithms for rare event simulation with heavy tails / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subexponential Distributions - Large Deviations with Applications to Insurance and Queueing Models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tail behaviour of the busy period of a GI/GI/1 queue with subexponential service times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniform renewal theory with applications to expansions of random geometric sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Estimates for the distribution of sums and maxima of sums of random variables without the Cramér condition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Large deviation probabilities for random walks with semiexponential distributions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymptotic Analysis of Random Walks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Large deviations for random walks under subexponentiality: The big-jump domain / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Estimates for the probability of ruin with special emphasis on the possibility of large claims / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiple channel queues in heavy traffic. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiple channel queues in heavy traffic. II: sequences, networks, and batches / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Large Deviations of Square Root Insensitive Random Sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Limit Theorems for Large Deviations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integral Limit Theorems Taking Large Deviations into Account when Cramér’s Condition Does Not Hold. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the transition from heavy traffic to heavy tails for the \(M/G/1\) queue: the regularly varying case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4085018 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probabilities of Large Deviations of Sums of Independent Random Variables with Common Distribution Function in the Domain of Attraction of the Normal Law / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Cramér Series Coefficients / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tail Asymptotics for the Busy Period in the GI/G/1 Queue / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:03, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Uniform approximations for the \(M/G/1\) queue with subexponential processing times |
scientific article |
Statements
Uniform approximations for the \(M/G/1\) queue with subexponential processing times (English)
0 references
17 June 2011
0 references
From the authors' abstract and the introduction: ``The asymptotic behaviour of the distribution of an \(M/G/1\) queue with subexponential service time distribution and FIFO (first in, first out) scheduling are investigated. The steady state waiting time distribution of this queue is described by the so-called heavy-traffic approximation and heavy-tail asymptotic. In the main result of this paper, the observation is made that the behaviour of the studied waiting-time for service time distributions decaying slower than subexponentially includes a third region where neither the heavy-traffic approximation nor the heavy-tail asymptotic are valid. The authors provide details of the used approximation of the steady-state waiting time for which they derive uniform expressions of the minimum conditions for the service time distribution. This approach allows them to draw a connection between the asymptotic behaviour of the steady-state waiting time distribution and that of the associated random walk. The obtained results can be of practical use for numerical approximations of the steady-state waiting time distribution. The results are confirmed by some simulations, the main idea of which is based on the numerical computation of the integrated tail distribution of these processing times and their first few moments. In all these experiments the heavy-tail asymptotic holds tend to the mean and variance of the integrated tail distribution.''
0 references
queueing theory
0 references
performance evaluation
0 references
queueing, scheduling
0 references
large deviations
0 references
0 references
0 references
0 references
0 references
0 references