Skip to main content

Multicast group communication as a base for a load-balancing replicated data service

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1499))

Abstract

We give a rigorous account of an algorithm that provides sequentially consistent replicated data on top of the view synchronous group communication service previously specified by Fekete, Lynch and Shvartsman. The algorithm performs updates at all members of a majority view, but rotates the work of queries among the members to equalize the load. The algorithm is presented and verified using I/O automata.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Amir. Replication using Group Communication over a Partitioned Network. PhD thesis, The Hebrew University of Jerusalem, Israel, 1995.

    Google Scholar 

  2. Y. Amir, D. Dolev, P. Melliar-Smith, and L. Moser. Robust and efficient replication using group communication. Technical Report 94-20, The Hebrew University of Jerusalem, Israel, 1994.

    Google Scholar 

  3. O. Babaoglu, R. Davoli, L. Giachini, and P. Sabattini. The inherent cost of strongpartial view-synchronous communication. LNCS, 972:72–86, 1995.

    MathSciNet  Google Scholar 

  4. K. P. Birman. Building Secure and Reliable Network Applications. Manning Publications Co., Greenwich, CT, 1996.

    Google Scholar 

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

    Google Scholar 

  6. T. D. Chandra, V. Hadzilacos, S. Toueg, and B. Charron-Bost. On the impossibility of group membership. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 322–330, New York, USA, May 1996.

    Google Scholar 

  7. G. V. Chockler, N. Huleihel, and D. Dolev. An adaptive totally ordered multicast protocol that tolerates partitions. In Proceedings of the 17h Annual ACM Symposium on Principles of Distributed Computing, pages 237–246, 1998.

    Google Scholar 

  8. F. Cristian. Group, majority, and strict agreement in timed asynchronous distributed systems. In Proceedings of the Twenty-Sixth International Symposium on Fault-Tolerant Computing, pages 178–189, Washington, June 25–27, 1996. IEEE.

    Google Scholar 

  9. R. De Prisco, A. Fekete, N. Lynch, and A. Shvartsman. A dynamic view-oriented group communication service. In Proceedings of the 17h Annual ACM Symposium on Principles of Distributed Computing, pages 227–236, 1998.

    Google Scholar 

  10. D. Dolev and D. Malki. The Transis approach to high availability cluster communication. Communications of the ACM, 39(4):64–70, Apr. 1996.

    Article  Google Scholar 

  11. D. Dolev, D. Malki, and R. Strong. A framework for partitionable membership service. Technical Report TR94-6, Department of Computer Science, Hebrew University, 1994.

    Google Scholar 

  12. P. D. Ezhilchelvan, R. A. MacÊdo, and S. K. Shrivastava. Newtop: A fault-tolerant group communication protocol. In Proceedings of the 15th International Conference on Distributed Computing Systems (ICDCS'95), pages 296–306, Los Alamitos, CA, USA, May 30–June 2, 1995. IEEE Computer Society Press.

    Google Scholar 

  13. A. Fekete, N. Lynch, and A. Shvartsman. Specifying and using a partionable group communication service. Extended version, http://theory.lcs.mit.edu/tds.

    Google Scholar 

  14. A. Fekete, N. Lynch, and A. Shvartsman. Specifying and using a partionable group communication service. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pages 53–62, Santa Barbara, California, Aug. 21–24, 1997.

    Google Scholar 

  15. R. Friedman and R. van Renesse. Strong and weak virtual synchrony in Horus. Technical Report TR95-1537, Cornell University, Computer Science Department, Aug. 24, 1995.

    Google Scholar 

  16. R. Friedman and A. Vaysburd. Implementing replicated state machines over partitionable networks. Technical Report TR96-1581, Cornell University, Computer Science, Apr. 17, 1996.

    Google Scholar 

  17. R. Friedman and A. Vaysburd. High-performance replicated distributed objects in partitionable environments. Technical Report TR97-1639, Cornell University, Computer Science, July 16, 1997.

    Google Scholar 

  18. I. Keidar. A highly available paradigm for consistent object replication. Master's thesis, Institute of Computer Science, The Hebrew University of Jerusalem, Israel, 1994.

    Google Scholar 

  19. I. Keidar and D. Dolev. Efficient message ordering in dynamic networks. In Proceedings of the 15th Anual ACM Symposium on Principles of Distributed Computing, pages 68–76, New York, USA, May 1996.

    Google Scholar 

  20. R. I. Khazan. Group communication as a base for a load-balancing replicated data service. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, May 1998.

    Google Scholar 

  21. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):690–691, 1979.

    Google Scholar 

  22. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann series in data management systems. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, 1996.

    Google Scholar 

  23. N. A. Lynch and M. R. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219–246, 1989. Also available as MIT Technical Memo MIT/LCS/TM-373.

    MATH  MathSciNet  Google Scholar 

  24. L. E. Moser, Y. Amir, P. M. Melliar-Smith, and D. A. Agarwal. Extended virtual synchrony. In Proceedings of the 14th International Conference on Distributed Computing Systems, pages 56–65, Los Alamitos, CA, USA, June 1994. IEEE Computer Society Press.

    Google Scholar 

  25. L. E. Moser, P. M. Melliar-Smith, D. 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, Apr. 1996.

    Article  Google Scholar 

  26. A. M. Ricciardi, A. Schiper, and K. P. Birman. Understanding partitions and the “no partition” assumption. Technical Report TR93-1355, Cornell University, Computer Science Department, June 1993.

    Google Scholar 

  27. R. van Renesse, K. P. Birman, and S. Maffeis. Horus: A flexible group communication system. Communications of the ACM, 39(4):76–83, Apr. 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Shay Kutten

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khazan, R., Fekete, A., Lynch, N. (1998). Multicast group communication as a base for a load-balancing replicated data service. In: Kutten, S. (eds) Distributed Computing. DISC 1998. Lecture Notes in Computer Science, vol 1499. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056488

Download citation

  • DOI: https://doi.org/10.1007/BFb0056488

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65066-9

  • Online ISBN: 978-3-540-49693-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics