The Longer Queue Model
From MaRDI portal
Recommendations
- On the nonsymmetric longer queue model. II: Marginal and conditional probabilities
- A two-queue, one-server model with priority for the longer queue
- On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
- Analysis of the asymmetrical shortest two-server queueing model
- On the infinite server shortest queue problem: non-symmetric case
Cites work
- A two-queue, one-server model with priority for the longer queue
- AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
- Boundary value problems in queueing theory
- scientific article; zbMATH DE number 3814724 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 3417832 (Why is no real title available?)
- scientific article; zbMATH DE number 3096896 (Why is no real title available?)
- Two queues in parallel
Cited in
(15)- A two-queue, one-server model with priority for the longer queue
- Stationary analysis of the shortest queue problem
- Queue-length balance equations in multiclass multiserver queues and their generalizations
- Repair systems with exchangeable items and the longest queue mechanism
- On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
- Martingales and buffer overflow for the symmetric shortest queue model
- A polling system with `join the shortest -- serve the longest' policy
- Asymptotic analysis of two coupled queues with vastly different arrival rates and finite customer capacities
- The tail behavior of a longest-queue-served-first queueing system: a random walk in the half plane
- On the nonsymmetric longer queue model. II: Marginal and conditional probabilities
- Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions
- Two coupled queues with vastly different arrival rates: critical loading case
- A 3-queue polling system with join the shortest-serve the longest policy
- Rare event asymptotics for a random walk in the quarter plane
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
This page was built for publication: The Longer Queue Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415951)