A Distributed Snapshots Algorithm and its Application to Protocol Stabilization
In this paper, we study the apphcation of Chandy and Lamport’s Distributed Snapshots Algorithm (DSA)  to compute global states of a communications protocol. In particular, we are interested in assessing the suitability of the application of DSA for protocol stabilization. We show that the protocol state obtained cannot always be used for protocol stabilization, specifically from the checkpointing or recovery viewpoint. Furthermore, we show that when a loss of coordination and synchronization occurs, DSA is not guaranteed to terminate, and therefore it sometimes fails to obtain a global protocol state. These two problems with DSA are illustrated on a protocol example.
Key WordsCommunication protocols finite state machines global state protocol stabilization
Unable to display preview. Download preview PDF.
- M. Raynal, Networks and Distributed Computation. The MIT Press, 1988.Google Scholar
- G. Bochmann, “Finite state description of communication protocols,” Computer Networks, vol. 2, no. 4/5, pp. 361–372, 1978.Google Scholar
- H. U. K. Saleh and A. Agarwal, “A modified distributed snapshots algorithm for stabilizing protocols,” submitted for publication.Google Scholar
- P. Lee and T. Anderson, Fault tolerance: Principles and Practice. Springer Verlag, 1990.Google Scholar
- K. Saleh and A. Agarwal, “Efficient and fault tolerant checkpointing procedures for distributed systems,” to appear in Proceedings of the Intern. Phoenix Conf. on Computers and Communications, 1993.Google Scholar