Performance Analysis of Cloud Analytics Across Multi Region Data Centres Using VM Scheduling Algorithms

Authors

  •   M. K. Jha Student (Computer Science and Engineering) Malout Institute of Management and Information Technology, Green Field Enclave, Near New Grain Market, Malout - 152 107, District Muktsar, Punjab, India
  •   S. Kumar Student (Computer Science and Engineering) Malout Institute of Management and Information Technology, Green Field Enclave, Near New Grain Market, Malout - 152 107, District Muktsar, Punjab, India
  •   G. Singh Assistant Professor (Information Technology) Malout Institute of Management and Information Technology, Green Field Enclave, Near New Grain Market, Malout - 152 107, District Muktsar, Punjab, India

DOI:

https://doi.org/10.17010/ijcs/2026/v11/i2/176007

Keywords:

Cloud Analytics, Cloud Computing, Multi-Region Data Centres, Performance Evaluation, VM Scheduling
Publication Chronology: Paper Submission Date : March 11, 2026 ; Paper sent back for Revision : March 18, 2026 ; Paper Acceptance Date : March 20, 2026 ; Paper Published Online : April 5, 2026.

Abstract

Cloud computing is widely used in today’s world as it can provide resources from different locations. However, when the cloud infrastructure is deployed over various locations such as America, Asia, and Europe, it is very difficult to achieve the performance. This is because each region has different kinds of users, different kinds of workloads, and different kinds of internet speeds. Because of this diversity, issues may occur. In this paper, we are going to discuss the performance of cloud analytics over a multiregion environment using various kinds of Virtual Machine (VM) scheduling algorithms. Instead of using the real cloud system, we have opted for a simulation approach for creating a virtual cloud system. In the virtual cloud system, multiple regions have been created with different data centres, users, and bandwidth conditions to simulate real-world scenarios. In this scenario, we have implemented various scheduling algorithms such as Round Robin, First Come First Serve (FCFS), Min-Min, and Max-Min scheduling algorithms and compared their performance. The system is simulated under all the conditions, and the results are
obtained using key parameters such as response time, processing time, cost, throughput, and bandwidth. From all the analysis and results obtained in this study, we can conclude that there is no particular algorithm that performs better in all situations. Some algorithms are fast, while some are cost-effective. This study enables us to understand which scheduling algorithm is best for a particular cloud environment for the growth of cloud analytics performance.

Downloads

Download data is not yet available.

Downloads

Published

2026-05-26

How to Cite

Jha, M. K., Kumar, S., & Singh, G. (2026). Performance Analysis of Cloud Analytics Across Multi Region Data Centres Using VM Scheduling Algorithms. Indian Journal of Computer Science, 11(2), 34–47. https://doi.org/10.17010/ijcs/2026/v11/i2/176007

Issue

Volume 11, issue 2, March- April 2026

Section

Articles
Crossref
Scopus
Google Scholar
Europe PMC

References

[1] R. Buyya, C. S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, “Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility,” Future Gener. Comput.

Syst., vol. 25, no. 6, pp. 599–616, 2009, doi: 10.1016/j.future.2008.12.001.

[2] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “A view of cloud computing,” Commun. ACM, vol. 53, no. 4, pp. 50–58, 2010, doi:

10.1145/1721654.1721672.

[3] R. N. Calheiros, R. Ranjan, A. Beloglazov, A. De Rose, and R. Buyya, “CloudSim: A toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms,” Softw.: Pract. Experience, vol. 41, no. 1, pp. 23–50, Jan. 2011, doi: 10.1002/spe.995.

[4] S. K. Garg, S. Versteeg, and R. Buyya, “A framework for ranking of cloud computing services,” Future Gener. Comput. Syst., vol. 29, no. 4, pp. 1012–1023, Jun. 2013, doi: 10.1016/j.future.2012.06.006.

[5] H. Topcuoglu, S. Hariri, and M. Y. Wu, “Performanceeffective and low-complexity task scheduling for heterogeneous computing,” IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 3, pp. 260–274, Mar. 2002, doi: 10.1109/71.993206.

[6] K. Etminani and M. Naghibzadeh, “A Min-Min MaxMin selective algorithm for grid task scheduling,” in 2007 3rd IEEE/IFIP Int. Conf. Central Asia Internet, Tashkent, Uzbekistan, Oct. 2007, pp. 1–7, doi: 10.1109/CANET.2007.4401694.

[7] J. Dean and S. Ghemawat, “MapReduce: Simplified data processing on large clusters,” Commun. ACM, vol. 51, no. 1, pp. 107–113, Jan. 2008, doi: 10.1145/1327452.1327492.

[8] A. Beloglazov and R. Buyya, “Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in cloud data centers,” Concurrency Computation: Pract. Experience, vol. 24, no. 13, pp. 1397–1420, Oct. 2012, doi: 10.1002/cpe.1867.

[9] F. Xhafa and A. Abraham, “Computational models and heuristic methods for grid scheduling problems,”

Future Gener. Comput. Syst., vol. 26, no. 4, pp. 608–621, Apr. 2010, doi: 10.1016/j.future.2009.11.005.

[10] L. F. Bittencourt, E. R. Madeira, and N. L. S. D. Fonseca, “Scheduling in hybrid clouds,” in IEEE Commun. Mag., vol. 50, no. 9, pp. 42–47, Sep. 2012, doi: 10.1109/MCOM.2012.6295710.

[11] T. Dillon, C. Wu, and E. Chang, “Cloud computing:Issues and challenges,” in Proc. 24th IEEE Int. Conf. Adv. Inf. Netw. Appl., Perth, WA, Australia, 2010, pp. 27–33, doi: 10.1109/AINA.2010.187.

[12] S. Pandey, L. Wu, S. M. Guru, and R. Buyya, “A particle swarm optimization-based heuristic for

scheduling workflow applications in cloud computing environments,” in 2010 24th IEEE Int. Conf. Adv. Inf.

Netw. Appl., Perth, WA, Australia, 2010, pp. 400–407, doi: 10.1109/AINA.2010.31.