HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING

DOI10.1017/S0269964899133011zbMath0967.60100OpenAlexW2021040499MaRDI QIDQ4955506

Philip Fleming, Burton Simon

Publication date: 30 August 2001

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964899133011

zbMATH Keywords

heavy traffic approximationsexponential queueing systemPoisson arrival streamstationary behavior

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (5)

Optimal pricing and capacity sizing for online service systems with free trials ⋮ Optimization of an M/M/∞ Queueing System with Free Experience Service ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ On diffusion approximation with discountinuous coefficients.

This page was built for publication: HEAVY TRAFFIC APPROXIMATIONS FOR A SYSTEM OF INFINITE SERVERS WITH LOAD BALANCING