Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Erik Winands"'
Autor:
Marko Boon, Erik Winands
Publikováno v:
EAI Endorsed Transactions on Collaborative Computing, Vol 2, Iss 10, Pp 1-8 (2016)
We consider a two-queue polling model with switch-over times and k-limited service (serve at most ki customers during one visit period to queue i) in each queue. The major benefit of the k-limited service discipline is that it - besides bounding the
Externí odkaz:
https://doaj.org/article/d4f210cd409d4dd48bb542d7761524cb
Publikováno v:
Methodology and Computing in Applied Probability, 22, 927-948
Methodology and Computing in Applied Probability, 22, 3, pp. 927-948
Methodology and Computing in Applied Probability, 22(3), 927-948. Springer Netherlands
Methodology and Computing in Applied Probability, 22, 3, pp. 927-948
Methodology and Computing in Applied Probability, 22(3), 927-948. Springer Netherlands
This paper develops asymptotics and approximations for ruin probabilities in a multivariate risk setting. We consider a model in which the individual reserve processes are driven by a common Markovian environmental process. We subsequently consider a
Publikováno v:
Finance and Stochastics, 24, 309-333
Finance and Stochastics, 24(2), 309-333. Springer Verlag
Finance and Stochastics, 24, 2, pp. 309-333
Finance and Stochastics, 24(2), 309-333. Springer Verlag
Finance and Stochastics, 24, 2, pp. 309-333
We introduce the notion of a regime switching affine process. Informally this is a Markov process that behaves conditionally on each regime as an affine process with specific parameters. To facilitate our analysis, specific restrictions are imposed o
Publikováno v:
Insurance: Mathematics and Economics, 84, 87-97. Elsevier
Insurance: Mathematics and Economics, 84, 87-97
Insurance: Mathematics and Economics, 84, 87-97
Firms should keep capital to offer sufficient protection against the risks they are facing. In the insurance context methods have been developed to determine the minimum capital level required, but less so in the context of firms with multiple busine
Publikováno v:
Queueing Systems. Springer Netherlands
Queueing Systems, 2, 145-172
Bekker, R, Vis, P, Dorsman, J L, van der Mei, R D & Winands, E M M 2015, ' The Impact of Scheduling Policies on the Waiting-time Distributions in Polling Systems ', Queueing Systems . https://doi.org/10.1007/s11134-014-9416-8
Queueing Systems: Theory and Applications, 79(2), 145-172. Springer
Queueing Systems, 79(2), 145-172. Springer Netherlands
Queueing Systems, 2, 145-172
Bekker, R, Vis, P, Dorsman, J L, van der Mei, R D & Winands, E M M 2015, ' The Impact of Scheduling Policies on the Waiting-time Distributions in Polling Systems ', Queueing Systems . https://doi.org/10.1007/s11134-014-9416-8
Queueing Systems: Theory and Applications, 79(2), 145-172. Springer
Queueing Systems, 79(2), 145-172. Springer Netherlands
We consider polling models consisting of a single server that visits the queues in a cyclic order. In the vast majority of papers that have appeared on polling models, it is assumed that at each of the individual queues, the customers are served on a
Publikováno v:
Adv. in Appl. Probab. 46, no. 3 (2014), 812-831
Advances in Applied Probability, 46(3), 812-831. University of Sheffield
Advances in Applied Probability, 46(3), 812-831. University of Sheffield
We focus on a particular connection between queueing and risk models in a multidimensional setting. We first consider the joint workload process in a queueing model with parallel queues and simultaneous arrivals at the queues. For the case that the s
Publikováno v:
Probability in the Engineering and Informational Sciences, 26(3), 337-373. Cambridge University Press
In this paper, we study a traffic intersection with vehicle-actuated traffic signal control. Traffic lights stay green until all lanes within a group are emptied. Assuming general renewal arrival processes, we derive exact limiting distributions of t
Publikováno v:
Queueing Systems
Queueing Systems, Springer Verlag, 2011, 68 (3-4), pp.365-374. ⟨10.1007/s11134-011-9247-9⟩
Queueing Systems: Theory and Applications, 68(3-4), 365-374. Springer
Queueing Systems, Springer Verlag, 2011, 68 (3-4), pp.365-374. ⟨10.1007/s11134-011-9247-9⟩
Queueing Systems: Theory and Applications, 68(3-4), 365-374. Springer
International audience; In the present paper we address two open problems concerning polling systems, viz., queueing systems consisting of multiple queues attended by a single server that visits the queues one at a time. The first open problem deals
Publikováno v:
van Leeuwaarden, J S H, Squillante, M S & Winands, E M M 2009, ' Quasi-birth-and-death processes, lattice path counting, and hypergeometric functions ', Journal of Applied Probability, vol. 46, no. 2, pp. 507-520 . https://doi.org/10.1239/jap/1245676103
Journal of Applied Probability, 46(2), 507-520. University of Sheffield
Journal of Applied Probability, 46(2), 507-520. University of Sheffield
In this paper we consider a class of quasi-birth-and-death processes for which explicit solutions can be obtained for the rate matrix R and the associated matrix G . The probabilistic interpretations of these matrices allow us to describe their eleme
Publikováno v:
Probability in the Engineering and Informational Sciences, 23(2), 385-408. Cambridge University Press
Probability in the Engineering and Informational Sciences, 23(02), 385-408. Cambridge University Press
Winands, E M M, Adan, I J B F, van Houtum, G J & Down, D G 2009, ' A state-dependent polling model with k-limited service ', Probability in the Engineering and Informational Sciences, vol. 23, no. 02, pp. 385-408 . https://doi.org/10.1017/S0269964809000217
Probability in the Engineering and Informational Sciences, 23(02), 385-408. Cambridge University Press
Winands, E M M, Adan, I J B F, van Houtum, G J & Down, D G 2009, ' A state-dependent polling model with k-limited service ', Probability in the Engineering and Informational Sciences, vol. 23, no. 02, pp. 385-408 . https://doi.org/10.1017/S0269964809000217
We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. A set