Advances in Applied Probability

A strong law for the rate of growth of long latency periods in a cloud computing service

Souvik Ghosh and Soumyadip Ghosh

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Cloud-computing shares a common pool of resources across customers at a scale that is orders of magnitude larger than traditional multiuser systems. Constituent physical compute servers are allocated multiple `virtual machines' (VMs) to serve simultaneously. Each VM user should ideally be unaffected by others' demand. Naturally, this environment produces new challenges for the service providers in meeting customer expectations while extracting an efficient utilization from server resources. We study a new cloud service metric that measures prolonged latency or delay suffered by customers. We model the workload process of a cloud server and analyze the process as the customer population grows. The capacity required to ensure that the average workload does not exceed a threshold over long segments is characterized. This can be used by cloud operators to provide service guarantees on avoiding long durations of latency. As part of the analysis, we provide a uniform large deviation principle for collections of random variables that is of independent interest.

Article information

Source
Adv. in Appl. Probab., Volume 44, Number 4 (2012), 995-1017.

Dates
First available in Project Euclid: 5 December 2012

Permanent link to this document
https://projecteuclid.org/euclid.aap/1354716587

Digital Object Identifier
doi:10.1239/aap/1354716587

Mathematical Reviews number (MathSciNet)
MR3052847

Zentralblatt MATH identifier
1260.60053

Subjects
Primary: 60F10: Large deviations
Secondary: 60F15: Strong theorems 60G99: None of the above, but in this section

Keywords
Cloud computing large deviations long strange segment latency period moving average nonstationary process

Citation

Ghosh, Souvik; Ghosh, Soumyadip. A strong law for the rate of growth of long latency periods in a cloud computing service. Adv. in Appl. Probab. 44 (2012), no. 4, 995--1017. doi:10.1239/aap/1354716587. https://projecteuclid.org/euclid.aap/1354716587


Export citation

References

  • Apostol, T. M. (1974). Mathematical Analysis. Addison-Wesley, Reading, MA.
  • Arnold, B. C. (1980). Majorization and the Lorenz Order: A Brief Introduction (Lecture Notes Statist. 43). Springer.
  • Arratia, R., Gordon, L. and Waterman, M. S. (1990). The Erdös-Rényi law in distribution, for coin tossing and sequence matching. Ann. Statist. 18, 539–570.
  • Bryc, W. and Dembo, A. (1996). Large deviations and strong mixing. Ann. Inst. H. Poincaré Prob. Statist. 32, 549–569.
  • Dembo, A. and Zeitouni, O. (1998). Large Deviations Techniques and Applications, 2nd edn. Springer, New York.
  • Deuschel, J.-D. and Stroock, D. W. (1989). Large Deviations. Academic Press, Boston, MA.
  • Ellis, R. S. (1984). Large deviations for a general class of random vectors. Ann. Prob. 12, 1–12.
  • Erdös, P. and Rényi, A. (1970). On a new law of large numbers. J. Analyse Math. 23, 103–111.
  • Gartner, J. (1977). On large deviations from the invariant measure. Theory Prob. Appl. 22, 24–39.
  • Ghosh, S. and Samorodnitsky, G. (2009). The effect of memory on functional large deviations of infinite moving average processes. Stoch. Process. Appl. 119, 534–561.
  • Ghosh, S. and Samorodnitsky, G. (2010). Long strange segments, ruin probabilities and the effect of memory on moving average processes. Stoch. Process. Appl. 120, 2302–2330.
  • Khan, A., Yan, X., Tao, S. and Anerousis, N. (2012). Workload characterization and prediction in the cloud: a multiple time series approach. Submitted.
  • Li, H. \et (2009). Developing an enterprise cloud computing strategy. White Paper, Intel Corporation.
  • Li, T.-H. (2005). A hierarchical framework for modeling and forecasting web server workload. J. Amer. Statist. Assoc. 100, 748–763.
  • Li, T.-H. (2007). A statistical framework of optimal workload consolidation with application to capacity planning for on-demand computing. J. Amer. Statist. Assoc. 102, 841–855.
  • Mansfield, P., Rachev, S. T. and Samorodnitsky, G. (2001). Long strange segments of a stochastic process. Ann. Appl. Prob. 11, 878–921.
  • Mendler, C. (2010). Cloud 99.99: the small print exposed. Analyst Report, Yankee Group.
  • Rachev, S. T. and Samorodnitsky, G. (2001). Long strange segments in a long-range-dependent moving average. Stoch. Process. Appl. 93, 119–148.
  • Reid, S. \et (2011). Sizing the cloud: understanding and quantifying the future of cloud computing. Tech. Rep., Forrester Research. Available at http://forrester.com/rb/Research/sizing_cloud/q/id/58161/t/2.
  • Varadhan, S. R. S. (1984). Large Deviations and Applications. SIAM, Philadelphia, PA. \endharvreferences