Skip to main content
SpringerLink
Log in

The Analysis of Cloud Computing System as a Queueing System with Several Servers and a Single Buffer

  • Conference paper
  • First Online:
Analytical and Computational Methods in Probability Theory (ACMPT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10684))

  • 652 Accesses

Abstract

The mathematical model of cloud computing system based on the queuing system with the splitting of the incoming queries and synchronization of services is considered. The queuing system consists of a single buffer and N servers (\(N>2\)), service times are independent and exponentially distributed. The incoming query enters the system as a whole and only before service is divided into subqueries, each subquery is served by its device. The servers with parts of the same query are considered to be employed as long as the query is not serviced as a whole: the query is handled only when the last of it is out and a new query may be served only when there are enough free servers (the response time is the maximum of service times of all parts of this query). Expressions for the stationary performance characteristics of the system are presented.

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

Access this chapter

Log in via an institution
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

References

  1. Buyya, R., Broberg, J., Goscinski, A.M.: Introduction to Cloud Computing. Cloud Computing: Principles and Paradigms. Wiley, Hoboken (2011)

    Book  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  6. Gorbunova, A., Zaryadov, I., Matyushenko, S., Sopin, E.: The estimation of probability characteristics of cloud computing systems with splitting of requests. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2016. CCIS, vol. 678, pp. 418–429. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-51917-3_37

    Chapter  Google Scholar 

  7. Duda, A., Czachórski, T.: Performance evaluation of fork and join synchronization primitives. Acta Informatica 24(5), 525–533 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kim, M.Y., Tantawi, A.N.: Asynchronous disk interleaving: approximating access delays. IEEE Trans. Comput. 40(7), 801–810 (1991)

    Article  Google Scholar 

  9. Fiorini, P.M.: Exact analysis of some split merge queues. SIGMETRICS Perform. Eval. Rev. 43(2), 51–53 (2015)

    Article  Google Scholar 

  10. Moiseeva, S., Sinyakova, I.: Investigation of Queueing System GI(2)—M2—\(\infty \). In: Proceedings of the Internattional Conference on Modern Probabilistic Methods for Analysis and Optimization of Information and Telecommunication Networks, pp. 219–225 (2011)

    Google Scholar 

  11. Moiseeva, S., Sinyakova, I.: Investigation of output flows in the system with parallel service of multiple requests. In: Problems of Cybernetics and Informatics (PCI-2012) : IV International Conference (IEEE), pp. 180–181, Baku, Azerbaijan (2012)

    Google Scholar 

  12. 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). https://doi.org/10.1007/978-3-642-40725-3_25

    Chapter  Google Scholar 

  13. Dean, J., Barroso, L.: The tail at scale. Commun. ACM 56(2), 74–80 (2013)

    Article  Google Scholar 

  14. Joshi, G., Soljanin, E., Wornell, G.: Efficient redundancy techniques for latency reduction in cloud systems. arXiv preprint. arXiv:1508.03599 (2015)

  15. Gardner, K., Harchol-Balter, M., Scheller-Wolf, A.: A better model for job redundancy: decoupling server slowdown and job size. In: Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), pp. 1–10. IEEE (2016)

    Google Scholar 

  16. Gorbunova, A.V., Kradenyh, A.A., Zaryadov, I.S.: The mathematical model of a cloud computing system. In: Proceedings of the Nineteenth International Scientific Conference: Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN-2016), Youth School-Seminar, vol. 3, pp. 169–175 (2016)

    Google Scholar 

  17. Bocharov, P.P., D’Apice, C., Pechinkin, A.V., Salerno, S.: Queueing Theory. VSP, Utrecht, Boston (2004)

    MATH  Google Scholar 

  18. 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). https://doi.org/10.1007/978-3-540-45232-4_10

    Chapter  Google Scholar 

  19. Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore (1981)

    MATH  Google Scholar 

  20. Neuts, M.F.: Matrix-analytic methods in queuing theory. Eur. J. Oper. Res. 15(1), 2–12 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  21. Neuts, M.F.: Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker Inc., New York (1989)

    MATH  Google Scholar 

  22. Chakravarthy, S., Alfa, A.S., Attahiru, S.: Matrix-Analytic Methods in Stochastic Models. Taylor & Francis Group, Routledge (1996)

    Book  MATH  Google Scholar 

  23. Breuer, L., Baum, D.: An Introduction to Queueing Theory and Matrix-Analytic Methods. Springer, Dordrecht (2005)

    MATH  Google Scholar 

  24. Ibe, O.: Markov Processes for Stochastic Modeling. Elsevier Science, Amsterdam (2013)

    Google Scholar 

  25. He, Q.-M.: Fundamentals of Matrix-Analytic Methods. Springer, New-York (2014). https://doi.org/10.1007/978-1-4614-7330-5

    Book  MATH  Google Scholar 

  26. Trivedi, K.S.: Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Wiley, Hoboken (2016)

    Book  MATH  Google Scholar 

Download references

Acknowledgments

The publication was financially supported by the Ministry of Education and Science of the Russian Federation (the Agreement number 02.a03.21.0008) and partially supported by RFBR Grants No. 15-07-03007, No. 15-07-03406 and No. 14-07-00090.

Author information

Authors and Affiliations

  1. Department of Applied Probability and Informatics, Peoples Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow, 117198, Russia

    Ivan Zaryadov, Andrey Kradenyh & Anastasiya Gorbunova

  2. Institute of Informatics Problems of the Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilova Str., Moscow, 119333, Russia

    Ivan Zaryadov

Authors
  1. Ivan Zaryadov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrey Kradenyh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anastasiya Gorbunova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Zaryadov .

Editor information

Editors and Affiliations

  1. Department of Applied Probability and Informatics, RUDN University, Moscow, Russia

    Vladimir V. Rykov

  2. City University of Hong Kong, Hong Kong, Hong Kong

    Nozer D. Singpurwalla

  3. Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, Russia

    Andrey M. Zubkov

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zaryadov, I., Kradenyh, A., Gorbunova, A. (2017). The Analysis of Cloud Computing System as a Queueing System with Several Servers and a Single Buffer. In: Rykov, V., Singpurwalla, N., Zubkov, A. (eds) Analytical and Computational Methods in Probability Theory. ACMPT 2017. Lecture Notes in Computer Science(), vol 10684. Springer, Cham. https://doi.org/10.1007/978-3-319-71504-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71504-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71503-2

  • Online ISBN: 978-3-319-71504-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation