On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1

DOI10.2307/3212973zbMath0444.60088MaRDI QIDQ3888294

No author found.

Publication date: 1980

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3212973

zbMATH Keywords

functional equation; regular variation; Laplace-Stieltjes transform; busy period; extreme value theory; M/G/1 queue; service time; tail- behaviour

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Related Items

A Two‐Queue Polling Model with Regularly Varying Service and/or Switchover Times, Asymptotics for the First Passage Times of Lévy Processes and Random Walks, SOJOURN TIMES IN THE M/G/1 FB QUEUE WITH LIGHT-TAILED SERVICE TIMES, Heavy-tailed asymptotics of stationary probability vectors of Markov chains of gi/g/1 type, Tail asymptotics of the waiting time and the busy period for the \(\mathrm{M}/\mathrm{G}/1/K\) queues with subexponential service times, Regularly varying tail of the waiting time distribution in M/G/1 retrial queue, Processor sharing: a survey of the mathematical theory, Global and local asymptotics for the busy period of an M/G/1 queue, Asymptotic analysis of Lévy-driven tandem queues, Failure rates of regenerative systems with heavy tails, Stability of an M\(|G|1\) queue with thick tails and excess capacity, Sampling at subexponential times, with queueing applications, Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion, Tail behavior of laws stable by random weighted mean, Tail asymptotics for the fundamental period in the MAP\(/G/1\) queue, Tail behaviour of the busy period of a GI/GI/1 queue with subexponential service times, Tail asymptotics for the queue length in an M/G/1 retrial queue, Tail behaviour of the area under the queue length process of the single server queue with regularly varying service times, Limits and Approximations for the Busy-Period Distribution in Single-Server Queues, Information ranking and power laws on trees, Probabilistic Relation between In-Degree and PageRank, Asymptotic analysis for personalized Web search