Asymptotic analysis of multiclass closed queueing networks: Common bottleneck

Performance Evaluation

Volumn 26, Issue 1, 1996, Pages 51-72

  Balbo, Gianfranco ^a   Serazzi, Giuseppe ^a  

^a NONE

Author keywords

Approximate solutions; Asymptotic analysis; Modelling; Multiclass queueing networks; Performance; Product form networks

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PERFORMANCE; RESPONSE TIME (COMPUTER SYSTEMS); SYSTEMS ANALYSIS;

ASYMPTOTIC ANALYSIS; LOAD INDEPENDENT STATIONS; MEAN CYCLE TIMES; MEAN QUEUE LENGTHS; MULTICLASS QUEUEING NETWORKS; PRODUCT FORM NETWORKS; THROUGHPUTS;

COMPUTER NETWORKS;

EID: 0030196882     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-5316(95)00021-6     Document Type: Article

References (25)

1. F. Baskett, K.M. Chandy, R.R. Muntz and F. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. ACM 22(2) (1975) 248-260.
2. M. Reiser and S.S. Lavenberg, Mean value analysis of closed multichain queueing networks, J. ACM 27(2) (1980) 313-322.
3. M. Reiser, A queueing network analysis of computer communication networks with window flow control, IEEE Trans. Comm. COM-27(8) (1979) 1199-1209.
4. P.J. Schweitzer, Approximate analysis of multiclass closed networks of queues, Proc. Internat. Conf. on Stochastic Control and Optimization, Amsterdam, 1979.
5. P.J. Schweitzer, Bottleneck determination in networks of queues, Proc. ORSA/TIMS Special Interest Conf. on Appl. Probab. - Comput. Sci., The Interface, Boca Raton, FLA, January 1981, pp. 471-485.
6. K.M. Chandy and D. Neuse, Linearizer: A heuristic algorithm for queueing network models of computing systems, Comm. ACM 25(2) (1982) 126-134.
7. J. Zahorjan, K.C. Sevcik, D.L. Eager and B. Galler, Balanced job bound analysis of queueing networks, Comm. ACM 25(2) (1982) 134-141.
8. T. Kerola, The composite bound method for computing throughput bounds in multiple class environments, Performance Evaluation 6(1) (1986) 1-9.
9. D.L. Eager and K.C. Sevcik, Performance bound hierarchies for queueing networks, ACM Trans. Comput. Systems 1(2) (1982) 99-115.
10. D.L. Eager and K.C. Sevcik, Bound hierarchies for multiple-class queueing networks, J. ACM 33(1) (1986) 179-206.
11. R.R. Muntz and J. Wong, Asymptotic properties of closed queueing network models, Proc. 8th Ann. Princeton Conf. Inform. Sci. and Systems, Princeton University, March 1974.
12. L. Kleinrock, Queueing Systems Volume II: Computer Applications, Wiley, New York (1976).
13. P.J. Denning and J.P. Buzen, The operational analysis of queueing network models, ACM Comput. Surveys 10(3) (1978) 225-261.
14. B. Pittel, Closed exponential networks of queues with saturation: The Jackson-type stationary distribution and its asymptotic analysis, Math. Oper. Res. 4 (1979) 357-378.
15. S.S. Lavenberg, Closed multichain product form queueing networks with large population sizes, IBM Res. Rep. RC8496, Yorktown Heights, New York, 1980.
16. P.J. Schweitzer, A survey of mean value analysis, its generalizations, and applications for networks of queues, Proc. Second Internat. Landelijk Netwerk Mathematische Besliskunde Workshop, Math. Oper. Res. Amsterdam, The Netherlands (1990).
17. G. Balbo and G. Serazzi, Multi-class product form closed queueing networks under heavy loading conditions, in: G. Pujolle (Ed.), Modelling Techniques and Performance Evaluation, North Holland, Amsterdam (1987) 257-269.
18. G. Balbo and G. Serazzi, On the asymptotic behaviour of multiclass closed queueing networks (Part I), Technical Report 93-093, Computer Science Department, Politecnico di Milano, Milano, Italy, December 1989.
19. G. Balbo and G. Serazzi, On the asymptotic behaviour of multiclass closed queueing networks (Part II), Technical Report 93-094, Computer Science Department, Politecnico di Milano, Milano, Italy, December 1990.
20. G. Balbo and G. Serazzi, Asymptotic analysis of multiclass closed queueing networks: Multiple bottlenecks, submitted for publication (March 1992).
21. M. Reiser and H. Kobayashi, Queueing networks with multiple closed chains: Theory and computational algorithms, IBM J. Res. Develop. 19(3) (1975) 283-294.
22. S.C. Bruell and G. Balbo, Computational Algorithms for Closed Queueing Networks, Elsevier, Amsterdam (1980).
23. A. Chang and S.S. Lavenberg, Work rates in closed queueing networks with general independent servers, Oper. Res. 22 (1974) 838-847.
24. M. Reiser and S.S. Lavenberg, Corrigendum: Mean value analysis of closed multichain queueing networks, J. ACM 28(3) (1981) 629.
25. L. Lipsky, C.H. Lieu, A. Tehranipour and A. van de Liefvoort, On the asymptotic behavior of time-sharing systems, Comm. ACM 25(10) (1982) 707-714.