iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/s11227-017-1999-5
A method for the optimum selection of datacenters in geographically distributed clouds | The Journal of Supercomputing Skip to main content
Springer Nature Link
Log in

A method for the optimum selection of datacenters in geographically distributed clouds

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The optimal selection of a datacenter is one of the most important challenges in the structure of a network for the wide distribution of resources in the environment of a geographically distributed cloud. This is due to the variety of datacenters with different quality-of-service (QoS) attributes. The user’s requests and the conditions of the service-level agreements (SLAs) should be considered in the selection of datacenters. In terms of the frequency of datacenters and the range of QoS attributes, the selection of the optimal datacenter is an NP-hard problem. A method is therefore required that can suggest the best datacenter, based on the user’s request and SLAs. Various attributes are considered in the SLA; in the current research, the focus is on the four important attributes of cost, response time, availability, and reliability. In a geo-distributed cloud environment, the nearest datacenter should be suggested after receiving the user’s request, and according to its conditions, SLA violations can be minimized. In the approach proposed here, datacenters are clustered according to these four important attributes, so that the user can access these quickly based on specific need. In addition, in this method, cost and response time are taken as negative criteria, while accessibility and reliability are taken as positive, and the multi-objective NSGA-II algorithm is used for the selection of the optimal datacenter according to these positive and negative attributes. In this paper, the proposed method, known as NSGAII_Cluster, is implemented with the Random, Greedy and MOPSO algorithms; the extent of SLA violation of each of the above-mentioned attributes are compared using four methods. The simulation results indicate that compared to the Random, Greedy and MOPSO methods, the proposed approach has fewer SLA violations in terms of the cost, response time, availability, and reliability of the selected datacenters.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26

Similar content being viewed by others

Notes

  1. Local optimal pairwise interchange.

  2. Simulated annealing.

  3. Phase-connected component-based recursive split.

  4. Greedy heuristic.

References

  1. Drago I, Mellia M, Munafo MM, Sperotto A, Sadre R, Pras A (2012) Inside dropbox: understanding personal cloud storage services. In: Proceedings of the 2012 ACM Conference on Internet Measurement Conference, Boston, Massachusetts, USA, 2012, pp 481–494

  2. Slatman H (2013) Opening up the sky: a comparison of performance-enhancing features in skydrive and dropbox. In: The 18th Proceedings of Twente Student Conference on IT

  3. Testa S, Chou W (2004) The distributed data center: front-end solutions. IT Prof 6:26–32

    Article  Google Scholar 

  4. Miller R (2015) Google Data Center FAQ. http://www.datacenterknowledge.com/archives/2012/05/15/google-data-center-faq/

  5. Amazon (2015) Amazon Global Infrastructure. http://aws.amazon.com/about-aws/global-infrastructure/

  6. Valancius V, Laoutaris N, Massoulié L, Diot C, Rodriguez P (2009) Greening the internet with nano data centers. In: Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, pp 37–48

  7. Greenberg A, Hamilton J, Maltz DA, Patel P (2008) The cost of a cloud: research problems in data center networks. ACM SIGCOMM Comput Commun Rev 39:68–73

    Article  Google Scholar 

  8. Meng X, Pappas V, Zhang L (2010) Improving the scalability of data center networks with traffic-aware virtual machine placement. In: The 30th IEEE International Conference on Computer Communications (INFOCOM), pp 1–9

  9. Church K, Greenberg AG, Hamilton JR (2008) On delivering embarrassingly distributed cloud services. In: Conference on HotNets , pp 55–60

  10. Clarke R (2010) User requirements for cloud computing architecture. In: 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid), 2010, pp 625–630

  11. Cao J, Wu Y, Li M (2012) Energy efficient allocation of virtual machines in cloud computing environments based on demand forecast. In: Li R, Cao J, Bourgeois J (eds) Advances in grid and pervasive computing. Lecture notes in computer science, vol 7296. Springer, Berlin, Heidelberg

  12. Beloglazov A, Abawajy J, Buyya R (2012) Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing. Future Gener Comput Syst 28(5):755–768

    Article  Google Scholar 

  13. Buyya R, Beloglazov A, Abawajy J (2010) Energy-efficient management of data center resources for cloud computing: a vision, architectural elements, and open challenges. arXiv preprint arXiv:1006.0308

  14. Beloglazov A, Buyya R (2010) Energy efficient resource management in virtualized cloud data centers. In: The 10th International Conference on Cluster, Cloud and Grid Computing, pp 826–831

  15. Wang M, Meng X, Zhang L (2011) Consolidating virtual machines with dynamic bandwidth demand in data centers. In: The 31th IEEE International Conference on Computer Communications (INFOCOM), pp 71–75

  16. Biran O, Corradi A, Fanelli M, Foschini L, Nus A, Raz D et al (2012) A stable network-aware vm placement for cloud systems. In: The 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2012), pp 498–506

  17. Alicherry M, Lakshman T (2012) Network aware resource allocation in distributed clouds. In: The 32th IEEE International Conference on Computer Communications (INFOCOM), pp 963–971

  18. Cooper B (2016) Data Center Map. http://www.datacentermap.com/

  19. Yao Y, Cao J, Li M (2013) A network-aware virtual machine allocation in cloud datacenter. In: Hsu CH, Li X, Shi X, Zheng R (eds) Network and parallel computing. Lecture notes in computer science, vol 8147. Springer, Berlin, Heidelberg

  20. Malekimajd M, Movaghar A, Hosseinimotlagh S (2015) Minimizing latency in geo-distributed clouds. J Supercomput 71:4423–4445

    Article  Google Scholar 

  21. Patidar S, Rane D, Jain P (2012) A survey paper on cloud computing. In: The 2nd International Conference on Advanced Computing & Communication Technologies (ACCT), pp 394–398

  22. Buyya R, Broberg J, Goscinski AM (2010) Cloud computing: principles and paradigms, vol 87. Wiley, Hoboken

    Google Scholar 

  23. Tepe A, Yilmaz G (2013) A survey on cloud computing technology and its application to satellite ground systems. In: The 6th International Conference on Recent Advances in Space Technologies (RAST), pp 477–481

  24. Mell P, Grance T (2011) The NIST definition of cloud computing SP 800–145. doi:10.6028/NIST.SP.800-145

  25. Alpaydin E (2014) Introduction to machine learning. MIT Press, Cambridge

    MATH  Google Scholar 

  26. Jain AK (2010) Data clustering: 50 years beyond \(k\)-means. Pattern Recognit Lett 31:651–666

    Article  Google Scholar 

  27. Han J, Kamber M, Pei J (2011) Data mining: concepts and techniques. Elsevier, Amsterdam

    MATH  Google Scholar 

  28. Coello CAC, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems, vol 242. Springer, Berlin

    Book  MATH  Google Scholar 

  29. Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and applications. Ph.D. thesis. Swiss Federal Institute of Technology (ETH) , Shaker Verlag publication, Germany. ISBN 3-8265-6831

  30. Cremene M, Suciu M, Pallez D, Dumitrescu D (2015) Comparative analysis of multi-objective evolutionary algorithms for QoS-aware web service composition. Appl Soft Comput 39:124–139

    Article  Google Scholar 

  31. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182–197

    Article  Google Scholar 

  32. Haupt RL, Haupt SE (2004) Practical genetic algorithms. Wiley, Hoboken

    MATH  Google Scholar 

  33. Hinterding R (1995) Gaussian mutation and self-adaption for numeric genetic algorithms. In: IEEE International Conference on Evolutionary Computation, 1995, p 384

  34. Shang S, Wu Y, Jiang J, Zheng W (2011) An intelligent capacity planning model for cloud market. J Internet Serv Inf Secur Innov Inf Sci Technol Res Group 1:37–45

    Google Scholar 

  35. Vazirani VV (2013) Approximation algorithms. Springer, Berlin

    Google Scholar 

  36. Kuo J-J, Yang H-H, Tsai M-J (2014) Optimal approximation algorithm of virtual machine placement for data latency minimization in cloud systems. In: The 34th IEEE International Conference on Computer Communications (INFOCOM), pp 1303–1311

  37. Koren I, Krishna CM (2010) Fault-tolerant systems. Morgan Kaufmann, Burlington

    MATH  Google Scholar 

  38. Bauer E, Adams R (2012) Reliability and availability of cloud computing. Wiley, Hoboken

    Book  MATH  Google Scholar 

  39. Amazon (2016) Amazon EC2 Pricing. http://aws.amazon.com/ec2/pricing/

  40. (2016) World Regions Based on United Nations Country Grouping. http://www.internetworldstats.com/list1.htm#AF

  41. MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp 281–297

  42. Xu D, Tian Y (2015) A comprehensive survey of clustering algorithms. Ann Data Sci 2:165–193

    Article  Google Scholar 

  43. Park H-S, Jun C-H (2009) A simple and fast algorithm for \(k\)-medoids clustering. Expert Syst Appl 36:3336–3341

    Article  Google Scholar 

  44. Kaufman L, Rousseeuw PJ (1990) Partitioning around medoids (program pam), Finding groups in data: an introduction to cluster analysis, pp 68–125

  45. Kaufman L, Rousseeuw PJ (2009) Finding groups in data: an introduction to cluster analysis, vol 344. Wiley, Hoboken

    MATH  Google Scholar 

  46. Ng RT, Han J (2002) CLARANS: a method for clustering objects for spatial data mining. IEEE Trans Knowl Data Eng 14:1003–1016

    Article  Google Scholar 

  47. Data mining algorithms in R/clustering/K-means. https://en.wikibooks.org/wiki/Data_Mining_Algorithms_In_R/Clustering/K-Means

  48. Veness C (2016) Calculate distance, bearing and more between latitude/longitude points. http://www.movable-type.co.uk/scripts/latlong.html

  49. Peter K (2010) New achievements in evolutionary computation. In: Korosec P (ed) InTech Publisher. doi:10.5772/3083

  50. Arlitt M, Jin T (2000) A workload characterization study of the 1998 world cup web site. IEEE Netw 14:30–37

    Article  Google Scholar 

Download references

Acknowledgements

Authors would thank University of Kashan to support of this study by Grant # 577242.

Author information

Authors and Affiliations

  1. Department of Computer, University of Kashan, Kashan, Iran

    Hassan Ziafat & Seyed Morteza Babamir

Authors
  1. Hassan Ziafat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyed Morteza Babamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seyed Morteza Babamir.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ziafat, H., Babamir, S.M. A method for the optimum selection of datacenters in geographically distributed clouds. J Supercomput 73, 4042–4081 (2017). https://doi.org/10.1007/s11227-017-1999-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-017-1999-5

Keywords

Search

Navigation