Balanced Path Selection in Cloud Computing Using Round Robin Algorithm

Abstract

Cloud is the new computing technology for manipulating, setting and accessing a large number of distributed applications over the network in worldwide. So there need a proper workload distribution in cloud network. The load is evaluated by the quantity of work perform with the system which can be classified as CPU load, network load, memory capability, storage capacity and the utilization of the path that the user uses to access cloud server. A Multi-path protocol uses local nodes and their weight value to find out shortest distance between user and cloud server. This paper shows the appropriate selection of route from user personal device to provider’s server by using round robin scheduling algorithm technique. This technique mitigates the performance degradation of heavily utilized link in cloud environment by proper distribution of user tasks over various paths from user to their requested server.