Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T10:36:21.539Z Has data issue: false hasContentIssue false

SERVER WAITING TIMES IN INFINITE SUPPLY POLLING SYSTEMS WITH PREPARATION TIMES

Published online by Cambridge University Press:  09 December 2015

Jan-Pieter L. Dorsman
Affiliation:
Mathematical Institute, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands E-mail: j.l.dorsman@math.leidenuniv.nl
Nir Perel
Affiliation:
Department of Industrial Engineering and Management, Shenkar - Engineering, Design and Art, Ramat Gan, Israel E-mail: perelnir@shenkar.ac.il
Maria Vlasiou
Affiliation:
EURANDOM and Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The NetherlandsStochastics, Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands E-mail: m.vlasiou@tue.nl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a system consisting of a single server serving 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 queueing networks, to an extension of polling systems and surprisingly to random graphs. We are interested in the waiting time of the server. For the case where the server polls the stations cyclically, we give a sufficient condition for the existence of a limiting waiting-time distribution and we study the tail behavior of the stationary waiting time. Furthermore, assuming that preparation times are exponentially distributed, we describe in depth the resulting Markov chain. We also investigate a model variation where the server does not necessarily poll the stations in a cyclic order, but always serves the customer with the earliest completed preparation phase. We show that the mean waiting time under this dynamic allocation never exceeds that of the cyclic case, but that the waiting-time distributions corresponding to both cases are not necessarily stochastically ordered. Finally, we provide extensive numerical results investigating and comparing the effect of the system's parameters to the performance of the server for both models.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2015