Arnold L. Rosenberg
Journal of the ACM
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.
Arnold L. Rosenberg
Journal of the ACM
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Imran Nasim, Melanie Weber
SCML 2024
Berrin Yanikoglu, Peter A. Sandon
Pattern Recognition