Cyclic-type polling models with preparation times

N. Perel, J.L. Dorsman, M. Vlasiou

Research output: Book/ReportReportAcademic

1 Citation (Scopus)
65 Downloads (Pure)

Abstract

We consider a system consisting of a server serving in sequence a ¿xed number of stations. At each station there is an in¿nite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queuing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. The waiting time of the server satis¿es a Lindley-type equation of a non-standard form. We give a suf¿cient condition for the existence of a limiting waiting time distribution in the general case, and assuming preparation times are exponentially distributed, we describe in depth the resulting Markov chain. We provide detailed computations for a special case and extensive numerical results investigating the effect of the system’s parameters to the performance of the server.
Original languageEnglish
Place of PublicationEindhoven
PublisherEurandom
Number of pages10
Publication statusPublished - 2013

Publication series

NameReport Eurandom
Volume2013003
ISSN (Print)1389-2355

Fingerprint

Polling
Preparation
Server
Waiting Time
Polling Systems
Queuing Networks
Waiting Time Distribution
Limiting Distribution
Random Graphs
Model
Queue
Markov chain
Customers
Numerical Results

Cite this

Perel, N., Dorsman, J. L., & Vlasiou, M. (2013). Cyclic-type polling models with preparation times. (Report Eurandom; Vol. 2013003). Eindhoven: Eurandom.
Perel, N. ; Dorsman, J.L. ; Vlasiou, M. / Cyclic-type polling models with preparation times. Eindhoven : Eurandom, 2013. 10 p. (Report Eurandom).
@book{2e56ca67034b45d893c74087ca208b87,
title = "Cyclic-type polling models with preparation times",
abstract = "We consider a system consisting of a server serving in sequence a ¿xed number of stations. At each station there is an in¿nite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queuing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. The waiting time of the server satis¿es a Lindley-type equation of a non-standard form. We give a suf¿cient condition for the existence of a limiting waiting time distribution in the general case, and assuming preparation times are exponentially distributed, we describe in depth the resulting Markov chain. We provide detailed computations for a special case and extensive numerical results investigating the effect of the system’s parameters to the performance of the server.",
author = "N. Perel and J.L. Dorsman and M. Vlasiou",
year = "2013",
language = "English",
series = "Report Eurandom",
publisher = "Eurandom",

}

Perel, N, Dorsman, JL & Vlasiou, M 2013, Cyclic-type polling models with preparation times. Report Eurandom, vol. 2013003, Eurandom, Eindhoven.

Cyclic-type polling models with preparation times. / Perel, N.; Dorsman, J.L.; Vlasiou, M.

Eindhoven : Eurandom, 2013. 10 p. (Report Eurandom; Vol. 2013003).

Research output: Book/ReportReportAcademic

TY - BOOK

T1 - Cyclic-type polling models with preparation times

AU - Perel, N.

AU - Dorsman, J.L.

AU - Vlasiou, M.

PY - 2013

Y1 - 2013

N2 - We consider a system consisting of a server serving in sequence a ¿xed number of stations. At each station there is an in¿nite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queuing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. The waiting time of the server satis¿es a Lindley-type equation of a non-standard form. We give a suf¿cient condition for the existence of a limiting waiting time distribution in the general case, and assuming preparation times are exponentially distributed, we describe in depth the resulting Markov chain. We provide detailed computations for a special case and extensive numerical results investigating the effect of the system’s parameters to the performance of the server.

AB - We consider a system consisting of a server serving in sequence a ¿xed number of stations. At each station there is an in¿nite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queuing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. The waiting time of the server satis¿es a Lindley-type equation of a non-standard form. We give a suf¿cient condition for the existence of a limiting waiting time distribution in the general case, and assuming preparation times are exponentially distributed, we describe in depth the resulting Markov chain. We provide detailed computations for a special case and extensive numerical results investigating the effect of the system’s parameters to the performance of the server.

M3 - Report

T3 - Report Eurandom

BT - Cyclic-type polling models with preparation times

PB - Eurandom

CY - Eindhoven

ER -

Perel N, Dorsman JL, Vlasiou M. Cyclic-type polling models with preparation times. Eindhoven: Eurandom, 2013. 10 p. (Report Eurandom).