Bound analysis of closed queueing networks with workload burstiness

SIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

Volumn 36, Issue 1 SPECIAL ISSUE, 2008, Pages 13-24

  Casale, Giuliano ^a   Mi, Ningfang ^a   Smirni, Evgenia ^a  

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

Bound analysis; Burstiness; Closed systems; Markovian arrival processes; Nonrenewal service; Queueing networks; Temporal dependence

Indexed keywords

BOUND ANALYSIS; BURSTINESS; CLOSED SYSTEMS; MARKOVIAN ARRIVAL PROCESSES; NONRENEWAL SERVICE; TEMPORAL DEPENDENCE;

COMPUTER NETWORKS; COMPUTER SYSTEMS; COMPUTERS; CONTROL THEORY; DATA STORAGE EQUIPMENT; ELECTRIC REACTORS; QUEUEING THEORY;

QUEUEING NETWORKS;

EID: 56649122884     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375457.1375460     Document Type: Conference Paper

References (33)

1. A. T. Andersen and B. F. Nielsen. A Markovian approach for modeling packet traffic with long-range dependence. IEEE J SAC, 16(5):719-732, 1998.
2. M. F. Arlitt and C. L. Williamson. Web server workload characterization: The search for invariants. In Proc. of ACM SIGMETRICS, pp. 126-137, 1996.
3. M. Arlitt and T. Jin. Workload characterization of the 1998 world cup web site. TR HPL-1999-35R1, HP Labs, 1999.
4. S. Asmussen and F. Koole. Marked point processes as limits of Markovian arrival streams. J. App. Prob., 30:365-372, 1993.
5. F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios. Open, closed, and mixed networks of queues with different classes of customers. JACM, 22(2):248-260, 1975.
6. D. Bertsimas and J. Tsitsiklis. Introduction to Linear Optimization. Athena, 1997.
7. G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queueing Networks and Markov Chains. Wiley, 1998.
8. A. B. Bondi and W. Whitt. The influence of service-time variabilityin a closed network of queues. Perf. Eval, 6:219-234, 1986.
9. G. Casale, N. Mi, and E.Smimi. Bound analysis of closed queueing networks with nonrenewal workloads. TR WM-CS-2008-03, College of William and Mary, 2008.
10. G. Casale. An efficient algorithm for the exact analysis of multiclass queueing networks with large population sizes. In Proceedings of joint ACM SIGMETRICS/IFIP Performance 2006, pages 169-180. ACM Press, 2006.
11. G. Casale, E.Z. Zhang, and E. Smirni. Interarrival Times Characterization and Fitting for Markovian Traffic Analysis. TR WM-CS-2008-02, College of William and Mary, 2008.
12. K. M. Chandy, U. Herzog, and L. Woo. Parametric analysis of queueing networks. IBM J. Res. Dev., 19(l):36-42, 1975.
13. P.J. Courtois. Decomposability, instabilities, and saturation in multiprogramming systems. CACM, 18(7):371-377, 1975.
14. D.R. Cox and P.A.W. Lewis. The Statistical Analysis of Series of Events. John Wiley and Sons, New York, 1966.
15. MAP Queueing Networks Webpage. http://www.cs.wm.edu/MAPQN/.
16. D. L. Eager, D.J. Sorin, and M. K. Vernon. AMVA techniques for high service time variability. In Proc. of ACM SIGMETRICS, pp. 217-228. ACM Press, 2000.
17. W. Fischer and K. S. Meier-Hellstern. The Markov- Modulated Poisson Process (MMPP) cookbook. Perf. Eval., 18(2): 149-171, 1993.
18. R. Fourer and D.M. Gay and B.W. Kemighan. AMPL - A Modeling Language for Mathematical Programming. Springer-Verlag, 1995.
19. GNU GLPK4.8. http://www.gnu.org/software/glpk/.
20. A. Horváth and M. Telek. Markovian modeling of real data traffic: Heuristic phase type and MAP fitting of heavy tailed and fractal like samples. In Performance Evaluation of Complex Systems: Techniques and Tools, IFIP Performance 2002, LNCS Tutorial Series Vol 2459, pages 405-434, 2002.
21. S. Kounev and A. Buchmann. Performance modeling and evaluation of large-scale J2EE applications. In Proc. of the 29th International Conference of the Computer Measurement Group (CMG), pages 273-283, 2003.
22. E. D. Lazowska, J. Zahorjan, G. Graham, and K. C. Sevcik. Quantitative System Performance. Prentice-Hall, 1984.
23. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson. On the self-similar nature of ethernet traffic. IEEE/ACM T. Networking, 2(1): 1-15, 1994.
24. Z. Liu. Long range dependence and heavy tail distributions (special issue). Perf. Eval., 61(2-3):91-93, 2005.
25. N. Mi, Q. Zhang, A. Riska, E. Smirni, and E. Riedel. Performance impacts of autocorrelated flows in multi-tiered systems. Perf. Eval, 64(9-12):1082-1101, 2007.
26. J. Morrison and P.R. Kumar. New linear program performance bounds for closed queueing networks. Discrete Event Dynamic Systems: Theory and Applications, 11:291-317, 2001.
27. R. R. Muntz and J. W. Wong. Asymptotic properties of closed queueing network models. In Proc. Ann. Princeton Conf. on Inf. Set. and Sys., pp. 348-352, 1974.
28. M. F. Neuts. Structured Stochastic Matrices of M/G/I Type and Their Applications. Marcel Dekker, NY, 1989.
29. M. Reiser. A queueing network analysis of computer communication networks with window flow control. IEEE T. Comm., 27(8): 1199-1209, 1979.
30. M. Reiser and S. S. Lavenberg. Mean-value analysis of closed multichain queueing networks. JACM, 27(2):312-322, 1980.
31. A. Riska and E. Riedel. Long-range dependence at the disk drive level. In Proc. of 3rd Conf. on Quantitative Eval of Systems (QEST), pp. 41-50, IEEE Press, 2006.
32. J. Zahorjan, E. D. Lazowska, and R. L. Garner. A decomposition approach to modelling high service time variability. Perf. Eval, 3:35-54, 1983.
33. Q. Zhang, N. Mi, A. Riska, and E. Smirni Performance-Guided Load (Un)Balancing Under Autocorrelated Flows. IEEE T. on Parall and Distrib. Sys., 19(5):652-665, May 2008.