A polling system with `join the shortest -- serve the longest' policy

DOI10.1016/j.cor.2019.104809zbMath1458.60099OpenAlexW2976271733WikidataQ127181186 ScholiaQ127181186MaRDI QIDQ2337379

Uri Yechiali, Efrat Perel, Nir Perel

Publication date: 19 November 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.104809

zbMATH Keywords

polling systemsprobability generating functionsmatrix geometricjoin the shortestserve the longest

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• The shorter queue polling model
• The Israeli queue with retrials
• A retrial system with two input streams and two orbit queues
• Queues where customers of one queue act as servers of the other queue
• A two-queue, one-server model with priority for the longer queue
• Optimality of routing and servicing in dependent parallel processing systems
• Analysis of the asymmetrical shortest two-server queueing model
• Stationary analysis of the shortest queue problem
• Join the shortest queue: Stability and exact asymptotics
• Stability analysis of parallel server systems under longest queue first
• Repair systems with exchangeable items and the longest queue mechanism
• On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
• Erlang arrivals joining the shorter queue
• Bad luck when joining the shortest queue
• On the infinite server shortest queue problem: non-symmetric case
• Analysis of the asymmetric shortest queue problem
• The Israeli Queue with Priorities
• AN M/M/1 QUEUE IN RANDOM ENVIRONMENT WITH DISASTERS
• Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains
• The Stability of Longest-Queue-First Scheduling With Variable Packet Sizes
• The symmetric longest queue system
• Two-queue polling systems with switching policy based on the queue that is not being served
• Stability of multiclass queueing networks under longest-queue and longest-dominating-queue scheduling
• The Longer Queue Model
• On the Optimality of the Generalized Shortest Queue Policy
• Quasi-Birth-and-Death Processes with an Explicit Rate Matrix
• Retrial Queueing Systems
• The shortest queue problem
• Dynamic priority rules for cyclic-type queues
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• Optimality of the shortest line discipline
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• A join the shorter queue model in heavy traffic
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• A Queueing Model to Analyze the Value of Centralized Inventory Information
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
• EXPLICIT SOLUTIONS FOR CONTINUOUS-TIME QBD PROCESSES BY USING RELATIONS BETWEEN MATRIX GEOMETRIC ANALYSIS AND THE PROBABILITY GENERATING FUNCTIONS METHOD
• Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions

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