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

DOI10.1016/J.INDAG.2022.11.001zbMATH Open1520.90082arXiv2204.08346OpenAlexW4309280932MaRDI QIDQ6135890FDOQ6135890

Authors: Efrat Perel, Nir Perel, Uri Yechiali 

Publication date: 28 August 2023

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Retrial Queueing Systems
• A retrial system with two input streams and two orbit queues
• The shorter queue polling model
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
• Introduction to Queueing
• Optimality of the shortest line discipline
• Analysis of the asymmetrical shortest two-server queueing model
• Join the shortest queue: Stability and exact asymptotics
• Erlang arrivals joining the shorter queue
• Bad luck when joining the shortest queue
• Analysis of the asymmetric shortest queue problem
• On the Optimality of the Generalized Shortest Queue Policy
• The shortest queue problem
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• On the infinite server shortest queue problem: non-symmetric case
• A two-queue, one-server model with priority for the longer queue
• The Longer Queue Model
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
• Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
• The symmetric longest queue system
• Repair systems with exchangeable items and the longest queue mechanism
• Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime
• On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
• EXPLICIT SOLUTIONS FOR CONTINUOUS-TIME QBD PROCESSES BY USING RELATIONS BETWEEN MATRIX GEOMETRIC ANALYSIS AND THE PROBABILITY GENERATING FUNCTIONS METHOD
• A polling system with `join the shortest -- serve the longest' policy
• The Stability of Longest-Queue-First Scheduling With Variable Packet Sizes
• Analysis of the symmetric join the shortest orbit queue
• The concise encyclopedia of statistics
• Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues

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)