Some asymptotic results for the \(M/M/\infty\) queue with ranked servers

DOI10.1023/B:QUES.0000035314.35882.5BzbMath1048.90077OpenAlexW2014861651MaRDI QIDQ1878850

Charles Knessl

Publication date: 9 September 2004

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:ques.0000035314.35882.5b

zbMATH Keywords

\(M/M/\infty\) queue, asymptotic expansions, memory fragmentation, saddle point method

Mathematics Subject Classification ID

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

Related Items (10)

Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage ⋮ On a storage allocation model with finite capacity ⋮ Delay-Minimizing Capacity Allocation in an Infinite Server-Queueing System ⋮ Asymptotic analysis of a family of polynomials associated with the inverse error function ⋮ The distribution of wasted spaces in the M/M/∞ queue with ranked servers ⋮ A simple direct solution to a storage allocation model ⋮ Asymptotic analysis of a storage allocation model with finite capacity: joint distribution ⋮ Storage allocation under processor sharing. I: Exact solutions and asymptotics ⋮ Storage allocation under processor sharing II: Further asymptotic results ⋮ Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions

This page was built for publication: Some asymptotic results for the \(M/M/\infty\) queue with ranked servers