Multiplicativity of Markov chains with multiaddress routing (Q1812361): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Q1180565 / rank | |||
Property / reviewed by | |||
Property / reviewed by: Jevsey Morozov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:46, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multiplicativity of Markov chains with multiaddress routing |
scientific article |
Statements
Multiplicativity of Markov chains with multiaddress routing (English)
0 references
7 March 2004
0 references
A multiplicativity criterion known for a single class queueing network is extended to the network with multiaddress routing in which case a departing call may arrive at several stations simultaneously. A criterion of multiplicativity of the limit distribution of a Markov network process is found. This criterion includes a set of balance equations (in particular, partial balance) between network process distribution and those of isolated nodes. This criterion is also applied to the network with quasi-reversible and arrival ineffective stations.
0 references
queueing networks
0 references
Markov process
0 references
multiaddress routing
0 references
product form distribution
0 references
multiplicativity criterion
0 references