|
Problemy Peredachi Informatsii, 2005, Volume 41, Issue 3, Pages 64–75
(Mi ppi108)
|
|
|
|
This article is cited in 38 scientific papers (total in 38 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.
Received: 23.07.2004 Revised: 24.04.2005
Citation:
O. M. Tikhonenko, “Generalized Erlang Problem for Queueing Systems with Bounded Total
Size”, Probl. Peredachi Inf., 41:3 (2005), 64–75; Problems Inform. Transmission, 41:3 (2005), 243–253
Linking options:
https://www.mathnet.ru/eng/ppi108 https://www.mathnet.ru/eng/ppi/v41/i3/p64
|
Statistics & downloads: |
Abstract page: | 859 | Full-text PDF : | 636 | References: | 67 |
|