Dynamic Selection of Optimal Cloud Service Provider for Big Data Applications

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Big data analytics and Cloud computing are the two most imperative innovations in the current IT industry. In a surprise, these technologies come up together to convey the effective outcomes to various business organizations. However, big data analytics require a huge amount of resources for storage and computation. The storage cost is massively increased on the input amounts of data and requires innovative algorithms to reduce the cost to store the data in a specific data centers in a cloud. In Today’s IT Industry, Cloud Computing has emerged as a popular paradigm to host customer, enterprise data and many other distributed applications. Cloud Service Providers (CSPs) store huge amounts of data and numerous distributed applications with different cost. For example Amazon provides storage services at a fraction of TB/month and each CSP having different Service Level Agreements with different storage offers. Customers are interested in reliable SLAs and it increases the cost since the number of replicas are more. The CSPs are attracting the users for initial storage/put operations and get operations from the cloud becomes hurdle and subsequently increases the cost. CSPs provides these services by maintaining multiple datacenters at multiple locations throughout the world. These datacenters provide distinctive get/put latencies and unit costs for resource reservation and utilization. The way of choosing distinctive CSPs data centers, becomes tricky for cloud users those who are using the distributed application globally i.e. online social networks.  In has mainly two challenges. Firstly, allocating the data to different datacenters to satisfy the SLO including the latency. Secondly, how one can reserve the remote resource i.e. memory with less cost. In this paper we have derived a new model to minimize the cost by satisfying the SLOs with integer programming. Additionally, we proposed an algorithm to store the data in a data center by minimizing the cost among different data centers and the computation of cost for put/get latencies. Our simulation works shows that the cost is minimized for resource reservation and utilization among different datacenters.



  • Keywords

    Storage issues, CSPs, Optimal Selection, Service Level Objectives.

  • References

      [1] Jens-Matthias Bohli, Nils Gruschka, Meiko Jensen, Member, IEEE, Luigi Lo Iacono, And Ninja Marnau, IEEE Paper on Security And Privacy Enhancing Multi cloud Architectures, , IEEE Transactions On Dependable And Secure Computing, Vol. 10, No. 4, July/August 2013.

      [2] Fan Zhang, Se- Nior Member, Ieee, Kai Hwang, Life Fellow, IEEE, Samee U. Khan, Senior Member, IEEE, And Qutaibah M. Malluhi IEEE Paper on Skyline Discovery And Composition Of Multi-Cloud Mashup Services , , Ieee Transactions On Services Com- Puting, Vol. 9, No. 1, January/February 2016.

      [3] Dr. K. Subramanian1, F. Leo John, Data Security In Single And Multi-Cloud Storage, ISSN(Online): 2320-9801, Vol. 4, Issue 11, November 2016

      [4] Assistant Professor, Department of MCA, Visvesvaraya Technological University Post Graduate Centre, Multi-Cloud Data Storing Strategy with Cost Efficiency and High Availability, , ISSN (Online): 2319-7064 Index Copernicus Value (2013): 6.14 — Impact Factor (2015): 6.391 Kalaburagi, Paper ID: ART20161263 , Volume 5 Issue 8, August 2016.

      [5] Prof. J. M. Patil , Ms. B. S. Sonune “Data Security Using Multi Cloud Architecture ,international Journal on Recent and Innovation Trends in Computing and Communication, Volume: 3 Issue: 5 Ijritcc — May 2015.

      [6] Amazon S3, accessed on Jul. 2015. [Online]. Available: http://aws. amazon.com/s3/

      [7] Microsoft Azure, accessed on Jul. 2015. [Online]. Available: http://www. windowsazure.com/

      [8] Goolge Cloud Storage, accessed on Jul. 2015. [Online]. Available: https://cloud.google.com/products/cloud-storage/

      [9] R. Kohavl and R. Longbotham. (2007). Online Experiments: Lessons Learned, accessed on Jul. 2015. [Online]. Available: http://exp-platform. com/Documents/IEEEComputer2007OnlineExperiments.pdf

      [10] B. F. Cooper et al., “PNUTS: Yahoo!’s hosted data serving platform,” Proc. VLDB Endowment, vol. 1, no. 2, pp. 1277–1288, Aug. 2008.

      1. Hussam, P. Lonnie, and W. Hakim, “RACS: A case for cloud storage diversity,” in Proc. SoCC, Jun. 2010, pp. 229–240.

      [11] Amazon DynnamoDB, accessed on Jul. 2015. [Online]. Available: http://aws.amazon.com/dynamodb/

      [12] Z. Wu, M. Butkiewicz, D. Perkins, E. Katz-Bassett, and H. V. Madhyastha, “SPANStore: Cost-effective geo-replicated storage spanning multiple cloud services,” in Proc. SOSP, Nov. 2013, pp. 292–308.

      [13] Guoxin Liuet.al.,”Minimum-Cost Cloud Storage Service Across Multiple Cloud Providers” in IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 25, NO. 4, AUGUST 2017.

      [14] E. Anderson et al., “Hippodrome: Running circles around storage administration,” in Proc. FAST, Jan. 2002, pp. 175–188.

      [15] H. Roh, C. Jung, W. Lee, and D. Du, “Resource pricing game in geodistributed clouds,” in Proc. INFOCOM, Apr. 2013, pp. 1519–1527.

      [16] C. Hong, M. Caesar, and P. B. Godfrey, “Finishing flows quickly with preemptive scheduling,” in Proc. SIGCOMM, Sep. 2012, pp. 127–138.

      [17] B. Vamanan, J. Hasan, and T. N. Vijaykumar, “Deadline-aware datacenter TCP (D2TCP),” in Proc. SIGCOMM, Sep. 2012, pp. 115–126. [37] H. Wu, Z. Feng, C. Guo, and Y. Zhang, “ICTCP: Incast congestion control for TCP in data center networks,” in Proc. CoNEXT, Nov. 2010, pp. 1–12.

      [18] D. Zats, T. Das, P. Mohan, D. Borthakur, and R. Katz, “DeTail: Reducing the flow completion time tail in datacenter networks,” in Proc. SIGCOMM, Sep. 2012, pp. 139–150.

      [19] [20] G. Liu and H. Shen, “Minimum-cost cloud storage service across multiple cloud providers,” in Proc. ICDCS, Jun. 2016, pp. 129–138.

      [20] T. Padmapriya and V. Saminadan, “Inter-cell Load Balancing technique for multi-class traffic in MIMO-LTE-A Networks”, International Journal of Electrical, Electronics and Data Communication (IJEEDC), ISSN: 2320- 2084, vol.3, no.8, pp. 22-26, Aug 2015.

      [21] S.V.Manikanthan and D.Sugandhi “ Interference Alignment Techniques For Mimo Multicell Based On Relay Interference Broadcast Channel ” International Journal of Emerging Technology in Computer Science & Electronics (IJETCSE) ISSN: 0976-1353 Volume- 7 ,Issue 1 –MARCH 2014.

      [22]S.V. Manikanthan , T. Padmapriya “An enhanced distributed evolved node-b architecture in 5G tele-communications network” International Journal of Engineering & Technology (UAE), Vol 7 Issues No (2.8) (2018) 248-254.March2018




Article ID: 12007
DOI: 10.14419/ijet.v7i2.24.12007

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.