A Priority Queuing System with Server-Walking Time
From MaRDI portal
Publication:5525720
Cited in
(13)- Time-dependent analysis of M/G/1 vacation models with exhaustive service
- Approximate mean value analysis based on Markov chain aggregation by composition
- Some notes on the queueing analysis of the SCAN policy of the walking server
- scientific article; zbMATH DE number 3675102 (Why is no real title available?)
- Optimal design and control of queues
- The paging drum queue: A uniform perspective and further results
- Analysis of a periodically inspected buffer
- Analysis of channel and disk subsystems in computer systems
- Vacationing server model for \(M/G/1\) queues for rebuild processing in RAID5 and threshold scheduling for readers and writers
- Queueing models of secondary storage devices
- The passport control problem or how to keep a dynamic service system load balanced?
- Quality-related measures of unreliable machines with preventive maintenance
- A first-in-first-out buffered cyclic memory
This page was built for publication: A Priority Queuing System with Server-Walking Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5525720)