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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 16th International Conference on Distributed Computing Systems S. 734 - 743
Hauptverfasser: Sato, Y., Inoue, M., Masuzawa, T., Fujiwara, H.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 1996
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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