Crash Recovery for Distributed Mobile Computing Systems

Tong-Ying Tony JUANG

Crash Recovery for Distributed Mobile Computing Systems

Tong-Ying Tony JUANG

Full Text Views

0

Cite this

Summary :

One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networks do have some fundamental differences from wired networks that need to be paid special attention of, such as lower communication bandwidth compared to wired networks, limited electrical power due to battery capacity, and mobility of processes. These new issues make traditional recovery algorithm unsuitable. In this paper, we propose an efficient algorithm with O(n_r) message complexity where O(n_r) is the total number of mobile hosts (MHs) related to the failed MH. In addition, these MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. During normal operation, the application message needs O(1) additional information when it transmitted between MHs and mobile support stations (MSSs). Each MSS must keep an n_{total_h}*n _{cell_h} dependency matrix, where O(n_{total_h}) is the total number of MHs in the system and n_{cell_h} is the total number of MHs in its cell. Finally, one related issue of resending lost messages is also considered.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.2 pp.668-674

Publication Date: 2001/02/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Mobile Information Network and Personal Communications

Cite this

Copy

Tong-Ying Tony JUANG, "Crash Recovery for Distributed Mobile Computing Systems" in IEICE TRANSACTIONS on Fundamentals, vol. E84-A, no. 2, pp. 668-674, February 2001, doi: .
Abstract: One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networks do have some fundamental differences from wired networks that need to be paid special attention of, such as lower communication bandwidth compared to wired networks, limited electrical power due to battery capacity, and mobility of processes. These new issues make traditional recovery algorithm unsuitable. In this paper, we propose an efficient algorithm with O(n_r) message complexity where O(n_r) is the total number of mobile hosts (MHs) related to the failed MH. In addition, these MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. During normal operation, the application message needs O(1) additional information when it transmitted between MHs and mobile support stations (MSSs). Each MSS must keep an n_{total_h}*n _{cell_h} dependency matrix, where O(n_{total_h}) is the total number of MHs in the system and n_{cell_h} is the total number of MHs in its cell. Finally, one related issue of resending lost messages is also considered.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_2_668/_p

Copy

@ARTICLE{e84-a_2_668,
author={Tong-Ying Tony JUANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Crash Recovery for Distributed Mobile Computing Systems},
year={2001},
volume={E84-A},
number={2},
pages={668-674},
abstract={One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networks do have some fundamental differences from wired networks that need to be paid special attention of, such as lower communication bandwidth compared to wired networks, limited electrical power due to battery capacity, and mobility of processes. These new issues make traditional recovery algorithm unsuitable. In this paper, we propose an efficient algorithm with O(n_r) message complexity where O(n_r) is the total number of mobile hosts (MHs) related to the failed MH. In addition, these MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. During normal operation, the application message needs O(1) additional information when it transmitted between MHs and mobile support stations (MSSs). Each MSS must keep an n_{total_h}*n _{cell_h} dependency matrix, where O(n_{total_h}) is the total number of MHs in the system and n_{cell_h} is the total number of MHs in its cell. Finally, one related issue of resending lost messages is also considered.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Crash Recovery for Distributed Mobile Computing Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 668
EP - 674
AU - Tong-Ying Tony JUANG
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2001
AB - One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networks do have some fundamental differences from wired networks that need to be paid special attention of, such as lower communication bandwidth compared to wired networks, limited electrical power due to battery capacity, and mobility of processes. These new issues make traditional recovery algorithm unsuitable. In this paper, we propose an efficient algorithm with O(n_r) message complexity where O(n_r) is the total number of mobile hosts (MHs) related to the failed MH. In addition, these MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. During normal operation, the application message needs O(1) additional information when it transmitted between MHs and mobile support stations (MSSs). Each MSS must keep an n_{total_h}*n _{cell_h} dependency matrix, where O(n_{total_h}) is the total number of MHs in the system and n_{cell_h} is the total number of MHs in its cell. Finally, one related issue of resending lost messages is also considered.
ER -