Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case

DOI10.1080/15326349.2016.1269291zbMath1370.60168arXiv1305.3496OpenAlexW1504118992MaRDI QIDQ4976518

Alain Simonian, Fabrice M. Guillemin

Publication date: 31 July 2017

Published in: Stochastic Models (Search for Journal in Brave)

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

zbMATH Keywords

queueingMarkov processesperformance evaluationfunctional equationsstochastic scheduling

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (max. 100)

Stationary analysis of the shortest queue first service policy ⋮ Serve the shortest queue and Walsh Brownian motion

Cites Work

• Unnamed Item
• Stationary analysis of the shortest queue first service policy
• 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
• The equivalence between processor sharing and service in random order.
• Random walks in the quarter plane with zero drift: an explicit criterion for the finiteness of the associated group
• Two Parallel Queues with Infinite Servers andJoin the Shortest QueueDiscipline
• Two queues in parallel

This page was built for publication: Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case