Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9506711 | Applied Mathematics and Computation | 2005 | 18 Pages |
Abstract
Multi-server retrial queues are widely used to model stochastically many telephone systems and computer networks. This paper studies the distribution of the time needed to reach a certain level of congestion, i.e., a given number of customers in the retrial group. We present a detailed algorithmic analysis which includes the computation of the time to reach a critical number of customers (continuous descriptor), the number of customers served during such a time (discrete descriptor) and the corresponding moments for both queueing performance measures.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
N.M. Apaolaza, J.R. Artalejo,