A network architecture providing host migration transparency

Teraoka, Fumio; Yokore, Yasuhiko; Tokoro, Mario

doi:10.1145/115992.116012

Cited by 130 publications

(23 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Messages sent by an MH to another MH may have to be rerouted because the destination MH may be disconnected from the old MSS and connected to a new MSS. Many routing protocols for the network layer have been proposed [2], [26], [33] to handle MH mobility. It should be noted that disconnection of an MH is a voluntary operation [1], and frequent disconnections of MHs is an expected feature of the mobile computing environment.…”

Section: Handling Mobility and Disconnectionsmentioning

confidence: 99%

Mutable checkpoints: a new checkpointing approach for mobile computing systems

Singhal

2001

IEEE Trans. Parallel Distrib. Syst.

109

View full text Add to dashboard Cite

AbstractÐMobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. Coordinated checkpointing is an attractive approach for transparently adding fault tolerance to distributed applications since it avoids domino effects and minimizes the stable storage requirement. However, it suffers from high overhead associated with the checkpointing process in mobile computing systems. Two approaches have been used to reduce the overhead: First is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process nonblocking. These two approaches were orthogonal previously until the Prakash-Singhal algorithm [28] combined them. However, we [8] found that this algorithm may result in an inconsistency in some situations and we proved that there does not exist a nonblocking algorithm which forces only a minimum number of processes to take their checkpoints. In this paper, we introduce the concept of ªmutable checkpoint,º which is neither a tentative checkpoint nor a permanent checkpoint, to design efficient checkpointing algorithms for mobile computing systems. Mutable checkpoints can be saved anywhere, e.g., the main memory or local disk of MHs. In this way, taking a mutable checkpoint avoids the overhead of transferring large amounts of data to the stable storage at MSSs over the wireless network. We present techniques to minimize the number of mutable checkpoints. Simulation results show that the overhead of taking mutable checkpoints is negligible. Based on mutable checkpoints, our nonblocking algorithm avoids the avalanche effect and forces only a minimum number of processes to take their checkpoints on the stable storage.

show abstract

Section: Handling Mobility and Disconnectionsmentioning

confidence: 99%

Mutable checkpoints: a new checkpointing approach for mobile computing systems

Singhal

2001

IEEE Trans. Parallel Distrib. Syst.

109

View full text Add to dashboard Cite

show abstract

“…As mentioned in section 1, previous works such as [2], [6], [7] and [8] are not appropriate for supporting mobile ESs in an area. In addition, mobile ESs should perform additional functions such as migration notification, hence they cannot be directly applied to the existing networks.…”

Section: Related Workmentioning

confidence: 99%

“…A caching mechanism was originally employed in [6]. In the original usage, clear packets are broadcasted to eliminate obsolete caches.…”

Section: Related Workmentioning

confidence: 99%

“…Several protocols for mobile communication have been proposed based on IP [2], [6], [B] and based on CLNP [l], [7]. These approaches, however, mainly focused on the problem of the identification of systems, and the last two problems are rather considered to be of secondary importance.…”

Section: Introductionmentioning

confidence: 99%

“…In the case of l), when the PDU returns to the default NIS by the arrow 6 Independence from other areas: ES information is exchanged only in the area and the other areas in the routing domain are not affected by the information.…”

mentioning

confidence: 99%

See 2 more Smart Citations

A CLNP-based protocol for mobile end systems within an area

Tanaka¹,

Tsukamoto²

1993 International Conference on Network Protocols

View full text Add to dashboard Cite

In this paper, we propose a protocol for supporting mobile End Systems (ESs) ihat move within an area in ConnectionLess-mode Network Protocol (CLNP) environment. Trafic caused by control Protocol Data Units (PDUs) under fiequeni ES migration can be reduced by separating the roles of Intermediate Systems (ISs); 1) generating and propagating the information ofthe default location of an ES, 2) communicating directly to the ES and notifying the IS performing the role 1) of the current loctztion of the ES. In addition, ISs may use a new caching mechanism for efficiency. This protocol has the following advantages: First, there is no need for mobile ESs t o be changed. Second, ISs implementing this protocol can coexist with the conventional ISs. Third, it does not require any change to the areas which do not have mobile ESs, hence it is easy to apply it to the existing networks.

show abstract

Supporting universal personal computing on the Internet with Java and CORBA

Zhu

Törö

Leung

et al. 1998

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

Universal personal computing (UPC) supports nomadic computing on the Internet by allowing mobile users to access their personalized computing resources anywhere on the Internet using any available terminal. Since UPC must deal with heterogeneous systems in a mobile environment, independence of computing platforms and support of portable objects are imperative, which leads to the choice of Java. The system is modeled as distributed objects with CORBA as the common bus that facilitates distribution, interfacing, and integration of the objects. The combination of Java and CORBA constitutes an ideal environment for UPC. © 1998 John Wiley & Sons, Ltd.

show abstract

A network architecture providing host migration transparency

Cited by 130 publications

References 4 publications

Mutable checkpoints: a new checkpointing approach for mobile computing systems

Mutable checkpoints: a new checkpointing approach for mobile computing systems

A CLNP-based protocol for mobile end systems within an area

Supporting universal personal computing on the Internet with Java and CORBA

Contact Info

Product

Resources

About