Affiliations: [a] Research Scholar, Anna University, Chennai, Tamil Nadu, India
| [b] Department of Computer Science and Engineering, SRM Valliammai Engineering College, Chennai, Tamil Nadu, India
Correspondence:
[*]
Corresponding author. K. Rajkumar, Research Scholar, Anna University, Chennai – 600 025, Tamil Nadu, India. E-mail: rajonline7@gmail.com.
Abstract: Storage consumption is increasing significantly these days, with consumers trying to find an effective approach to safe storage space. In these situations, a deduplication in cloud storage services is a significant way to reduce bandwidth and service space by omitting unnecessary information and keeping only a single copy of the information. This raises computational, privacy and storage issues when large numbers of handlers outsource the similar data to cloud service storage. To overcome these problems, an effective Fuzzy-Dedup framework is designed in this research by integrating four steps namely is introduced, which breaks down the data into fixed size chunks and is immediately fingerprinted by a hashing algorithm for ensuring data authentication and then indexing is done with the help of traditional b-tree indexing, similarity function is calculated to compute the similarity value in the documents. After calculating the similar values, the fuzzy interference system is designed by formulating appropriate rules for the decision-making process that determines duplicate and non-duplicate files by obtaining an effective de-duplication ratio over existing methods. After detecting duplicate files, the inline based deduplication policy checks that the new data is ready to send for storage against existing data and does not store any redundant data it discovers. The proposed model is implemented in MATLAB software is carried out several performance metrics and these parameter attained better performance such as, deduplication ratio of 1.2, memory utilization of 12500 bytes in inline and 9550 bytes in offline, throughput of 32500 Mb/s in inline and 25500 Mb/s in offline and processing time of 0.4494 s in inline and 0.1139 s in offline. Thus when compared to previous methods, such as Two Thresholds Two Divisors deduplication (TTTD) approach proposed design shows high range of performance.
