Advertisement

Quality of Service Requirements in Computer Networks with Blocking

  • Walenty Oniszczuk

Abstract

This paper provides an analytical study of the closed type, multi-center networks with two different blocking strategies. The measures of effectiveness related to such models, and based on Quality of Service (QoS) requirement, are studied. In finite population (closed) multi-node models, where the number of tasks is equal to the population in the network, there are service centers and source centers treated as an infinite server (IS — means, ample-server model). In the systems described here, there are a finite number of tasks cycling from one service center to the other. If the buffer at a front of the service center is full, the accumulation of new tasks by this center is temporally suspended (blocking).

Keywords

Quality of Service (QoS) requirements Finite Source Queuing Models with Blocking Blocking Strategies 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Akyildiz I.F. 1988. ‘Mean Value Analysis for Blocking Queuing Networks'. IEEE Transaction on Software Engineering 14(4), pp. 418–428.CrossRefGoogle Scholar
  2. [2]
    Balsamo S., de Nito Persone V., Onvural R. 2001. ‘Analysis of Queueing Networks with Blocking'. Kluwer Academic Publishers.Google Scholar
  3. [3]
    Balsamo S., de Nito Persone V., Inverardi P. 2003. ‘A review on queueing network models with finite capacity queues for software architectures performance predication', Performance Evaluation 51(2–4), pp. 269–288.CrossRefGoogle Scholar
  4. [4]
    Boucherie R.J., van Dijk N.M. 1997. ‘On the arrival theorem for product form queueing networks with blocking', Performance Evaluation 29(3), pp. 155–176.CrossRefGoogle Scholar
  5. [5]
    Clo M.C. 1998. ‘MVA for product-form cyclic queueing networks with blocking'. Annals of Operations Research 79, pp. 83–96.zbMATHMathSciNetCrossRefGoogle Scholar
  6. [6]
    Economou A., Fakinos D. 1998. ‘Product form stationary distributions for queueing networks with blocking and rerouting', Queueing Systems 30(3/4), pp. 251–260.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [7]
    Gomez-Corral A. 2002. ‘A Tandem Queue with Blocking and Markovian Arrival Process, Queueing Systems 41(4), pp. 343–370.zbMATHMathSciNetCrossRefGoogle Scholar
  8. [8]
    Harrison P.G. 2003. ‘A new blocking problem from Java-based schedulers', Performance Evaluation 51(2–4), pp. 229–246.CrossRefGoogle Scholar
  9. [9]
    Kaufman J.S., Rege K.M. 1996. ‘Blocking in a shared resource environment with batched arrival processes', Performance Evaluation 24, pp. 249–263.CrossRefzbMATHGoogle Scholar
  10. [10]
    Kouvatsos D., Awan I. 2003. ‘Entropy maximization and open queueing networks with priorities and blocking'. Performance Evaluation 51(2–4), pp. 191–227.CrossRefGoogle Scholar
  11. [11]
    Martin J.B. 2002. ‘Large Tandem Queueing Networks with Blocking', Queueing Systems 41(1/2), pp. 45–72.]zbMATHMathSciNetCrossRefGoogle Scholar
  12. [12]
    Morrison J.A. 1996. ‘Blocking probabilities for multiple class batched arrivals to a shared resource, Performance Evaluation 25, pp. 131–150.zbMATHCrossRefGoogle Scholar
  13. [13]
    Oniszczuk W. 2003. ‘Blocking and Delay Factors in Computer Information Systems'. Computer Information Systems and Industrial Management Applications, BUFM Press, pp. 282–288.Google Scholar
  14. [14]
    Onvural R. 1990. ‘Survey of closed queuing networks with blocking'. Computer Survey 22(2), pp. 83–121.CrossRefGoogle Scholar
  15. [15]
    Perros H.G. 1994. ‘Queuing Networks with Blocking. Exact and Approximate Solution'. Oxford University Press.Google Scholar
  16. [16]
    Pinsky E., Conway A.D. 1996. ‘Mean-value analysis of multi-facility blocking models with state-dependent arrivals', Performance Evaluation 24, pp. 303–309.CrossRefzbMATHGoogle Scholar
  17. [17]
    Ramesh S., Perros H.G. 2000. ‘A two-level queueing network model with blocking and non-blocking messages'. Annals of Operations Research 93(1/4), pp. 357–372.MathSciNetCrossRefzbMATHGoogle Scholar
  18. [18]
    Sereno M. 1999. ‘Mean value analysis of product form solution queueing networks with repetitive service blocking'. Performance Evaluation 36–37, pp. 19–33.CrossRefGoogle Scholar
  19. [19]
    Strelen J.Ch., Bärk B., Becker J., Jonas V. 1998. ‘Analysis of queueing networks with blocking using a new aggregation technique'. Annals of Operations Research 79, pp. 121–142.MathSciNetCrossRefzbMATHGoogle Scholar
  20. [20]
    Tolio T., Gershwin S.B. 1998. ‘Throughput estimation in cyclic queueing networks with blocking'. Annals of Operations Research 79, pp. 207–229.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Walenty Oniszczuk
    • 1
  1. 1.Faculty of Computer ScienceBialystok University of TechnologyBialystokPoland

Personalised recommendations