Multiplicativity of Markov Chains with Multiaddress Routing

被引：0
作者：
M. Yu. Tyurikov
机构：
来源：
Problems of Information Transmission | 2002年 / 38卷 / 3期
关键词：
Markov Chain; System Theory; Markov Process; Stationary Distribution; Broad Class;
D O I：
10.1023/A:1020317303239
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：227 / 236
页数：9
相关论文
共 24 条
[1]  
Chao X.(1998)Markov Network Processes with Product Form Stationary Distributions Queueing Syst. 28 377-401
[2]  
Miyazawa M.(1999)Multiplicativity of a Stationary Distribution of an Open Queueing Network with Standard Nodes and Single-Type Calls Probl. Peredachi Inf. 35 75-89
[3]  
Serfozo R.F.(1975)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers J. ACM 22 248-260
[4]  
Takada H.(1977)Product Form and Local Balance in Queueing Networks J. ACM 24 250-263
[5]  
Malinkovsky Y.(1992)Connecting Internally Balanced Quasi-Reversible Markov Processes Adv. Appl. Probab. 24 934-959
[6]  
Baskett F.(1963)Jobshop-like Queueing Systems Manag. Sci. 10 131-142
[7]  
Chandy K.M.(1975)Networks of Queues with Customers of Different Types J. Appl. Probab. 12 542-554
[8]  
Muntz R.R.(1976)Networks of Queues Adv. Appl. Probab. 8 416-432
[9]  
Palacios F.G.(1987)Preserving Partial Balance in Continuous-Time Markov Chains Adv. Appl. Probab. 19 431-453
[10]  
Chandy K.M.(1980)Interconnections of Markov Chains and Quasi-Reversible Queueing Networks Stoch. Proc. Appl. 10 209-219
123