Maengsoon Baik

• Samsung

A mobile agent system is regarded as an attractive technology when developing distributed applications. However, mobility makes it more difficult to trace agents. It is also more complex for agents to communicate with each other in a reliable manner. Therefore, a reliable communication protocol is necessary to control and monitor mobile agents and...

A mobile agent is regarded as an attractive technology when developing distributed applications in mobile and ubiquitous comput- ing environments. In this paper, we present ODDUGI, a java-based ubiquitous mobile agent system. The ODDUGI mobile agent system provides fault tolerance, security, location management and message delivery mechanisms in a...

Desktop Grid has recently received the strong attraction for executing high throughput applications as CPU, storage and network capacities improve and become cheaper. Desktop Grid is different from Grid in many respects, but there is no general survey or taxonomy for desktop Grid. Therefore, we propose a new comprehensive taxonomy and survey of des...

In a desktop grid computing environment, voluntary desktops (i.e., resource providers) are free to leave and join independently in the middle of execution. To develop a reliable desktop grid computing system, a scheduling scheme must consider the dynamic nature (i.e., volatility) of volunteers. Existing desktop grid computing systems, however, do n...

Agents' mobility makes it difficult for them to deliver messages reliably, but a new system could change that. To asynchronously deliver messages to a mobile agent, the reliable asynchronous message delivery (RAMD) protocol places a "blackboard" in each region server for sharing information. RAMD also relates message delivery with a mobile agent's...

To design a stable global computing environment supporting reliable job execution and covering unanticipated state changes of hosts, the dynamic characteristics (i.e. volatilities) of hosts should be considered. Since a host is not dedicated to the system, voluntary hosts are free to leave and join autonomously in the middle of execution. As curren...

A peer-to-peer grid computing is complicated by heterogeneous capabilities, failures, volatility, and lack of trust because it is based on desktop computers at the edge of the Internet. In order to improve the reliability of computation and gain better performance, a replication mechanism must adapt to these distinct features. In other words, it is...

In P2P systems, the speed of searching for desired lists of sharable files is one of the most important measurement issues in evaluation of overall system performance. Although the searching schemes of existing non-structured P2P systems have been improved to enhance speed considerably, they still never reach to the level of those of the centralize...

Peer-to-peer grid computing is an attractive computing paradigm for high throughput applications. However, both volatility Peer-to-peer grid computing is an attractive computing paradigm for high throughput applications. However, both volatility due to the autonomy of volunteers (i.e., resource providers) and the heterogeneous properties of volunte...

This paper presents construction of dependable computation environment and autonomous scheduling strategies in decentralized desktop grid systems. Desktop grid systems have the limits of performance because of characterized by heterogeneous, volatility, scalability, and extremely dynamic computation environment. In this paper, the Self-Organizing C...

In a peer to peer grid computing environment, volunteers have heterogeneous properties and dynamically join and leave during execution. Therefore, it is essential to adapt to an unstable and widely distributed environment. However, existing scheduling and result certification mechanisms do not adapt to such a dynamic environment. As a result, they...

A volunteer node can join and leave a volunteer computing system freely. However, existing volunteer computing systems suffer from interruptions of job execution, delays of execution time, and increases of total execution time, since they do not consider dynamic scheduling properties (i.e. volatilities), such as leave, join, and suspension. Therefo...

In a peer to peer grid computing environment, volunteers are exposed to failures such as crash and link failures. In addition, since volunteers can dynamically join and leave executions and they are not dedicated only to a peer to peer grid computing, the executions of volunteers are stopped or suspended more frequently than in a grid computing env...

This paper considers the problem of correctness to fault-tolerance in global computing systems. Global computing system has been shown to be exposed to intentional attacks, where authentication is not relevant, network security techniques are insufficient. To guarantee correctness for computation, fault-tolerance schemes have been used to majority...

Optimistic log-based rollback recovery protocols have been regarded as an attractive fault-tolerant solution in distributed systems based on message-passing paradigm due to low overhead in failure-free time. These protocols are based on a Piecewise Deterministic (PWD) Assumption model. They, however, assumed that all logged non-deterministic events...

Location management and message delivery protocol is fundamental to the further development of mobile agent systems in a multiregion mobile agent computing environment in order to control mobile agents and guarantee message delivery between them. However, previous works have some problems when they are applied to a multiregion mobile agent computin...

Fault tolerance is essential to the development of reliable mobile agent systems in order to guarantee continuous execution of mobile agents. For this purpose, previous work has proposed fault tolerant protocols for mobile agent execution based on stage construction. However, when previous protocols are applied to a multiregion mobile agent computi...

Fault tolerance is essential to the further development of desktop grid computing system in order to guarantee continuous and reliable execution of tasks in spite of failures. In a desktop grid computing environment, volunteers are often susceptible to volunteer autonomy failures such as volatility failure and interference failure in the middle of...

In this paper, we will propose a message transferring model between mobile agents using broadcasting the receiving notification of message by home site creating the corresponding mobile agent or Mobile Agent Name Server(MANS) in the current region of the corresponding mobile agent. Proposed message transferring model adapts the previous broadcastin...

Mobile agent technology pushes the flexibility of distributed computing to its limits since not only computations are distributed dynamically, the code that performs them is also distributed. Mobile agent is not always safe. Especially, the leakage of its sensitive data by malicious host may cause the great harm to users of Mobile Agent Systems(MAS...

In this paper, we will prove that the new consistency condition for checkpoints must be needed in systems based on PWD model and propose an efficient coordinated checkpointing scheme. In our scheme, whenever process constructs a consistent global checkpoint set, it must obey the new consistency condition instead of previous consistency condition. T...

In this paper, we will prove that the new consistency condition for checkpoints must be needed in systems based on PWD model and propose an efficient coordinated checkpointing scheme. In our scheme, whenever process constructs a consistent global checkpoint set, it must obey the new consistency condition instead of previous consistency condition. T...