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
相关论文
共 46 条
[31]   Approximation of discrete time tandem queueing networks with unreliable servers and blocking [J].
Shin, Yang Woo ;
Moon, Dug Hee .
PERFORMANCE EVALUATION, 2018, 120 :49-74
[32]   General open and closed queueing networks with blocking: A unified framework for approximation [J].
Vroblefski, M ;
Ramesh, R ;
Zionts, S .
INFORMS JOURNAL ON COMPUTING, 2000, 12 (04) :299-316
[33]   An approximation for computing the throughput of closed assembly-type queueing networks [J].
Ayhan, H ;
Wortman, MA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :107-121
[34]   Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing [J].
Gorbunova, A. V. ;
Lebedev, A. V. .
MATHEMATICS AND COMPUTERS IN SIMULATION, 2023, 214 :409-428
[35]   EQUIVALENCE, REVERSIBILITY, SYMMETRY AND CONCAVITY PROPERTIES IN FORK-JOIN QUEUING-NETWORKS WITH BLOCKING [J].
DALLERY, Y ;
LIU, Z ;
TOWSLEY, D .
JOURNAL OF THE ACM, 1994, 41 (05) :903-942
[36]   A decomposition approximation for assembly-disassembly queueing networks with finite buffer and blocking [J].
Asadathorn, N ;
Chao, XL .
ANNALS OF OPERATIONS RESEARCH, 1999, 87 (0) :247-261
[37]   THROUGHPUT EQUIVALENCIES IN FORK JOIN QUEUING-NETWORKS WITH FINITE BUFFERS AND GENERAL SERVICE TIMES [J].
PAIK, CH ;
TCHA, DW .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1995, 33 (03) :695-703
[38]   APPROXIMATION ANALYSIS OF OPEN ACYCLIC EXPONENTIAL QUEUING-NETWORKS WITH BLOCKING [J].
LEE, HS ;
POLLOCK, SM .
OPERATIONS RESEARCH, 1990, 38 (06) :1123-1134
[39]   Refined mean-field approximation for discrete-time queueing networks with blocking [J].
Pan, Yang ;
Shi, Pengyi .
NAVAL RESEARCH LOGISTICS, 2023, 70 (07) :770-789