A Distributed Snapshots Algorithm and its Application to Protocol Stabilization

  • K. Saleh
  • H. Ural
  • A. Agarwal
Conference paper
Part of the Dependable Computing and Fault-Tolerant Systems book series (DEPENDABLECOMP, volume 7)

Abstract

In this paper, we study the apphcation of Chandy and Lamport’s Distributed Snapshots Algorithm (DSA) [1] 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 Words

Communication protocols finite state machines global state protocol stabilization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K. Chandy and L. Lamport, “Distributed snapshots: determining global states of distributed systems,” ACM Trans, on Comp. Sys, vol. 3, no. 1, pp. 63–75, 1985.CrossRefGoogle Scholar
  2. [2]
    C. Morgan, “Global and logical time in distributed algorithms,” Information Processing Letters, vol. 20, pp. 189–194, 1985.CrossRefGoogle Scholar
  3. [3]
    M. Raynal, Networks and Distributed Computation. The MIT Press, 1988.Google Scholar
  4. [4]
    R. Probert and K. Saleh, “Synthesis of communications protocols: survey and assessment,” IEEE Trans, on Computers., vol. 40, no. 4, pp. 468–476, 1991.CrossRefGoogle Scholar
  5. [5]
    G. Bochmann, “Finite state description of communication protocols,” Computer Networks, vol. 2, no. 4/5, pp. 361–372, 1978.Google Scholar
  6. [6]
    M. Gouda and N. Multari, “Stabilizing communication protocols,” IEEE Trans, on Computers, vol. 40, no. 4, pp. 448–458, 1991.CrossRefGoogle Scholar
  7. [7]
    H. U. K. Saleh and A. Agarwal, “A modified distributed snapshots algorithm for stabilizing protocols,” submitted for publication.Google Scholar
  8. [8]
    P. Lee and T. Anderson, Fault tolerance: Principles and Practice. Springer Verlag, 1990.Google Scholar
  9. [9]
    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

Copyright information

© Springer-Verlag/Wien 1993

Authors and Affiliations

  • K. Saleh
    • 1
  • H. Ural
    • 2
  • A. Agarwal
    • 1
  1. 1.Dept. of Electrical and Computer EngineeringConcordia UniversityCanada
  2. 2.Dept. of Computer ScienceUniversity of OttawaCanada

Personalised recommendations