Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

The Estimation of Probability Characteristics of Cloud Computing Systems with Splitting of Requests

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks (DCCN 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 678))

  • 792 Accesses

Abstract

Growing popularity of cloud services is explained by many advantages of them. The accessibility, flexibility, scalability, ease of management, the relatively low cost of implementation can be listed among the main advantages. The demand for cloud services with the ability to change one cloud service provider to another one without any significant cost for a user result in a high competition between cloud providers. Due to this reason, it became important to find the optimal performance measures of cloud systems. These measures, on the one hand, must meet all the requirements of Service Level Agreement (SLA), on the other hand, do not lead to excessive costs for provider. The paper presents the evaluation of the main service quality characteristics of cloud systems, including formulas for variance of residence time in the synchronization buffer. For the analysis of a cloud system, fork-join queues with corresponding methods of its approximation were used.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Balsamo, S., Mura, I.: Approximate response time distribution in fork and join systems. In: Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 305–306 (1995)

    Google Scholar 

  2. Balsamo, S., Mura, I.: On queue length moments in fork and join queuing networks with general service times. In: Marie, R., Plateau, B., Calzarossa, M., Rubino, G. (eds.) TOOLS 1997. LNCS, vol. 1245, pp. 218–231. Springer, Heidelberg (1997). doi:10.1007/BFb0022209

    Chapter  Google Scholar 

  3. Balsamo, S., Donatiello, L., van Dijk, N.M.: Bound performance models of heterogeneous parallel processing systems. IEEE Trans. Parallel Distrib. Syst. 9(10), 1041–1056 (1998)

    Article  Google Scholar 

  4. David, H.A.: Order Statistics. Wiley, New York (1981)

    MATH  Google Scholar 

  5. Flatto, L., Hahn, S.: Two parallel queues created by arrivals with two demands I. SIAM J. Appl. Math. 44(5), 1041–1053 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gorbunova, A.V., Zaryadov, I.S., Matyushenko, S.I., Samouylov, K.E., Shorgin, S.Ya.: The approximation of response time of a cloud computing system. 9, 32–38 (2015)

    Google Scholar 

  7. Harrison, P., Zertal, S.: Queueing models with maxima of service times. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol. 2794, pp. 152–168. Springer, Heidelberg (2003). doi:10.1007/978-3-540-45232-4_10

    Chapter  Google Scholar 

  8. Joshi, G., Soljanin, E., Wornell, G.: Efficient redundancy techniques for latency reduction in cloud systems (unpublished)

    Google Scholar 

  9. Khazae, H., Misic, J., Misic, V.B.: A fine-grained performance model of cloud computing centers. IEEE Trans. Parallel Distrib. Syst. 24, 2138–2147 (2012)

    Article  Google Scholar 

  10. Nelson, R., Tantawi, A.N.: Approximate analysis of fork/join synchronization in parallel queues. IEEE Trans. Comput. 37, 739–743 (1988)

    Article  Google Scholar 

  11. Neuts, M.F.: Matrix-geometric solutions in stochastic models. Johns Hopkins University Press, Baltimore (1981)

    MATH  Google Scholar 

  12. Thomasian, A.: Analysis of fork/join and related queueing systems. ACM Comput. Surv. (CSUR) 47(17), 1–71 (2014)

    Article  Google Scholar 

  13. Tsimashenka, I., Knottenbelt, W.J.: Reduction of subtask dispersion in fork-join systems. In: Balsamo, M.S., Knottenbelt, W.J., Marin, A. (eds.) EPEW 2013. LNCS, vol. 8168, pp. 325–336. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40725-3_25

    Chapter  Google Scholar 

  14. Varki, E.: Response time analysis of parallel computer and storage systems. IEEE Trans. Parallel Distrib. Syst. 12(11), 1146–1161 (2001)

    Article  Google Scholar 

  15. Varki, E., Merchant, A., Chen, H.: The M/M/1 fork-join queue with variable subtasks (unpublished)

    Google Scholar 

  16. Varma, S., Makowski, A.M.: Interpolation approximations for symmetric fork-join queues. Perform. Eval. 20, 245–265 (1994)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by RFBR, projects No. 15-07-03051,15-07-03608.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eduard Sopin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Gorbunova, A., Zaryadov, I., Matyushenko, S., Sopin, E. (2016). The Estimation of Probability Characteristics of Cloud Computing Systems with Splitting of Requests. In: Vishnevskiy, V., Samouylov, K., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2016. Communications in Computer and Information Science, vol 678. Springer, Cham. https://doi.org/10.1007/978-3-319-51917-3_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51917-3_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51916-6

  • Online ISBN: 978-3-319-51917-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics