The cyclic queue with one general and one exponential server
- 1 December 1983
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 15 (4) , 857-873
- https://doi.org/10.2307/1427328
Abstract
This paper considers the two-stage cyclic queueing model consisting of one general (G) and one exponential (M) server. The strong connection between the present model and the M/G/1 model (with finite waiting room) is exploited to yield the joint distribution of the successive response times of a customer at the G queue and the M queue. This result reveals a surprising phenomenon: in general there is a difference between the joint distribution of the two successive response times at (first) the G queue and (then) the M queue, and the joint distribution of the two successive response times at (first) the M queue and (then) the G queue.Another associated result is an expression for the cycle-time distribution. Special consideration is given to the case that the number of customers in the system tends to ∞, while the mean service times tend to 0 at an inversely proportional rate.Keywords
This publication has 8 references indexed in Scilit:
- Joint distribution of sojourn time and queue length in the M/G/1 queue with (in) finite capacityPublished by Elsevier ,2011
- The Product Form for Sojourn Time Distributions in Cyclic Exponential QueuesJournal of the ACM, 1984
- Sojourn times in closed queueing networksAdvances in Applied Probability, 1983
- The Time for a Round Trip in a Cycle of Exponential QueuesJournal of the ACM, 1983
- On response time and cycle time distributions in a two-stage cyclic queuePerformance Evaluation, 1982
- Passage times for overtake-free paths in Gordon–Newell networksAdvances in Applied Probability, 1982
- The Cycle Time Distribution of Exponential Cyclic QueuesJournal of the ACM, 1980
- The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity QueueManagement Science, 1975