A cyclic queueing network with dependent exponential service times
- 1 September 1978
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 15 (3), 573-589
- https://doi.org/10.2307/3213120
Abstract
A cyclic queueing network with two servers and a finite number of customers is studied. The service times for server 1 form an earma(1,1) process (exponential mixed autoregressive moving average process both of order 1) which is a sequence of positively correlated exponential random variables; the process in general is not Markovian. The service times for the other server are independent with a common exponential distribution. Limiting results for the number of customers in queue and the virtual waiting time at server 1 are obtained. Comparisons are made with the case of independent exponential service times for server 1.Keywords
This publication has 8 references indexed in Scilit:
- A mixed autoregressive-moving average exponential sequence and point process (EARMA 1,1)Advances in Applied Probability, 1977
- A queue with poisson input and semi-Markov service times: busy period analysisJournal of Applied Probability, 1975
- Processor Utilization in Multiprogramming Systems via Diffusion ApproximationsOperations Research, 1973
- Empirically Derived Micromodels for Sequences of Page ExceptionsIBM Journal of Research and Development, 1973
- A pseudo-random number generator for the System/360IBM Systems Journal, 1969
- Time dependence of queues with semi-Markovian servicesJournal of Applied Probability, 1967
- Queues with moving average service timesJournal of Applied Probability, 1967
- Stationary Waiting-Time Distributions for Single-Server QueuesThe Annals of Mathematical Statistics, 1962