Application Checkpointing Technique for Self-Healing From Failures in Mobile Grid Computing
01 Apr 2019-Vol. 11, Iss: 2, pp 50-62
TL;DR: A checkpointing based failure handling technique is proposed which will improve arrangement reliability and failure recovery time for the MG network and is tested on a grid of ubiquitously available Android-based mobile phones.
Abstract: A mobile grid (MG) consists of interconnected mobile devices which are used for high performance computing. Fault tolerance is an important property of mobile computational grid systems for achieving superior arrangement reliability and faster recovery from failures. Since the failure of the resources affects task execution fatally, fault tolerance service is essential to achieve QoS requirement in MG. The faults which occur in MG are link failure, node failure, task failure, limited bandwidth etc. Detecting these failures can help in better utilisation of the resources and timely notification to the user in a MG environment. These failures result in loss of computational results and data. Many algorithms or techniques were proposed for failure handling in traditional grids. The authors propose a checkpointing based failure handling technique which will improve arrangement reliability and failure recovery time for the MG network. Experimentation was conducted by creating a grid of ubiquitously available Android-based mobile phones.
Citations
More filters
TL;DR: In this article , a robust and effective intrusion detection approach, named RV coefficient+Exponential Sea Lion Optimization-enabled Deep Residual Network (ExpSLO-enabled DRN) using spark is devised for the intrusion detection.
10 citations
6 citations
TL;DR: An effective dragonfly improved invasive weed optimization‐based Shepard convolutional neural network (DIIWO‐based ShCNN) to detect the intruders and to mitigate the attacks in cloud paradigm and are more feasible to detectThe intruders with ShCNN.
Abstract: In cloud computing, the resources and memory are dynamically allocated to the user based on their needs. Security is considered as a major issue in cloud as the use of cloud is increased. Intrusion detection is considered as a significant tool to develop a reliable and secure cloud environment. Performing intrusion detection in cloud is a difficult task because of its distributed nature and extensive usage. Intrusion detection system (IDS) is widely considered to find the malicious actions in network. In cloud, most conventional IDS are vulnerable to attacks and have no capability for maintaining the balance between sensitivity and accuracy. Thus, we proposed an effective dragonfly improved invasive weed optimization‐based Shepard convolutional neural network (DIIWO‐based ShCNN) to detect the intruders and to mitigate the attacks in cloud paradigm and are more feasible to detect the intruders with ShCNN. The proposed method outperforms the existing method with maximum accuracy of 0.960%, sensitivity of 0.967%, and specificity 0.961%, respectively.
4 citations
TL;DR: The analysis results revealed that the scientific literature published on IoT during the period had grown exponentially, with an approximately 48% growth rate in the last two years of the study period.
Abstract: This research was carried out using the bibliometric method to thematically analyze the articles on IoT in the Web of Science with Hierarchical Agglomerative Clustering approach. First, the descriptors of the related articles published from 2002 to 2016 were extracted from WoS, by conducting a keyword search using the “Internet of Things” keyword. Data analysis and clustering were carried out in SPSS, UCINET, and PreMap. The analysis results revealed that the scientific literature published on IoT during the period had grown exponentially, with an approximately 48% growth rate in the last two years of the study period (i.e. 2015 and 2016). After analyzing the themes of the documents, the resulting concepts were classified into twelve clusters. The twelve main clusters included: Privacy and Security, Authentication and Identification, Computing, Standards and Protocols, IoT as a component, Big Data, Architecture, Applied New Techniques in IoT, Application, Connection and Communication Tools, Wireless Network Protocols, and Wireless Sensor Networks.
3 citations
1 citations
References
More filters
26 Mar 2007
TL;DR: An asynchronous consistent global checkpoint collection algorithm which prevents contention for network storage at the file server and hence reduces the checkpointing overhead is presented.
Abstract: In this paper, we present an asynchronous consistent global checkpoint collection algorithm which prevents contention for network storage at the file server and hence reduces the checkpointing overhead. The algorithm has two phases: In the first phase, a process initiates consistent global checkpoint collection by saving its state tentatively and asynchronously (called tentative checkpoint) in local memory or remote stable storage if there is no contention for stable storage while saving the state; in the second phase, the message log associated with the tentative checkpoint is stored in stable storage (checkpoint finalization phase). The tentative checkpoint together with the associated message log stored in the stable storage becomes part of a consistent global checkpoint. Under our algorithm, two or more processes can concurrently initiate consistent global checkpoint collection. Every tentative checkpoint will be finalized successfully unless a failure occurs. The finalized checkpoints of each process is assigned a unique sequence number in ascending order. Finalized checkpoints with same sequence number form a consistent global checkpoint.
31 citations
01 Feb 2014
TL;DR: The feasibility of using the ontology in solving multi- document summarization problems in the domain of disaster management is explored and it is demonstrated that ontology-based multi-document summarization methods outperform other baselines in terms of the summary quality.
Abstract: Domain ontology, as a conceptual model, provides a meaningful framework for semantic representation of textual information. In this paper, we explore the feasibility of using the ontology in solving multi-document summarization problems in the domain of disaster management. We provide an empirical study of different approaches in which the ontology has been used for summarization tasks. Extensive experiments on a collection of press releases relevant to Hurricane Wilma in 2005 demonstrate that ontology-based multi-document summarization methods outperform other baselines in terms of the summary quality.
30 citations
TL;DR: Simulations and actual testbed implementation show ReD's favorable recovery probabilities with respect to Random Checkpointing Arrangement (RCA) middleware, a QoS-blind comparison protocol producing random arbitrary checkpointing arrangements.
Abstract: This paper deals with decentralized, QoS-aware middleware for checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is more crucial in MoG systems than in their conventional wired counterparts due to host mobility, dynamicity, less reliable wireless links, frequent disconnections, and variations in mobile systems. We've determined the globally optimal checkpoint arrangement to be NP-complete and so consider Reliability Driven (ReD) middleware, employing decentralized QoS-aware heuristics, to construct superior checkpointing arrangements efficiently. With ReD, an MH (mobile host) simply sends its checkpointed data to one selected neighboring MH, and also serves as a stable point of storage for checkpointed data received from a single approved neighboring MH. ReD works to maximize the probability of checkpointed data recovery during job execution, increasing the likelihood that a distributed application, executed on the MoG, completes without sustaining an unrecoverable failure. It allows collaborative services to be offered practically and autonomously by the MoG. Simulations and actual testbed implementation show ReD's favorable recovery probabilities with respect to Random Checkpointing Arrangement (RCA) middleware, a QoS-blind comparison protocol producing random arbitrary checkpointing arrangements.
26 citations
TL;DR: This paper proposes parallel checkpointing approach based on the use of antecedence graphs for providing fault tolerance in mobile agent systems and enhancement of graph-based approach in terms of considerable improvement by reducing message overhead, execution, and recovery times.
Abstract: The flexibility offered by mobile agents is quite noticeable in distributed computing environments. However, the greater flexibility of the mobile agent paradigm compared to the client/server computing paradigm comes at an additional threats since agent systems are prone to failures originating from bad communication, security attacks, agent server crashes, system resources unavailability, network congestion, or even deadlock situations. In such events, mobile agents either get lost or damaged (partially or totally) during execution. In this paper, we propose parallel checkpointing approach based on the use of antecedence graphs for providing fault tolerance in mobile agent systems. During normal computation message transmission, the dependency information among mobile agents is recorded in the form of antecedence graphs by participating mobile agents of mobile agent group. When a checkpointing procedure begins, the initiator concurrently informs relevant mobile agents, which minimizes the identifying time. The proposed scheme utilizes the checkpointed information for fault tolerance which is stored in form of antecedence graphs. In case of failures, using checkpointed information, the antecedence graphs and message logs are regenerated for recovery and then normal operation continued. Moreover, compared with the existing schemes, our algorithm involves the minimum number of mobile agents during the identifying and checkpoiting procedure, which leads to the improvement of the system performance. In addition, the proposed algorithm is a domino-free checkpointing algorithm, which is especially desirable for mobile agent systems. Quantitative analysis and experimental simulation show that our algorithm outperforms other coordinated checkpointing schemes in terms of the identifying time and the number of blocked mobile agents and then can provide a better system performance. The main contribution of the proposed checkpointing scheme is the enhancement of graph-based approach in terms of considerable improvement by reducing message overhead, execution, and recovery times.
19 citations
Journal Article•
TL;DR: A distributed fault tolerant architecture for fault recovery algorithms is proposed, to perform recovery actions, using data checkpoints and state checkpoints of the node, in a distributed manner.
Abstract: Smart applications use wireless sensor network for surveillance of any physical property of that area, to realize the vision of ambient intelligence. Since wireless sensor network is resource constrained and for unattended deployment scenario faults are quite trivial. Reliability and dependability of the network depends on in its fault detection, diagnosis and recovery techniques. Detecting faults in wireless sensor network is challenging and recovery of faulty nodes is very crucial task. In this research article, a distributed fault tolerant architecture is proposed. This paper also proposes fault recovery algorithms. Recovery actions are initiated based on fault diagnosis notification. The novelty of this paper is to perform recovery actions, using data checkpoints and state checkpoints of the node, in a distributed manner. Data checkpoint helps to recover the old data and the state checkpoint tells the previous trust degree of the node. Moreover, the result section explains even after replacement of a faulty node, the topology and connectivity between rests of the nodes are maintained in WSN.
14 citations