IETF (Internet Engineering Task Force) has proposed a PMIPv6 (Proxy Mobile IPv6) to make up for the weak points caused by handoff delay and signaling overhead. The handoff delay and signaling overhead occur due to frequent binding updates during handoff in the MIPv6 (Mobile IPv6). Although the handoff in the PMIPv6 can be faster than that in the MIPv6, there still exists the handoff delay and packet loss during the handoff. For these reasons, the researches to reduce the handoff delay and retransmit missing packets have been investigated. We propose a scheme in order to set up the multicast group. As a result, the scheme reduces the handoff delay by using the cache and prevents the packet loss in the PMIPv6. We have analyzed general handoff performance in the PMIPv6 and packet loss occurring interval from a practical point of view to verify the proposed scheme.

PMIPv6 has been proposed in network-based localized mobility management (NetLMM) of IETF. The PMIPv6 copes with the disadvantages of client-based mobility technology by utilizing network-based mobility technology in which the handover function of a mobile node (MN) is replaced by a router. However, the PMIPv6 has the critical problem that inter-cell handover is not supported. In order to support the intercell handover in the PMIPv6, an all neighbor multicast (ANM) scheme has been proposed. Meanwhile, the ANM scheme wastes resources for sending multicast messages because the multicast messages are not sent only to handover-occurring-cells but also other neighbor cells. In this paper, a network router recognizes the MN newly entered at the boundary of the cell. We propose an intelligent multicast configuration (IMC) scheme for the inter-cell handover. Using the proposed scheme, the consumption of resources and the whole load of networks are reduced by up to 64% compared to the ANM scheme.

IETF (Internet Engineering Task Force) has proposed the use of PMIPv6 (Proxy Mobile IPv6) over Mobile IPv6 which has the problem of handover latency and signaling overhead caused by binding update(BU). However, considering that PMIPv6 provides the fast handover only in intra-domain, not inter-domain. IETF is debating whether to go back to the previously proposed method, MIPv6, which allows handover in inter-domain [1]. Using MIPv6 in intra-domain also has two major drawbacks: it requires IP update which cannot maintain L4 connectivity and it takes longer handover time due to the latency in binding update of MIPv6. This paper proposed adding the multicast server to PMIPv6, a method that allows the handover in inter-domain without delaying the handover in intra-domain. Adding the multicast server keeps L4 connectivity in both domains and application layer as well; therefore, it enables the seamless service based on IP anywhere. Moreover, this method reduces handover latency so that it takes much less time than using MIPv6. To prove this, the performance of PMIPv6 and the new MIPv6 used in intra and inter domains have been analyzed and compared in practical point of view.

HMIPv6 draws lots of attention in recent years for providing an efficient handoff and reducing the signaling overhead. HMIPv6 employs MAP (mobility anchor point) in order to minimize signaling overhead and to support local mobility management. HMIPv6 provides an outstanding mobility management in the network environment with frequent micro-handoff but incurs higher signaling cost than MIPv6 in case of macro-handoff. In this paper, we propose the FMHS (fast macro-handover scheme) for efficient macro-handoff in HMIPv6 networks. The FMHS reduces binding update cost, in which a MN sends binding update (BU) message including the newly obtained RCoA to the previous MAP instead of its own home agent (HA) where several MAPs exist in the administration domain. The FMHS reduces about 56% binding update cost and shortens macro-handover delay compared to HMIPv6.

Abstract Hierarchical Mobile IPv6 (HMIPv6) has been proposed by the Internet engineering task force (IETF) to compensate for such problems as handover latency and signalling overhead when employing Mobile IPv6 (MIPv6). HMIPv6 supports micro‐mobility within a domain and introduces a new entity, namely mobility anchor point (MAP) as a local home agent (HA). However, HMIPv6 has caused load concentration at a particular MAP and longer handover latency when an inter‐domain handover occurs. In order to solve such problems, this paper establishes a virtual domain (VD) of a higher layer MAP and proposes a MAP changing scheme. The MAP changing scheme enables complete handover by using binding‐update of the on‐link care of address (LCoA) only when inter‐domain handover occurs. In addition, the concentrated load of a particular MAP is distributed as well. Copyright © 2008 John Wiley & Sons, Ltd.

Simulated annealing is a general-purpose optimization technique capable of finding an optimal or near-optimal solution in various applications. However, the long execution time required for a good quality solution has been a major drawback in practice. Extensive studies have been carried out to develop parallel algorithms for simulated annealing. Most of them were not very successful, mainly because multiple processing elements (PEs) were required to follow a single Markov chain and, therefore, only a limited parallelism was exploited. In this paper, we propose new parallel simulated annealing algorithms which allow multiple Markov chains to be traced simultaneously by PEs which may communicate with each other. We have considered both synchronous and asynchronous implementations of the algorithms. Their performance has been analyzed in detail and also verified by extensive experimental results. It has been shown that for graph partitioning the proposed parallel simulated annealing schemes can find a solution of equivalent (or even better) quality up to an order of magnitude faster than the conventional parallel schemes. Among the proposed schemes, the one where PEs exchange information dynamically (not with a fixed period) performs best.