The shorter queue polling model
From MaRDI portal
Recommendations
Cites work
- A compensation approach for two-dimensional Markov processes
- A survey of Markov decision models for control of networks of queues
- Analysis of the asymmetric shortest queue problem
- Analysis of the asymmetrical shortest two-server queueing model
- Bad luck when joining the shortest queue
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Constrained admission control to a queueing system
- Customers' Optimal Joining Rules for the GI/M/s Queue
- Deciding Which Queue to Join: Some Counterexamples
- Erlang arrivals joining the shorter queue
- Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model
- scientific article; zbMATH DE number 3814724 (Why is no real title available?)
- scientific article; zbMATH DE number 49989 (Why is no real title available?)
- scientific article; zbMATH DE number 51576 (Why is no real title available?)
- scientific article; zbMATH DE number 1300856 (Why is no real title available?)
- scientific article; zbMATH DE number 732083 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- J.comput. appl. math
- Join the shortest queue: Stability and exact asymptotics
- Mathematical methods to study the polling systems
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
- On optimal call admission control in resource-sharing system
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- On the Optimality of the Generalized Shortest Queue Policy
- On the shortest queue version of the Erlang loss model
- On the Stochastic Matrices Associated with Certain Queuing Processes
- Optimal control of admission to a quenching system
- Optimal Design of Queueing Systems
- Optimality of routing and servicing in dependent parallel processing systems
- Optimality of the shortest line discipline
- Polling systems and multitype branching processes
- Queueing models with multiple waiting lines
- Shortest expected delay routing for Erlang servers
- The M/M/1 queue with gated random order of service
- The shortest queue problem
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- Two queues in parallel
- Two Similar Queues in Parallel
Cited in
(12)- Polling: past, present, and perspective
- On partially homogeneous nearest-neighbour random walks in the quarter plane and their application in the analysis of two-dimensional queues with limited state-dependency
- A polling system with `join the shortest -- serve the longest' policy
- Erlang arrivals joining the shorter queue
- Analysis of the symmetric join the shortest orbit queue
- A queueing model with two classes of retrial customers and paired services
- A comparative analysis of the successive lumping and the lattice path counting algorithms
- Matrix geometric approach for random walks: stability condition and equilibrium distribution
- A two-class retrial system with coupled orbit queues
- A 3-queue polling system with join the shortest-serve the longest policy
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
- Inversion and spectral analysis of matrices arising in the analysis of Markov processes
This page was built for publication: The shorter queue polling model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333083)
