Two Parallel Queues with Dynamic Routing
DOI10.1109/TCOM.1986.1096486zbMATH Open0612.60086MaRDI QIDQ3753227FDOQ3753227
Authors: Zeev Schuss, Charles Tier, Charles Knessl, B. J. Matkowsky 
Publication date: 1986
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Recommendations
- STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES
- Optimal routing in two parallel queues with exponential service times
- Parallel queues with resequencing
- Dynamic server assignment in a two-queue model
- The model of queueing network with parallel routes
- Dynamic scheduling of a two-class queue with setups
- A pathwise comparison of parallel queues
- A note on joining strategies for two queues in parallel
- Two Parallel Queues Created by Arrivals with Two Demands II
computer communicationsapproximations to the steady-state joint distribution of the number of customers in the two systems
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (18)
- Two Parallel Queues Created by Arrivals with Two Demands II
- Analysis of the asymmetric shortest queue problem
- A Markov-modulated M/G/1 queue. I: Stationary distribution
- STRATEGIC DYNAMIC JOCKEYING BETWEEN TWO PARALLEL QUEUES
- Cost-aware defense for parallel server systems against reliability and security failures
- Asymptotic analysis of multiple class queueing networks
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues
- Title not available (Why is that?)
- Title not available (Why is that?)
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- Using estimated entropy in a queueing system with dynamic routing
- Steady-State Distributions Of Parallel Queues
- Stationary analysis of the shortest queue problem
- The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations
- The model of queueing network with parallel routes
- On the shortest queue version of the Erlang loss model
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- The autostrada queueing problem
This page was built for publication: Two Parallel Queues with Dynamic Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753227)
