Stationary analysis of the shortest queue first service policy

DOI10.1007/s11134-013-9383-5zbMath1309.60087arXiv1305.3490MaRDI QIDQ475121

Alain Simonian, Fabrice M. Guillemin

Publication date: 25 November 2014

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.3490

zbMATH Keywords

functional equation; Markovian analysis; queue asymptotics; shortest queue first service

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case, Serve the shortest queue and Walsh Brownian motion, Stationary analysis of the shortest queue problem, On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency, Martingales and buffer overflow for the symmetric shortest queue model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rate conservation laws for multidimensional processes of bounded variation with applications to priority queueing systems
• A two-queue, one-server model with priority for the longer queue
• Analysis of the asymmetrical shortest two-server queueing model
• Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case