Abstract
A new version of the Power-Series Algorithm is developed to compute the steady-state distribution of a rich class of Markovian queueing networks. The arrival process is a Multi-queue Markovian Arrival Process, which is a multi-queue generalization of the BMAP. It includes Poisson, fork and round-robin arrivals. At each queue the service process is a Markovian Service Process, which includes sequences of phase-type distributions, set-up times and multi-server queues. The routing is Markovian. The resulting queueing network model is extremely general, which makes the Power-Series Algorithm a useful tool to study load-balancing, capacity-assignment and sequencing problems.
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
Blanc, J.P.C., On a numerical method for calculating state probabilities for queueing systems with more than one waiting line, J. Comput. Appl. Math. 20 (1987), 119–125.
Blanc, J.P.C. and R.D. van der Mci, Optimization of polling systems by means of gradient methods and the power-series algorithm, Tilburg University, Report FEW 575 (1992).
Blanc, J.P.C., Performance evaluation of polling systems by means of the power-series algorithm, Annals of Operations Research 35 (1992), 155–186.
Blanc, J.P.C., The power-series algorithm applied to the shortest-queue model, Operations Research 40 (1992), 157–167.
Blanc, J.P.C., Performance analysis and optimization with the power-series algorithm, in Performance Evaluation of Computer and Communication Systems, eds. L. Donatiello, R. Nelson, Springer-Verlag, Berlin, 1993, 53–80.
Greenberg, B.S. and R.W. Wolff, Optimal order of servers for tandem queues in light traffic, Management Science bf 34 (1988), 500–508.
Hooghiemstra, G., M. Keane and S. van de Ree, Power series for stationary distributions of coupled processor models, SIAM J. Appl. Math. 48 (1988), 1159–1166.
Hout, W.B. van den and J.P.C. Blanc, The power-series algorithm extended to the BMAP/PH/1 queue, Tilburg University, Center DiscussionPaper 9360 (1993).
Koole, G., On the power series algorithm, in Performance Evaluation of Parallel and Distributed Systems, eds. O.J. Boxma and G.M. Koole, CWI Tract 105, Amsterdam, 1994, 139–155.
Lucantoni, D.M., New results on the single server queue with a batch Markovian arrival process, Commun. Statist.-Stochastic Models 7 (1991), 1–46.
Neuts, M.F., Matriz Geometric Solutions in Stochastic Models: an algorithmic approach, John Hopkins Univ. Press, Baltimore, 1981.
Suresh, S. and W. Whitt, Arranging queues in series: a simulation experiment, Management Science 36 (1990), 1080–1091.
Whitt, W., The best order for queues in series, Management Science 31 (1985), 475–487.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this paper
Cite this paper
van den Hout, W.B., Blanc, J.P.C. (1995). The Power-Series Algorithm for Markovian Queueing Networks. In: Stewart, W.J. (eds) Computations with Markov Chains. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2241-6_19
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2241-6_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5943-2
Online ISBN: 978-1-4615-2241-6
eBook Packages: Springer Book Archive