Open Access   Article Go Back

SLO Guarantee and Cost Minimization under the Get Rate Variation in ES3

Sankar Lavanya1

Section:Review Paper, Product Type: Journal Paper
Volume-6 , Issue-11 , Page no. 837-839, Nov-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i11.837839

Online published on Nov 30, 2018

Copyright © Sankar Lavanya . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Sankar Lavanya, “SLO Guarantee and Cost Minimization under the Get Rate Variation in ES3,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.11, pp.837-839, 2018.

MLA Style Citation: Sankar Lavanya "SLO Guarantee and Cost Minimization under the Get Rate Variation in ES3." International Journal of Computer Sciences and Engineering 6.11 (2018): 837-839.

APA Style Citation: Sankar Lavanya, (2018). SLO Guarantee and Cost Minimization under the Get Rate Variation in ES3. International Journal of Computer Sciences and Engineering, 6(11), 837-839.

BibTex Style Citation:
@article{Lavanya_2018,
author = {Sankar Lavanya},
title = {SLO Guarantee and Cost Minimization under the Get Rate Variation in ES3},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {11 2018},
volume = {6},
Issue = {11},
month = {11},
year = {2018},
issn = {2347-2693},
pages = {837-839},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3253},
doi = {https://doi.org/10.26438/ijcse/v6i11.837839}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i11.837839}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3253
TI - SLO Guarantee and Cost Minimization under the Get Rate Variation in ES3
T2 - International Journal of Computer Sciences and Engineering
AU - Sankar Lavanya
PY - 2018
DA - 2018/11/30
PB - IJCSE, Indore, INDIA
SP - 837-839
IS - 11
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
387 230 downloads 232 downloads
  
  
           

Abstract

Now a day’s each and everyone can store their data cloud because of its services and storage capacity. It is key for cloud advantage delegates to give a multi-appropriated restrain relationship to oblige their cost to cloud expert affiliations (CSPs) while giving service level objective (SLO) certification to their customers. Diverse multi-passed on restrict affiliations have been proposed or divide minimization or SLO guarantee. In existing system we simply store the data but we don’t know whether data will be secured or not that means we don’t have any guarantee on cloud providers still now only few works achieve both cost minimization and SLO guarantee. In this paper, we propose a multi-cloud Economical and SLO-ensured Storage Service (ES3), which picks information transport and asset reservation follows with fragment cost minimization and SLO ensure.ES3 joins an engineered data bit and resource reservation methodology, which assigns each data thing to a datacenter and determines the resource reservation amount on datacenters by leveraging all the pricing policies; (2) ) a genetic algorithm based data allocation adjustment method, which decrease data Get/Put rate contrast in each datacenter to enable the reservation to advantage. Our proposed system (i.e., Amazon S3, Windows Azure Storage and Google Cloud Storage) exhibit the unrivaled execution of ES3 in separate cost minimization and SLO guarantee in relationship with previous works.

Key-Words / Index Term

Delegates,SLO guarantee, Storage Service, datacenter and cost decrease

References

[1].Niu, C. Feng, and B. Li. A Theory of Cloud Bandwidth Pricing for Video-on-Demand Providers. In Proc. of INFOCOM, 2012.
[2].H. V. Madhyastha, J. C. McCullough, G. Porter, R. Kapoor, S. Savage, A. C. Snoeren, and A. Vahdat. SCC: Cluster Storage Provisioning Informed by Application Characteristics and SLAs. In Proc. of FAST, 2012.
[3].K. P. N. Puttaswamy, T. Nandagopal, and M. S. Kodialam. Frugal Storage for Cloud File Systems. In Proc. of EuroSys, 2012.
[4].A. Wang, S. Venkataraman, S. Alspaugh, R. H. Katz, and I. Stoica. Cake: Enabling High-Level SLOs on Shared Storage Systems. In Proc. of SoCC, 2012.
[5].W. Lloyd, M. J. Freedman, M. Kaminsky, and D. G. Andersen. Dont Settle for Eventual: Scalable Causal Consistency for Wide- Area Storage with COPS. In Proc. of SOSP, 2011.
[6].Z. Wu, M. Butkiewicz, D. Perkins, E. Katz-Bassett, and H. V.Madhyastha. SPANStore: Cost-Effective Geo-Replicated Storage Spanning Multiple Cloud Services. In SOSP, 2013.
[7].N. Bronson, Z. Amsden, G. Cabrera, P. Chakka, P. Dimov, H. Ding, J. Ferris, A. Giardullo, S. Kulkarni, H. Li, M. Marchukov, D. Petrov, L. Puzar, Y. J. Song, and V. Venkataramani. TAO: Facebooks Distributed Data Store for the Social Graph. In Proc. of ATC, 2013.
[8].D. E. Goldberg. Genetic Algorithms in Search, Optimization andMachine Learning. Addison-Wesley, 1989.