SCALABLE FAULT-TOLERANT LOCATION MANAGEMENT SCHEME FOR MOBILE IP

As the number of mobile nodes registering with a network rapidly increases in Mobile IP, multiple mobility (home or foreign) agents can be allocated to a network in order to improve performance and availability. Previous fault-tolerant schemes (denoted by PRT schemes) to mask failures of the mobility agents use passive replication techniques. However, they result in high failure-free latency during registration process if the number of mobility agents in the same network increases, and force each mobility agent to manage bindings of all the mobile nodes registering with its network. In this paper, we present a new fault-tolerant scheme (denoted by CML scheme) using checkpointing and message logging techniques. The CML scheme achieves low failure-free latency even if the number of mobility agents in a network increases, and improves scalability to a large number of mobile nodes registering with each network compared with the PRT schemes. Additionally, the CML scheme allows each failed mobility agent to recover bindings of the mobile nodes registering with the mobility agent when it is repaired even if all the other mobility agents in the same network concurrently fail

Coupling Resource Grouping and Scheduling in Centralized Desktop Grid Computing

Desktop Grid is different from Grid in terms of the characteristics of resources as well as types of sharing. Particularly, resource providers in Desktop Grid are volatile, heterogeneous, faulty, and malicious. These distinct features make it difficult for a scheduler to allocate tasks. Moreover, they deteriorate reliability of computation and performance. To overcome the problems, we propose a new Desktop Grid scheduling coupled with resource grouping, which constructs a computational overlay network (CON) according to capability, dedication, volatility, and trust of resource providers. Scheduling is performed on the basis of characteristics and topology of the CON

A Taxonomy of Desktop Grid Systems Focusing on Scheduling

Desktop Grid has recently received the strong attraction for executing high throughput applications. Although Desktop Grid is different from Grid in many respects, there is no general survey or taxonomy for Desktop Grid. Especially, scheduling for Desktop Grid is considerably challenging because of unreliable, heterogeneous, volatile, and insecure environment. Therefore, we propose a new comprehensive taxonomy and survey of Desktop Grid in order to help understand the definition, architecture, model, and applications of Desktop Grid. Particularly, we focus on a taxonomy and survey of scheduling for Desktop Grid in this paper.

Adaptive Group Scheduling Mechanism using Mobile Agents in Peer-to-Peer Grid Computing Environment

A peer to peer grid computing is an attractive computing paradigm for high throughput applications. However, both volatility due to autonomy of volunteers (i.e., resource providers) and heterogeneous properties of volunteers are challenging in a scheduling procedure. Therefore, it is necessary to develop a scheduling mechanism to adapt to a dynamic peer to peer grid computing environment. In this paper, we propose a Mobile Agent based Adaptive Scheduling Mechanism (MAASM). The MAASM classifies and constructs volunteer groups to perform a scheduling mechanism according to properties of volunteers such as volunteer autonomy failures, volunteer availability, and volunteering service time. In addition, the MAASM exploits a mobile agent technology to adaptively conduct different scheduling, fault tolerance, and replication algorithms suitable for each volunteer group. Furthermore, we demonstrate that the MAASM improves the performance by evaluating our scheduling mechanism i

Group-based Dynamic Computational Replication Mechanism

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 required to classify volunteers into groups that have similar properties and then dynamically apply different replication algorithms to each group. However, existing mechanisms do not provide such a replication mechanism on a per group basis. As a result, they cause a high overhead and poor performance. To solve the problems, we propose a new group-based computational replication mechanism to adapt to a unstable, untrusted, dynamic peer-to-peer grid computing environment. Our mechanism can reduce the number of redundancy and therefore complete many tasks by adaptively replicating computations on the basis of the properties of volunteer group such as availability, credibility, and volunteering service time. I