Analysis of the asymmetric shortest queue problem

DOI10.1007/BF02412240MaRDI QIDQ2640244zbMATH OpenOpenAlexFDO

Authors Ivo Adan, J. Wessels, W. H. M. Zijm

Publication date 1991

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02412240

zbMATH Keywords

parallel servers with different service ratesproduct formshortest queue problemstationary queue length distribution

Mathematics Subject Classification ID

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

Recommendations

• J.comput. appl. math
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• Analysis of the asymmetrical shortest two-server queueing model
• A new heavy traffic limit for the asymmetric shortest queue problem
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE

Cites work

• A Basic Dynamic Routing Problem and Diffusion
• A Queueing System with General-Use and Limited-Use Servers
• Analysis of the asymmetric shortest queue problem
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3814724 (Why is no real title available?)
• scientific article; zbMATH DE number 4066100 (Why is no real title available?)
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• J.comput. appl. math
• On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
• On the Stochastic Matrices Associated with Certain Queuing Processes
• Power Series for Stationary Distributions of Coupled Processor Models
• Queuing Models with Lane Selection: A New Class of Problems
• Regenerative Analysis and Steady State Distributions for Markov Chains
• Technical Note—A Note on “Queueing Models with Lane Selection”
• The autostrada queueing problem
• The Power-Series Algorithm Applied to the Shortest-Queue Model
• The shorter queue problem: A numerical study using the matrix-geometric solution
• The shortest queue problem
• Two Parallel Queues with Dynamic Routing
• TWO QUEUES IN PARALLEL
• Two Similar Queues in Parallel

Cited in

(41)

• Analysis of the asymmetrical shortest two-server queueing model
• Shortest expected delay routing for Erlang servers
• A level-crossing approach to the solution of the shortest-queue problem
• Stationary analysis of the shortest queue problem
• Steady-state analysis of shortest expected delay routing
• Observing general service queues before joining
• 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
• Discrete harmonic functions in the three-quarter plane
• Group service system with three queues and load balancing
• Martingales and buffer overflow for the symmetric shortest queue model
• Analysis of the shortest relay queue policy in a cooperative random access network with collisions
• Necessary conditions for the compensation approach for a random walk in the quarter-plane
• On walks avoiding a quadrant
• A polling system with `join the shortest -- serve the longest' policy
• Erlang arrivals joining the shorter queue
• Some first passage time problems for the shortest queue model
• On the infinite server shortest queue problem: non-symmetric case
• Decay rate for a PH/M/2 queue with shortest queue discipline
• Analysis of the asymmetric shortest queue problem
• Analysis of the symmetric join the shortest orbit queue
• GEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASES
• Asymptotic analysis of two coupled queues with vastly different arrival rates and finite customer capacities
• The shorter queue polling model
• Observing general service queues before joining
• On the Shortest Queue Policy for the Tandem Parallel Queue
• J.comput. appl. math
• scientific article; zbMATH DE number 4066100 (Why is no real title available?)
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• scientific article; zbMATH DE number 51576 (Why is no real title available?)
• scientific article; zbMATH DE number 654704 (Why is no real title available?)
• Analysis of job assignment with batch arrivals among heterogeneous servers
• scientific article; zbMATH DE number 1523216 (Why is no real title available?)
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• A new heavy traffic limit for the asymmetric shortest queue problem
• Stationary analysis of the ``shortest queue first service policy: the asymmetric case
• Explicit solution for queue length distribution of M/T-SPH/1 queue
• The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations
• A finite compensation procedure for a class of two-dimensional random walks
• A 3-queue polling system with join the shortest-serve the longest policy
• The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
• A compensation procedure for multiprogramming queues

This page was built for publication: Analysis of the asymmetric shortest queue problem

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