Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary


Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

An authority: Merchant Lock in to Meta storage

Shaik Murthujavali, P.Kiranrao, Dr.S.Prem Kumar, ,
Affiliations
M.Tech Research Scholar
Assistant Professor
Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India
:NOT ASSIGNED


Abstract
-Expense and versatility advantages of Cloud storage administrations are evident. Notwithstanding, selecting a solitary storage service provider limits accessibility and versatility to the chose supplier and may further cause a merchant lock basically. In this paper, we introduce Meta Storage Capacity, an unified Cloud storage framework that can incorporate differing Cloud storage suppliers. Meta storage Capacity is a very accessible and versatile circulated hash table that imitates information on top of assorted storage service. Meta Capacity reuses instruments from Amazon's Dynamo for cross-supplier replication and thus acquaints a novel methodology with oversee consistency-inactivity tradeoffs by amplifying the customary majority (N; R; W) configurations to an (np; R; W) conspire that incorporates distinctive providers as an extra measurement. With Metastorage, new means to control consistency-inertness tradeoffs are presented.


Citation
Shaik Murthujavali,P.Kiranrao,Dr.S.Prem Kumar."An authority: Merchant Lock in to Meta storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 04,pp.245-252, OCTOBER - 2014, URL :https://ijcert.org/ems/ijcert_papers/V1I414.pdf,


Keywords : Merchant Lock, Meta storage, Meta Storage Nodes

References
[1] A. Lenk, M. Klems, J. Nimis, S. Tai, and T.
Sandholm, “What’s inside the Cloud? An
architectural map of the Cloud landscape,” in
Software Engineering Challenges of Cloud
Computing, 2009. CLOUD’09. ICSE Workshop on.
IEEE, 2009, pp. 23–31.
[2] C. Baun, M. Kunze, J. Nimis, and S. Tai,Cloud
Computing: Web-basierte dynamische IT-Services,
ser. Informatik im Fokus. Berlin:Springer, 2010.
[3] G. DeCandia, D. Hastorun, M. Jampani, G.
Kakulapati, A. Lakshman,A. Pilchin, S.
Sivasubramanian, P. Vosshall, and W. Vogels,
“Dynamo:amazon’s highly available key value store,”
inProc. SOSP, 2007
[4] M. Welsh, D. Culler, and E. Brewer, “SEDA:
architecture forwell-conditioned, scalable Internet services,”ACM SIGOPS OperatingSystems Review,
vol. 35, no. 5, pp. 230–243, 2001.
[5] S. Garfinkel, “An Evaluation of Amazon’s Grid
Computing Services:EC2, S3, and SQS,” inCenter for.
Citeseer, 2007
[6] A. T. Velte, T. J. Velte, and R. Elsenpeter,Cloud
Computing: A Practical Approach. Upper Saddle
River, NJ: McGraw-Hill, 2010.
[7] D. Nurmi, R. Wolski, C. Grzegorczyk, G. Obertelli,
S. Soman, L. Yous-eff, and D. Zagorodnov, “The
eucalyptus open-source cloud-computing system,” in
Proceedings of the 2009 9th IEEE/ACM International
Symposium on Cluster Computing and the Grid.
IEEE, 2009, pp.124–13
[8] N. Chohan, C. Bunch, S. Pang, C. Krintz, N.
Mostafa, S. Soman,and R. Wolski, “Appscale: Scalable
and open appengine applicationdevelopment and
deployment,”First International Conference on
CloudComputing, 2009.
[9] A. Lakshman and P. Malik, “Cassandra: a
decentralized structuredstorage system,”ACM
SIGOPS Operating Systems Review, vol. 44, no. 2,pp.
35–40, 2010.
[10] R. Thomas, “A majority consensus approach to
concurrency controlfor multiple copy databases,”
ACM Transactions on Database Systems(TODS), vol.
4, no. 2, pp. 180–209, 1979
[11] D. Karger, E. Lehman, T. Leighton, R. Panigrahy,
M. Levine, andD. Lewin, “Consistent hashing and
random trees: Cloud cachingprotocols for relieving
hot spots on the World Wide Web,” in Proceedings of
the twenty-ninth annual ACM symposium on Theory
ofcomputing. ACM, 1997, pp. 654–663.
[12] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and
H. Balakrishnan,“Chord: A scalable peer-to-peer
lookup service for internet applications, “in
Proceedings of the 2001 conference on Applications,
technologies, architectures, and protocols for
computer communications. ACM, 2001,pp. 149–160.
[13] J. Elson and J. Howell, “Handling flash crowds
from your garage,”in USENIX 2008 Annual Technical
Conference on Annual TechnicalConference. USENIX
Association, 2008, pp. 171–184.
[14] S. Bourne, “A conversation with Bruce
Lindsay,”Queue, vol. 2, no. 8,pp. 22–33, 2004.
[15] T. Chandra, R. Griesemer, and J. Redstone,
“Paxos made live: anengineering perspective,”
inProceedings of the twenty-sixth annual
ACMsymposium on Principles of Cloud computing.
ACM, 2007, pp.398–407
[16] L. Lamport, “The part-time parliament,”ACM
Transactions on ComputerSystems (TOCS), vol. 16,
no. 2, pp. 133–169, 1998
[17] H. Weatherspoon, P. Eaton, B. Chun, and J.
Kubiatowicz, “Antiquity:exploiting a secure log for
wide-area Cloud storage,”ACM SIGOPSOperating
Systems Review, vol. 41, no. 3, pp. 371–384, 2007.
[18] M. Burrows, “The Chubby lock service for
loosely-coupled Cloudsystems,” in Proceedings of the
7th symposium on Operating systemsdesign and
implementation. USENIX Association, 2006, pp. 335–
350.
[19] A. Adya, W. Bolosky, M. Castro, G. Cermak, R.
Chaiken, J. Douceur,J. Howell, J. Lorch, M. Theimer,
and R. Wattenhofer, “FARSITE:Federated, available,
and reliable storage for an incompletely
trustedenvironment,”ACM SIGOPS Operating
Systems Review, vol. 36, no. SI, pp. 1–14, 2002
[20] K. Bowers, A. Juels, and A. Oprea, “HAIL: A
high-availability andintegrity layer for cloud
storage,” in Proceedings of the 16th ACMconference
on Computer and communications security. ACM,
2009,pp. 187–198.
[21] J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski,
P. Eaton, D. Geels,R. Gummadi, S. Rhea, H.
Weatherspoon, C. Wellset al., “Oceanstore: An
architecture for global-scale persistent storage,”ACM
SIGARCH Computer Architecture News, vol. 28, no.
5, pp. 190–201, 2000
[22] Google, Datastore Performance Growing Pains.
Google, Jun.2010, (accessed on December 4, 2010).
[Online]. Available:
http://googleappengine.blogspot.com/2010/06/datasto
re-perfor mance-growing-pains.html
[23] C. Bunch, N. Chohan, C. Krintz, J. Chohan, J.
Kupferman, P. Lakhina,Y. Li, and Y. Nomura, “An
evaluation of Cloud datastores using the appscale
cloud platform,” in Cloud Computing (CLOUD),
2010 IEEE3rd International Conference on, 2010, pp.
305 –312
[24] Broberg, Buyya, and Tari, “Creating a Cloud
Storage Mashup forHigh Performance, Low Cost
Content Delivery,” inService-OrientedComputing–
ICSOC 2008 Workshops. Springer, 2009, pp. 178–183.
[25] J. Broberg, R. Buyya, and Z. Tari, “MetaCDN:
Harnessing ’StorageClouds’ for high performance
content delivery,”Journal of Network andComputer
Applications, vol. 32, no. 5, pp. 1012–1022, 2009
[26] H. Abu-Libdeh, L. Princehouse, and H.
Weatherspoon, “RACS: a casefor cloud storage
diversity,” in Proceedings of the 1st ACM
symposiumon Cloud computing. ACM, 2010, pp.
229–240.
[27] H. Weatherspoon and J. Kubiatowicz, “Erasure
coding vs. replication:A quantitative
comparison,”Peer-to-Peer Systems, pp. 328–337, 2002.
[28] W. Vogels, Eventually Consistent - Revisited,
Dec. 2008,(accessed on October 19, 2010). [Online].
Available:http://www.allthingsCloud.com/2008/12/ev
entually _consistent.html


DOI Link : NOT ASSIGNED

Download :
  V1I414.pdf


Refbacks : Currently there are no Refbacks

Announcements


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events


Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.


Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.


IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert


IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)


Emerging Sources Citation Index (in process)


IJCERT title is under evaluation by Scopus.


Key Dates


☞   INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞   LAST DATE OF SUBMISSION : 31st March 2023
☞  SUBMISSION TO FIRST DECISION :
In 7 Days
☞  FINAL DECISION :
IN 3 WEEKS FROM THE DAY OF SUBMISSION

Important Announcements


All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index


Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)


Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links



Conference Proposal




DOI:10.22362/ijcert