1. S. Adve and M. Hill. Sufficient Conditions for Implementing the Data-Race-Free-1Memory Model. Technical Report 1107, Computer Science Department, University of Wisconsin, Wisconsin-Madison, September 1992.

   Google Scholar 

2. Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A Communication Sub-System for HighAvailability. InProc. of the 22nd Annual International Symposium on Fault-Tolerant Computing, pages 76–84, July 1992.

   Google Scholar 

3. Y. Amir and J. Stanton. The Spread Wide Area Group Communication System. Technical Report CNDS-98-2, The Center for Networking and Distributed Systems, Computer Science Department, John Hopkins University, 1998.

   Google Scholar 

4. Ö. Babaoğlu, R. Davoli, L. Giachini, and M. Baker. Relacs:A Communication Infrastructure for Constructing Reliable Applications in Large-Scale Distributed Systems. Technical Report UBLCS-94-15, Department of Computer Science, University of Bologna, June 1994. Revised January 1995.

   Google Scholar 

5. K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu,, and Y. Minsky. Bimodal Multicast.ACM Transactions on Computer Systems, 17(2):41–88, May 1999.

   Article  Google Scholar 

6. K. Birman and T. Joseph. Exploiting Virtual Synchrony in Distributed Systems. InProc. of the 11th ACMSymp. on Operating Systems Principles, pages 123–138, December 1987.

   Google Scholar 

7. D. Braginsky and D. Estrin. Rumor Routing Algorithm For Sensor Networks.http://lecs.cs.ucla.edu/daveey/work/lecs/rumorroute.pdf.

8. T. Chandra and S. Toueg. Unreliable Failure Detectors for Asynchronous Systems.Journal of the ACM, 43(4):685–722, July 1996.

   Article MathSciNet MATH  Google Scholar 

9. F. Cosquer, L. Rodrigues, and P. Verissimo. Using Tailord Failure Suspectors to Support Distributed Cooperative Applications. InProc. of the 7th International Conference on Parallel and Distributed Computing and Systems, October 1995.

   Google Scholar 

10. R. Friedman, S. Manor, and K. Guo. Scalable Hypercube Based Stability Detection. InProc. of the 18th Symposium on Reliable Distributed Systems, October 1999.

    Google Scholar 

11. R. Friedman and R. van Renesse. Strong andWeak Virtual Synchrony in Horus. InProc. of the 15th Symposium on Reliable Distributed Systems, pages 140–149, October 1996.

    Google Scholar 

12. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. InProc. of the 17th International Symposium on Computer Architecture, pages 15–26, May 1990.

    Google Scholar 

13. M. Hayden. The Ensemble System. Technical Report TR98-1662, Department of Computer Science, Cornell University, January 1998.

    Google Scholar 

14. M. Hurfin and M. Raynal. A Simple and Fast Asynchronous Consensus Protocol Based on aWeak Failure Detector.Distributed Computing, 12(4):209–223, 1999.

    Article  Google Scholar 

15. C. Intanagonwiwat, R. Govindan, and D. Estrin. Direct Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks. InProceedings of the 6th Annual International Conference on Mobile Computing and Networks, August 2000.

    Google Scholar 

16. I. Keidar and D. Dolev. Increasing the Resilience of Atomic Commit, at No Additional Cost. InProc. of ACM Symposium on Principles of Database Systems, pages 245–254, May 1995.

    Google Scholar 

17. L. Lamport. HowtoMake a Multiprocessor Computer that Correctly Executes Multiprocess Programs.IEEE Trans. on Computers, C-28(9):690–691, 1979.

    Article MATH  Google Scholar 

18. C. Malloth, P. Felber, A. Schiper, and U. Wilhelm. Phoenix: A Toolkit for Building Fault-Tolerant Distributed Application in Large Scale. Technical report, Department d’Informatique, Ecole Polytechnique Federale de Lausanne, July 1995.

    Google Scholar 

19. A. Rowstron, A-M. Kermarrec, M. Castro, and P. Druschel. SCRIBE: The Design of a Large Scale Event Notification Infrastructure. InProceedings of 3rd International Workshop on Networked Group Communication, November 2001.

    Google Scholar 

20. E.M. Royer and C.E. Perkins. Multicast Operation of the Ad-Hoc On-Demand Distance Vector Routing Protocol. InProceedings of the 5th Annual International Conference on Mobile Computing and Networks, pages 207–218, August 1999.

    Google Scholar 

21. A. Schiper. Early Consensus in an Asynchronous System with a Weak Failure Detector.Distributed Computing, 10:194–157, 1997.

    Article  Google Scholar 

22. P. Sinha, R. Sivakumar, and V. Bhargavan. MCEDAR: Multicast Core-Extraction Distributed Ad-Hoc Routing. InProceedings of the IEEE Wireless Communication and Networking Conference, September 1999.

    Google Scholar 

23. D. Skeen. A Quorum-Based Commit Protocol. Technical Report TR82-483, Department of Computer Science, Cornell University, February 1982.

    Google Scholar 

24. R. van Renesse, K. Birman, and S. Maffeis. Horus: A Flexible Group Communication System.Communications of the ACM, 39(4):76–83, April 1996.

    Article  Google Scholar 

25. C. Wu and Y.C. Tay. AMRIS: A Multicast Protocol for Ad-Hoc Wireless Networks. InProceedings of the MILCOMM’ 99, November 1999.

    Google Scholar 

26. B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph. Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. Technical Report UCB/CSD-01-1141, Computer Science Department, U.C. Berkeley, April 2001.

    Google Scholar 

Download references