Improved Self Fused Check pointing Replication for Handling Multiple Faults in Cloud Computing
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 6
Abstract
The performance of checkpointing replication fault tolerance technique is severely bottlenecks due to handling of number of replicas generated for a large number of nodes to tolerate multiple faults such as multiple failure of nodes, processes etc. In fusion based approach, these checkpointing replicas stored at large number of computing nodes is aggregated into some data structure to handle efficiently through fused data structure. These impose higher overheads of fusing a large numbers of checkpointing replicas. In this paper, a self fused checkpointing replication (SFCR) for cloud computing is proposed. All checkpointing replicas assigned to store at a particular node are stored in a self-fused-shared-checkpointing-replicas file already created and located at every node rather than storing as a separate checkpointing element and than fusing. Thus, it eliminates the need of further fusing of the checkpointing replicas stored at different checkpointing replicas storage nodes, as checkpointing replicas assign to store a particular node stored in an already created fuse file at every checkpointing replicas storage node. It improves the performance without affecting the specified fault tolerant capabilities as failure of any node will result in loss of all replicas irrespective of separate checkpointing file or shared checkpointing fused file. Costs to maintain these set of self fused shared files are obviously less than the number of separate replicated files in terms of time and efforts that it takes to create, and update a file. Thus, proposed approach is enhancement of performance without compromising the specified fault tolerance capability. At the same time when system seems to be prone to many number of faults, some specific self fused shared files consist of important and critical data that can be further replicated to enhance the fault tolerant capability of a group of important and critical nodes or processes at run time. Thus, it also provides adaptive dynamic fault tolerance capability in a simple manner. Effectiveness of proposed technique is also presented
Authors and Affiliations
Sanjay Bansal , Sanjeev Sharma , Ishita Trivedi , Mrinalika Ghosh
Keywords
Related Articles
- EP ID EP156018
- DOI -
- Views 136
- Downloads 0
Multithreaded Implementation of Hybrid String Matching Algorithm
Reading and taking reference from many books and articles, and then analyzing the Navies algorithm, Boyer Moore algorithm and Knuth Morris Pratt (KMP) algorithm and a variety of improved algorithms, summarizes various ad...
Routing in Highly Dynamic Ad Hoc Networks: Issues and Challenges
The aim of this research paper is to analyze the various issues and challenges involved in routing of data packets in highly mobile ad hoc networks. Routing in ad hoc networks has always been a challenging and tough task...
A Study on the Performance of Android Platform
As the Android platform is widely used for embedded systems including smart mobile devices, the needs for systematic performance analysis have significantly increased. System performance is usually measured by benchmarks...
Spectrum sensing and Spectrum shifting implementation in a Cognitive Radio based IEEE 802.22 Wireless Regional Area Network
With the technological advancement in wireless applications more effective and efficient utilization of the available spectrum became the urgent requirement. According to the IEEE 802.22 standard the unlicensed secondary...
Frequent Itemset mining over transactional data streams using Item-Order-Tree
The association rule mining is one of the important area for research in data mining. In association rule mining online association rule mining is one of the hottest area due to the reason that the knowledge embedded in...