The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
최근 통신사회의 획기적인 발전 중 하나는 네트워킹이 유선에서 무선으로 확장되는 현상이다. 이를 통해 모바일 분산 컴퓨팅 환경 구축이 가능해졌으며 분산 프로토콜 설계에 몇 가지 새로운 과제가 생겼습니다. 분명히 무선 네트워크에는 유선 네트워크에 비해 낮은 통신 대역폭, 배터리 용량으로 인한 전력 제한, 프로세스 이동성 등 특별한 주의가 필요한 유선 네트워크와 몇 가지 근본적인 차이점이 있습니다. 이러한 새로운 문제로 인해 기존 복구 알고리즘이 적합하지 않게 되었습니다. 본 논문에서는 O(nr) 메시지 복잡성 여기서 O(nr)는 총 개수입니다. 변하기 쉬운 호스트 (MH) 실패한 것과 관련이 있습니다. MH. 또한 이러한 MH 한 번만 롤백하면 되며 다른 사용자의 조정 메시지를 기다리지 않고 즉시 작업을 재개할 수 있습니다. MH. 정상적인 동작 중에 애플리케이션 메시지는 서로 전송될 때 O(1)개의 추가 정보가 필요합니다. MH 및 모바일 지원 스테이션 (MSS). 마다 MSS 유지해야합니다 ntotal_h*n cell_h 종속성 행렬, 여기서 O(ntotal_h)는 총 개수입니다. MH 시스템과 ncell_h 총 수입니다 MH 셀에. 마지막으로, 손실된 메시지를 다시 보내는 것과 관련된 한 가지 문제도 고려됩니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
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(nr) message complexity where O(nr) 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 ntotal_h*n cell_h dependency matrix, where O(ntotal_h) is the total number of MHs in the system and ncell_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
부
@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(nr) message complexity where O(nr) 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 ntotal_h*n cell_h dependency matrix, where O(ntotal_h) is the total number of MHs in the system and ncell_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},}
부
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(nr) message complexity where O(nr) 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 ntotal_h*n cell_h dependency matrix, where O(ntotal_h) is the total number of MHs in the system and ncell_h is the total number of MHs in its cell. Finally, one related issue of resending lost messages is also considered.
ER -