Abstract
This paper describes an analytical study on open three-station network models with blocking assuming that there are finite capacity buffers at the front of each server. Tasks arrive from the source station at station A in a Poisson fashion at a rate λ, and the service times at the first and second station are exponentially distributed with a mean of sA and sB respectively. Both service stations have buffers with finite capacities. Here, a two-dimensional state graph was constructed and a set of steady-state equations is created. These equations allow for calculating state probabilities for each graph state. In the next part of the paper, the algorithms for calculation of the main measures of effectiveness in an open three-station model are presented. The numerical part of this paper contains examples of an investigation of the three-station models, where there are presented the results of the calculation of the main measures of effectiveness and quality of service (QoS) parameters.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akyildiz I.F. Mean Value Analysis for Blocking Queuing Networks, IEEE Transaction on Software Engineering, Vol. 14(4), pp. 418-428, 1988.
Balsamo S., de Nitto Persone V. A survey of product form queueing networks with blocking and their equivalences, Annals of Operations research, Vol. 48(1/4), pp. 31-61, 1994.
Balsamo S., de Nito Persone V., Onvural R. Analysis of Queueing Networks with Blocking, Kluwer Academic Publishers, Boston, 2001.
Clo M.C. MVA for product-form cyclic queueing networks with blocking, Annals of Operations Research, Vol. 79, pp. 83-96, 1998.
Economou A., Fakinos D. Product form stationary distributions for queueing networks with blocking and rerouting, Queueing Systems, Vol. 30(3/4), pp. 251-260, 1998.
Gomez-Corral A. A Tandem Queue with Blocking and Markovian Arrival Process, Queueing Systems, Vol. 41(4), pp. 343-370, 2002.
Martin J.B. Large Tandem Queueing Networks with Blocking, Queueing Systems, Vol. 41(1/2), pp. 45-72, 2002.
Morrison J.A. Blocking probabilities for multiple class batched arrivals to a shared resource, Performance Evaluation, Vol. 25, pp. 131-150, 1996.
Onvural R. Survey of closed queuing networks with blocking, Computer Survey, Vol. 22(2), pp. 83-121, 1990.
Perros H.G. Queuing Networks with Blocking. Exact and Approximate Solution, Oxford University Press, New York, 1994.
Sereno M. Mean value analysis of product form solution queueing networks with repetitive service blocking, Performance Evaluation, Vol. 36-37, pp. 19-33, 1999.
Strelen J.Ch., et al. Analysis of queueing networks with blocking using a new aggregation technique, Annals of Operations Research, Vol. 79, pp. 121-142, 1998.
Tolio T., Gershwin S.B. Throughput estimation in cyclic queueing networks with blocking, Annals of Operations Research, Vol. 79, pp. 207-229, 1998.
Zhuang L., Buzacott J.A., Liu X-G. Approximate mean value performance analysis of cyclic queueing networks with production blocking, Queueing Systems, Vol. 16, pp. 139-165, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this paper
Cite this paper
Oniszczuk, W. (2007). Analysis of an Open Linked Series Three-station Network with Blocking. In: Pejaś, J., Saeed, K. (eds) Advances in Information Processing and Protection. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-73137-7_38
Download citation
DOI: https://doi.org/10.1007/978-0-387-73137-7_38
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-73136-0
Online ISBN: 978-0-387-73137-7
eBook Packages: Computer ScienceComputer Science (R0)