Proceedings of the 5th International Conference on Queueing Theory and Network Applications
| Hi-index | 0.01 |
We consider a single-server retrial queue with a finite number of sources and exponential repeated attempts. This queueing system and its variants are widely used to model disk memory systems, star-like local area networks and other communication systems. The paper extends previous works on this topic and deals with the orbit size distribution in the case of exponential service times. Sufficient conditions for a mode at zero and formulas for computing the most probable orbit size at the moments when a primary call enters orbit are obtained.