Acta Informatica

, Volume 40, Issue 3, pp 159–210 | Cite as

Providing view synchrony for group communication services

  • N. Lesley
  • A. Fekete


Building applications in a distributed computing environment is a complex process involving reasoning about message ordering, system failures, link failures etc. Group communication services attempt to make this task easier by providing building blocks to be used in assembling such systems and by defining properties that are guaranteed by these services. One such property is VS (view synchrony) which imposes restrictions on when messages can be delivered, guaranteeing that processors who share the same view of the distributed environment receive either the same set of messages or prefixes of the set received by one processor. This paper provides a precise description of an algorithm (based on ideas of Cristian and Schmuck) and a proof that this algorithm provides VS. The contributions of this paper are to show that VS is implementable and to provide an actual algorithm to implement it. We also show conditional timing properties of the algorithm, giving timebounds for group formation under certain stability conditions.


Stability Condition Group Formation Communication Service Computing Environment Group Communication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Amir Y (1995) Replication using group communication over a paritioned network. PhD thesis, Institute of Computer Science, Hebrew University of JerusalemGoogle Scholar
  2. 2.
    Amir Y, Breitgand D, Chockler GV, Dolev D (1996) Group communication as an infrastructure for distributed system management. In: Third Int Workshop on Services in Distributed and Networked Enviroments (SDNE’96), pp 84-91Google Scholar
  3. 3.
    Amir Y, Dolev D, Melliar-Smith P, Moser L (1994) Robust and efficient replication using group communication. Technical Report TR 94-20, Hebrew University of JerusalemGoogle Scholar
  4. 4.
    Amir Y, Moser L, Melliar-Smith P, Agrawal D, Ciarfella P (1993) Fast message ordering and membership using a logical token-passing ring. In: Proc. of IEEE Int. Conf. on Distributed Computing Systems, pp 551-560Google Scholar
  5. 5.
    Babaoglu O, Davoli R, Giachini L, Baker M (1995) Relacs: A communication infrastructure for constructing reliable applications in large-scale distributed systems. In: m Proc of Hawaii Int Conf on Comp and Syst Science, pp 612-621Google Scholar
  6. 6.
    Babaoglu O, Davoli R, Giachini L, Sabbattini P (1995) The inherent cost of strong-partial view synchronous communication. Technical Report UBLCS-95-11, University of Bologna, ItalyGoogle Scholar
  7. 7.
    Babaoglu O, Davoli R, Montresor A (1995) Group membership and view synchrony in partitionable asynchronous systems: Specifications. Technical Report UBLCS-95-18, University of Bologna, ItalyGoogle Scholar
  8. 8.
    Birman K, Joseph T (1987) Exploiting virtual synchrony in distributed systems. In: Proceedings of the Eleventh ACM Symposium on Operating Systems Principles, pp 123-138Google Scholar
  9. 9.
    Birman K, van Renesse R (eds) (1994) Reliable distributed computing with the Isis toolkit. IEEE Computer Society PressGoogle Scholar
  10. 10.
    Chockler GV, Keidar I, Vitenberg R (2001) Group communication specifications: a comprehensive study. ACM Computing Surveys 33(4): 1-43CrossRefGoogle Scholar
  11. 11.
    Malloth C, Schiper A (1995) View synchronous communication in large scale networks. In: 2nd Open Workshop of the ESPRIT project BROADCAST (6360)Google Scholar
  12. 12.
    Cristian F, Schmuck F (1995) Agreeing on processor group membership in timed asynchronous distributed systems. Technical Report CSE95-428, Department of Computer Science, University of California San DiegoGoogle Scholar
  13. 13.
    Dolev D, Malki D (1996) The Transis approach to high availability cluster communication. Communications of the ACM 39(4): 64-70CrossRefGoogle Scholar
  14. 14.
    Fekete A, Lynch N, Shvartsman A (2001) Specifying and using a partitionable group communication service. ACM Transactions on Computer Systems 19(2): 171-216CrossRefGoogle Scholar
  15. 15.
    Friedman R, van Renesse R (1996) Strong and weak virtual synchrony in Horus. In: Proc of IEEE Symposium on Reliable Distributed Systems, pp 140-149Google Scholar
  16. 16.
    Garland S, Guttag J, Horning J (1993) An overview of Larch. In: Lauer PE (ed) Functional programming, concurrency, simulation and automated reasoning, vol 693, pp 329-348. SpringerGoogle Scholar
  17. 17.
    Hayden M (1998) The Ensemble System Cornell University. Technical Report TR98-1662, CornellGoogle Scholar
  18. 18.
    Jahanian F, Fakhouri S, Rajkumar R (1993) Processor group membership protocols: specification, design and implementation. In: Proc of 12th IEEE Symposium on Reliable Distributed Systems, pp 2-11Google Scholar
  19. 19.
    Kaashoek MF, Tanenbaum AS (1996) An evaluation of the Amoeba Group Communication System. In: IEEE International Conference on Distributed Computing Systems, pp 436-448Google Scholar
  20. 20.
    Keidar I, Dolev D (1996) Efficient message ordering in dynamic networks. In: 15th ACM Symposium on Principles of Distributed Computing Systems (PODC), pp 68-76Google Scholar
  21. 21.
    Keidar I, Dolev D (1999) Totally ordered broadcast in the face of network partitions. In: Auresky D (ed) Dependable network computing, pp 57-75. Klumer Academic PublicationsGoogle Scholar
  22. 22.
    Keidar I, Khazan R (2002) A virtually synchronous group multicast algorithm for WANs: Formal approach. SIAM Journal on Computing (SICOMP) 32(1): 78-130CrossRefGoogle Scholar
  23. 23.
    Keidar I, Sussman J, Marzullo K, Dolev D (2000) A client-server oriented algorithm for virtually synchronous group membership in WANs. In: 20th Internation Conference on Distributed Computing Systems (ICDCS), pp 356-365Google Scholar
  24. 24.
    Lesley N, Fekete A (1999) Providing view synchrony for group communication services. In: Proceedings of the 22nd Australasian Computer Science Conference ACSC99, pp 457-468Google Scholar
  25. 25.
    Lynch N, Tuttle M (1989) An introduction to input/output automata. CWI-Quarterly 2(3): 219-246 (1989)Google Scholar
  26. 26.
    Lynch NA (1996) Distributed algorithms. Morgan Kaufmann Publishers, San Mateo, CAGoogle Scholar
  27. 27.
    Lynch NA, Vaandrager F (1996) Forward and backward simulations - Part II: Timing-based systems. Information and Computation 128(1): 1-25CrossRefMathSciNetzbMATHGoogle Scholar
  28. 28.
    Moser L, Amir Y, Melliar-Smith P, Agrawal D (1994) Extended virtual synchrony. In: Proc of IEEE Int Conf on Dist Comp Systems, pp 56-63Google Scholar
  29. 29.
    Moser LE, Melliar-Smith PM, Agarwal DA, Budhia RK, Lingley-Papadopoulos CA (1996) Totem: A fault-tolerant multicast group communication system. Communications of the ACM 39(4): 54-63CrossRefGoogle Scholar
  30. 30.
    De Prisco R, Fekete A, Lynch N, Shvartsman A (1998) A dynamic view-oriented group communication service. In: Proceedings of ACM Conference on Principles of Distributed Computing, pp 227-236Google Scholar
  31. 31.
    Sussman J, Keidar I, Marzullo K (2000) Optimistic virtual synchrony. In: 19th IEEE Symposium on Reliable Distributed Systems, pp 42-51Google Scholar
  32. 32.
    van Renesse R, Birman KP, Maffeis S (1996) Horus: A flexible group communication system. Communications of the ACM 39(4): 76-83CrossRefGoogle Scholar
  33. 33.
    Défago X, Schiper A, Urbán P (2000) Totally ordered broadcast and multicast algorithms: A comprehensive survey. Technical Report TR DSC/2000/036, Swiss Federal Institute of TechnologyGoogle Scholar

Copyright information

© Springer-Verlag Berlin/Heidelberg 2003

Authors and Affiliations

  1. 1.School of Information TechnologiesUniversity of Sydney

Personalised recommendations