No label defined (Q4234740)

The paper presents an efficient method to compute call and time blocking when there are renewal arrivals to a communication link with \(s\) channels, the service time distribution being exponential. Both a loss system and a finite room system are considered. The renewal arrival is represented by a matrix-exponential distribution, requiring that the inter-arrival distribution has a rational Laplace transform. The presentation is based on linear algebraic queueing theory, which does not require any complex and tedious transform methods or root finding procedures. Computational results are presented for comparison with various approximation methods. It is observed that the first two moments of a distribution may not be enough to characterize an arrival distribution; the third moment may have to be taken into account to compute call-blocking occurring in a loss system. For the entire collection see [Zbl 0903.00111].