Материалов:
1 005 012

Репозиториев:
30

Авторов:
761 409

По вашему запросу найдено документов: 12198

Страница 2 из 1220

Analysis of a finite queue under arbitrary service discipline with Markovian input flow depending on the system state
Bocharov P.P.
capacity indices. Queue models of such the type occur in parameter analysis of the loading control
Stationary characteristics of the finite capacity queueing systemwith inverse service order and generalized probabilistic priority
Meykhanadzhyan L.A.
Consideration is given to the M/G/1/(r - 1) queueing system with LIFO (last in, first out
Revisiting joint stationary distribution in two finite capacity queues operating in parallel
Meykhanadzhyan L., Matyushenko S., Pyatkina D., Razumchik R.
pij in a queueing system consisting of two single-server queues, each of capacityN ≥ 3, operating
Stationary waiting time in G/M/n/r FCFS queue with random renovation
Zaryadov I.S., Razumchik R.V.
Consideration is given to G/M/n/r FCFS queue with random renovation policy. This policy implies
Marginal loss probabilities at phases for multiphase queue with common for phases servers in discrete time
Rykova T.
A multiphase (tandem) queueing system (QS) with a set of common servers distributed between phases
ALGEBRAIC METHOD FOR APPROXIMATING JOINT STATIONARY DISTRIBUTION IN FINITE CAPACITY QUEUE WITH NEGATIVE CUSTOMERS AND TWO QUEUES
Razumchik R.V.
) customers and Poisson flow of negative customers. There is a queue of capacity к (0 < к < ос), where
A finite queue with a markov input dependent on the state of the system and a random service discipline
Bocharov P.P.
A single-server finite-capacity queue with a Markov input is studied under the assumption
2 FINITE QUEUES WITH RELATIVE PRIORITY IN A SINGLE-SERVER SYSTEM WITH PHASE-TYPE DISTRIBUTIONS
ALBORES F.X., BOCHAROV P.P.
of each input wait in separate waiting rooms of finite capacity. Customers of the first input have
Tandem queues with a Markov flow and blocking
Bocharov P., Manzo R., Pechinkin A.
. Both phases are characterized by one server with a buffer of finite capacity. The service times have
BMAP/G/1/∞ system with last come first served probabilistic priority
Milovanova T.A.
, arbitrary servicing, finite-capacity buffer, and last come first served probabilistic priority. Equations

Страница 2 из 1220

Фасеты

Новости проекта

Новости

Партнеры

КФУ
ТГУ
Elpub
СФУ
Webpublishers

Индексация

BASE
WorldCat
OpenAIRE
EDS
core