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

DOI10.1134/S0005117909120133zbMath1180.90083MaRDI QIDQ845476

S. F. Yashkov, A. S. Yashkova

Publication date: 29 January 2010

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Processor sharing: a survey of the mathematical theory
• A note on application of the method of supplementary variables to the analysis of a processor sharing system
• Waiting times for \(M/M\) systems under state-dependent processor sharing
• Processor-sharing queues: Some progress in analysis
• Mathematical problems in the theory of processor-sharing queueing systems
• \(G\)-networks: development of the theory of multiplicative networks
• The \(M/G/1\) processor-sharing queue with disasters
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
• Priority queues
• A Pollaczek–Khintchine formula for M/G/1 queues with disasters
• Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
• Queues with negative arrivals
• Analysis of A time‐shared processor
• An introduction to queueing theory. Modeling and analysis in applications.

This page was built for publication: On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes