Advertisement

Priority-Based and Optimized Data Center Selection in Cloud Computing

  • Najib A. KofahiEmail author
  • Tariq Alsmadi
  • Malek Barhoush
  • Moy’awiah A. Al-Shannaq
Research Article - Computer Engineering and Computer Science
  • 10 Downloads

Abstract

Cloud computing (CC) is rapidly emerging in IT fields and becomes a vital research area. CC environment allows cloud service providers to offer different types of services to customers of different categories. Customers like their requests to be processed at the lowest cost and minimum response time, which is highly dependent on the receiving datacenter (DC). Selecting a DC is entitled to the service broker that operates in accordance with a built-in routing policy. Improper selection of a DC may cause a bottleneck in the service brokerage architecture, resulting in resource bleeding (time and money). Moreover, cloud services are charged based on a pay-per-use model. Therefore, this paper proposes an efficient service broker routing policy that improves users’ satisfaction and cloud performance. The proposed policy employs the Vector Space Model and a multi-objective scalarization function to optimize conflicting objectives. The simulation-based approach was used to test the performance of the proposed methodology. The results show the ability of the proposed methodology to improve DC selection process based on the user’s priorities. Moreover, the performance of the proposed methodology has been compared with related works; the results show a significant improvement in average DC processing time, response time and total cost.

Keywords

Cloud computing Data center selection Service broker Cloud simulation Multi-objective optimization Vector space mode 

Notes

Author Contributions

NK & TA contributed to an intensive literature review for very important and recent work in the field. NK & TA defines baselines and important factors that should be considered in the service broker routing policy. NK, TA & MB proposes an efficient and dynamic service broker policy by handling the DC selection problem as a multi-objective problem, where conflicting objectives might exist. For example, a DC may exist that has the lowest cost but not the most capable, while there exists another DC that has a slightly higher cost but way more capable than the lowest cost DC. Hence, selecting the later DC would be a wise decision to be considered by the service broker routing policy. Moreover, considering the fact that the service broker should select DCs as soon as possible with no possible delays, it is preferred to preset the user’s requirements before initialization and at runtime the service broker should be able to select the appropriate DCs without user’s intervention. Therefore, by considering the requirements and needs of the problem being researched, we propose a solution by handling the DC selection problem as a multi-objective and non-interactive problem through employing heuristic test jobs and Vector Space Model and scalarization function for multi-objective optimization. MAA recommends future work and further research approaches. NK, TA, MB & MAA performed formatting and language proofing.

References

  1. 1.
    Armbrust, M.; Fox, A.; Griffith, R.; Joseph, A.D.; Katz, R.; Konwinski, A.; Lee, G.; Patterson, D.; Rabkin, A.; Stoica, I.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010).  https://doi.org/10.1145/1721654.1721672 CrossRefGoogle Scholar
  2. 2.
    Purcell, B.M.: Big data using cloud computing. J. Technol. Res. 5, 1 (2014)Google Scholar
  3. 3.
    Hashem, I.A.T.; Yaqoob, I.; Anuar, N.B.; Mokhtar, S.; Gani, A.; Khan, S.U.: The rise of “big data” on cloud computing: review and open research issues. Inf. Syst. 47, 98–115 (2015)CrossRefGoogle Scholar
  4. 4.
    Iosup, A.; Ostermann, S.; Yigitbasi, M.N.; Prodan, R.; Fahringer, T.; Epema, D.H.: Performance analysis of cloud computing services for many-tasks scientific computing. IEEE Trans. Parallel Distrib. Syst. 22(6), 931–945 (2011)CrossRefGoogle Scholar
  5. 5.
    Bryant, R.; Katz, R.H.; Lazowska, E.D.: Big-data computing: creating revolutionary breakthroughs in commerce. Sci. Soc. 8, 1–15 (2008)Google Scholar
  6. 6.
    Katal, A.; Wazid, M.; Goudar, R.H.: Big data: issues, challenges, tools and good practices. In: 2013 Sixth International Conference on Contemporary Computing (IC3), 8–10 Aug 2013, pp. 404–409 (2013)Google Scholar
  7. 7.
    Zhang, Q.; Cheng, L.; Boutaba, R.: Cloud computing: state-of-the-art and research challenges. J. Internet Serv. Appl. 1(1), 7–18 (2010).  https://doi.org/10.1007/s13174-010-0007-6 CrossRefGoogle Scholar
  8. 8.
    Kofahi, N.A.; Alsmadi, T.: A comparative study of service brokers scheduling policies in cloud computing. Int. J. Adv. Comput. Sci. Appl. (2018).  https://doi.org/10.15224/978-1-63248-157-3-06 Google Scholar
  9. 9.
    Douik, A.; Dahrouj, H.; Al-Naffouri, T.Y.; Alouini, M.-S.: Distributed hybrid scheduling in multi-cloud networks using conflict graphs. IEEE Trans. Commun. 66(1), 209–224 (2018).  https://doi.org/10.1109/TCOMM.2017.2749573 CrossRefGoogle Scholar
  10. 10.
    Sidhu, A.K.; Kinger, S.: Analysis of load balancing techniques in cloud computing. Int. J. Comput. Technol. 4(2), 737–741 (2013)Google Scholar
  11. 11.
    Muthurajkumar, S.; Vijayalakshmi, M.; Kannan, A.; Ganapathy, S.: Optimal and energy efficient scheduling techniques for resource management in public cloud networks. Natl. Acad. Sci. Lett. 41(4), 219–223 (2018)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Reeves, C.R.: Modern Heuristic Techniques for Combinatorial Problems. Wiley, New York (1993)zbMATHGoogle Scholar
  13. 13.
    Dorigo, M.; Birattari, M.; Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006)CrossRefGoogle Scholar
  14. 14.
    Zhao, C.; Zhang, S.; Liu, Q.; Xie, J.; Hu, J.: Independent tasks scheduling based on genetic algorithm in cloud computing. In: 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, pp. 1–4. IEEE (2009)Google Scholar
  15. 15.
    Wickremasinghe, B.; Calheiros, R.N.; Buyya, R.: CloudAnalyst: a cloudsim-based visual modeller for analysing cloud computing environments and applications. In: 2010 24th IEEE International Conference on Advanced Information Networking and Applications, pp. 446–452 (2010)Google Scholar
  16. 16.
    Sharma, V.; Rathi, R.; Bola, S.K.: Round-robin data center selection in single region for service proximity service broker in CloudAnalyst. Int. J. Comput. Technol. 4(2a1), 254–260 (2013)Google Scholar
  17. 17.
    Mishra, R.K.; Bhukya, S.N.: Service broker algorithm for cloud-analyst. Int. J. Comput. Sci. Inf. Technol. 5(3), 3957–3962 (2014)Google Scholar
  18. 18.
    Kapgate, D.: Efficient service broker algorithm for data center selection in cloud computing. Int. J. Comput. Sci. Mob. Comput. 3(1), 355–365 (2014)Google Scholar
  19. 19.
    Gunasekaran, S.; SaiRamesh, L.; Sabena, S.; Selvakumar, K.; Ganapathy, S.; Kannan, A.: Dynamic scheduling algorithm for reducing start time in Hadoop. In: Proceedings of the International Conference on Informatics and Analytics, p. 123. ACM (2016)Google Scholar
  20. 20.
    Manasrah, A.M.; Smadi, T.; ALmomani, A.: A variable service broker routing policy for data center selection in cloud analyst. J. King Saud Univ. Comput. Inf. Sci. 29(3), 365–377 (2016).  https://doi.org/10.1016/j.jksuci.2015.12.006 Google Scholar
  21. 21.
    Li, K.; Xu, G.; Zhao, G.; Dong, Y.; Wang, D.: Cloud task scheduling based on load balancing ant colony optimization. In: 2011 Sixth Annual ChinaGrid Conference, pp. 3–9. IEEE (2011)Google Scholar
  22. 22.
    Kavin, B.P.; Ganapathy, S.; Karman, A.: An intelligent task scheduling approach for cloud using IPSO and A* search algorithm. In: 2018 Eleventh International Conference on Contemporary Computing (IC3), pp. 1–5. IEEE (2018)Google Scholar
  23. 23.
    Zhang, P.; Zhou, M.: Dynamic cloud task scheduling based on a two-stage strategy. IEEE Trans. Autom. Sci. Eng. 15(2), 772–783 (2018)CrossRefGoogle Scholar
  24. 24.
    Sahni, J.; Vidyarthi, D.P.: A cost-effective deadline-constrained dynamic scheduling algorithm for scientific workflows in a cloud environment. IEEE Trans. Cloud Comput. 6(1), 2–18 (2018)CrossRefGoogle Scholar
  25. 25.
    Sundareswaran, S.; Squicciarini, A.; Lin, D.: A brokerage-based approach for cloud service selection. In: 2012 IEEE 5th International Conference on Cloud Computing (CLOUD), pp. 558–565. IEEE (2012)Google Scholar
  26. 26.
    Khurana, R.; Bawa, R.K.: Quality based cloud service broker for optimal cloud service provider selection. Int. J. Appl. Eng. Res. 12(18), 7962–7975 (2017)Google Scholar
  27. 27.
    Nandwani, S.; Achhra, M.; Shah, R.; Tamrakar, A.; Joshi, K.; Raksha, S.: Weight-based data center selection algorithm in cloud computing environment. In: Artificial Intelligence and Evolutionary Computations in Engineering Systems, pp. 515–525. Springer, New Delhi (2016)Google Scholar
  28. 28.
    Jain, R.; Sharma, T.; Sharma, N.: A review on service broker algorithm in cloud computing. Int. J. Comput. Appl. 159(3), 19–23 (2017)Google Scholar
  29. 29.
    Salton, G.; McGill, M.J.: Introduction to Modern Information Retrieval. McGraw-Hill Inc, New York (1986)zbMATHGoogle Scholar
  30. 30.
    Salton, G.: The state of retrieval system evaluation. Inf. Process. Manag. 28(4), 441–449 (1992)CrossRefGoogle Scholar
  31. 31.
    Juszczak, P.; Tax, D.; Duin, R.P.: Feature scaling in support vector data description. In: Proceedings of the ASCI, pp. 95–102. Citeseer (2002)Google Scholar
  32. 32.
    Mohamad, I.B.; Usman, D.: Standardization and its effects on k-means clustering algorithm. Res. J. Appl. Sci. Eng. Technol. 6(17), 3299–3303 (2013)CrossRefGoogle Scholar
  33. 33.
    Ahmed, T.; Singh, Y.: Analytic study of load balancing techniques using tool cloud analyst. Int. J. Eng. Res. Appl. 2(2), 1027–1030 (2012)Google Scholar
  34. 34.
    Nitika, M.; Shaveta, M.; Raj, M.G.: Comparative analysis of load balancing algorithms in cloud computing. Int. J. Adv. Res. Comput. Eng. Technol. 1(3), 120–124 (2012)Google Scholar
  35. 35.
    Mahalle, H.S.; Kaveri, P.R.; Chavan, V.: Load balancing on cloud data centres. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 3(1), 1–9 (2013)Google Scholar
  36. 36.
    Kaur, P.: A comparison of popular heuristics for load balancing in cloud computing. Int. J. Sci. Res. Comput. Sci. Eng. Inf. Technol. (IJSRCSEIT) 3(1), 1393–1401 (2018)Google Scholar
  37. 37.
    Naqvi, S.A.A.; Javaid, N.; Butt, H.; Kamal, M.B.; Hamza, A.; Kashif, M.: Metaheuristic optimization technique for load balancing in cloud-fog environment integrated with smart grid. In: International Conference on Network-Based Information Systems, pp. 700–711. Springer (2018)Google Scholar
  38. 38.
    Upadhyay, S.K., Bhattacharya, A., Arya, S., Singh, T.: Load optimization in cloud computing using clustering: a survey. Int. Res. J. Eng. Technol. 5(4), 2455–2459 (2018)Google Scholar
  39. 39.
    Tiwari, P.K.; Joshi, S.: Effective management of data centers resources for load balancing in cloud computing. Int. J. Inf. Retr. Res. (IJIRR) 8(2), 40–56 (2018)Google Scholar

Copyright information

© King Fahd University of Petroleum & Minerals 2019

Authors and Affiliations

  1. 1.Yarmouk UniversityIrbidJordan

Personalised recommendations