|
Problemy Peredachi Informatsii, 1999, Volume 35, Issue 1, Pages 75–89
(Mi ppi434)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Communication Network Theory
Multiplicativity of a Stationary Distribution of an Open Queueing Network with Standard Nodes and Single-Type Calls
Yu. V. Malinkovskii
Abstract:
We consider open queueing networks with Markov routing, standard nodes, and one type of completely random arrivals. We assume that nodes with Poisson flow of arrivals, being isolated from the network, are described by continuous-time Markov chains. Under certain conditions, we establish necessary, sufficient, and necessary-and-sufficient conditions for the stationary distribution of the process describing the network to be representable as a product of factors characterizing the separate nodes.
Received: 26.05.1998
Citation:
Yu. V. Malinkovskii, “Multiplicativity of a Stationary Distribution of an Open Queueing Network with Standard Nodes and Single-Type Calls”, Probl. Peredachi Inf., 35:1 (1999), 75–89; Problems Inform. Transmission, 35:1 (1999), 63–75
Linking options:
https://www.mathnet.ru/eng/ppi434 https://www.mathnet.ru/eng/ppi/v35/i1/p75
|
Statistics & downloads: |
Abstract page: | 281 | Full-text PDF : | 144 | References: | 40 |
|