A dynamic storage process

DOI10.1016/0304-4149(90)90061-VMaRDI QIDQ751479zbMATH OpenFDO

Authors Philippe Robert, Claude Kipnis

Publication date 1990

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

zbMATH Keywords

dynamic storage processesmaximal throughputmeasure valued Markov processes

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Inventory, storage, reservoirs (90B05)

Cites work

• scientific article; zbMATH DE number 4046862 (Why is no real title available?)
• scientific article; zbMATH DE number 3519673 (Why is no real title available?)
• scientific article; zbMATH DE number 4124976 (Why is no real title available?)
• scientific article; zbMATH DE number 3800672 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• A Stochastic Model of Fragmentation in Dynamic Storage Allocation
• Dynamic Bin Packing
• Some interesting processes arising as heavy traffic limits in an M/M/\(\infty\) storage process

Cited in

(5)

• Study of the maximal throughput of multiclass queueing systems
• Three-level modeling of a speed-scaling supercomputer
• Analysis of Stochastic Online Bin Packing Processes
• Stability criterion of a multiserver model with simultaneous service
• A performance analysis of channel fragmentation in dynamic spectrum access systems

This page was built for publication: A dynamic storage process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751479)