Secure Resource Allocation using MFRA and k-anomity in a Selective data field
V. Preethi
, R. Kalaivani , K. Latha
Max-min resource allocation, k-anomity,timeaccess
In a distributed environment, there is some complexity for resource allocation. The problem of resource allocation has some complications on time, space and data volume. In streambig data analytics, the data processing workflow is abstracted as a directed graph referred to as topology. Data are read from thestorage and processed tuple by tuple, because the content of data is in the format of meta store and these processing results are updated each time dynamically. The proposed system follows the Resource allocation scheme (MFRA), which is evaluated the max-min resource allocation analyze the cluster data shared by multiple topologies in a cloud. To maintain the security in the cloud, the data will be converted into security format by using K-Anomity.
"Secure Resource Allocation using MFRA and k-anomity in a Selective data field", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.2, Issue 3, page no.68 - 72, March-2017, Available :https://ijsdr.org/papers/IJSDR1703012.pdf
Volume 2
Issue 3,
March-2017
Pages : 68 - 72
Paper Reg. ID: IJSDR_170077
Published Paper Id: IJSDR1703012
Downloads: 000347192
Research Area: Engineering
Country: -, -, India
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave
