Crash Recovery for Distributed Mobile Computing Systems

概要

論文の詳細を見る
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 handwidth 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.
社団法人電子情報通信学会の論文
2001-02-01