Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions

DOI10.1016/J.RINAM.2021.100189zbMath1480.90107OpenAlexW3203470617MaRDI QIDQ2063288

Charles Knessl, Eunju Sohn

Publication date: 11 January 2022

Published in: Results in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.rinam.2021.100189

zbMATH Keywords

heavy trafficasymptotic analysisdynamic storage allocationbirth-and-death Markov processesfinite capacity queueing models

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Asymptotic analysis of a storage allocation model with finite capacity: joint distribution
• Some asymptotic results for the \(M/M/\infty\) queue with ranked servers
• Geometrical Optics and Models of Computer Memory Fragmentation
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A perpetuity and the M/M/∞ ranked server system

This page was built for publication: Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions