Abstract
This paper is tutorial in nature. It demonstrates how a particular heuristic extension of the arrival theorem, which was introduced earlier for very special network topologies, can be effectively applied (in an essentially unchanged manner) to obtain all mean performance measures for a rich class of Gordon-Newell like non-product-form queueing networks (QNs). All nodes in the class of queueing networks discussed are either FIFO or IS (pure delay), there is a single closed chain with probabilistic routing and each FIFO node also processes customers from a dedicated open chain. The number of FIFO nodesK, the number of IS nodesL and the closed chain populationN are finite but arbitrary and closed chain customers route probabilistically according to an arbitrary routing matrixQ. The think time distribution at an IS node is general, the service time distribution for both closed chain and open chain customers at the FIFO nodes is exponential with distinct service times for each, and both IS think times and FIFO service times are node dependent.
The approximation technique is enhanced by an analytic study which demonstrates that it mirrors the expected behavior of the QN in many essential respects: monotonicity, bottleneck and asymptotic behavior. Moreover, in the case of balanced QNs, the approximation yields simple and explicit expressions for all quantities of interest. The analytic study and the numerical experiments presented complement one another and suggest that this approximation technique captures the essential structure of the QN, insofar as mean performance quantities are concerned.
Similar content being viewed by others
References
J.S. Kaufman, Finite and infinite source interactions,Proc. Performance 84 (North-Holland, 1984) pp. 345–359.
J.S. Kaufman and W.S. Wong, Approximate analysis of a cyclic queueing network with applications to a simultaneous resource possession problem, Perf. Eval. 11 (1990) 187–200.
K.C. Sevcik and J. Mitrani, The distribution of queueing network states at input and output states,4th Int. Symp. on Modelling and Performance Analysis of Computer Systems, Vienna (February 1979) pp. 319–335.
J.S. Kaufman, A recursive technique for a combined source queueing model, IEEE Trans. Sel. Areas Commun. SAC-4 (1986) 919–925.
M. Reiser, Performance Evaluation of data-communication systems, Proc. IEEE 70 (1982) 171–196.
P. Schweitzer, Approximate analysis of multiclass closed networks of queues,Int. Conf. on Stochastic Control and Optimization, Amsterdam (1979).
E. de Souza e Silva, S.S. Lavenberg and R.R. Muntz, A perspective on iterative methods for the approximate analysis of closed queueing networks,Proc. Conf. on Mathematical Computer Performance and Reliability (North-Holland, 1984) pp. 225–244.
F.P. Kelly, On a class of approximations for closed queueing networks, Queueing Syst. 4 (1989) 69–76.
W.J. Gordon and G.F. Newell, Closed queueing systems with exponential servers, Oper. Res. 15 (1967) 254–265.
B. Melamed and R.J.T. Morris, Visual simulation: The performance analysis workstation, IEEE Comput. 18 (1985) 87–94.
Author information
Authors and Affiliations
Additional information
Currently on leave of absence from Bell Laboratories, at The Chinese University of Hong Kong, Department of Information Engineering, New Territories, Hong Kong.
Rights and permissions
About this article
Cite this article
Kaufman, J.S., Wong, W.S. Approximate analysis of a gordon-newell like non-product-form queueing network. Ann Oper Res 48, 249–271 (1994). https://doi.org/10.1007/BF02024660
Issue Date:
DOI: https://doi.org/10.1007/BF02024660