• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.1
• /
• pp.193-200
• /
• 2011

This paper presents an optimal checkpoint strategy for fault-tolerance in real-time systems. In our environment, multiple real-time tasks with arbitrary periods are scheduled in the system by Rate Monotonic (RM) algorithm, and checkpoints are inserted at a constant interval in each task while the width of interval is different with respect to the task. We propose a method to determine the optimal checkpoint interval for each task so that the probability of completing all the tasks is maximized. Whenever a fault occurs to a checkpoint interval of a task, the execution time of the task would be prolonged by rollback and re-execution of checkpoints. Our scheme includes the schedulability test to examine whether a task can be completed with an extended execution time. A numerical experiment is conducted to demonstrate the applicability of the proposed scheme.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.148-154
• /
• 2012

For a successful checkpointing strategy, we should place checkpoints so as to optimize fault-tolerance capability of real-time systems. This paper presents a novel scheme of checkpoint placement for real-time systems with periodic multi-tasks. Under the influence of transient faults, multi-tasks are scheduled by the Rate Monotonic (RM) algorithm. The optimal checkpoint intervals are derived to maximize the probability of task completion. In particular, this paper is concerned about the general case that the deadline of a task is longer than the period. Compared with the special condition that the deadline is equal to or less than the period, this general case causes a more complicate test procedure for schedulability of the RM algorithm with respect to a given set of checkpoint re-execution vectors. The probability of task completion is also derived in a more complex form. A case study is given to show the applicability of the proposed scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.77-84
• /
• 2003

A mobile agent is a program which represents a user in a network and is capable of migrating from one node to another node, performing computations on behalf of the user. In this paper, we suggest a scheme that can safely recover mobile agent using the checkpoint that is saved at the platform that it visited previously and restart its execution from the abnormal termination point of the mobile agent. For security, mobile agent uses its public key to encrypt the checkpoint and the home platform uses the private key of the mobile agent to decrypt the encrypted checkpoints at the recovery stage. When home platform receives the checkpoint of the mobile agent, home platform verifies the checkpoint using message digest. Home platform verifies the correctness of the checkpoint by comparing the message digest generated at checkpoint mention time with the message digest generated at mobile agent recovery time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.1
• /
• pp.120-127
• /
• 2011

Checkpointing is one of common methods of realizing fault-tolerance for real-time systems. This paper presents a scheme to determine checkpoint intervals using probabilistic optimization. The considered real-time systems comprises multiple tasks in which transient faults can happen with a Poisson distribution. Also, multi-tasks are scheduled by the non-preemptive Rate Monotonic (RM) algorithm. In this paper, we present an optimization problem where the probability of task completion is described by checkpoint numbers. The solution to this problem is the optimal set of checkpoint numbers and intervals that maximize the probability. The probability computation includes schedulability test for the non-preemptive RM algorithm with respect to given numbers of checkpoint re-execution. A case study is given to show the applicability of the proposed scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2533-2539
• /
• 1999

Two scheme are widely used for fault-tolerant systems : one is the duplex system that has a physical redundancy, and the other one is the checkpointing scheme that rolls back to the last checkpoint at a failure. The average execution time and availability are important factors for measuring the performance of the fault-tolerant systems. However, in fault-tolerant real-time systems with a time constraint, meeting the time constrain instead of reducing the average execution time is the most important factor in the performance evaluation. We analyze and compare the performance of two fault-tolerant scheme (the duplex system and the checkpointing scheme) for real-time applications.

• The KIPS Transactions:PartC
• /
• v.8C no.2
• /
• pp.182-188
• /
• 2001

이동 호스트에서 기지국으로의 데이터 전송 시 예상치 못한 기지국 전체 고장은 필연적으로 버퍼에 있는 데이터의 손실을 초래하고 적절한 손실 보상이 필요하다. 기지국의 고장시의 회복을 위한 기존의 기법들은 오버헤드가 많고 단순히 무선 링크 장애만을 고려하므로 기지 국 전체 고장에는 적합하지 않다. 유무선망 전체의 신뢰성 있는 전송을 위한 End to End 전송 방식도 비효율적으로 이동 호스트가 보상할 데이터 량을 알기 위해 필요한 기지국 버 퍼의 정확한 손실 정도를 알기 어렵다. 본 논문에서는 기존에 제안된 기법들의 문제점을 분 석하고 무선 ATM망에서 기지국 고장 시에 효율적으로 손실 보상을 하도록 하는 기법으로 CPS(Checkpoint Scheme)을 제안한다. CPS는 기지국이 버퍼의 출력 정보를 통보하여 고장 시에 이동 호스트가 seamless한 전송을 할 수 있도록 한다. 기존의 기법들과 시뮬레이션 및 비교 분석을 통하여 CPS의 효율을 증명한다.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.387-390
• /
• 2009

Wireless Sensor Network (WSN) can easily compromised from attackers because it has the limited resource and deployed in exposed environments. When the sensitive packets are occurred such as enemy's movement or fire alarm, attackers can selectively drop them using a compromised node. It brings the isolation between the basestation and the sensor fields. To detect selective forwarding attack, Xiao, Yu and Gao proposed checkpoint-based multi-hop acknowledgement scheme (CHEMAS). The check-point nodes are used to detect the area which generating selective forwarding attacks. However, CHEMAS has static probability of selecting check-point nodes. It cannot achieve the flexibility to coordinate between the detection ability and the energy consumption. In this paper, we propose the control method for the number fo check-point nodes. Through the control method, we can achieve the flexibility which can provide the sufficient detection ability while conserving the energy consumption.

• The Journal of Korean Association of Computer Education
• /
• v.12 no.4
• /
• pp.47-55
• /
• 2009

There are many researches considering mobile devices as resources in mobile grids. However, the mobile device has some limitations: wireless connection and battery capacity. So, the grid operations using mobile devices have lower reliability and efficiency than those in fixed grid environments. In this paper, we propose a job migration scheme using mobile devices to overcome these limitations. The proposed job migration scheme predicts failure condition during execution and takes checkpoints. Then, if the failure occurs on mobile device during execution, the executing job can be migrated to other mobile device by checkpoint information. To perform the proposed migration scheme, we establish a mobile device manager on a proxy server and a status manager on a mobile device. Connection, wireless signal strength and battery capacity of mobile devices are identified through two managers. The simulation results show improvement of efficiency and reliability during execution.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.73-80
• /
• 2010

A wireless sensor network which is deployed in hostile environment can be easily compromised by attackers. The selective forwarding attack can jam the packet or drop a sensitive packet such as the movement of the enemy on data flow path through the compromised node. Xiao, Yu and Gao proposed the checkpoint-based multi-hop acknowledgement scheme(CHEMAS). In CHEMAS, each path node enable to be the checkpoint node according to the pre-defined probability and then can detect the area where the selective forwarding attacks is generated through the checkpoint nodes. In this scheme, the number of hops is very important because this parameter may trade off between energy conservation and detection capacity. In this paper, we used the fuzzy rule system to determine adaptive threshold value which is the number of hops for the ACK packets. In every period, the base station determines threshold value while using fuzzy logic. The energy level, the number of compromised node, and the distance to each node from base station are used to determine threshold value in fuzzy logic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.13-23
• /
• 2002

A mobile host is prone to failure due to lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life on the wireless network. Many researchers have studied to overcome these problems. For high level Availability in the cellular networks, it is necessary to consider recovery from the failures of mobile support stations as well as mobile as mobile hosts. In this paper, we present modified trickle scheme for recovery from failures of Mobile Support Station based on checkpointing scheme and analyze and compare the performance. We propose and analyze the performance of two schemes : one is waiting recovery scheme for the mobile support station having the last checkpoint and the other is searching the new path to the another mobile support station having the checkpoint.