|
Problemy Peredachi Informatsii, 2002, Volume 38, Issue 3, Pages 72–82
(Mi ppi1318)
|
|
|
|
Communication Network Theory
Multiplicativity of Markov Chains with Multiaddress Routing
M. Yu. Tyurikov
Abstract:
A broad class of network Markov processes (including open queueing networks) with multiaddress routing and one type of calls is considered. Under such routing, the same call can simultaneously arrive at several nodes. For these processes, we found necessary and sufficient conditions of multiplicativity, that is, conditions of representability of a stationary distribution as a product of factors characterizing separate nodes.
Received: 27.10.2000 Revised: 17.01.2002
Citation:
M. Yu. Tyurikov, “Multiplicativity of Markov Chains with Multiaddress Routing”, Probl. Peredachi Inf., 38:3 (2002), 72–82; Problems Inform. Transmission, 38:3 (2002), 227–236
Linking options:
https://www.mathnet.ru/eng/ppi1318 https://www.mathnet.ru/eng/ppi/v38/i3/p72
|
|