Fibonacci Series based Virtual Machine Selection for Load Balancing in Cloud Computing
Keywords:Cloud Computing, Load Balancing, Round Robin, Fibonacci sequence, Virtual Machine.
The rapid advancement of the internet has given birth to many technologies. Cloud computing is one of the most emerging technology which aim to process large scale data by using the computational capabilities of shared resources. It gives support to the distributed parallel processing. Using cloud computing, we can process data by paying according to its uses which eliminates the requirement of device by individual users. As cloud computing grows, more users get attracted towards it. However, providing an efficient execution time and load distribution is a major challenging issue in the distributed systems. In our approach, weighted round robin algorithm is used and benefits of Fibonacci sequence is combined which results in better execution time than static round robin. Relevant virtual machines are chosen and jobs are assigned to them. Also, number of resources being utilized concurrently is reduced, which leads to resource saving thereby reducing the cost. There is no need to deploy new resources as resources such as virtual machines are already available.
 P. Mell and T. Grance, â€œThe NIST Definition of Cloud Computingâ€, National Institute of Standards and Technology, Sept. 2011.
 Qaisar, E. J. â€œIntroduction to cloud computing for developers: Key concepts, the players and their offerings.â€ In Information Technology Professional Conference (TCF Pro IT), 2012 IEEE TCF (pp. 1-6). IEEE, 2013.
 Jadeja, Y., & Modi, K. â€œCloud computing-concepts, architecture and challengesâ€. In Computing, Electronics and Electrical Technologies (ICCEET), 2012 International Conference on (pp. 877-880). IEEE, 2012
 Avram M., â€œAdvantages and challenges of adopting cloud computing from an enterprise perspectiveâ€, in Elsevier proc. of 7th International Conference Interdisciplinary in Engineering (INTER-ENG), pp. 529-534, 2013.
 Seemakuthi S., â€œA Review on Various Scheduling Algorithmsâ€, International Journal of Scientific & Engineering Research, Vol. 6, No. 12, Pp. 769-779, 2015.
 Sommer M., â€œPredictive Load Balancing in Cloud Computing Environments Based on Ensemble Forecastingâ€, Autonomic Computing (ICAC), IEEE International Conference, 2016.
 Belalem, G., Tayeb, F., & Zaoui, W. (2010). Approaches to improve the resources management in the simulator CloudSim. Information Computing and Applications, 189-196.
 Aslam S., â€œLoad balancing algorithms in cloud computing: A survey of modern techniquesâ€, Software Engineering Conference (NSEC), 2015 National, February 2016
 Kashyap, Dharmesh, and Jaydeep Viradiya. "A survey of various load balancing algorithms in cloud computing." Int. J. Sci. Technol. Res 3, no. 11 (2014): 115-119.
 Dhakad K., â€œPerformance Analysis Of Round Robin Scheduling Using Adaptive Approach Based On Smart Time Slice And Comparison With SRRâ€, International Journal of Advances in Engineering & Technology, Vol. 3, No. 2, Pp. 333-339, May 2012.
 Saranya D., â€œLoad Balancing Algorithms in Cloud Computing: A Reviewâ€, International Journal of Advanced Research in Computer Science and Software Engineering, vol. 5, No. 7, Pp. 1107-1111, 2015.
 Datta L., â€œEfficient Round Robin Scheduling Algorithm with Dynamic Time Sliceâ€, I.J. Education and Management Engineering, Vol. 2, Pp. 10-19, 2015
 Kanagaraj, Gowtham, Naveen Shanmugasundaram, and Sathish Prakash. "Adaptive Load Balancing Algorithm Using Service Queue." Jurnal. ICCSIT (2012).
 Zhao, Y., Chen, L., Li, Y., & Tian, W â€œEfficient task scheduling for Many Task Computing with resource attribute selection. China Communications, vol. 11(no. 12), pp. 125-140, 2014.
 S. G. Damanal and G. R. Reddy, â€œOptimal Load Balancing in Cloud Computing by Efficient Utilization of Virtual Machinesâ€, in IEEE proc. of 6th International Conference on Communication Systems and Networks (COMSNETS), Jan. 2014.
 Zuo, L., Shu, L., Dong, S., Zhu, C., & Hara, T. â€œA multi-objective optimization scheduling method based on the ant colony algorithm in cloud computingâ€. IEEE Access, vol. 3, pp. 26872699, 2015.
 Teymoori, P., Sohraby, K., & Kim, K.â€A fair and efficient resource allocation scheme for multi-server distributed systems and networksâ€. IEEE Transactions on Mobile Computing, vol. 15, no. 9, pp. 2137-2150, 2016
 Ariharan, V., & Manakattu, S. S. (2015, March). Neighbour Aware Random Sampling (NARS) algorithm for load balancing in Cloud computing. In Electrical, Computer and Communication Technologies (ICECCT), 2015 IEEE International Conference on (pp. 1-5). IEEE.
 Calheiros, R. N., Ranjan, R., De Rose, C. A., & Buyya, R. (2009). Cloudsim: A novel framework for modeling and simulation of cloud computing infrastructures and services. arXiv preprint arXiv:0903.2525.
 Naseem M, Kumar C. Congestion-aware Fibonacci sequence based multipath load balancing routing protocol for MANETs. Wireless Personal Communications 2015; 84(4):2955â€“2974.
 Naseem, Mohd, and Chiranjeev Kumar. "QSLB: queue size based single path load balancing routing protocol for MANETs." International Journal of Ad Hoc and Ubiquitous Computing 24.1-2 (2017): 90-100.
 Naseem, Mohd, and Chiranjeev Kumar. "Queueâ€based multiple path load balancing routing protocol for MANETs." International Journal of Communication Systems 30, no. 6 (2017).
View Full Article:
How to Cite
LicenseAuthors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under aÂ Creative Commons Attribution Licensethat allows others to share the work with an acknowledgement of the work''s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal''s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (SeeÂ The Effect of Open Access).