Robust bounds and throughput guarantees for closed multiclass queueing networks

Performance Evaluation

Volumn 32, Issue 2, 1998, Pages 101-136

  Majumdar, Shikharesh ^a,b,c,d   Woodside, C Murray ^a  

^a CARLETON UNIVERSITY   (Canada)

^b TNO   (Netherlands)

^c ACM   (Canada)

^d IEEE   (Canada)

Author keywords

Bounds for computer and communication system; Multiclass queueing networks; Performance bounds; Performance evaluation; Performance guarantee

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONGESTION CONTROL (COMMUNICATION); DIGITAL ARITHMETIC; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROLOG (PROGRAMMING LANGUAGE); QUEUEING THEORY; RANDOM PROCESSES; RESPONSE TIME (COMPUTER SYSTEMS); TELECOMMUNICATION SERVICES;

CLOSED MULTICLASS QUEUEING NETWORKS;

COMPUTER NETWORKS;

EID: 0032022068     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-5316(97)00019-9     Document Type: Article

References (29)

1. R.E. Barlow and F. Prochan, Statistical Theory of Reliability and Life Testing, Holt, Rinehart & Winston, New York (1975).
2. W. Cheney and D. Kincaid, Numerical Mathematics and Computing, Brooks/Cole Publishing Company (1985).
3. D.R. Cheriton and C.L. Williamson, Network measurement of the Vmtp request-response protocol in the V distributed system, in: Proc. ACM Sigmetrics Conf. on Measurement and Modeling of Computer Systems, May 1987, pp. 216-225.
4. Computing Research Laboratory, Bell Northern Research Ltd., Ottawa, Canada, BNR Prolog Reference Manual, 1988.
5. R.L. Cruz, A calculus for network delay, Part I: Network elements in isolation, IEEE Trans. Inform. Theory 37 (1991) 114-131.
6. R.L. Cruz, A calculus for network delay, Part II: Network analysis, IEEE Trans. Inform. Theory 37 (1991) 132-141.
7. D.L. Eager and K.C. Sevcik, Performance bound hierarchies for queueing networks, ACM Trans. Comput. Systems 1 (2) (1983) 99-115.
8. D.L. Eager and K.C. Sevcik, Bound hierarchies for multiple-class queueing networks, J. ACM 33 (2) (1986).
9. V-T. Hsieh and S.S. Lam, Two classes of performance bounds for closed queueing networks, Performance Evaluation 7 (3) (1987) 3-30.
10. R. Jain, The Art of Computer Systems Performance Analysis, Wiley, New York (1991).
11. B.-C. Jenq, W.H. Kohler and D. Towsley, A queueing network model for distributed database testbed system, IEEE Trans. Software Engrg. 14 (7) (1988) 908-921.
12. T. Kerola The composite bound method for computing throughput bounds in multiple class environments, Performance Evaluation 6(1) (1986) 1-9.
13. L. Kleinrock, Queueing Systems, Vol. 2, Wiley, New York (1976).
14. J. Kriz, Throughput bounds for closed queueing networks, Performance Evaluation 4(1) (1984) 1-10.
15. J.F. Kurose, On computing per-session performance bounds in high speed multi-hop computer networks, in: Proc. Sigmetrics and Performance'92 Conf., 1992.
16. S. Majumdar, C.M. Woodside, J.E. Neilson and D.C. Petriu, Performance bounds for concurrent software with rendezvous, Performance Evaluation 13 (4) (1991) 207-236.
17. S. Majumdar, C.M. Woodside, J.E. Neilson and D.C. Petriu, Robust box bounds: Throughput guarantees for closed multiclass queueing networks with minimal stochastic assumptions, in: Proc. IEEE Infocom '92, Florence, Italy, May 1992, pp. 8C.1.1-8C.1.10.
18. D. Michandani and P. Biswas, Characterizing and modeling ethernet performance of distributed DECwindows applications, Digital Equipment Corporation, Nashua, NH, USA, September 1989.
19. R.E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ (1966).
20. R.R. Muntz and J.W. Wong, Aymptotic properties of closed queueing network models, in : Proc. 8th Conf. on Information Sciences and Systems, 1974, pp. 348-352.
21. W. Older, The application of relational arithmetic to X-ray diffraction crystallography, Ottawa, Canada, February 1988.
22. W. Older, Personal communication, October 1990.
23. W. Older, A. Vellino and B. Farrahi, Relational arithmetic in prolog using interval constraints, Bell-Northern Research, Ottawa, Canada.
24. M. Reiser, A queueing network analysis of computer communication networks with window flow control, IEEE Trans. Comm. COM-27 (8) (1979) 1199-1209.
25. A. Silberschatz, J.L. Peterson and P. Galvin, Operating System Concepts, 3rd ed. Addison-Wesley, Reading, MA (1992).
26. L.E. Stephens and L.W. Dowdy, Convolutional bound hierarchies, in: Proc. ACM Sigmetrics Conf., Cambridge, USA, 1984, pp. 120-133.
27. B.W. Stuck and E. Arthurs, A Computer and Communications Network Performance Analysis Primer, Prentice-Hall, Englewood Cliffs, NJ (1985).
28. R. Suri, Generalized quick bounds for performance of queueing networks, Comput. Performance 5 (2) (1984) 116-120.
29. 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.