Throughput bounding and simple approximation methods for exponential fork/join queueing networks with blocking

被引：0
作者：
Paik, Chun-Hyun [1 ]
机构：
[1] Dongeui Univ, Pusan, Korea, Republic of
来源：
Computers and Industrial Engineering | 1998年 / 35卷 / 3-4期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：563 / 566
相关论文
共 47 条
[41]   Computationally efficient approximation algorithm for feed-forward open queueing networks with blocking [J].
Perros, H.G., 1600, (09)
[42]   Approximating closed fork-join queueing networks using product-form stochastic Petri-nets [J].
Osman, Rasha ;
Harrison, Peter G. .
JOURNAL OF SYSTEMS AND SOFTWARE, 2015, 110 :264-278
[43]   The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes [J].
Sunkyo Kim .
Queueing Systems, 2011, 68 :193-216
[44]   The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes [J].
Kim, Sunkyo .
QUEUEING SYSTEMS, 2011, 68 (02) :193-216
[45]   Methods of Determining Simple Approximation Formulas for the Characteristics of Electric Networks. [J].
Walther, K.H. .
Nachrichtentechnik (Changed to Nachrichtentechnik Elektronik), 1972, 22 (09) :281-283
[46]   A SIMPLE AND QUICK APPROXIMATION ALGORITHM FOR TANDEM, SPLIT-AND-MERGE QUEUING-NETWORKS WITH BLOCKING [J].
YANNOPOULOS, E ;
ALFA, AS .
INFOR, 1994, 32 (04) :288-308
[47]   ASYMPTOTIC ANALYSIS AND COMPUTATIONAL METHODS FOR A CLASS OF SIMPLE, CIRCUIT-SWITCHED NETWORKS WITH BLOCKING [J].
MITRA, D .
ADVANCES IN APPLIED PROBABILITY, 1987, 19 (01) :219-239
12345