RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2005 Volume 41, Issue 3, Pages 64–75 (Mi ppi108)

This article is cited in 39 papers

Communication Network Theory

Generalized Erlang Problem for Queueing Systems with Bounded Total Size

O. M. Tikhonenko

Belarusian State Pedagogical University

Abstract: A multiserver on-demand system is considered in which each call has three interdependent random characteristics: the required number of servers, capacity, and service time. The total capacity of calls and the total number of servers in the system are limited. The type of a call is defined by the number of servers required for its service. We find a stationary distribution of the number of calls in the system, as well as the loss probability for a call of each type.

UDC: 621.394.7:519.872

Received: 23.07.2004
Revised: 24.04.2005


 English version:
Problems of Information Transmission, 2005, 41:3, 243–253

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026