135 references, last updated Tue Mar 14 19:23:35 2000

[1]

Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, May 1985.

[2]

Deborah A. Agarwal. Totem: A Reliable Ordered Delivery Protocol for Interconnected Local-Area Networks. PhD thesis, University of California, Santa Barbara, August 1994.

[3]

Rosario Aiello, Elena Pagani, and Gian Paolo Rossi. Causal ordering in reliable group communications. In SIGCOMM93 [121], pages 106-115.

[4]

Guillermo Alvarez and Flaviu Cristian. Simulation-based test of synchronous and asynchronous fault-tolerant group membership services. In COMPASS12 [39], pages ??--??

[5]

Yair Amir, Danny Dolev, Shlomo Kramer, and Dalia Malki. Transis: A communication sub-system for high availability. In FTCS22 [68], pages 76-84.

[6]

Yair Amir, Louise E. Moser, P. M. Melliar-Smith, Deborah A. Agarwal, and P. Ciarfella. The totem single-ring ordering and membership protocol. ACM Transactions on Computer Systems, 13(4):311-342, November 1995.

[7]

Emmanuelle Anceaume, Bernadette Charron-Bost, Pascale Minet, and Sam Toueg. On the formal specification of group membership services. Technical Report 2695, INRIA, November 1995.

[8]

Hagit Attiya and Rinat Rappoport. The level of handshake required for managing a connection. Distributed Computing, Springer International, 11(1):54-57, February 1997.

[9]

Özalp Babao~glu and Rogério Drummond. Streets of byzantinum: Network architectures for fast reliable broadcasts. IEEE Transactions on Software Engineering, SE-11(6):546-554, June 1985.

[10]

Özalp Babao~glu and Keith Marzullo. Consistent global states of distributed systems: Fundamental concepts and mechanisms. In Mullender [102], chapter 4, pages 55-96.

[11]

Özalp Babao~glu, Rogério Drummond, and Pat Stephenson. The impact of communication network properties on reliable broadcast protocols. In FTCS16 [66], pages 212-217.

[12]

Özalp Babao~glu, Pat Stephenson, and Rogério Drummond. Reliable broadcasts and communication models: Tradeoffs and lower bounds. Distributed Computing, Springer International, 2(4):177-189, 1988.

[13]

Roberto Baldoni, Achour Moustefaoui, and Michel Raynal. Causal delivery of messages with real-time data in unreliable netweorks. The Journal of Real-Time Systems, 10(3):245-262, May 1996.

[14]

Alan E. Baratz and Adrian Segall. Reliable link initialization procedures. IEEE Transactions on Computers, 36(2):144-152, February 1988.

[15]

Twan Basten, Thomas Kunz, James P. Black, Michael H. Coffin, and David J. Taylor. Vector time and causality among abstract events in distributed computations. Distributed Computing, Springer International, 11(1):21-39, December 1997.

[16]

Piotr Berman and Anupam A. Bharali. Quick atomic broadcast. In Schiper [114], pages 189-203.

[17]

Kenneth P. Birman and Thomas A. Joseph. Communication support for reliable distributed computing. Technical Report 86-753, Department of Computer Science, Cornell University, Ithaca, NY, 1986.

[18]

Kenneth P. Birman and Thomas A. Joseph. Reliable communication in the presence of failures. ACM Transactions on Computer Systems, 5(1):47-76, February 1987.

[19]

Kenneth P. Birman and Robert van Renesse, editors. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, 1994.

[20]

Kenneth P. Birman, André Schiper, and Pat Stephenson. Fast causal multicast. Technical Report TR90-1105, Department of Computer Science, Cornell University, Ithaca, NY, April 1990.

[21]

Kenneth P. Birman, André Schiper, and Pat Stephenson. Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems, 9(3):272-314, August 1991.

[22]

Kenneth P. Birman. ISIS: A system for fault-tolerance in distributed systems. Technical Report TR86-744, Department of Computer Science, Cornell University, Ithaca, NY, April 1986.

[23]

Kenneth P. Birman. The process group approach to reliable distributed computing. Communications of the ACM, 36(12):37-53, 103, December 1993.

[24]

Kenneth P. Birman. Virtual synchrony model. In Birman and van Renesse [19], chapter 6, pages 101-106.

[25]

Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824-840, October 1985.

[26]

Gabriel Bracha. O(lg n) expected rounds randomized byzantine generals protocol. In ACMTCS17 [1], pages 316-326.

[27]

Gabriel Bracha. O(lg n) expected rounds randomized byzantine generals protocol. Journal of the ACM, 34(4):910-920, October 1987.

[28]

Tushar D. Chandra and Sam Toueg. Time and message efficient reliable broadcasts. In IWDA4 [82].

[29]

Tushar D. Chandra, V. Hadzilacos, Sam Toueg, and Bernadette Charron-Bost. On the impossibility of group membership. Technical Report 2782, INRIA, January 1996.

[30]

Tushar D. Chandra. Unreliable Failure Detectors for Asynchronous Distributed Systems. PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY, May 1993.

[31]

China-Liang Chang and Richard Char-Tung Lee. Symbolic Logic and Mechanical Theorem Prooving. Academic Press, Inc., 1973.

[32]

Jo-Mei Chang and N. F. Maxemchuk. Reliable broadcast protocols. ACM Transactions on Computer Systems, 2(3):251-273, August 1984.

[33]

Soma Chaudhuri, Brian A. Coan, and Jennifer L. Welch. Using adaptive timeouts to achieve at-most-once delivery. Distributed Computing, Springer International, 9(1):109-117, August 1995.

[34]

Ming-Syan Chen, Jeng-Chun Chen, and Philip S. Yu. On general results for all-to-all broadcast. IEEE Transactions on Parallel and Distributed Systems, 7(4):363-370, April 1996.

[35]

David R. Cheriton and Carey L. Williamson. Vmtp as the transport layer for high-performance distributed systems. IEEE Communications Magazine, pages 37-44, June 1989.

[36]

David R. Cheriton and Willy Zwaenopol. Distributed process groups in the v kernel. ACM Transactions on Computer Systems, 3(2):77-107, May 1985.

[37]

David R. Cheriton. Sirpent (tm): A high-performance internetworking approach. In SIGCOMM89 [120], pages 158-169.

[38]

Edmund M. Clarke and Jeannette M. Wing. Formal methods: State of the art and future directions. Technical Report CMU-CS-96-178, Carnegie Mellon University, 1998.

[39]

Twelfth Annual Conference on Computer Assurance, Gaithersburg, Maryland, USA, June 1997.

[40]

Proceedings of the 15th Computer Software and Application Conference, September 1991.

[41]

Flaviu Cristian and Cristof Fetzer. The timed asynchronous system model. Technical Report CSE97-519, University of California, San Diego, CA, January 1997.

[42]

Flaviu Cristian and Shivakant Mishra. Automatic service availability managmement in asynchronous distributed systems. In IWCDS2 [81], pages ??--??

[43]

Flaviu Cristian and Frank Schmuck. Agreeing on processor-group membership in timed asynchronous distributed systems. Technical Report CSE95-428, University of California, San Diego, CA, 1995.

[44]

Flaviu Cristian, Houtan Aghili, Ray Strong, and Danny Dolev. Atomic broadcast: From simple message diffusion to byzantine agreement. In FTCS15 [65], pages 200-206.

[45]

Flaviu Cristian, Danny Dolev, Ray Strong, and Houtan Aghili. Atomic broadcast in a real-time environment. In Simons and Spector [122], pages 51-71.

[46]

Flaviu Cristian, Richard de Beijer, and Shivakant Mishra. Comparing how well asynchronous atomic broadcast protocols perform. Distributed Systems Engeneering Journal, 4(1):177-201, 1994.

[47]

Flaviu Cristian. Reaching agreement on processor group membership in synchronous dsitributed systems. Technical Report RJ 5964, IBM Almaden Research Center, August 1990.

[48]

Flaviu Cristian. Synchronous atomic broadcast for redundant broadcast channels. The Journal of Real-Time Systems, 2:195-212, 1990.

[49]

Flaviu Cristian. Reaching agreement on processor-group membership in synchronous distributed systems. Distributed Computing, Springer International, 4(4):175-187, 1991.

[50]

Flaviu Cristian. Abstractions for fault-tolerance. In IFIP13 [80], pages ??--??

[51]

Flaviu Cristian. Group, majority, and strict agreement in timed asynchronous distributed systems. In FTCS26 [69], pages ??--??

[52]

Flaviu Cristian. Synchronous and asynchronous group communication. Communications of the ACM, 39(4):88-97, April 1996.

[53]

Mahmoud Dasser. Tomp, a total ordering multicast protocol. Operating System Review, 26(1):32-40, January 1992.

[54]

Stephen E. Deering and David R. Cheriton. Multicast routing in datagram internetworks and extended LANs. ACM Transactions on Computer Systems, 8(2):85-100, May 1990.

[55]

Danny Dolev and Dalia Malki. The transis approach to high availability cluster communication. Communications of the ACM, 39(4):64-70, April 1996.

[56]

Danny Dolev, Dalia Malki, and Ray Strong. A framework for partitionable membership services. Technical Report CS95-4, Hebrew University of Jerusalem, Israel, 1995.

[57]

Cristof Fetzer and Flaviu Cristian. On the possibility of consensus in asynchronous systems. Technical Report CSE95-415, University of California, San Diego, CA, December 1995.

[58]

Cristof Fetzer. Fail-Awareness in Timed Asynchronous Systems. PhD thesis, University of California, San Diego, CA, 1997.

[59]

Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14:183-186, April 1982.

[60]

Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.

[61]

Michael J. Fischer, Nancy A. Lynch, and Michael Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, Springer International, 1(1):26-39, January 1986.

[62]

John J. Fletcher and Richard W. Watson. Mechanisms for a reliable timer-based protocol. Computer Networks, 2:271-290, ? 1978.

[63]

Gerard Florin and C. Toinard. A new way to design causally and totally ordered multicast protocols. Operating System Review, 26(4):77-83, October 1992.

[64]

Roy Friedman and Robert van Renesse. Strong and weak virtual synchrony in horus. Technical Report 95-1537, Department of Computer Science, Cornell University, Ithaca, NY, August 1995.

[65]

Proceedings of the Fifteenth International Symposium on Fault-Tolerant Computing, Ann Arbor, Michigan, USA, June 1985. IEEE Computer Society Press.

[66]

Proceedings of the Sixteenth International Symposium on Fault-Tolerant Computing. IEEE Computer Society Press, July 1986.

[67]

Proceedings of the Twentieth International Symposium on Fault-Tolerant Computing. IEEE Computer Society Press, June 1990.

[68]

Proceedings of the Twenty-second International Symposium on Fault-Tolerant Computing, Boston, Massachusets, USA, July 1992. IEEE Computer Society Press.

[69]

Proceedings of the Twenty-sixth International Symposium on Fault-Tolerant Computing, Sendai, Japan, June 1996. IEEE Computer Society Press.

[70]

Hector Garcia-Molina and Annemarie Spauster. Message ordering in a multicast environment. In ICDCS9 [79], pages 354-361.

[71]

Hector Garcia-Molina and Annemarie Spauster. Ordered and reliable multicast communication. ACM Transactions on Computer Systems, 3(9):242-271, August 1991.

[72]

Stephen J. Garland and Nancy A. Lynch. The ioa language and toolset: Support for mathematics-based distributed programming. Technical Report MITLCS-???, Laboratory of Computer Science, Massachusetts Institute of Technology, Cambridge, MA, March 1998.

[73]

Stephen J. Garland, Nancy A. Lynch, and Mandana Vaziri. IOA: A Language for Specifying, Programming and Validating Distributed Systems, Draft, December 1997.

[74]

Rainer Gawlick, Jørgen Søgaard-Andersen, Roberto Segala, and Nancy A. Lynch. Liveness in timed and untimed systems. Technical Report MIT/LCS/TR-587, Laboratory of Computer Science, Massachusetts Institute of Technology, Cambridge, MA, December 1993.

[75]

Kenneth J. Goldman, Michael D. Anderson, and Bala Swaminathan. The programmers' playground: I/o abstraction for heterogeneous distributed systems. Technical Report WUCS-93-29, Washington University, Department of Computer Science, June 1993.

[76]

Kenneth J. Goldman. Highly concurrent logically synchronous multicast. Distributed Computing, Springer International, 4(4):189-207, 1991.

[77]

Proceedings of the Eleventh International Conference on Distributed Computing Systems. IEEE Computer Society Press, May 1991.

[78]

Proceedings of the Fourteenth International Conference on Distributed Computing Systems, Poznan, Poland, June 1994. IEEE Computer Society Press.

[79]

Proceedings of the Ninth International Conference on Distributed Computing Systems. IEEE Computer Society Press, 1989.

[80]

Proceedings of the Thirteenth IFIP World Computer Congress, Hamburg, Germany, September 1994.

[81]

Proceedings of the 2nd International Workshop on Configurable Distribute Systems, Pittsburgh, USA, March 1994.

[82]

Proceedings of the Fourth International Workshop on Distributed Algorithms. Springer Verlag, September 1990.

[83]

Pradepp Jain and Simon S. Lam. Modeling and verification of real-time protocols for broadcast networks. IEEE Transactions on Software Engineering, SE-13(8):924-937, August 1987.

[84]

Weijia Jia, Jörg Kaiser, and Edgar Nett. Rmp: Fault-tolerant group communication. IEEE Micro, 16(2):59-67, April 1996.

[85]

Xiaohua Jia. A total ordering multicast protocol using propagtion trees. IEEE Transactions on Parallel and Distributed Systems, 6(6):617-627, June 1995.

[86]

M. Frans Kaashoek and Andrew S. Tanenbaum. Fault-tolerance using group communication. Operating System Review, 25(2):71-74, April 1991.

[87]

M. Frans Kaashoek, Andrew S. Tanenbaum, Susan Flynn Hummel, and Henri E. Bal. An efficient reliable broadcast protocol. Operating System Review, 23(4):5-19, October 1989.

[88]

Stephen Cole Kleene. Introduction to Metamathematics. North-Holland Publishing Company, 10th edition, 1991.

[89]

Hermann Kopetz and Günther Grünsteidl. TTP --- a protocol for fault-tolerant real-time systems. IEEE Computer, 27(1):14-23, January 1994.

[90]

Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, July 1982.

[91]

Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, July 1978.

[92]

Leslie Lamport. Using time instead of timeout for fault-tolerant distributed systems. ACM Transactions on Programming Languages and Systems, 6(2):254-280, April 1984.

[93]

Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):873-923, May 1994.

[94]

Gerard LeLann. A distributed system for real-time transaction processing. IEEE Computer, 14:43-48, February 1981.

[95]

Gerard LeLann. The ariane 5 flight 501 failure --- a case study in system engineering for computer systems. Technical Report 3079, INRIA, December 1996.

[96]

Barbara Liskov, Liuba Shrira, and John Wroclawski. Efficient at-most-once messages based on synchronized clocks. ACM Transactions on Computer Systems, 9(2):125-142, May 1991.

[97]

Shyh-Wei Luan and Virgil Gligor. A fault-tolerant protocol for atomic broadcast. IEEE Transactions on Parallel and Distributed Systems, 1(3):271-285, July 1990.

[98]

Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.

[99]

P. M. Melliar-Smith, Louise E. Moser, and Vivek Agrawala. Broadcast protocols for distributed systems. IEEE Transactions on Parallel and Distributed Systems, 1(1):17-25, January 1990.

[100]

Louise E. Moser, Yair Amir, P. M. Melliar-Smith, and Deborah A. Agarwal. Extended virtual synchrony. In ICDCS14 [78], pages 56-65.

[101]

Louise E. Moser, P. M. Melliar-Smith, Deborah A. Agarwal, R. K. Budhia, and C. A. Lingley-Papadopoulos. Totem: A fault-tolerant multicast group communication system. Communications of the ACM, 39(4):54-63, April 1996.

[102]

Sape Mullender, editor. Distributed Systems. Addisson-Wesley, 1993.

[103]

Akihito Nakamura and Makoto Takizawa. Design of reliable broadcast protocol for selectively partially ordering PDUs. In ICDCS11 [77], pages 673-677.

[104]

Akihito Nakamura and Makoto Takizawa. Reliable broadcast protocol for selectivelly partially ordering PDUs (spo protocol). In COMPSAC15 [40], pages 239-246.

[105]

Dan Oestreicher. A simple reliable globally-ordered broadcast service. Operating System Review, 25(4):66-76, October 1991.

[106]

Sanjoy Paul, Krishan K. Sabani, John C.-H. Lin, and Supratik Bhattacharyya. Reliable multicast transport protocol (rmtp). IEEE Journal on Selected Areas in Communications, 15(3):407-421, April 1997.

[107]

Marshall Pease, Robert Shostak, and Leslie Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228-234, April 1980.

[108]

Larry L. Peterson, Nick C. Buchholz, and Richard D. Schlichting. Preserving and using context information in interprocess communication. ACM Transactions on Computer Systems, 7(3):217-246, August 1989.

[109]

Proceedings of the Tenth annual ACM symposium on Principles of Distributed Computing, August 1991.

[110]

Stefan Poledna. Replica determinism in distributed real-time systems: A brief survey. The Journal of Real-Time Systems, 6(1):289-316, 1994.

[111]

D. Powell, editor. Delta-4: A Generic Architecture for Dependable Distributed Computing, volume 1. Springer Verlag, 1991. ESPRIT Research Report, Project 818/2252.

[112]

Aleta M. Ricciardi and Kenneth P. Birman. Using process groups to implement failure detection in asynchronous environments. In PODC10 [109], pages 341-353.

[113]

Aleta M. Ricciardi. The Group Membership Problem in Asynchronous Systems. PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY, January 1993.

[114]

André Schiper, editor. Distributed Algorithms. Springer Verlag, 1993.

[115]

Ulrich Schmid and A. Pusterhofer. SSCMP: the sequenced synchronized clock message protocol. Computer Networks and ISDN Systems, 27(12):1615-1632, 11 1995.

[116]

Frank Schmuck. The use of Efficient Broadcast Primitives in Asynchronous Distributed Systems. PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY, August 1988.

[117]

Fred B. Schneider. Synchronization in distributed programs. ACM Transactions on Programming Languages and Systems, 4(2):125-148, April 1982.

[118]

Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, December 1990.

[119]

A. Udaya Shankar. Modular design principles for protocols with an application to the transport layer. Proceedings of the IEEE, 79(12):1687-1707, December 1991.

[120]

SIGCOMM'89. Symposium proceedings on Communications architectures & protocols, Austin, Texas, USA, September 1989. ACM Press.

[121]

SIGCOMM'93. Symposium proceedings on Communications architectures & protocols, San Francisco, California, USA, September 1993. ACM Press.

[122]

S. Simons and A. J. Spector, editors. Fault Tolerant Distributed Computing. Springer Verlag, 1990.

[123]

Pat Stephenson and Kenneth P. Birman. Fast causal multicast. Operating System Review, 25(2):75-79, April 1991.

[124]

Pat Stephenson. Fast Causal Multicast. PhD thesis, Department of Computer Science, Cornell University, Ithaca, NY, January 1991.

[125]

Andrew S. Tanenbaum, M. Frans Kaashoek, and Henri E. Bal. Parallel programming using shared objects and broadcasting. IEEE Computer, 25(8):10-19, August 1992.

[126]

Don Towsley, Jim Kurose, and Sridhar Pingali. A comparison of sender-initiated and receiver-initiated reliable multicast protocols. IEEE Journal on Selected Areas in Communications, 15(3):398-406, April 1997.

[127]

C. N. Tseung, Larence. Guaranteed, reliable, secure broadcast networks. IEEE Network Magazine, pages 33-37, November 1989.

[128]

Hong-Yi Tzeng and Kai-Yeung Siu. Message-optimal protocols for fault-tolerant broadcast/multicasts in distributed systems with crash failures. IEEE Transactions on Computers, 44(2):346-352, February 1995.

[129]

Hong-Yi Tzeng and Kai-Yeung Siu. On the message and time complexity of protocols for reliable broadcast/multicasts in networks with omission failures. IEEE Journal on Selected Areas in Communications, 13(7):1296-1308, September 1995.

[130]

Robert van Renesse, Kenneth P. Birman, and Silvano Maffeis. Horus: A flexible group communications system. Communications of the ACM, 39(4):76-83, April 1996.

[131]

Paulo Veríssimo and José Alves Marques. Reliable broadcast for fault-tolerance on local computer networks. In FTCS20 [67], pages 54-63.

[132]

Paulo Veríssimo, Louís Rodrigues, and Mário Baptista. Causal ordering in reliable group communications. In SIGCOMM89 [120], pages 83-93.

[133]

Paulo Veríssimo. Causal delivery protocols in real-time systems: A generic model. The Journal of Real-Time Systems, 10(1):45-73, January 1996.

[134]

Richard W. Watson. Timer-based mechanisms in reliable transport protocol connection managment. Computer Networks, 5:47-56, ? 1981.

[135]

Ping Zhou and Jozef Hooman. Formal specification and compositional verification of an atomic broadcast protocol. The Journal of Real-Time Systems, 9(2):119-145, September 1995.