On a storage allocation model with finite capacity

DOI10.1017/S0956792516000048zbMath1387.60140MaRDI QIDQ4594610

Eunju Sohn, Charles Knessl

Publication date: 24 November 2017

Published in: European Journal of Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

random walkPoisson processfinite capacityErlang loss modeldynamic storage allocationsteady-state joint distributionwasted spacemaximum occupied space

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Discrete location and assignment (90B80) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (1)

Asymptotic analysis of a storage allocation model with finite capacity: joint distribution

Cites Work

• 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
• Geometrical Optics and Models of Computer Memory Fragmentation
• The distribution of wasted spaces in the M/M/∞ queue with ranked servers
• An Introduction to Combinatorial Models of Dynamic Storage Allocation
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• A perpetuity and the M/M/∞ ranked server system
• Unnamed Item
• Unnamed Item

This page was built for publication: On a storage allocation model with finite capacity