Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models

被引：8
|
作者：
He, QM [1 ]
机构：
[1] Dalhousie Univ, Dept Ind Engn, DALTECH, Halifax, NS B3J 2X4, Canada
来源：
OPERATIONS RESEARCH LETTERS | 2000年 / 26卷 / 02期
关键词：
Markov process; queueing theory; tree structure; positive recurrence; null recurrence; transience; Lyapunov function; mean drift method;
D O I：
10.1016/S0167-6377(99)00057-7
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
This paper studies the classification problem of Markov processes of M/G/1 type with a tree structure. It is shown that the classification of positive recurrence, null recurrence, and transience of the Markov processes of interest is determined completely by the Perron-Frobenius eigenvalue of a nonnegative matrix. The results are used to find classification criteria for a number of discrete time or continuous time queueing systems with multiple types of customers. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：67 / 80
页数：14
相关论文
共 50 条
12345