A snapshot algorithm for distributed mobile systems

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. Manage...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 16th International Conference on Distributed Computing Systems s. 734 - 743
Hlavní autoři: Sato, Y., Inoue, M., Masuzawa, T., Fujiwara, H.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1996
Témata:
Algorithm design and analysis
Communications technology
Computational complexity
Computer networks
Distributed algorithms
Distributed computing
Information science
Mobile computing
Portable computers
Wireless communication
ISBN:9780818673993, 0818673990
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:9780818673993
0818673990
DOI:10.1109/ICDCS.1996.508026