The shorter queue polling model
From MaRDI portal
Publication:333083
DOI10.1007/S10479-013-1495-0zbMATH Open1348.90192OpenAlexW2103875208MaRDI QIDQ333083FDOQ333083
Authors: Stella Kapodistria, Vidyadhar G. Kulkarni, Ivo Adan, Onno Boxma 
Publication date: 9 November 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/c18e731a-4cc5-455d-b3e9-a2fb308ed67c
Recommendations
Cites Work
- Title not available (Why is that?)
- Customers' Optimal Joining Rules for the GI/M/s Queue
- Title not available (Why is that?)
- Optimal control of admission to a quenching system
- Title not available (Why is that?)
- Two coupled processors: The reduction to a Riemann-Hilbert problem
- On optimal call admission control in resource-sharing system
- Title not available (Why is that?)
- A survey of Markov decision models for control of networks of queues
- Optimal Design of Queueing Systems
- Constrained admission control to a queueing system
- Polling systems and multitype branching processes
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Optimality of the shortest line discipline
- Optimality of routing and servicing in dependent parallel processing systems
- Analysis of the asymmetrical shortest two-server queueing model
- Shortest expected delay routing for Erlang servers
- Join the shortest queue: Stability and exact asymptotics
- Erlang arrivals joining the shorter queue
- Bad luck when joining the shortest queue
- Mathematical methods to study the polling systems
- Analysis of the asymmetric shortest queue problem
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
- Two Similar Queues in Parallel
- On the Optimality of the Generalized Shortest Queue Policy
- J.comput. appl. math
- On the shortest queue version of the Erlang loss model
- The shortest queue problem
- Deciding Which Queue to Join: Some Counterexamples
- Title not available (Why is that?)
- Two queues in parallel
- A compensation approach for two-dimensional Markov processes
- Title not available (Why is that?)
- The M/M/1 queue with gated random order of service
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model
- On the Stochastic Matrices Associated with Certain Queuing Processes
- Queueing models with multiple waiting lines
Cited In (10)
- A comparative analysis of the successive lumping and the lattice path counting algorithms
- A 3-queue polling system with join the shortest-serve the longest policy
- A queueing model with two classes of retrial customers and paired services
- A polling system with `join the shortest -- serve the longest' policy
- Polling: past, present, and perspective
- A TWO-CLASS RETRIAL SYSTEM WITH COUPLED ORBIT QUEUES
- Matrix geometric approach for random walks: Stability condition and equilibrium distribution
- 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
- Analysis of the symmetric join the shortest orbit queue
- 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 shorter queue polling model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333083)
