Multiclass closed queueing networks with deterministic service times and finite local buffers: an approximate performance analysis method

A procedure is presented for the approximate analysis of multiclass queuing networks with deterministic processing times and limited local storage capacity. An algorithm is proposed which is an extension of the queuing network analyzer (QNA) procedure previously developed by Alcardi and Minciardi (Proc. IEEE Int. Conf. on CIM, Troy, NY, USA, p.85-90, 1988; IFAC Int. Workshop on Decisional Structures in Automated Manufacturing, Genova, Italy, p.247-55, 1989). In this procedure the effects of the buffers´ finiteness are explicitly taken into account in the computation of the network´s throughputs. Together with the procedure, some remarks about the approximation embedded in the reported relationships are provided in order to characterize the class of queuing networks allowing a good degree of accuracy of the QNA, both in finite- and infinite-buffer cases