Asymptotic analysis of a storage allocation model with finite capacity: joint distribution
From MaRDI portal
Publication:1748479
DOI10.1155/2016/1925827zbMath1387.90071OpenAlexW2507795961WikidataQ59122778 ScholiaQ59122778MaRDI QIDQ1748479
Publication date: 11 May 2018
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/1925827
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Special issue: Average-case analysis of algorithms
- 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
- Asymptotic Approximations of Integrals
- On Two-Dimensional Convection-Diffusion Past a Circle
- Geometrical Optics and Models of Computer Memory Fragmentation
- The distribution of wasted spaces in the M/M/∞ queue with ranked servers
- A Stochastic Model of Fragmentation in Dynamic Storage Allocation
- A perpetuity and the M/M/∞ ranked server system
- On a storage allocation model with finite capacity
- On the Transient Behavior of the Erlang Loss Model: Heavy Usage asymptotics
This page was built for publication: Asymptotic analysis of a storage allocation model with finite capacity: joint distribution
