Providing view synchrony for group communication services

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

[1]  Stephen J. Garland,et al.  An Overview of Larch , 1993, Functional Programming, Concurrency, Simulation and Automated Reasoning.

[2]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1991, Inf. Comput..

[3]  Robbert van Renesse,et al.  Reliable Distributed Computing with the Isis Toolkit , 1994 .

[4]  Idit Keidar,et al.  A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach , 2002, SIAM J. Comput..

[5]  Idit Keidar,et al.  Optimistic Virtual Synchrony , 2000, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000.

[6]  Louise E. Moser,et al.  Extended virtual synchrony , 1994, 14th International Conference on Distributed Computing Systems.

[7]  Andrew S. Tanenbaum,et al.  An evaluation of the Amoeba group communication system , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[8]  Ragunathan Rajkumar,et al.  Processor group membership protocols: specification, design and implementation , 1993, Proceedings of 1993 IEEE 12th Symposium on Reliable Distributed Systems.

[9]  Idit Keidar,et al.  A client-server oriented algorithm for virtually synchronous group membership in WANs , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[10]  Roy Friedman,et al.  Strong and weak virtual synchrony in Horus , 1996, Proceedings 15th Symposium on Reliable Distributed Systems.

[11]  Alberto Montresor,et al.  Group membership and view synchrony in partitionable asynchronous distributed systems: specifications , 1997, OPSR.

[12]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[13]  Nancy A. Lynch,et al.  Specifying and using a partitionable group communication service , 1997, PODC '97.

[14]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[15]  Danny Dolev,et al.  Group communication as an infrastructure for distributed system management , 1996, Proceedings of Third International Workshop on Services in Distributed and Networked Environments.

[16]  Nancy A. Lynch,et al.  A dynamic view-oriented group communication service , 1998, PODC '98.

[17]  Nancy A. Lynch,et al.  Forward and Backward Simulations, II: Timing-Based Systems , 1996, Inf. Comput..

[18]  Özalp Babaoglu,et al.  The Inherent Cost of Strong-Partial View-Synchronous Communication , 1995, WDAG.

[19]  Louise E. Moser,et al.  Robust and Efficient Replication Using Group Communication , 1994 .

[20]  Louise E. Moser,et al.  Fast message ordering and membership using a logical token-passing ring , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[21]  Andre Schiper,et al.  View Synchronous Communication in Large Scale Networks , 1995 .

[22]  Frank B. Schmuck,et al.  Agreeing on Processor Group Membership in Timed Asynchronous Distributed Systems , 1995 .

[23]  Danny Dolev,et al.  The Transis approach to high availability cluster communication , 1996, CACM.

[24]  Péter Urbán,et al.  Totally Ordered Broadcast and Multicast Algorithms: A Comprehensive Survey , 2000 .

[25]  Idit Keidar,et al.  Totally ordered broadcast in the face of network partitions: exploiting group communication for repl , 1999 .

[26]  Idit Keidar,et al.  Group communication specifications: a comprehensive study , 2001, CSUR.

[27]  Özalp Babaoglu,et al.  RELACS: A communications infrastructure for constructing reliable applications in large-scale distributed systems , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[28]  Louise E. Moser,et al.  Totem: a fault-tolerant multicast group communication system , 1996, CACM.

[29]  Mark Garland Hayden,et al.  The Ensemble System , 1998 .

[30]  Yair Amir,et al.  Replication using group communication over a partitioned network (שכפול באמצעות תקשרת קבוצות מעל רשת דינמית.) , 1995 .

[31]  Idit Keidar,et al.  Efficient message ordering in dynamic networks , 1996, PODC '96.

[32]  Robbert van Renesse,et al.  Horus: a flexible group communication system , 1996, CACM.

[33]  Kenneth P. Birman,et al.  Exploiting virtual synchrony in distributed systems , 1987, SOSP '87.