A snapshot algorithm for distributed mobile systems

Authors:
Affiliations:
Venue:
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Year:
1996

Citing 0
Cited 3

Termination Detection Protocols for Mobile Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Instant Image: Transitive and Cyclical Snapshots in Distributed Storage Volumes

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
A Termination Detection Protocol for Use in Mobile Ad Hoc Networks

Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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.