The distribution of wasted spaces in the M/M/∞ queue with ranked servers

DOI10.1239/aap/1222868188zbMath1155.60042OpenAlexW2011408540MaRDI QIDQ3535655

Eunju Sohn, Charles Knessl

Publication date: 13 November 2008

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1222868188

zbMATH Keywords

ranked serverwasted places

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items

Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage, On a storage allocation model with finite capacity, 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

Cites Work

• Unnamed Item
• First-fit allocation of queues: Tight probabilistic bounds on wasted space
• A provably efficient algorithm for dynamic storage allocation
• The M/M/\(\infty\) service system with ranked servers in heavy traffic. With a preface by Franz Ferschl
• Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process
• Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
• Asymptotic expansions for a stochastic model of queue storage
• A simple direct solution to a storage allocation model
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A perpetuity and the M/M/∞ ranked server system