A 3-queue polling system with join the shortest-serve the longest policy

DOI10.1016/J.INDAG.2022.11.001MaRDI QIDQ6135890zbMATH OpenOpenAlexFDO

Authors Efrat Perel, Nir Perel, Uri Yechiali

Publication date 28 August 2023

Published in Indagationes Mathematicae. New Series (Search for Journal in Brave)

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

zbMATH Keywords

Gini indexjoin the shortest queuepolling systemsprobability generating functionsmatrix geometricserve the longest queue

Mathematics Subject Classification ID

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

Abstract: In 1987, J.W. Cohen analyzed the so-called Serve the Longest Queue (SLQ) queueing system, where a single server attends two non-symmetric $M/G/1$-type queues, exercising a non-preemptive priority switching policy. Cohen further analyzed in 1998 a non-symmetric 2-queue Markovian system, where newly arriving customers follow the Join the Shortest Queue (JSQ) discipline. The current paper generalizes and extends Cohen's works by studying a combined JSQ-SLQ model, and by broadening the scope of analysis to a non-symmetric 3-queue system, where arriving customers follow the JSQ strategy and a single server exercises the preemptive priority SLQ discipline. The system states' multi-dimensional probability distribution function is derived while applying a non-conventional representation of the underlying process's state-space. The analysis combines both Probability Generating Functions and Matrix Geometric methodologies. It is shown that the joint JSQ-SLQ operating policy achieves extremely well the goal of balancing between queue sizes. This is emphasized when calculating the Gini Index associated with the differences between mean queue sizes: the value of the coefficient is close to zero. Extensive numerical results are presented.

Recommendations

• A polling system with `join the shortest -- serve the longest' policy
• Join the shortest queue with many servers. The heavy-traffic asymptotics
• Two parallel queues with infinite servers and \textit{join the shortest queue} discipline
• On the three-queue priority polling system with threshold service policy
• Stability of join the shortest queue networks

Cites work

• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• A polling system with `join the shortest -- serve the longest' policy
• A retrial system with two input streams and two orbit queues
• A two-queue, one-server model with priority for the longer queue
• Analysis of the asymmetric shortest queue problem
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• Analysis of the asymmetrical shortest two-server queueing model
• Analysis of the symmetric join the shortest orbit queue
• Bad luck when joining the shortest queue
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
• Erlang arrivals joining the shorter queue
• Explicit solutions for continuous-time QBD processes by using relations between matrix geometric analysis and the probability generating functions method
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Join the shortest queue with many servers. The heavy-traffic asymptotics
• Join the shortest queue: Stability and exact asymptotics
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• On the Optimality of the Generalized Shortest Queue Policy
• On the infinite server shortest queue problem: non-symmetric case
• On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
• Optimality of the shortest line discipline
• Performance analysis of joining the shortest queue model among a large number of queues
• Performance modeling and design of computer systems. Queueing theory in action
• Repair systems with exchangeable items and the longest queue mechanism
• Retrial Queueing Systems
• Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
• Steady-state analysis of the join-the-shortest-queue model in the Halfin-Whitt regime
• The Longer Queue Model
• The Stability of Longest-Queue-First Scheduling With Variable Packet Sizes
• The concise encyclopedia of statistics
• The shorter queue polling model
• The shortest queue problem
• The symmetric longest queue system

Cited in

(3)

• A polling system with `join the shortest -- serve the longest' policy
• On the three-queue priority polling system with threshold service policy
• The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times

This page was built for publication: A 3-queue polling system with join the shortest-serve the longest policy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135890)