Skip to main content

Ruminations on Domain-Based Reliable Broadcast

  • Conference paper
  • First Online:
Distributed Computing (DISC 2002)

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

Included in the following conference series:

Abstract

A distributed system is no longer confined to a single administrative domain. Peer-to-peer applications and business-to-business e-commerce systems, for example, typically span multiple local-area and wide-area networks, raising issues of trust, security, and anonymity. This paper introduces a distributed systems model with an explicit notion of domain that defines the scope of trust and local communication within a system. We introduce leader-election oracles that distinguish between common and distinct domains, encapsulating failure-detection information and leading to modular solutions and proofs. We show how Reliable Broadcast can be implemented in our domain-based model, we analyze the cost of communicating across groups, and we establish lower-bounds on the number of cross-domain messages necessary to implement Reliable Broadcast.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. A. Agarwal, L. E. Moser, P. M. Melliar-Smith, and R. K. Budhia. The totem multiple-ring ordering and topology maintenance protocol. ACM Transactions on Computer Systems, 16(2):93–132, 1998.

    Article  Google Scholar 

  2. Y. Amir, C. Danilov, and J. Stanton. A low latency, loss tolerant architecture and protocol for wide area group communication. In Proceedings of IEEE Conference on Distributed Systems and Networks (DSN), June 2000.

    Google Scholar 

  3. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4), October 1985.

    Google Scholar 

  4. L. Cardelli. Abstractions for mobile computation. In Secure Internet Programming: Security Issues for Distributed and Mobile Objects. Springer Verlag, 1999.

    Google Scholar 

  5. L. Cardelli. Wide area computation. In Proceedings of the 26th International Colloqium on Automata, Languages, and Programming (ICALP), 1999. LNCS 1644.

    Google Scholar 

  6. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685–722, July 1996.

    Google Scholar 

  7. T. D. Chandra and S. Toueg. Time and message efficient reliable broadcasts. In Proceedings of the 4th International Workshop on Distributed Algorithms, September 1990.

    Google Scholar 

  8. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225–267, March 1996.

    Google Scholar 

  9. S. Frølund and F. Pedone. Ruminations on domain-based reliable broadcast. Technical Report IC/2002/52, Ecole Polytechnique Fédérale de Lausanne (EPFL), July 2002.

    Google Scholar 

  10. R. Guerraoui and A. Schiper. Consensus service: A modular approach for building fault-tolerant agreement protocols in distributed systems. In Proceedings of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), pages 168–177, Sendai, Japan, June 1996.

    Google Scholar 

  11. K. Guo, W. Vogels, and R. van Renesse. Structured virtual synchrony: Exploring the bounds of virtual synchronous group communication. In Proceedings of the ACM SIGOPS European Workshop, 1996.

    Google Scholar 

  12. V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In Distributed Systems, chapter 5. Addison-Wesley, 2nd edition, 1993.

    Google Scholar 

  13. I. Keidar, J. Sussman, K. Marzullo, and D. Dolev. A client-server oriented algorithm for virtually synchronous group membership in WANs. In Proceedings of the 20th International Conference on Distributed Computing Systems, April 2000.

    Google Scholar 

  14. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, July 1982.

    Google Scholar 

  15. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2), April 1980.

    Google Scholar 

  16. M. K. Reiter. Secure agreement protocols: Reliable and atomic group multicasts in rampart. In Proceedings of the 2nd ACM Conference on Computer and Communications Security, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frølund, S., Pedone, F. (2002). Ruminations on Domain-Based Reliable Broadcast. In: Malkhi, D. (eds) Distributed Computing. DISC 2002. Lecture Notes in Computer Science, vol 2508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36108-1_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36108-1_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00073-0

  • Online ISBN: 978-3-540-36108-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics