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

Jeongsim Kim; Bara Kim

doi:10.1007/s11134-007-9058-1

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

Jeongsim Kim
, Bara Kim^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	57-64
Number of pages	8
Journal	Queueing Systems
Volume	58
Issue number	1
DOIs	https://doi.org/10.1007/s11134-007-9058-1
Publication status	Published - 2008 Jan

Bibliographical note

Funding Information:
This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-312-C00470).

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

Access to Document

10.1007/s11134-007-9058-1

Cite this

@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",

note = "Funding Information: This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-312-C00470).",

year = "2008",

month = jan,

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

N1 - Funding Information: This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-312-C00470).

PY - 2008/1

Y1 - 2008/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 - https://www.scopus.com/pages/publications/39149118560

U2 - 10.1007/s11134-007-9058-1

DO - 10.1007/s11134-007-9058-1

M3 - Article

AN - SCOPUS:39149118560

SN - 0257-0130

VL - 58

SP - 57

EP - 64

JO - Queueing Systems

JF - Queueing Systems

IS - 1

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this