Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals

Jeongsim Kim, Bara Kim

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Avrachenkov et al. (Queueing Syst. 50:459-480, [2005]) conjectured that in an M/G/1 processor-sharing queue with batch arrivals, the conditional mean sojourn time is concave. In this paper, we show that this conjecture is generally not true.

Original languageEnglish
Pages (from-to)57-64
Number of pages8
JournalQueueing Systems
Volume58
Issue number1
DOIs
Publication statusPublished - 2008 Jan

Keywords

  • Batch arrivals
  • Concavity
  • Processor-sharing
  • Sojourn time

ASJC Scopus subject areas

  • Statistics and Probability
  • Computer Science Applications
  • Management Science and Operations Research
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals'. Together they form a unique fingerprint.

Cite this