DocumentCode :
2132565
Title :
A snapshot algorithm for distributed mobile systems
Author :
Sato, Yasuro ; Inoue, Michiko ; Masuzawa, Toshimitsu ; Fujiwara, Hideo
Author_Institution :
Graduate Sch. of Inf. Sci., Nara Inst. of Sci. & Technol., Japan
fYear :
1996
fDate :
27-30 May 1996
Firstpage :
734
Lastpage :
743
Abstract :
This paper considers distributed algorithms for distributed mobile systems. Many distributed algorithms have been designed for distributed systems consisting of static computers only. But most of them cannot be directly applied to mobile systems. This paper proposes a model of mobile systems. Management of movements of mobile hosts is abstracted in our model to simplify design of algorithms for mobile systems. This paper also defines the snapshot problem, one of the fundamental problems, on the model. The problem requires to find a strongly consistent configuration in which topological consistency is satisfied in addition to causal consistency. Furthermore, this paper presents a snapshot algorithm for mobile systems
Keywords :
distributed algorithms; portable computers; causal consistency; distributed algorithms; distributed mobile systems; mobile hosts; snapshot algorithm; static computers; strongly consistent configuration; topological consistency; Algorithm design and analysis; Communications technology; Computational complexity; Computer networks; Distributed algorithms; Distributed computing; Information science; Mobile computing; Portable computers; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1996., Proceedings of the 16th International Conference on
Print_ISBN :
0-8186-7399-0
Type :
conf
DOI :
10.1109/ICDCS.1996.508026
Filename :
508026
Link To Document :
بازگشت