Zobrazeno 1 - 10
of 948
pro vyhledávání: '"Burke's theorem"'
Autor:
Priya, Banu, P., Rajendran
Publikováno v:
International Journal of Pervasive Computing and Communications, 2020, Vol. 17, Issue 1, pp. 37-48.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/IJPCC-03-2020-0012
Autor:
Cator, Eric, Groeneboom, Piet
Publikováno v:
The Annals of Probability, 2005 May 01. 33(3), 879-903.
Externí odkaz:
https://www.jstor.org/stable/3481714
Autor:
P. Rajendran, K. Banu Priya
Publikováno v:
International Journal of Pervasive Computing and Communications. 17:37-48
Purpose The authors consider parallel four-state tandem open queueing network. The queue capacity is infinite. Passenger arrival rate is Poisson distribution and service rate is exponential distribution. The queue is constructed in the form of tandem
Autor:
Cator, Eric, Groeneboom, Piet
Publikováno v:
The Annals of Probability, 2006 Jul 01. 34(4), 1273-1295.
Externí odkaz:
https://www.jstor.org/stable/25449910
Publikováno v:
Journal of Applied Probability, 2005 Dec 01. 42(4), 1145-1167.
Externí odkaz:
https://www.jstor.org/stable/30040835
Autor:
Ferrari, P. A., Fontes, L. R. G.
Publikováno v:
The Annals of Applied Probability, 1994 Nov 01. 4(4), 1129-1144.
Externí odkaz:
https://www.jstor.org/stable/2245084
Autor:
Lina Zhang, Junping Li
Publikováno v:
Frontiers of Mathematics in China. 12:1427-1439
We consider an M X /M/c queue with catastrophes and state-dependent control at idle time. Properties of the queues which terminate when the servers become idle are first studied. Recurrence, equilibrium distribution, and equilibrium queue-size struct
Autor:
Jamol Pender, Young Myoung Ko
Publikováno v:
INFORMS Journal on Computing. 29:688-704
This paper presents a novel and computationally efficient methodology for approximating the queue length (the number of customers in the system) distributions of time-varying non-Markovian many-server queues (e.g., Gt/Gt/nt queues), where the number
Autor:
Doo Ho Lee
Publikováno v:
Journal of the Korean Institute of Industrial Engineers. 43:324-329
Autor:
Igor Lazov
Publikováno v:
International Journal of General Systems. 46:616-639
A queueing system (QS) with finite size holds a current number N, and maximum number M, of present customers (waiting or being served), N ∊ {0, 1, … , M}. We model the system as family of Birth–Death Processes in equilibrium, with size M + 1, i