Cloud Data Center Design using Delay Tolerant Based Priority Queuing Model

Cloud Data Center Design using Delay Tolerant Based Priority Queuing Model

Meera Annamalai1 and Swamynathan Sankaranarayanan2

1Department of Information Technology, Tagore Engineering College, India

2Department of Information Science and Technology, Anna University Chennai, India

Abstract: Infrastructure as a Service (IaaS) that occupies the bottom tier in the cloud pyramid is a recently developed technology in cloud computing. Organizations can move their applications to a cloud data center without remodelling it. Cloud providers and consumers need to take into account the performance factors such as resource utilization of computing resources, availability of resources caused by scheduling algorithms. Thus, an effective scheduling algorithm must strive to maximize these performance factors. Designing a cloud data center that schedules computing resources and monitoring their performances plays a leading challenge among the cloud researches. In this paper, we propose a data center design using delay tolerant based priority queuing model for resource provisioning, by paying attention to individual customer attributes. Priority selection process defines how to select the next customer to be served. The system has a priority based task classifier and allocator that accept the customer’s request. Based on the rules defined in the rule engine, task classifier classifies each request to a workload Priority classifier is modeled as M/M/S priority queue. The resource monitoring agent provides the resource utilization scenario of cloud infrastructure in the form of dashboard to the task classifier for further resource optimization.

Keywords: Cloud data center, (IaaS) and M/M/S priority queuing model.

Received June 7, 2015; accepted July 28, 2016
 
Read 949 times Last modified on Wednesday, 24 April 2019 02:06
Share
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…