Cyclic-type polling models with preparation times

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

We consider a system consisting of a server serving in sequence a fixed number of stations. At each station there is an infinite 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 satisfies a Lindley-type equation of a non-standard form. We give a sufficient 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
Title of host publicationProceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES
PublisherINSTICC PRESS
Pages14-23
Number of pages10
ISBN (Print)978-989856540-2
Publication statusPublished - 2013
Externally publishedYes
Event2nd International Conference on Operations Research and Enterprise Systems 2013 - Barcelona, Spain
Duration: 6 Feb 20138 Feb 2013
Conference number: 2
http://www.icores.org/?y=2013

Conference

Conference2nd International Conference on Operations Research and Enterprise Systems 2013
Abbreviated titleICORES 2013
CountrySpain
CityBarcelona
Period6/02/138/02/13
Internet address

Fingerprint Dive into the research topics of 'Cyclic-type polling models with preparation times'. Together they form a unique fingerprint.

Cite this