Dynamic load balancing by round robin and warshall algorithm in cloud computing

Abstract

Cloud Computing is a well-known technology that delivers scalable, fault–tolerant, consistent, secure and reliable computational services. Cloud figure out grants its services in subscriptions means user have to pay as much they use. Due to the continuously progressing and increasing area, cloud figure out is a very good topic for researchers. The main area of interest in cloud figure out is virtualization, collates, software defined network, network function virtualization and many more. There are limited load collates algorithms are used in cloud, and all algorithms having its own advantages and disadvantages. This is the requirement of time to invent a new efficient algorithm in load collate in cloud figure out, through which we can get maximum throughput, minimum response time, etc. Here in this research paper authors are proposing a new approach of dynamic load collate, which mainly depends on the distance between datacenter to host. Simulation is done by CloudSim toolkit. Authentication and effectiveness of the proposed load collate algorithm are checked by comparative analysis with existing load collate algorithm.