A customer threshold property for closed finite queueing networks

Authors:
Mustafa Yuzukirmizi;J. MacGregor Smith
Affiliations:
Department of Mechanical and Industrial Engineering, University of Massachusetts Amherst, MA and Department of Engineering, Kirikkale University, Kirikkale, Turkey;Department of Mechanical and Industrial Engineering, University of Massachusetts Amherst, MA
Venue:
Performance Evaluation
Year:
2006

Citing 11
Cited 1

Mean Value Analysis for Blocking Queueing Networks

IEEE Transactions on Software Engineering
Product Form Approximations for Queueing Networks with Multiple Servers and Blocking

IEEE Transactions on Computers
Approximate Throughput Analysis of Cyclic Queueing Networks with Finite Buffers

IEEE Transactions on Software Engineering
Survey of closed queueing networks with blocking

ACM Computing Surveys (CSUR)
Some equivalencies between closed queueing networks with blocking

Performance Evaluation
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
Product Form and Local Balance in Queueing Networks

Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
On the Exact and Approximate Throughput Analysis of Closed Queuing Networks with Blocking

IEEE Transactions on Software Engineering
Properties and Analysis of Queueing Network Models with Finite Capacities

Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93

Dynamic analysis of an automobile assembly line considering starving and blocking

Robotics and Computer-Integrated Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new class of finite queues in cyclic networks with production blocking. We show that with a threshold property related to the number of customers in the network, these queues are insensitive to the allocation of buffers and the order of the stations. In addition, some simple and practical, yet effective approximations are presented. Numerical examples have been carried out to demonstrate the efficacy of the approaches.