On the infinite server shortest queue problem: non-symmetric case
From MaRDI portal
Publication:2494544
DOI10.1007/s11134-006-5500-zzbMath1091.60033OpenAlexW1964611177MaRDI QIDQ2494544
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
Queueing theory (aspects of probability theory) (60K25) Singular perturbations, turning point theory, WKB methods for ordinary differential equations (34E20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (7)
Two Parallel Queues with Infinite Servers andJoin the Shortest QueueDiscipline ⋮ A 3-queue polling system with join the shortest-serve the longest policy ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ Analysis of two queues in parallel with jockeying and restricted capacities ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ Transient analysis of two queues in parallel with jockeying ⋮ A polling system with `join the shortest -- serve the longest' policy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perturbation methods in applied mathematics
- On large deviations of Markov processes with discontinuous statistics
- On large deviations in load sharing networks
- Upper and lower bounds for the waiting time in the symmetric shortest queue system
- A level-crossing approach to the solution of the shortest-queue problem
- Matrix-geometric analysis of the shortest queue problem with threshold jockeying
- On the infinite server shortest queue problem: non-symmetric case
- Analysis of the asymmetric shortest queue problem
- Two Similar Queues in Parallel
- The shortest queue model with jockeying
- J.comput. appl. math
- The shortest queue problem
- Analysis of the asymmetric shortest queue problem with threshold jockeying
- Rays, waves and asymptotics
- A join the shorter queue model in heavy traffic
- ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
- A new heavy traffic limit for the asymmetric shortest queue problem
- HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING
This page was built for publication: On the infinite server shortest queue problem: non-symmetric case