The M/G/1 processor-sharing queue with disasters

Authors:
Quan-Lin Li;Chuang Lin
Affiliations:
-;-
Venue:
Computers & Mathematics with Applications
Year:
2006

Citing 6
Cited 7

Processor-sharing queues: some progress in analysis

Queueing Systems: Theory and Applications
Time-shared Systems: a theoretical treatment

Journal of the ACM (JACM)
Waiting Time Distributions for Processor-Sharing Systems

Journal of the ACM (JACM)
Sojourn time asymptotics in the M/G/1 processor sharing queue

Queueing Systems: Theory and Applications
A MAP/G/1 Queue with Negative Customers

Queueing Systems: Theory and Applications
Sojourn time distribution in a MAP/M/1 processor-sharing queue

Operations Research Letters

Performance estimation of an email contact center by a finite source discrete time Geo/Geo/1 queue with disasters

Computers and Industrial Engineering
A note on application of the method of supplementary variables to the analysis of a processor sharing system

Automation and Remote Control
The N-policy for an unreliable server with delaying repair and two phases of service

Journal of Computational and Applied Mathematics
On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes

Automation and Remote Control
An initiative for a classified bibliography on G-networks

Performance Evaluation
Bibliography on G-networks, negative customers and applications

Mathematical and Computer Modelling: An International Journal
The optimal control of an Mx/G/1 unreliable server queue with two phases of service and Bernoulli vacation schedule

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.10

Visualization

Abstract

n this paper, the M/G/1 processor-sharing queue with disasters is given a detailed analysis by means of extending the supplementary variable method. The transient and steady-state distributions of the queue length are expressed as a simple and computable form, the Laplace-Stieltjes transform of the sojourn time is derived, and the Laplace transform of the busy period and its mean are obtained. Also, the approach developed in this paper is shown to be able to study more complicated M/G/1 processor-sharing models.