On the shortest queue version of the Erlang loss model

DOI10.1111/J.1467-9590.2007.00399.XMaRDI QIDQ3560175zbMATH OpenOpenAlexFDO

Authors Haishen Yao, Charles Knessl

Publication date 19 May 2010

Published in Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1467-9590.2007.00399.x

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• On the infinite server shortest queue problem: non-symmetric case
• scientific article; zbMATH DE number 4066100
• Two Parallel Queues with Dynamic Routing
• On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits

Cited in

(13)

• On the Erlang loss model with time dependent input
• Duality between the Erlang loss system and a finite source queue
• Erlang arrivals joining the shorter queue
• The shorter queue polling model
• Performance analysis of joining the shortest queue model among a large number of queues
• Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing
• HITTING TIME IN AN ERLANG LOSS SYSTEM
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• Steady-state analysis of shortest expected delay routing
• Sharp and simple bounds for the Erlang delay and loss formulae
• 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
• On the infinite server shortest queue problem: non-symmetric case

This page was built for publication: On the shortest queue version of the Erlang loss model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560175)