On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes
From MaRDI portal
(Redirected from Publication:845476)
Recommendations
- A note on application of the method of supplementary variables to the analysis of a processor sharing system
- The \(M/G/1\) processor-sharing queue with disasters
- scientific article; zbMATH DE number 19793
- On the M/M/1 queue with catastrophes and its continuous approximation
- On some time non-homogeneous queueing systems with catastrophes
Cites work
- scientific article; zbMATH DE number 3174015 (Why is no real title available?)
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 3823138 (Why is no real title available?)
- scientific article; zbMATH DE number 3754037 (Why is no real title available?)
- A Pollaczek–Khintchine formula for M/G/1 queues with disasters
- A note on application of the method of supplementary variables to the analysis of a processor sharing system
- An introduction to queueing theory. Modeling and analysis in applications.
- Analysis of A time‐shared processor
- Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
- Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
- Mathematical problems in the theory of processor-sharing queueing systems
- Priority queues
- Processor sharing: a survey of the mathematical theory
- Processor-sharing queues: Some progress in analysis
- Queues with negative arrivals
- The \(M/G/1\) processor-sharing queue with disasters
- Waiting times for \(M/M\) systems under state-dependent processor sharing
- \(G\)-networks: development of the theory of multiplicative networks
Cited in
(3)
This page was built for publication: On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845476)
