Limit theorems for queueing systems with various service disciplines in heavy-traffic conditions

DOI10.1007/s11009-018-9660-1zbMath1460.60103OpenAlexW2888539754WikidataQ129348627 ScholiaQ129348627MaRDI QIDQ2218861

S. A. Grishunina

Publication date: 18 January 2021

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-018-9660-1

zbMATH Keywords

limit theoremsqueueing systemservice disciplinesheavy-traffic

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Unnamed Item
• Unnamed Item
• Coupling method for asymptotic analysis of queues with regenerative input and unreliable server
• Ladder heights and the Markov-modulated M/G/1 queue
• Doubly stochastic Poisson processes
• Diffusion approximation in overloaded switching queueing models
• Queueing systems with different service disciplines
• Join the shortest queue: Stability and exact asymptotics
• Queuing systems with cyclic control processes
• Switching Processes in Queueing Models
• Approximations for heavily loaded G/GI/n + GI queues
• Limit Theorems for Semi-Markov Queues and Their Applications
• Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
• The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums

This page was built for publication: Limit theorems for queueing systems with various service disciplines in heavy-traffic conditions