Individual distributed storage administrations
are picking up fame. However the two principle issues
worried with the document facilitating applications are
security and execution. Through this anticipate for
information security "Division and Replication of Data in
the Cloud for Optimal Performance and Security (DROPS)
system" would be utilized. In the DROPS strategy, the
document is partitioned into sections, and repeat the divided
information over the cloud hubs. Each of the hubs will stores
just a solitary section of a specific information document
that guarantees that even if there should be an occurrence of
an effective assault, no important data is uncovered to the
aggressor .Also considering the purpose of replication,
Erasure coding offers better information assurance.
Exploratory results exhibit that the system is better to the
extent relieved storage room limit and data recuperation.
Published In:IJCSN Journal Volume 5, Issue 4
Date of Publication : August 2016
Pages : 604-608
Figures :02
Tables : --
Sukruti Admuthe : Savitribai Pule University , Dept. Computer Computer Engineering
Pune, Maharashtra, India
Bharti Dhote : Savitribai Pule University , Dept. Computer Computer Engineering
Pune, Maharashtra, India
To keep up the effective and to prevent information
debasement in information storage backup system are
main errands. Storing information sections on numerous
servers decreases the possibilities of information loss yet
this information section storage on different servers for
information backup expands storage space. To preserve
the storage space, our proposed framework executes
erasure coding method; this can restore the tainted
information records if any part is loss or corrupt. Likewise
to decrease the calculation cost, framework makes
utilization of cloud servers to store the information, as
cloud server has its own particular focal points; security,
low cost, high accessibility and so on. To assess the
performance of proposed framework, the examination
completed on dataset having numerous documents. The
record size shifts from `16 MB to 11 MB. The exploratory
results demonstrate that, our framework is superior to
existing one, in case of storage space, cost and
accessibility of information.
[1] Mazhar Ali , Kashif Bilal , Samee U. Khan ,
Bharadwaj Veeravalli , Keqin Li , Albert Y. Zomaya ,
“DROPS: Division and Replication of Data in Cloud
for Optimal Performance and Security , ” IEEE
Transactions on Cloud Computing , DOI
10.1109/TCC.2015.2400460
[2] Haiyang Wang, Ryan Shea, Feng Wang and
Jiangchuan Liu , “On the Impact of Virtualization on
Dropbox-like Cloud File Storage/Synchronization
Services ,“ 978-1-4673-1298-1/12/$31.00!c 2012
IEEE
[3] K. Bilal, S. U. Khan, L. Zhang, H. Li, K. Hayat, S. A.
Madani, N. Min-Allah, L. Wang, D. Chen, M. Iqbal,
C. Z. Xu, and A. Y. Zomaya, “Quantitative
comparisons of the state of the art data center
architectures,” Concurrency and Computation: Practice
and Experience, Vol. 25, No. 12, 2013, pp. 1771-
1783.
[4] K. Bilal, M. Manzano, S. U. Khan, E. Calle, K. Li,
and A. Zomaya, “On the characterization of the
structural robustness of data center networks,” IEEE
Transactions on Cloud Computing, Vol. 1, No. 1,
2013, pp. 64-77.
[5] A. Juels and A. Opera, “New approaches to security
and availability for cloud data,” Communications of
the ACM, Vol. 56, No. 2, 2013, pp. 64-73.
[6] G. Kappes, A. Hatzieleftheriou, and S. V.
Anastasiadis, “Dike: Virtualization-aware Access
Control for Multitenant Filesystems,” University of
Ioannina, Greece, Technical Report No. DCS2013-1,
2013.
[7] S. U. Khan, and I. Ahmad, “Comparison and analysis
of ten static heuristics-based Internet data replication
techniques,” Journal of Parallel and Distributed
Computing, Vol. 68, No. 2, 2008, pp. 113-136.
