Higher-order distributional properties in closed queueing networks

Performance Evaluation

Volumn 66, Issue 11, 2009, Pages 607-620

  Brandwajn, Alexandre ^a   Begin, Thomas ^b  

^a University of California Santa Cruz   (United States)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Approximation methods; Arrival Theorem; Closed queueing networks; High variability; Higher order moments; Non exponential service time

Indexed keywords

APPROXIMATION METHODS; ARRIVAL THEOREM; CLOSED QUEUEING NETWORKS; HIGH VARIABILITY; HIGHER-ORDER MOMENTS; NON-EXPONENTIAL SERVICE TIME;

APPROXIMATION THEORY; COMPUTER APPLICATIONS; METHOD OF MOMENTS; NUMERICAL METHODS; QUEUEING THEORY; SERVERS;

QUEUEING NETWORKS;

EID: 67651151066     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2009.05.002     Document Type: Article

References (38)

1. P. Borgnat, G. Dewaele, K. Fukuda, P. Abry, K. Cho, Seven years and one day: Sketching the evolution of internet traffic, in: Proceedings of the 28th IEEE INFOCOM, Rio de Janeiro, Brazil, April 2009, INFOCOM 2009, 2009
2. Brandwajn A., and Wang H. A conditional probability approach to M/G/1-like queues. Performance Evaluation 65 5 (2008) 366-381
3. A. Brandwajn, T. Begin, Preliminary results on a simple approach to G/G/c-like queues. in: Proceedings of the 16th International Conference on Analytical and Stochastic Modelling Techniques and Applications, Madrid, Spain, June 2009, ASMTA 2009, 2009
4. Sevcik K.C., and Mitrani I. The distribution of queueing network states at input and output instants. Proceedings of the 4th Internat. Symposium on Modeling and Performance Evaluation of Computer Systems (1979), North Holland
5. Lavenberg S.S., and Reiser M. Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers. Journal of Applied Probability 17 4 (1980) 1048-1061
6. Sevcik K.C., and Mitrani I. The distribution of queuing network states at input and output instants. Journal of the ACM 28 2 (1981) 358-371
7. Reiser M. Mean value analysis for queueing networks - A new look at an old problem. Proceedings of the 3rd International Symposium on Modelling and Performance Evaluation of Computer Systems (February 1979), PERFORMANCE 1979 (1979), North-Holland Publishing Co., Amsterdam, The Netherlands 63-77
8. Reiser M., and Lavenberg S.S. Mean value analysis of closed multi-chain queueing networks. Journal of the Association for Computing Machinery 27 April (1980) 313-322
9. Reiser M. Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks. Performance Evaluation 1 1 (1981) 7-18
10. P. Schweitzer, Approximate analysis of multiclass closed networks of queues, in: International Conf. Stochastic Control and Optimization, 1979
11. Bard Y. Some extensions to multiclass queueing network analysis. Proceedings of the 3rd International Symposium on Modelling and Performance Evaluation of Computer Systems (February 1979), PERFORMANCE 1979 (1979), North-Holland Publishing Co., Amsterdam, The Netherlands 51-62
12. Reiser M. A queueing network analysis of computer communication networks with window flow control. IEEE Transactions on Communications 27 8 (1979) 1199-1209
13. Akyildiz I.F. Mean value analysis of closed queueing networks with Erlang service time distributions. Computing 39 3 (1987) 219-232
14. Kaufman J.S., and Wong W.S. Approximate analysis of a Gordon-Newell like non-product-form queueing network. Operations Research 48 3 (1994) 249-271
15. Akyildiz I.F. Mean value analysis for blocking queueing networks. IEEE Transactions on Software Engineering 14 4 (1988) 418-428
16. Clò C. MVA for product-form cyclic queueing networks with blocking. Operations Research 79 (1998) 83-96
17. Varki E. Mean value technique for closed fork-join networks. Proceedings of the 1999 ACM SIGMETRICS international Conference on Measurement and Modeling of Computer Systems (Atlanta, GA, USA, May 1999), SIGMETRICS'99 (1999), ACM, New York, NY 103-112
18. Buitenhek R., van Houtum G.J., and Zijm W.H.M. AMVA based solution procedures for open queueing networks with a population constraint. Annals of Operations Research 93 March (2000) 15-40
19. Eager D.L., Sorin D.J., and Vernon M.K. AMVA techniques for high service time variability. Proceedings of the 2000 ACM SIGMETRICS international Conference on Measurement and Modeling of Computer Systems (Santa Clara, CA, USA, June 2000), SIGMETRICS'00 (2000), ACM, New York, NY 217-228
20. Halachmi I., Adan I.J.B.F., van der Wal J., Heesterbeek J.A.P., and van Beek P. The design of robotic dairy barns using closed queueing networks. European Journal of Operational Research 124 3 (2000) 437-446
21. Winands E.M., Adan I.J., and Van Houtum G.J. Mean value analysis for polling systems. Queueing Systems. Theory and Applications 54 1 (2006) 35-44
22. Bondi A.B., and Whitt W. The influence of service-time variability in a closed network of queues. Performance Evaluation 6 3 (1986) 219-234
23. Balsamo S. Closed queueing networks with finite capacity queues: Approximate analysis. Proceedings of the 14th European Simulation Multiconference on Simulation and Modelling: Enablers For A Better Quality of Life (May 2000) (2000), SCS Europe 593-600
24. Casale G., Mi N., and Smirni E. Bound analysis of closed queueing networks with workload burstiness. Proceedings of the 2008 ACM SIGMETRICS international Conference on Measurement and Modeling of Computer Systems (Annapolis, MD, USA, Jun. 2008), SIGMETRICS'08 (2008), ACM, New York, NY 13-24
25. Kleinrock L. Queueing Systems, Volume 1: Theory (1975), John Wiley & Sons, New York
26. Allen A.O. Probability, Statistics, and Queueing Theory with Computer Science Applications. 2nd edition (1990), Academic Press
27. Wolff R.W. The Effect of Service Time Regularity on System Performance. Computer Performance (1977), North Holland pp. 297-304
28. Whitt W. A diffusion approximation for the G/GI/n/m queue. Operations Research 52 6 (2004) 922-941
29. Marie R.A. An approximate analytical method for general queueing networks. IEEE Transactions on Software Engineering 5 5 (1979) 530-538
30. Onvural R.O. Survey of closed queueing networks with blocking. ACM Computing Surveys 22 2 (1990) 83-121
31. R. Sadre, B.R. Haverkort, P. Reinelt, A fixed-point algorithm for closed queueing networks, in: Proceedings of the 4th European Performance Engineering Workshop (Berlin, Germany, September 2007), EPEW 2007, 2007, pp. 154-170
32. Walstra R.J. Nonexponential networks of queues: A maximum entropy analysis. Proceedings of the 1999 ACM SIGMETRICS international Conference on Measurement and Modeling of Computer Systems (Austin, TX, USA, May 1985), SIGMETRICS'85 (1985), ACM, New York, NY 27-37
33. Wu J. Maximum entropy analysis of open queueing networks with group arrivals. The Journal of the Operational Research Society 43 11 (1992) 1063-1078
34. Cox D.R., and Smith W.L. Queues (1961), John Wiley & Sons, New York
35. Whitt W. The effect of variability in the GI/G/s queue. Journal of Applied Probability 17 4 (1980) 1062-1071
36. Ma B., ~ N.W., and Mark J.W. Approximation of the mean queue length of an M/G/c queueing system. (special issue) Telecommunications Systems: Modeling, Analysis and Design. Operations Research 43 1 (1995) 158-165
37. Gupta V., Harchol-Balter M., Dai J., and Zwart B. The effect of higher moments of job size distribution on the performance of an M/G/s queueing system. Performance Evaluation Review 35 2 (2007) 12-14
38. Cooper R. Introduction to Queueing Theory. 2nd edition (1984), North Holland, New York