On the infinite server shortest queue problem: non-symmetric case
DOI10.1007/S11134-006-5500-ZzbMATH Open1091.60033OpenAlexW1964611177MaRDI QIDQ2494544FDOQ2494544
Authors: Haishen Yao, Charles Knessl 
Publication date: 28 June 2006
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-006-5500-z
Recommendations
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- On the shortest queue version of the Erlang loss model
- Analysis of the asymmetric shortest queue problem
- On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Singular perturbations, turning point theory, WKB methods for ordinary differential equations (34E20)
Cites Work
- Title not available (Why is that?)
- Perturbation methods in applied mathematics
- Title not available (Why is that?)
- Analysis of the asymmetric shortest queue problem
- Two Similar Queues in Parallel
- J.comput. appl. math
- The shortest queue problem
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- On large deviations of Markov processes with discontinuous statistics
- On large deviations in load sharing networks
- HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING
- On the infinite server shortest queue problem: non-symmetric case
- The shortest queue model with jockeying
- Title not available (Why is that?)
- A new heavy traffic limit for the asymmetric shortest queue problem
- Rays, waves and asymptotics
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- A join the shorter queue model in heavy traffic
- Matrix-geometric analysis of the shortest queue problem with threshold jockeying
- A level-crossing approach to the solution of the shortest-queue problem
Cited In (16)
- A 3-queue polling system with join the shortest-serve the longest policy
- A polling system with `join the shortest -- serve the longest' policy
- Analysis of job assignment with batch arrivals among heterogeneous servers
- On a new numerical computation of the steady state solution for two infinite server parallel queues
- Transient analysis of two queues in parallel with jockeying
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- On the nonsymmetric longer queue model. II: Marginal and conditional probabilities
- Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
- The Longer Queue Model
- On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
- Two parallel queues with infinite servers and \textit{join the shortest queue} discipline
- Analysis of two queues in parallel with jockeying and restricted capacities
- On the infinite server shortest queue problem: non-symmetric case
- On the shortest queue version of the Erlang loss model
- The non-preemptive `join the shortest queue-serve the longest queue' service system with or without switch-over times
- Asymptotic behavior for MArP/PH/2 queue with join the shortest queue discipline
This page was built for publication: On the infinite server shortest queue problem: non-symmetric case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494544)
