Two coupled queues with vastly different arrival rates: critical loading case
From MaRDI portal
Publication:541178
DOI10.1155/2011/216790zbMath1229.90046OpenAlexW1987359692WikidataQ58655018 ScholiaQ58655018MaRDI QIDQ541178
Charles Knessl, John A. Morrison
Publication date: 6 June 2011
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/227161
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two queues with vastly different arrival rates and processor-sharing factors
- Interacting queues in heavy traffic
- Approximate behavior of tandem queues
- Heavy traffic analysis of two coupled processors
- Processor sharing for two queues with vastly different rates
- The heavy traffic limit of an unbalanced generalized processor sharing model
- A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
- Two Parallel Queues Created by Arrivals with Two Demands I
- The Longer Queue Model
- J.comput. appl. math
- Two Parallel Queues Created by Arrivals with Two Demands II
- On the Distribution of Multidimensional Reflected Brownian Motion
- Equilibria for diffusion models of pairs of communicating computers--Symmetric case
- Processor-sharing of two parallel lines
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- Two queues in parallel
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Analysis of generalized processor-sharing systems with two classes of customers and exponential services
