Priority based Round-Robin service broker algorithm for Cloud-Analyst

Cloud computing is an area that is rapidly gaining popularity in both academia and industry. Cloud-Analyst is useful tool to model and analyze cloud computing environment and applications before actual deployment of cloud products. Service broker controls the traffic routing between user bases and data centers based on different service broker policies. Service proximity based routing policy selects closest data center to route the user request. If there are more than one data centers within the same region, it is selected randomly without considering workload, cost, processing time or other parameters. Randomly selected data center is prone to give unsatisfactory results in term of response time, resource utilization, cost or other parameters. In this paper we propose a priority based Round-Robin service broker algorithm which distributes the requests based on the priority of data centers and gives better performance than the conventional Random selection algorithm.