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 1

Fingerprint

Batch
Queue
Concavity
Queueing

Keywords

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

ASJC Scopus subject areas

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

Cite this

Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals. / Kim, Jeongsim; Kim, Bara.

In: Queueing Systems, Vol. 58, No. 1, 01.01.2008, p. 57-64.

Research output: Contribution to journalArticle

@article{8025a4da6e2f427eb17d10f1da545590,
title = "Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals",
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.",
keywords = "Batch arrivals, Concavity, Processor-sharing, Sojourn time",
author = "Jeongsim Kim and Bara Kim",
year = "2008",
month = "1",
day = "1",
doi = "10.1007/s11134-007-9058-1",
language = "English",
volume = "58",
pages = "57--64",
journal = "Queueing Systems",
issn = "0257-0130",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

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

AU - Kim, Jeongsim

AU - Kim, Bara

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

KW - Batch arrivals

KW - Concavity

KW - Processor-sharing

KW - Sojourn time

UR - http://www.scopus.com/inward/record.url?scp=39149118560&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39149118560&partnerID=8YFLogxK

U2 - 10.1007/s11134-007-9058-1

DO - 10.1007/s11134-007-9058-1

M3 - Article

AN - SCOPUS:39149118560

VL - 58

SP - 57

EP - 64

JO - Queueing Systems

JF - Queueing Systems

SN - 0257-0130

IS - 1

ER -