Comparison between Round Robin and Virtual Migration Algorithm Based on their Energy Efficiency
Keywords:
Cloud Computing, Machine Migration, Virtual data Round RobinAbstract
Cloud Computing is an important field in today’s computer world. Data are entered the server through various algorithms and each algorithm has its own advantages and disadvantages. In this paper two algorithms are compared, and their energy efficiency based on their time taken is found and a graph is tabulated. The algorithms are Round Robin and Virtual Machine migration algorithms
References
[1] A. Ali-Eldin, J. Tordsson, and E. Elmroth, “An adaptive hybrid elasticity controller for cloud infrastructures,” in Proc. of Network Operations and Management Symposium (NOMS), 2012, pp. 204–212.
[2] A. Sulistio, K. H. Kim, and R. Buyya, “Managing cancellations and no-shows of reservations with overbooking to increase resource revenue,” in Proc. of Intl. Symposium on Cluster Computing and the Grid (CCGrid), 2008, pp. 267–276.
[3] L. Tom´as and J. Tordsson, “Improving Cloud Infrastructure Utilization through Overbooking,” in Proc. of ACM Cloud and Autonomic Computing Conference (CAC), 2013.
[4] “Cloudy with a chance of load spikes: Admission control with fuzzy risk assessments,” in Proc. of 6th IEEE/ACM Intl. Conference on Utility and Cloud Computing, 2013, pp. 155–162.
[5] K. J. A° stro¨m and R. M. Murray, Feedback Systems: An Introduction for Scientists and Engineers. Princeton University Press, 2008.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
