In this paper, we consider a queue with compound Poisson arrivals, phase type required service times in which a single processor serves according to the processor-sharing discipline. For this queue, we derive a system of equations for the transform of the queue-length and obtain the moments of the queue-length as a solution of linear equations. We also obtain a system of equations for the joint transforms of the sojourn time and the queue-length and find the moments of the sojourn time as a solution of linear equations. Numerical examples show that the smaller the variation of the required service times becomes, the larger the mean and variance of the sojourn times become.
Bibliographical noteFunding Information:
We thank the associate editor and the referees for their helpful comments. This work was supported by a Korea University Grant.
- Bulk arrivals
- Joint transform
- Sojourn time
ASJC Scopus subject areas
- Modelling and Simulation
- Hardware and Architecture
- Computer Networks and Communications