Performance analysis of cloud computing using Queuing models

24Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cloud computing is a new economic computing paradigm in which information and computer resources can be accessed from a Web browser by customers. The process of a job entering into the cloud schedule is generally in the form of queue, so that each user needs to wait until the earlier users are being served. Whenever a new job enters the cloud buffer, the queue length increases so the waiting time. There are many methods like FIFO, Priority scheduling, Round robin etc to dispatch the job from buffer to a machine. In this paper, we developed and analyzed a cloud and provided service using Queuing analogy. The transient analysis of cloud studied by deriving various parameters like mean queue length, Utilization, Throughput and Mean Waiting Time in the cloud. It is observed that using queuing theory in the service has tremendous influence on Mean Delay, Throughput and Congestion Control. © 2012 IEEE.

Cite

CITATION STYLE

APA

Suresh Varma, P., Satyanarayana, A., & Rama Sundari, M. V. (2012). Performance analysis of cloud computing using Queuing models. In Proceedings of 2012 International Conference on Cloud Computing Technologies, Applications and Management, ICCCTAM 2012 (pp. 12–15). https://doi.org/10.1109/ICCCTAM.2012.6488063

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free