Two Parallel Queues with Dynamic Routing
From MaRDI portal
Publication:3753227
DOI10.1109/TCOM.1986.1096486zbMath0612.60086MaRDI QIDQ3753227
Zeev Schuss, Charles Tier, Bernard J. Matkowsky, Charles Knessl
Publication date: 1986
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
computer communicationsapproximations to the steady-state joint distribution of the number of customers in the two systems
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
Analysis of the asymmetric shortest queue problem ⋮ A Markov-modulated M/G/1 queue. I: Stationary distribution ⋮ Stationary analysis of the shortest queue problem ⋮ The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations ⋮ Cost-aware defense for parallel server systems against reliability and security failures ⋮ Asymptotic analysis of multiple class queueing networks ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system
This page was built for publication: Two Parallel Queues with Dynamic Routing
