Abstract
An intelligent service strategy is one of the key elements in ensuring quality of service in a computer network. This paper presents a new analytical model for investigating a linked computer network with blocking and feedback (service according to the HOL priority scheme.) It describes behaviour of a computer network exposed to an open Markovian queuing model with blocking. The model illustrated below is very accurate, derived directly from a two-dimensional state graph and a set of steady-state equations, followed by calculations of Quality of Service (QoS) parameters. Collected numerical results indicate that the proposed open queuing network model with blocking and feedback can provide accurate performance estimates of a network. In our examples, the performance is calculated and numerically illustrated by varying buffer capacities, regulating intensity of the input flow and altering feedback probability. In addition, blocking probabilities in such network are calculated.
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.
Similar content being viewed by others
References
Balsamo, S., de Nito Persone, V., Onvural, R.: Analysis of Queueing Networks with Blocking. Kluwer Academic Publishers, Boston (2001)
Balsamo, S., de Nito Persone, V., Inverardi, P.: A review on queueing network models with finite capacity queues for software architectures performance predication. Performance Evaluation 51(2-4), 269–288 (2003)
Badrah, A., et al.: Performance evaluation of multistage interconnection networks with blocking – discrete and continuous time Markov models. Archiwum Informatyki Teoretycznej i Stosowanej 14(2), 145–162 (2002)
Boucherie, R.J., van Dijk, N.M.: On the arrival theorem for product form queueing networks with blocking. Performance Evaluation 29(3), 155–176 (1997)
Economou, A., Fakinos, D.: Product form stationary distributions for queueing networks with blocking and rerouting. Queueing Systems 30(3/4), 251–260 (1998)
Gomez-Corral, A., Martos, M.E.: Performance of two-stage tandem queues with blocking: The impact of several flows of signals. Performance Evaluation 63, 910–938 (2006)
Kim, C.S., et al.: The BMAP/G/1-> · /PH/1/M tandem queue with feedback and losses. Performance Evaluation 64, 802–818 (2007)
Kouvatsos, D., et al.: A cost-effective approximation for SRD traffic in arbitrary multi-buffered networks. Computer Networks 34, 97–113 (2000)
van der Mei, R.D., et al.: Response times in a two-node queueing network with feedback. Performance Evaluation 49, 99–110 (2002)
Oniszczuk, W.: Analysis of an Open Linked Series Three-Station Network with Blocking. In: Pejaś, J., Saeed, K. (eds.) Advances in Information Processing and Protection, Springer Science+Business Media, LLC, New York, pp. 419–429 (2007)
Onvural, R.: Survey of closed queuing networks with blocking. Computer Survey 22(2), 83–121 (1990)
Perros, H.G.: Queuing Networks with Blocking. In: Exact and Approximate Solution, Oxford University Press, New York (1994)
Tolio, T., Gershwin, S.B.: Throughput estimation in cyclic queueing networks with blocking. Annals of Operations Research 79, 207–229 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Oniszczuk, W. (2008). An Intelligent Service Strategy in Linked Networks with Blocking and Feedback. In: Nguyen, N.T., Katarzyniak, R. (eds) New Challenges in Applied Intelligence Technologies. Studies in Computational Intelligence, vol 134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79355-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-79355-7_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79354-0
Online ISBN: 978-3-540-79355-7
eBook Packages: EngineeringEngineering (R0)