About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of the ACM
Paper
The Cycle Time Distribution of Exponential Cyclic Queues
Abstract
The cycle time distribution of a cyclic queue with two exponential servers is derived. Results show that when the population size N is large enough, the cycle time distribution is not sensitive to the ratio of service rates and asymptotically approaches an Erlangian distribution. If service rates are identical, however, the cycle time has an exact Erlangian distribution for any N. © 1980, ACM. All rights reserved.