Asymptotic expansions for a stochastic model of queue storage

DOI10.1214/aoap/1019487357zbMath1056.60095OpenAlexW2028323177MaRDI QIDQ1884832

Charles Knessl

Publication date: 27 October 2004

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1019487357

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (7)

Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage ⋮ On a storage allocation model with finite capacity ⋮ Geometrical Optics and Models of Computer Memory Fragmentation ⋮ The distribution of wasted spaces in the M/M/∞ queue with ranked servers ⋮ 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
• Unnamed Item
• 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
• Stochastic Models of Queue Storage
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation

This page was built for publication: Asymptotic expansions for a stochastic model of queue storage