APPROXIMATION ANALYSIS OF OPEN ACYCLIC EXPONENTIAL QUEUING-NETWORKS WITH BLOCKING

• 成果类型: Article
• 署名作者: LEE, HS; POLLOCK, SM
• 署名单位: University of Michigan System; University of Michigan
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.38.6.1123
• 发表日期: 1990
• 页码: 1123-1134
• 关键词: Queues; APPLICATIONS; ANALYSIS OF NETWORKS WITH BLOCKING; queues; LIMIT THEOREMS; APPROXIMATION METHOD FOR NETWORKS WITH BLOCKING

摘要

An arbitrary configuration of an open queueing network with exponential service times and finite buffers is analyzed. We offer an iterative procedure for approximating the marginal occupancy probabilities for each queue of the system. The method decomposes the queueing network into individual queues and analyzes each in isolation using information from only its nearest neighbors. Based upon the SIMP approximation previously used for tandem queues, it replaces each server's service time with a clearance time, which includes blocking, and each server's arrival rate by an equivalent acceptance rate. The procedure is easy to implement and requires modest memory and computer time. Extensive numerical experiments, performed for various topologies, yield accurate results compared with those obtained by exact or simulation methods.