A Deduplication Aware similarity in Cloud with Secure Deduplication of Encrypted Data

Authors

  • S. Palani  Asst. Professor Department of Computer Applications Sri Venkateswara College of Engineering and Technology(Autonomous) Chittoor, Andhra Pradesh, India
  • P. Bharath Kumar Reddy  PG scholar Department of Computer Applications Sri Venkateswara College of Engineering and Technology(Autonomous) Chittoor, Andhra Pradesh, India
  • K. Roja  PG scholar Department of Computer Applications Sri Venkateswara College of Engineering and Technology(Autonomous) Chittoor, Andhra Pradesh, India

Keywords:

Data deduplication, delta compression, resemblance Detection.

Abstract

Data reduction has become progressively necessary in storage systems owing to the explosive growth of digital data within the world that has ushered within the big data era. One in every of the most challenges facing large-scale data reduction is the way to maximally observe and eliminate redundancy at terribly low overheads. In this paper, we present a our scheme, a low-overhead Deduplication-Aware resemblance detection and Elimination theme that effectively exploits existing duplicate-adjacency data for extremely economical resemblance detection in data deduplication primarily based backup/archiving storage systems. the most plan behind our scheme is to use a theme, call Duplicate-Adjacency primarily based resemblance Detection (DupAdj), by considering any two data chunks to be similar (i.e., candidates for delta compression) if their various adjacent data chunks are duplicate in a very deduplication system, and then further enhance the resemblance detection efficiency by an improved super-feature approach.

References

  1. A. Adya, W. J. Bolosky, M. Castro, R. Chaiken, G. Cermak, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. Wattenhofer. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, Dec. 2002. USENIX.
  2. N. Agrawal, W. J. Bolosky, J. R. Douceur, and J. R. Lorch. A five-year study of file-system metadata. In Proceedings of the 5th USENIX Conference on File and Storage Technologies (FAST), pages 31-45, Feb. 2007.
  3. R. Anderson, R. Needham, and A. Shamir. The steganographic file system. In Proceedings of the International Workshop on Information Hiding (IWIH 1998), pages 73-82, Portland, OR, Apr. 1998.
  4. S. Annapureddy, M. J. Freedman, and D. Mazières. Shark: Scaling file servers via cooperative caching. In Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI), pages 129-142, 2005.
  5. D. Bhagwat, K. Pollack, D. D. E. Long, E. L. Miller, J.-F. Paris, and T. Schwarz, S. J. Providing high reliability in a minimum redundancy archival storage system. In Proceedings of the 14th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS ’06), Monterey, CA, Sept. 2006.
  6. W. J. Bolosky, S. Corbin, D. Goebel, and J. R. Douceur. Single instance storage in Windows 2000. In Proceedings of the 4th USENIX Windows Systems Symposium, pages 13-24. USENIX, Aug. 2000.
  7. P. J. Braam. The Lustre storage architecture. http://www.lustre.org/documentation.html, Cluster File Systems, Inc., Aug. 2004.
  8. A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler. Dynamic and redundant data placement. In Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS ’07), 2007.
  9. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. Lecture Notes in Computer Science, 2009:46-66, 2001.
  10. J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer. Reclaiming space from duplicate files in a serverless distributed file system. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS ’02), pages 617-624, Vienna, Austria, July 2002.
  11. F. Douglis and A. Iyengar. Application-specific delta-encoding via resemblance detection. In Proceedings of the 2003 USENIX Annual Technical Conference, pages 113-126. USENIX, June 2003.
  12. D. Goldschlag, M. Reed, and P. Syverson. Onion routing. Communications of the ACM, 1999.
  13. G. R. Goodson, J. J. Wylie, G. R. G anger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the 2004 Int’l Conference on Dependable Systems and Networking (DSN 2004), June 2004.
  14. H. S. Gunawi, N. Agrawal, A. C. Arpaci-Dusseau, R. H. Arpaci-Dusseau, and J. Schindler. Deconstructing commodity storage clusters. In Proceedings of the 32nd Int’l Symposium on Computer Architecture, pages 60-71, June 2005.
  15. S. Hand and T. Roscoe. Mnemosyne: Peer-to-peer steganographic storage. Lecture Notes in Computer Science, 2429:130-140, Mar. 2002.
  16. Health Information Portability and Accountability Act, Oct. 1996.
  17. D. Hitz, J. Lau, and M. Malcom. File system design for an NFS file server appliance. In Proceedings of the winter 1994USENIX Technical Conference, pages 235-246, San Francisco, CA, Jan. 1994.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-04-30

Issue

Volume 3, Issue 4, March-April-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
S. Palani, P. Bharath Kumar Reddy, K. Roja, " A Deduplication Aware similarity in Cloud with Secure Deduplication of Encrypted Data , IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 4, pp.403-408, March-April-2018.