Abstract
A new algorithm for computing main measures of effectiveness in a special type of a tandem model with finite capacity of buffer is presented. In such a model, the finite capacity buffer is located between two multi-channel nodes, where tasks are processed. This type of model provides realistic and objective foundation for performance evaluation in the discrete flow systems such as information systems, computer networks, etc. For instant, in the tandem model with finite capacity of buffer, if the buffer is full, the blocking mechanisms restricts the arrival of any new processes and the newly generated tasks are blocked in an input node until the transmission process is resumed.
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
Akyildiz I.F.: Mean Value Analysis for Blocking Queuing Networks. IEEE Transaction on Software Engineering 14(4) (1988) 418–428
Balsamo S., De Nitto Persone V.: Closed queueing networks with finite capacities: blocking types, product-form solution and performance indices. Performance Evaluation 12(2) (1991) 85–102
Balsamo S., De Nito Persone V., Onvural R.: Analysis of Queueing Networks with Blocking. Kluwer Academic Publishers, Boston (2001)
Badrah A., Czachórski T., Domańska J., Fourneau J.-M., Quessette F.: Performance evaluation of multistage interconnection networks with blocking — discrete and continuous time Markov models. Archiwum Informatyki Teoretycznej i Stosowanej 14(2) (2002) 145–162
Boucherie R.J., van Dijk N.M.: On the arrival theorem for product form queueing networks with blocking. Performance Evaluation 29(3) (1997) 155–176
Clo M.C.: MVA for product-form cyclic queueing networks with blocking. Annals of Operations Research 79 (1998) 83–96
Economou A., Fakinos D.: Product form stationary distributions for queueing networks with blocking and rerouting. Queueing Systems 30(3/4) (1998) 251–260
Gomez-Corral A.: A Tandem Queue with Blocking and Markovian Arrival process. Queueing Systems 41(4) (2002) 343–370
Kaufman J.S., Rege K.M.: Blocking in a shared resource environment with batched arrival processes, Performance Evaluation 24 (1996) 249–263
Kouvatsos D., Awan I.: Entropy maximization and open queueing networks with priorities and blocking. Performance Evaluation 51(2–4) (2003) 191–227
Martin J.B.: Large Tandem Queueing Networks with Blocking. Queueing Systems 41(1/2) (2002) 45–72
Oniszczuk W.: Metody modelowania. Wydawnictwa Politechniki Białostockiej, Białystok (1995)
Onvural R.: Survey of closed queuing networks with blocking. Computer Survey 22(2) (1990) 83–121
Perros H.G.: Queuing Networks with Blocking, Exact and Approximate Solution. Oxford University Press, New York (1994)
Pinsky E., Conway A.D.: Mean-value analysis of multi-facility blocking models with state-dependent arrivals. Performance Evaluation 24 (1996) 303–309
Ramesh S., Perros H.G.: A two-level queueing network model with blocking and nonblocking messages. Annals of Operations Research 93(1/4) (2000) 357–372
Sereno M,: Mean value analysis of product form solution queueing networks with repetitive service blocking. Performance Evaluation 36–37 (1999) 19–33
Stasiak M., Głąbowski M.: A simple approximation of the link model with reservation by a one-dimensional Markov chain. Performance Evaluation 40 (2000) 195–208
Strelen J.Ch., Bärk B., Becker J., Jonas V.: Analysis of queueing networks with blocking using a new aggregation technique. Annals of Operations Research 79 (1998) 121–142
Tolio T., Gershwin S.B.: Throughput estimation in cyclic queueing networks with blocking. Annals of Operations Research 79 (1998) 207–229
Zhuang L., Buzacott J.A., Liu X-G.: Approximate mean value performance analysis of cyclic queueing networks with production blocking. Queueing Systems 16 (1994) 139–165
Zhuang L.: Acceptance instant distributions in product-form closed queueing networks with blocking. Performance Evaluation 26 (1996) 133–144
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, LLC
About this paper
Cite this paper
Oniszczuk, W. (2006). Tandem Models with Blocking in the Computer Subnetworks Performance Analysis. In: Saeed, K., Pejaś, J., Mosdorf, R. (eds) Biometrics, Computer Security Systems and Artificial Intelligence Applications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-36503-9_24
Download citation
DOI: https://doi.org/10.1007/978-0-387-36503-9_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-36232-8
Online ISBN: 978-0-387-36503-9
eBook Packages: Computer ScienceComputer Science (R0)