Some Time-Dependent Properties of Symmetric M/G/1 Queues

DOI10.1239/jap/1110381382zbMath1077.60069OpenAlexW3023242196MaRDI QIDQ5312852

Offer Kella, Bert Zwart, Onno J. Boxma

Publication date: 25 August 2005

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

Full work available at URL: https://doi.org/10.1239/jap/1110381382

zbMATH Keywords

tail behaviorinsensitivityrandom permutationstime-dependent analysissymmetric queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (7)

On the distribution of the number of customers in the symmetric M/G/1 queue ⋮ Time-dependent properties of symmetric queues ⋮ Connecting Renewal Age Processes with M/D/1 and M/D/∞ Queues Through Stick Breaking ⋮ A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues ⋮ SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE ⋮ A useful relationship between epidemiology and queueing theory: The distribution of the number of infectives at the moment of the first detection ⋮ Asymptotic behavior of local times of compound Poisson processes with drift in the infinite variance case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculation of the Laplace transform of the length of the busy period for the M/G/1 queue via martingales
• The multiple phase service network with generalized processor sharing
• The M/G/1 processor-sharing model: Transient behavior
• Lévy processes that can creep downwards never increase
• Brownian analogues of Burke's theorem.
• Tails of waiting times and their bounds
• A LIFO queue in heavy traffic
• Tail asymptotics for exponential functionals of Lévy processes
• Queues under preemptive lifo and ladder height distributions for risk processes: a duality
• Analysis of the GI/GI/1 Queue and its Variations via the LCFS Preemptive Resume Discipline and Its Random Walk Interpretation
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Networks of queues
• Insensitivity in processor-sharing networks

This page was built for publication: Some Time-Dependent Properties of Symmetric M/G/1 Queues