Balanced Path Selection in Cloud Computing Using Round Robin Algorithm

Authors(1) :-Arjun Ghosh

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.

Authors and Affiliations

Arjun Ghosh
Department of Computer Science & Engineering, Maulana Abul Kalam Azad University of Technology (Formerly Known as WBUT), Kolkata, West Bengal, India

Cloud Data Centre, Path Selection, Round-Robin Scheduling, Task Categorization

  1. P. Samal and P. Mishra, "Analysis of variants in Round Robin Algorithms for load balancing in Cloud Computing", International Journal of Computer Science and Information Technologies, Vol.4(3), pp.416-419, 2013.
  2. K.Mukherjee and G.Sahoo " Mathematical Model of Cloud computing framework using Fuzzy Bee Colony optimization Technique", International Conference on Advances in Computing, Control and Telecommunication Technologies, IEEE Xplorer, 2009.
  3. M. Dorigo, V. Maniezzo, A. Colorni, "The ant system: "Optimization by a colony of cooperating agents", IEEE Transactions on Systems, Man, and Cybernetics", Vol.26(1), pp.1–13, 1996.
  4. M. Hussin, Y.C. Lee and A. Y. Zomaya, "Priority-based scheduling for Large-Scale Distribute Systems with Energy Awareness", Ninth IEEE International Conference on Dependable, Autonomic and Secure Computing, pp.503- 509, 2011.
  5. L. Huang, H. Chen and T. Hu, "Survey on Resource Allocation Policy and Job Scheduling Algorithms of Cloud Computing", Journal of Software,Vol.8(2), pp.480-487, 2013.
  6. R. Mohanty and H. S. Behera, "Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems", International Journal of Computer and Electrical Engineering, Vol.2(2), pp.46-50, 2011.

Publication Details

Published in : Volume 2 | Issue 4 | July-August 2017
Date of Publication : 2017-08-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 709-711
Manuscript Number : CSEIT1172490
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Arjun Ghosh, "Balanced Path Selection in Cloud Computing Using Round Robin Algorithm", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 4, pp.709-711, July-August-2017.
Journal URL :

Article Preview