The processor-sharing queue with bulk arrivals and phase-type services

Jeongsim Kim, Bara Kim

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)277-297
Number of pages21
JournalPerformance Evaluation
Volume64
Issue number4
DOIs
Publication statusPublished - 2007 May

Keywords

  • Bulk arrivals
  • Joint transform
  • Processor-sharing
  • Queue-length
  • Sojourn time

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'The processor-sharing queue with bulk arrivals and phase-type services'. Together they form a unique fingerprint.

  • Cite this