Abstract
The tool FiFiQueues analyses a general class of open queueing networks, consisting of queueing stations with limited or unlimited buffer capacity and with arbitrary connections between them. The external arrival processes and the service processes are not limited to Poisson processes but are defined by the first and the second moments of the underlying general phase-type distributions [5]. In fact, the class of queueing networks that can be analysed with FiFiQueues supersedes the model class supported by Whitt’s Queueing Network Analyser [7] with one server per node. The first extension of Whitt’s QNA that supported queueing stations with limited buffer capacity was “QNAUT” [4] which was developed at the University of Twente. FiFiQueues replaces some of the approximations made in “QNAUT” and employs new and faster algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. P. Bocharov. Analysis of the queue length and the output flow in single server with finite waiting room and phase type distributions. Problems of Control and Information Theory, 16(3):211–222, 1987.
B. R. Haverkort. Performance of Computer Communication Systems: A Model-Based Approach. John Wiley & Sons, 1998.
B. R. Haverkort and A. Ost. Steady-state analysis of infinite stochastic Petri nets: A comparison between the spectral expansion and the matrix-geometric method. In Proceedings of the 7th International Workshop on Petri Nets and Performance Models, pages 36–45. IEEE Computer Society Press, 1997.
B.R. Haverkort. Approximate analysis of networks of PH|PH|1|K queues: Theory & tool support. In H. Beilner and F. Bause, editors, Quantitative Evalution of Computing and Communication Systems, Lecture Notes in Computer Science 977, pages 239–253. Springer-Verlag, 1995.
M.F. Neuts. Matrix Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, 1981.
R. Sadre, B.R. Haverkort, and A. Ost. An efficient and accurate decomposition method for open finite-and infinite-buffer queueing networks. In W. Stewart and B. Plateau, editors, Numerical Solution of Markov Chains, pages 1–20, Zaragosa University Press, 1999.
W. Whitt. The queueing network analyzer. The Bell System Technical Journal, 62(9):2779–2815, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadre, R., Haverkort, B.R. (2000). FiFiQueues: Fixed-Point Analysis of Queueing Networks with Finite-Buffer Stations. In: Haverkort, B.R., Bohnenkamp, H.C., Smith, C.U. (eds) Computer Performance Evaluation.Modelling Techniques and Tools. TOOLS 2000. Lecture Notes in Computer Science, vol 1786. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46429-8_23
Download citation
DOI: https://doi.org/10.1007/3-540-46429-8_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67260-9
Online ISBN: 978-3-540-46429-7
eBook Packages: Springer Book Archive