Quality of Service Requirements in Computer Networks with Blocking

1. Akyildiz I.F. 1988. ‘Mean Value Analysis for Blocking Queuing Networks'. IEEE Transaction on Software Engineering 14(4), pp. 418–428.

   Article  Google Scholar 

2. Balsamo S., de Nito Persone V., Onvural R. 2001. ‘Analysis of Queueing Networks with Blocking'. Kluwer Academic Publishers.

   Google Scholar 

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.

   Article  Google Scholar 

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.

   Article  Google Scholar 

5. Clo M.C. 1998. ‘MVA for product-form cyclic queueing networks with blocking'. Annals of Operations Research 79, pp. 83–96.

   Article  MATH  MathSciNet  Google Scholar 

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.

   Article  MathSciNet  MATH  Google Scholar 

7. Gomez-Corral A. 2002. ‘A Tandem Queue with Blocking and Markovian Arrival Process, Queueing Systems 41(4), pp. 343–370.

   Article  MATH  MathSciNet  Google Scholar 

8. Harrison P.G. 2003. ‘A new blocking problem from Java-based schedulers', Performance Evaluation 51(2–4), pp. 229–246.

   Article  Google Scholar 

9. Kaufman J.S., Rege K.M. 1996. ‘Blocking in a shared resource environment with batched arrival processes', Performance Evaluation 24, pp. 249–263.

   Article  MATH  Google Scholar 

10. Kouvatsos D., Awan I. 2003. ‘Entropy maximization and open queueing networks with priorities and blocking'. Performance Evaluation 51(2–4), pp. 191–227.

    Article  Google Scholar 

11. Martin J.B. 2002. ‘Large Tandem Queueing Networks with Blocking', Queueing Systems 41(1/2), pp. 45–72.]

    Article  MATH  MathSciNet  Google Scholar 

12. Morrison J.A. 1996. ‘Blocking probabilities for multiple class batched arrivals to a shared resource, Performance Evaluation 25, pp. 131–150.

    Article  MATH  Google Scholar 

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. Onvural R. 1990. ‘Survey of closed queuing networks with blocking'. Computer Survey 22(2), pp. 83–121.

    Article  Google Scholar 

15. Perros H.G. 1994. ‘Queuing Networks with Blocking. Exact and Approximate Solution'. Oxford University Press.

    Google Scholar 

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.

    Article  MATH  Google Scholar 

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.

    Article  MathSciNet  MATH  Google Scholar 

18. Sereno M. 1999. ‘Mean value analysis of product form solution queueing networks with repetitive service blocking'. Performance Evaluation 36–37, pp. 19–33.

    Article  Google Scholar 

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.

    Article  MathSciNet  MATH  Google Scholar 

20. Tolio T., Gershwin S.B. 1998. ‘Throughput estimation in cyclic queueing networks with blocking'. Annals of Operations Research 79, pp. 207–229.

    Article  MathSciNet  MATH  Google Scholar 

Download references