On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes

Authors:
S. F. Yashkov;A. S. Yashkova
Affiliations:
Institute for Information Transmission Problems (Kharkevich Institute), Russian Academy of Sciences, Moscow, Russia;Municipal Institute, Zhukovskii, Moscow oblast, Russia
Venue:
Automation and Remote Control
Year:
2009

Citing 8
Cited 0

Processor-sharing queues: some progress in analysis

Queueing Systems: Theory and Applications
G-Networks: Development of the Theory of Multiplicative Networks

Automation and Remote Control
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Processor sharing: A survey of the mathematical theory

Automation and Remote Control
Asymptotic expansions for the conditional sojourn time distribution in the M/M/1-PS queue

Queueing Systems: Theory and Applications
The M/G/1 processor-sharing queue with disasters

Computers & Mathematics with Applications
Waiting times for M/M systems under state-dependent processor sharing

Queueing Systems: Theory and Applications
A note on application of the method of supplementary variables to the analysis of a processor sharing system

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive the Laplace-Stiltjes transforms of busy period and sojourn time distributions in the M/G/1 queue with egalitarian processor sharing (EPS) and the possibility of (external) catastrophes. Each arrival of the catastrophes immediately removes all the positive jobs (and hence unfinished work) in this non work-conserving queueing system. One of the main results is obtained by means of the so-called method of decomposition into delay elements introduced by the first author.