Stationary analysis of the shortest queue problem
From MaRDI portal
Publication:1688928
DOI10.1007/s11134-017-9556-8zbMath1377.60085arXiv1704.06442OpenAlexW2610134619MaRDI QIDQ1688928
Christine Fricker, Plinio S. Dester, Danielle Tibi
Publication date: 12 January 2018
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.06442
Queueing theory (aspects of probability theory) (60K25) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (5)
Stationary analysis of the shortest queue problem ⋮ Stability of Parallel Server Systems ⋮ Martingales and buffer overflow for the symmetric shortest queue model ⋮ A polling system with `join the shortest -- serve the longest' policy ⋮ Stationary Distribution of Discrete-Time Finite-Capacity Queue with Re-sequencing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stationary analysis of the shortest queue first service policy
- Large deviations without principle: join the shortest queue
- Analysis of the asymmetrical shortest two-server queueing model
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Malyshev's theory and JS-queues. Asymptotics of stationary probabilities
- Stationary analysis of the shortest queue problem
- Join the shortest queue: Stability and exact asymptotics
- Analysis of two queues in parallel with jockeying and restricted capacities
- Analysis of the asymmetric shortest queue problem
- Random Walks in the Quarter Plane
- TWO QUEUES IN PARALLEL
- Two Similar Queues in Parallel
- The autostrada queueing problem
- The Longer Queue Model
- J.comput. appl. math
- The shortest queue problem
- Two Parallel Queues with Dynamic Routing
- Deciding Which Queue to Join: Some Counterexamples
- Power Series for Stationary Distributions of Coupled Processor Models
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- The Power-Series Algorithm Applied to the Shortest-Queue Model
- Two queues in parallel
- Optimality of the shortest line discipline
- On the optimal assignment of customers to parallel servers
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- A compensation approach for two-dimensional Markov processes
- Bounds for performance characteristics: a systematic approach via cost structures
- A join the shorter queue model in heavy traffic
- A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
- Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
- Quasi-Birth-and-Death Processes, Lattice Path Counting, and Hypergeometric Functions
- DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS
- A Large Deviation Principle for Join the Shortest Queue
- Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model
This page was built for publication: Stationary analysis of the shortest queue problem
