z-logo
open-access-imgOpen Access
An Efficient Data Segmentation and Replication Technique for Cloud using Fuzzy Centrality Measures
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b1115.0782s319
Subject(s) - cloud computing , computer science , replication (statistics) , centrality , computer security , server , data security , data deduplication , database , data mining , computer network , encryption , statistics , mathematics , combinatorics , operating system
Cloud computing is a creating worldview to give reliable and resilient infrastructure permitting the clients (data proprietors) to store their data and the data purchasers (clients) can get to the data from cloud servers. This worldview decreases storage and maintenance cost of the data proprietor. Notwithstanding, cloud data storage still offers ascend to security related issues. In the event of shared data, the data face both cloud-explicit and insider threats. In this work, we propose fuzzy centrality measure based division and replication of data in the cloud for perfect execution and security that consider both security and execution issues. In our framework, we separate a data records and imitate the isolated data over the cloud center points utilizing fuzzy centrality measures. Every one of the nodes stores just a solitary data fragment of a particular data document that guarantees that even if there should arise an occurrence of a fruitful attack, no significant information is uncovered to the attacker. In addition, the cloud nodes storing the data fragments, are separated with certain distance by methods for altered fuzzy T-coloring to prohibit an attacker of predicting the locations of the fragments. We likewise contrast the exhibition of the our methodology and other standard replication plans. The greater amount of security with improved performance was observed.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here