AN OVERLAY-BASED DATA MINING ARCHITECTURE TOLERANT TO PHYSICAL NETWORK DISRUPTIONS

-Big data generated from various aspects like online transactions, social websites, logs and search queries is increasing rapidly and thus the demand for data mining has risen as a noteworthy zone. An overlaybased parallel information mining executes completely dispersed information administration and handles processing by utilizing the overlay system, which can achieve high flexibility. The talk incorporates a survey of best in class systems and stages for preparing and overseeing huge information and also the endeavours expected on enormous information mining. Nonetheless, the overlay based parallel mining structural planning is not fit for achieving data mining administrations if there is an occurrence of the physical system disturbance that is created due to switch/correspondence line breakdowns on the grounds that various hubs are expelled from the overlay system. To get the estimated arrangement and better results, the proposed framework utilizes K-medoids algorithm for cluster formation and overlay based system. Proposed work gives enhancement in terms Energy Consumption in data gathering, reduced delay and Node Coverage

[1]  Niklas Elmqvist,et al.  Ubiquitous Analytics: Interacting with Big Data Anywhere, Anytime , 2013, Computer.

[2]  Yanfeng Zhang,et al.  PrIter: A Distributed Framework for Prioritizing Iterative Computations , 2011, IEEE Transactions on Parallel and Distributed Systems.

[3]  Masato Asahara,et al.  LoadAtomizer: A locality and I/O load aware task scheduler for MapReduce , 2012, 4th IEEE International Conference on Cloud Computing Technology and Science Proceedings.

[4]  Odej Kao,et al.  Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud , 2011, IEEE Transactions on Parallel and Distributed Systems.

[5]  Roy H. Campbell,et al.  Orchestrating an Ensemble of MapReduce Jobs for Minimizing Their Makespan , 2013, IEEE Transactions on Dependable and Secure Computing.

[6]  Randy H. Katz,et al.  How Hadoop Clusters Break , 2013, IEEE Software.

[7]  Abhishek Chandra,et al.  Exploiting Spatio-Temporal Tradeoffs for Energy-Aware MapReduce in the Cloud , 2012, IEEE Transactions on Computers.

[8]  H. Peter Hofstee,et al.  Big Data text-oriented benchmark creation for Hadoop , 2013, IBM J. Res. Dev..

[9]  Sean Quinlan,et al.  GFS: evolution on fast-forward , 2010, Commun. ACM.

[10]  Nei Kato,et al.  Designing P2P Networks Tolerant to Attacks and Faults Based on Bimodal Degree Distribution , 2012, J. Commun..