scholarly journals The Cloud Computing Center Performance Analysis Model Based on Queuing Theory

2015 ◽  
Vol 7 (1) ◽  
pp. 2280-2285
Author(s):  
Zhang Yong-Hua ◽  
Zhou Zhen ◽  
Zeng Fan-Zi ◽  
Li Yuan
2014 ◽  
Vol 509 ◽  
pp. 182-188
Author(s):  
Bin Chen ◽  
Zhi Jian Wang ◽  
Rong Zhi Qi ◽  
Xin Lv

Cloud Computing has become another buzzword in recent years. Follow the popular research and use of the cloud system the performance become the bottleneck of the Newborn. More and more researches are turning their attention to analyze the performance of the cloud services. However, it is hard to extract accurate information from the different type of the cloud components such as datacenter, host, Virtual Machines (VM) in the cloud. Thus, it is significant to collect sufficient row data of the Cloud systems for the performance analysis. In this paper, we described an analysis framework to evaluate comprehensive performance guideline of cloud computing center. The analysis architecture is built based on the performance agent and server interface method (PASI), which consists of performance client (PMC), performance agent (PMA) and performance server (PMS), and we put forward a mathematical model based on the PASI information and queuing theory to forecast the idle rate and availability of the cloud environment. It is proved that the PASI architecture is correctly and effectively evaluates the performance of the cloud component and whole cloud environment.


Author(s):  
Supreet Kaur Sahi ◽  
V. S. Dhaka

Cloud computing is good fit for deployment of different applications but workload and instances requirement will vary depending upon type of applications. Workload estimation of cloud computing is tedious task.  In cloud computing number of instances of cloud need to be reserved based on certain parameters. If these instance are under estimated then performance of system will reduce and if over estimated then cost will increase. In order to optimize this cost there must be some algorithm working that can help in reserving number of instances based on certain parameters. Web applications have unpredictable workload. Certain steps of capacity planning need to follow for predicting workload of web applications. This paper analysis performance of ANN based workload estimation model for web applications on cloud environment. A brief survey of literature is also presented to find out different parameters necessary for capacity planning of website.


2021 ◽  
Vol 2091 (1) ◽  
pp. 012003
Author(s):  
Rakesh Kumar ◽  
Bhavneet Singh Soodan ◽  
Godlove Suila Kuaban ◽  
Piotr Czekalski ◽  
Sapana Sharma

Abstract Queuing theory has been extensively used in the modelling and performance analysis of cloud computing systems. The phenomenon of the task (or request) reneging, that is, the dropping of requests from the request queue often occur in cloud computing systems, and it is important to consider it when developing performance evaluations models for cloud computing infrastructures. Majority of studies in the performance evaluation of cloud computing data centres with the use of queuing theory do not consider the fact that the tasks could be removed from queue without being serviced. The removal of tasks from the queue could be due to the user impatience, execution deadline expiration, security reasons, or as an active queue management strategy. The reneging could be correlated in nature, that is, if a request is dropped (or reneged) at any time epoch, and then there is a probability that a request may or may not be dropped at the next time epoch. This kind of dropping (or reneging) of requests is referred to as correlated request reneging. In this paper we have modelled a cloud computing infrastructure with correlated request reneging using queuing theory. An M/M/1/N queuing model with correlated reneging has been used to study the performance analysis of the load balancing server of a cloud computing system. The steady-state as well as the transient performance analyses have been carried out. Important measures of performance like average queue size, average delay, probability of task blocking, and the probability of no waiting in the queue are studied. Finally, some comparisons are performed which describe the effect of correlated task reneging over simple exponential reneging.


Sign in / Sign up

Export Citation Format

Share Document