Sojourn times in a processor sharing queue with service interruptions

We study the sojourn times of customers in an M/M/1 queue with the processor sharing service discipline and a server that is subject to breakdowns. The lengths of the breakdowns have a general distribution, whereas the “on-periods” are exponentially distributed. A branching process approach leads to a decomposition of the sojourn time, in which the components are independent of each other and can be investigated separately. We derive the Laplace–Stieltjes transform of the sojourn-time distribution in steady state, and show that the expected sojourn time is not proportional to the service requirement. In the heavy-traffic limit, the sojourn time conditioned on the service requirement and scaled by the traffic load is shown to be exponentially distributed. The results can be used for the performance analysis of elastic traffic in communication networks, in particular, the ABR service class in ATM networks, and best-effort services in IP networks.

[1]  Peter D. Welch,et al.  On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service , 1964 .

[2]  W. D. Ray,et al.  Stochastic Models: An Algorithmic Approach , 1995 .

[3]  R. Schassberger,et al.  A new approach to the M/G/1 processor-sharing queue , 1984, Advances in Applied Probability.

[4]  Bhaskar Sengupta,et al.  A Queue with Service Interruptions in an Alternating Random Environment , 1990, Oper. Res..

[5]  L. Christie,et al.  Queuing with Preemptive Priorities or with Breakdown , 1958 .

[6]  S. F. Yashkov.  On a heavy traffic limit theorem for the M/G/1 processor-sharing queue , 1993 .

[7]  Edward G. Coffman,et al.  Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[8]  Duan-Shin Lee,et al.  Analysis of a single server queue with semi-Markovian service interruption , 1997, Queueing Syst. Theory Appl..

[9]  Bhaskar Sengupta,et al.  An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue , 1992 .

[10]  James W. Roberts.  Realizing quality of service guarantees in multiservice networks , 1997, PMCCN.

[11]  Awi Federgruen,et al.  Queueing Systems with Service Interruptions , 1986, Oper. Res..

[12]  J. Morrison.  Response-Time Distribution for a Processor-Sharing System , 1985 .

[13]  Tetsuya Takine,et al.  A single server queue with service interruptions , 1997, Queueing Syst. Theory Appl..

[14]  Xiuli Chao,et al.  Reliability analysis of M/G/1 queueing systems with server breakdowns and vacations , 1997, Journal of Applied Probability.

[15]  B. Avi-Itzhak,et al.  A Many-Server Queue with Service Interruptions , 1968, Oper. Res..

[16]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[17]  B. Sengupta,et al.  A conditional response time of the M/M/1 processor-sharing queue , 1985, AT&T Technical Journal.

[18]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[19]  Ward Whitt,et al.  The Fourier-series method for inverting transforms of probability distributions , 1992, Queueing Syst. Theory Appl..

[20]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[21]  S. F. Yashkov.  Mathematical problems in the theory of shared-processor systems , 1992 .

[22]  R. Nunez Queija,et al.  Centrum Voor Wiskunde En Informatica Reportrapport Sojourn times in Non-homogeneous Qbd Processes with Processor Sharing Sojourn times in Non-homogeneous Qbd Processes with Processor Sharing , 2022 .

[23]  S. F. Yashkov,et al.  Processor-sharing queues: Some progress in analysis , 1987, Queueing Syst. Theory Appl..

[24]  D. Gaver.  A Waiting Line with Interrupted Service, Including Priorities , 1962 .

[25]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[26]  Kiran M. Rege,et al.  A decomposition theorem and related results for the discriminatory processor sharing queue , 1994, Queueing Syst. Theory Appl..

[27]  S. Grishechkin.  Crump–Mode–Jagers Branching Processes As a Method of Investigating ${\rm M}/{\rm G}/1$ Systems with Processor Sharing , 1992 .

[28]  S. Grishechkin.  On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes , 1992, Advances in Applied Probability.

[29]  Awi Federgruen,et al.  Queueing systems with service interruptions II , 1988 .

[30]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[31]  J. Teugels,et al.  On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1 , 1980, Journal of Applied Probability.

[32]  T. Ott.  THE SOJOURN-TIME DISTRIBUTION IN THE M/G/1 QUEUE , 1984 .

[33]  Hans van den Berg,et al.  TheM/G/1 queue with processor sharing and its relation to a feedback queue , 1991, Queueing Syst. Theory Appl..

[34]  Georgia-Ann Klutke,et al.  STATIONARY INCREMENTS IN THE ACCUMULATED WORK PROCESS IN PROCESSOR-SHARING QUEUES , 1989 .