Robust queueing theory : an initial study using imprecise probabilities
- Author
- Stavros Lopatatzidis, Jasper De Bock (UGent) , Gert de Cooman (UGent) , Stijn De Vuyst (UGent) and Joris Walraevens (UGent)
- Organization
- Abstract
- We study the robustness of performance predictions of discrete-time finite-capacity queues by applying the framework of imprecise probabilities. More concretely, we consider the Geo/Geo/1/L model with probabilities of arrival and departure that are no longer fixed, but are allowed to vary within given intervals. We distinguish between two concepts of independence in this framework, namely repetition independence and epistemic irrelevance. In the first approach, we assume the existence of time-homogeneous probabilities for arrival and departure, which leads us to consider a collection of stationary queues. In the second, the stationarity assumption is dropped and we allow the arrival and departure probabilities to vary from time point to time point; they may even depend on the complete history of queue lengths. We calculate bounds on the expected queue length, the probability of a particular queue length and the probability of turning on the server. For the expected queue length, both approaches coincide. For the other performance measures, we observe and discuss various differences between the bounds obtained for these two approaches. One of our observations is that ergodicity may break down due to imprecision: bounds on expected time averages of certain functions on the state space are not necessarily equal to the bounds on the expectation of that function at random instants in a steady-state queue.
- Keywords
- Geo/Geo/1/L, Imprecise probabilities, Time-homogeneous, Robustness, Performance measures, Discrete-time queueing, MARKOV-CHAINS, PERTURBATION REALIZATION, MODELS, OPTIMIZATION, SIMULATION
Downloads
-
(...).pdf
- full text
- |
- UGent only
- |
- |
- 1.13 MB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-7189654
- MLA
- Lopatatzidis, Stavros, et al. “Robust Queueing Theory : An Initial Study Using Imprecise Probabilities.” QUEUEING SYSTEMS, vol. 82, no. 1–2, 2016, pp. 75–101, doi:10.1007/s11134-015-9458-6.
- APA
- Lopatatzidis, S., De Bock, J., de Cooman, G., De Vuyst, S., & Walraevens, J. (2016). Robust queueing theory : an initial study using imprecise probabilities. QUEUEING SYSTEMS, 82(1–2), 75–101. https://doi.org/10.1007/s11134-015-9458-6
- Chicago author-date
- Lopatatzidis, Stavros, Jasper De Bock, Gert de Cooman, Stijn De Vuyst, and Joris Walraevens. 2016. “Robust Queueing Theory : An Initial Study Using Imprecise Probabilities.” QUEUEING SYSTEMS 82 (1–2): 75–101. https://doi.org/10.1007/s11134-015-9458-6.
- Chicago author-date (all authors)
- Lopatatzidis, Stavros, Jasper De Bock, Gert de Cooman, Stijn De Vuyst, and Joris Walraevens. 2016. “Robust Queueing Theory : An Initial Study Using Imprecise Probabilities.” QUEUEING SYSTEMS 82 (1–2): 75–101. doi:10.1007/s11134-015-9458-6.
- Vancouver
- 1.Lopatatzidis S, De Bock J, de Cooman G, De Vuyst S, Walraevens J. Robust queueing theory : an initial study using imprecise probabilities. QUEUEING SYSTEMS. 2016;82(1–2):75–101.
- IEEE
- [1]S. Lopatatzidis, J. De Bock, G. de Cooman, S. De Vuyst, and J. Walraevens, “Robust queueing theory : an initial study using imprecise probabilities,” QUEUEING SYSTEMS, vol. 82, no. 1–2, pp. 75–101, 2016.
@article{7189654,
abstract = {{We study the robustness of performance predictions of discrete-time finite-capacity queues by applying the framework of imprecise probabilities. More concretely, we consider the Geo/Geo/1/L model with probabilities of arrival and departure that are no longer fixed, but are allowed to vary within given intervals. We distinguish between two concepts of independence in this framework, namely repetition independence and epistemic irrelevance. In the first approach, we assume the existence of time-homogeneous probabilities for arrival and departure, which leads us to consider a collection of stationary queues. In the second, the stationarity assumption is dropped and we allow the arrival and departure probabilities to vary from time point to time point; they may even depend on the complete history of queue lengths. We calculate bounds on the expected queue length, the probability of a particular queue length and the probability of turning on the server. For the expected queue length, both approaches coincide. For the other performance measures, we observe and discuss various differences between the bounds obtained for these two approaches. One of our observations is that ergodicity may break down due to imprecision: bounds on expected time averages of certain functions on the state space are not necessarily equal to the bounds on the expectation of that function at random instants in a steady-state queue.}},
author = {{Lopatatzidis, Stavros and De Bock, Jasper and de Cooman, Gert and De Vuyst, Stijn and Walraevens, Joris}},
issn = {{1572-9443}},
journal = {{QUEUEING SYSTEMS}},
keywords = {{Geo/Geo/1/L,Imprecise probabilities,Time-homogeneous,Robustness,Performance measures,Discrete-time queueing,MARKOV-CHAINS,PERTURBATION REALIZATION,MODELS,OPTIMIZATION,SIMULATION}},
language = {{eng}},
location = {{Ghent, BELGIUM}},
number = {{1-2}},
pages = {{75--101}},
title = {{Robust queueing theory : an initial study using imprecise probabilities}},
url = {{http://doi.org/10.1007/s11134-015-9458-6}},
volume = {{82}},
year = {{2016}},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: