Some aspects of waiting time in cyclic-waiting systems

Laszlo Lakatos; Dmitry Efrosinin

doi:10.1007/978-3-642-35980-4_13

Some aspects of waiting time in cyclic-waiting systems

Laszlo Lakatos, Dmitry Efrosinin

Institute of Stochastics

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

Abstract

We consider a queueing system with Poisson arrivals and exponentially distributed service time and FCFS service discipline. The service of a customer is started at the moment of arrival (in case of free system) or at moments di®ering from it by the multiples of a given cycle time T (in case of occupied server or waiting queue). The waiting time is always the multiple of cycle time T, one Їnds its generating function and mean value. The characteristics of service are illustrated by numerical examples. If we measure the waiting time by means of number of cycles, we can optimize the cycle time T.

Original language	English
Title of host publication	Modern Probabilistic Methods for Analysis of Telecommunication Networks. Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings
Publisher	Springer-Verlag
Pages	115-121
Number of pages	7
Volume	356
ISBN (Print)	978-3-642-35979-8
DOIs	https://doi.org/10.1007/978-3-642-35980-4_13
Publication status	Published - Jan 2013

Publication series

Name	Communications in Computer and Information Science
ISSN (Print)	1865-0929

Fields of science

101002 Analysis
101029 Mathematical statistics
101014 Numerical mathematics
101024 Probability theory
101015 Operations research
101026 Time series analysis
101019 Stochastics
107 Other Natural Sciences
211 Other Technical Sciences

JKU Focus areas

Computation in Informatics and Mathematics
Engineering and Natural Sciences (in general)

Access to Document

10.1007/978-3-642-35980-4_13

Cite this

Lakatos, L., & Efrosinin, D. (2013). Some aspects of waiting time in cyclic-waiting systems. In Modern Probabilistic Methods for Analysis of Telecommunication Networks. Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings (Vol. 356, pp. 115-121). (Communications in Computer and Information Science). Springer-Verlag. https://doi.org/10.1007/978-3-642-35980-4_13

Lakatos, Laszlo ; Efrosinin, Dmitry. / Some aspects of waiting time in cyclic-waiting systems. Modern Probabilistic Methods for Analysis of Telecommunication Networks. Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings. Vol. 356 Springer-Verlag, 2013. pp. 115-121 (Communications in Computer and Information Science).

@inproceedings{8ecb8485b6a14046a07ad51497e4f7e5,

title = "Some aspects of waiting time in cyclic-waiting systems",

abstract = "We consider a queueing system with Poisson arrivals and exponentially distributed service time and FCFS service discipline. The service of a customer is started at the moment of arrival (in case of free system) or at moments di{\textregistered}ering from it by the multiples of a given cycle time T (in case of occupied server or waiting queue). The waiting time is always the multiple of cycle time T, one Їnds its generating function and mean value. The characteristics of service are illustrated by numerical examples. If we measure the waiting time by means of number of cycles, we can optimize the cycle time T.",

author = "Laszlo Lakatos and Dmitry Efrosinin",

year = "2013",

month = jan,

doi = "10.1007/978-3-642-35980-4_13",

language = "English",

isbn = "978-3-642-35979-8",

volume = "356",

series = "Communications in Computer and Information Science",

publisher = "Springer-Verlag",

pages = "115--121",

booktitle = "Modern Probabilistic Methods for Analysis of Telecommunication Networks. Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings",

}

Lakatos, L & Efrosinin, D 2013, Some aspects of waiting time in cyclic-waiting systems. in Modern Probabilistic Methods for Analysis of Telecommunication Networks. Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings. vol. 356, Communications in Computer and Information Science, Springer-Verlag, pp. 115-121. https://doi.org/10.1007/978-3-642-35980-4_13

Some aspects of waiting time in cyclic-waiting systems. / Lakatos, Laszlo; Efrosinin, Dmitry.
Modern Probabilistic Methods for Analysis of Telecommunication Networks. Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings. Vol. 356 Springer-Verlag, 2013. p. 115-121 (Communications in Computer and Information Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

TY - GEN

T1 - Some aspects of waiting time in cyclic-waiting systems

AU - Lakatos, Laszlo

AU - Efrosinin, Dmitry

PY - 2013/1

Y1 - 2013/1

N2 - We consider a queueing system with Poisson arrivals and exponentially distributed service time and FCFS service discipline. The service of a customer is started at the moment of arrival (in case of free system) or at moments di®ering from it by the multiples of a given cycle time T (in case of occupied server or waiting queue). The waiting time is always the multiple of cycle time T, one Їnds its generating function and mean value. The characteristics of service are illustrated by numerical examples. If we measure the waiting time by means of number of cycles, we can optimize the cycle time T.

AB - We consider a queueing system with Poisson arrivals and exponentially distributed service time and FCFS service discipline. The service of a customer is started at the moment of arrival (in case of free system) or at moments di®ering from it by the multiples of a given cycle time T (in case of occupied server or waiting queue). The waiting time is always the multiple of cycle time T, one Їnds its generating function and mean value. The characteristics of service are illustrated by numerical examples. If we measure the waiting time by means of number of cycles, we can optimize the cycle time T.

U2 - 10.1007/978-3-642-35980-4_13

DO - 10.1007/978-3-642-35980-4_13

M3 - Conference proceedings

SN - 978-3-642-35979-8

VL - 356

T3 - Communications in Computer and Information Science

SP - 115

EP - 121

BT - Modern Probabilistic Methods for Analysis of Telecommunication Networks. Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings

PB - Springer-Verlag

ER -

Lakatos L, Efrosinin D. Some aspects of waiting time in cyclic-waiting systems. In Modern Probabilistic Methods for Analysis of Telecommunication Networks. Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings. Vol. 356. Springer-Verlag. 2013. p. 115-121. (Communications in Computer and Information Science). doi: 10.1007/978-3-642-35980-4_13