Cyclic Queueing Networks Research Articles

A note on cycle times in tree-like queueing networks

Cycle-time distribution is shown to take the form of a linear combination of M Erlang-N density functions in a cyclic queueing network of M servers and N customers. For paths of m servers in tree-like networks, the components in the more complex linear combination are convolutions of Erlang-N with at most m − 1 negative exponentials.

A note on cycle times in tree-like queueing networks

Cycle-time distribution is shown to take the form of a linear combination of M Erlang-N density functions in a cyclic queueing network of M servers and N customers. For paths of m servers in tree-like networks, the components in the more complex linear combination are convolutions of Erlang-N with at most m − 1 negative exponentials.

A cyclic queueing network with dependent exponential service times

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.

A cyclic queueing network with dependent exponential service times

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.

The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity Queue

We derive an expression for the Laplace-Stieltjes transform of the steady-state distribution of the queueing time for the M/G/1 finite capacity queue. The derivation proceeds in terms of a related 2-stage closed cyclic queueing network. The resulting expression is a rational function of the steady-state probabilities of the imbedded Markov chain at departure epochs and of the Laplace-Stieltjes transform of the service time distribution. The expression can be differentiated readily in order to obtain moments of the steady-state queueing time and some numerical results for the mean and coefficient of variation are presented.