Standard

On evaluation of the mean service cycle time in tandem queueing systems. / Krivulin, N. K.; Nevzorov, V. B.

Applied Statistical Science V. ред. / M. Ahsanullah; J. Kennyon; S. K. Sarkar. Nova Science Publishers, Inc., 2001. стр. 145-155.

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийглава/разделнаучнаяРецензирование

Harvard

Krivulin, NK & Nevzorov, VB 2001, On evaluation of the mean service cycle time in tandem queueing systems. в M Ahsanullah, J Kennyon & SK Sarkar (ред.), Applied Statistical Science V. Nova Science Publishers, Inc., стр. 145-155.

APA

Krivulin, N. K., & Nevzorov, V. B. (2001). On evaluation of the mean service cycle time in tandem queueing systems. в M. Ahsanullah, J. Kennyon, & S. K. Sarkar (Ред.), Applied Statistical Science V (стр. 145-155). Nova Science Publishers, Inc..

Vancouver

Krivulin NK, Nevzorov VB. On evaluation of the mean service cycle time in tandem queueing systems. в Ahsanullah M, Kennyon J, Sarkar SK, Редакторы, Applied Statistical Science V. Nova Science Publishers, Inc. 2001. стр. 145-155

Author

Krivulin, N. K. ; Nevzorov, V. B. / On evaluation of the mean service cycle time in tandem queueing systems. Applied Statistical Science V. Редактор / M. Ahsanullah ; J. Kennyon ; S. K. Sarkar. Nova Science Publishers, Inc., 2001. стр. 145-155

BibTeX

@inbook{90c4333468694f5ab7d1880caaaef341,
title = "On evaluation of the mean service cycle time in tandem queueing systems",
abstract = "The problem of exact evaluation of the mean service cycle time in tandem systems of single-server queues with both infinite and finite buffers is considered. It is assumed that the interarrival and service times of customers form sequences of independent and identically distributed random variables with known mean values. We start with tandem queues with infinite buffers, and show that under the above assumptions, the mean cycle time exists. Furthermore, if the random variables which represent interarrival and service times have finite variance, the mean cycle time can be calculated as the maximum out from the mean values of these variables. Finally, obtained results are extended to evaluation of the mean cycle time in particular tandem systems with finite buffers and blocking.",
keywords = "tandem queueing systems, mean cycle time, recursive equations, independent random variables, bounds on the mean value",
author = "Krivulin, {N. K.} and Nevzorov, {V. B.}",
year = "2001",
language = "English",
isbn = "1-56072-923-6",
pages = "145--155",
editor = "M. Ahsanullah and J. Kennyon and Sarkar, {S. K.}",
booktitle = "Applied Statistical Science V",
publisher = "Nova Science Publishers, Inc.",
address = "United States",

}

RIS

TY - CHAP

T1 - On evaluation of the mean service cycle time in tandem queueing systems

AU - Krivulin, N. K.

AU - Nevzorov, V. B.

PY - 2001

Y1 - 2001

N2 - The problem of exact evaluation of the mean service cycle time in tandem systems of single-server queues with both infinite and finite buffers is considered. It is assumed that the interarrival and service times of customers form sequences of independent and identically distributed random variables with known mean values. We start with tandem queues with infinite buffers, and show that under the above assumptions, the mean cycle time exists. Furthermore, if the random variables which represent interarrival and service times have finite variance, the mean cycle time can be calculated as the maximum out from the mean values of these variables. Finally, obtained results are extended to evaluation of the mean cycle time in particular tandem systems with finite buffers and blocking.

AB - The problem of exact evaluation of the mean service cycle time in tandem systems of single-server queues with both infinite and finite buffers is considered. It is assumed that the interarrival and service times of customers form sequences of independent and identically distributed random variables with known mean values. We start with tandem queues with infinite buffers, and show that under the above assumptions, the mean cycle time exists. Furthermore, if the random variables which represent interarrival and service times have finite variance, the mean cycle time can be calculated as the maximum out from the mean values of these variables. Finally, obtained results are extended to evaluation of the mean cycle time in particular tandem systems with finite buffers and blocking.

KW - tandem queueing systems

KW - mean cycle time

KW - recursive equations

KW - independent random variables

KW - bounds on the mean value

M3 - Chapter

SN - 1-56072-923-6

SP - 145

EP - 155

BT - Applied Statistical Science V

A2 - Ahsanullah, M.

A2 - Kennyon, J.

A2 - Sarkar, S. K.

PB - Nova Science Publishers, Inc.

ER -

ID: 4409463